Path planning on a cuboid using genetic algorithms-Reference-Cited by-同舟云学术

Path planning on a cuboid using genetic algorithms

Published:2008-08 Issue:16 Volume:178 Page:3275-3287
ISSN:0020-0255
Container-title:Information Sciences
language:en
Short-container-title:Information Sciences

Author:

UĞUR Aybars

Publisher

Elsevier BV

Subject

Artificial Intelligence,Information Systems and Management,Computer Science Applications,Theoretical Computer Science,Control and Systems Engineering,Software

Reference37 articles.

1. Software project management with GAs;Alba;Information Sciences,2007

2. Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems;Applegate;Mathametical Programming,2004

3. A hybrid genetic-neural architecture for stock indexes forecasting;Armano;Information Sciences,2005

4. Polynomial time approximation schemes for Euclidean TSP and other geometric problems;Arora;Proc. 37th Ann. Symp. Foundations of Computer Sci., IEEE Computer Soc.,1996

5. CGD-GA: A graph-based genetic algorithm for sensor network design;Carballido;Information Sciences,2007

Cited by 53 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A novel formula for representing the equivalent resistance of the $$m\times n$$ cylindrical resistor network;Scientific Reports;2024-09-11

2. Traveling Salesman Problem with neighborhoods on a sphere in reflectance transformation imaging scenarios;Expert Systems with Applications;2022-07

3. Optimization of Sensor Placement for Birds Acoustic Detection in Complex Fields;Proceedings of the 11th International Conference on Pattern Recognition Applications and Methods;2022

4. Kohonen Self-Organizing Map based Route Planning: A Revisit;2021 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS);2021-09-27

5. Multi-performance based computational model for the cuboid open traveling salesman problem in a smart floating city;Building and Environment;2021-06