Path planning on a cuboid using genetic algorithms

Information Sciences

Volumn 178, Issue 16, 2008, Pages 3275-3287

  UǦUR, Aybars ^a  

^a EGE UNIVERSITY   (Turkey)

Author keywords

2 opt; Cuboid; Genetic algorithms; Local search; Optimization; Path planning; TSP; Visualization

Indexed keywords

AEROSPACE APPLICATIONS; ALGORITHMS; BENCHMARKING; COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; CURVE FITTING; EVOLUTIONARY ALGORITHMS; GENETIC ALGORITHMS; GLOBAL OPTIMIZATION; HEURISTIC ALGORITHMS; HEURISTIC METHODS; HEURISTIC PROGRAMMING; INTEGER PROGRAMMING; OPTIMIZATION;

(1 1 0) SURFACE; BENCH-MARK PROBLEMS; ELSEVIER (CO); EUCLIDEAN TSP; GLOBAL SEARCH; HYBRID METHODS; INTERACTIVE VISUALIZATION TOOL; JAVA-3D; PATH PLANNING; POTENTIAL APPLICATIONS; TRAVELING SALESMAN PROBLEM (TSP);

TRAVELING SALESMAN PROBLEM;

EID: 45649085382     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2008.04.005     Document Type: Article

References (37)

1. Alba E., and Chicano J.F. Software project management with GAs. Information Sciences 177 11 (2007) 2380-2401
2. Applegate D., Bixby R., Chvátal V., and Cook W. Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems. Mathametical Programming 97 (2004) 91-153
3. Armano G., Marchesi M., and Murru A. A hybrid genetic-neural architecture for stock indexes forecasting. Information Sciences 170 1 (2005) 3-33
4. Arora S. Polynomial time approximation schemes for Euclidean TSP and other geometric problems. Proc. 37th Ann. Symp. Foundations of Computer Sci., IEEE Computer Soc. (1996) 2-11
5. Carballido J.A., Ponzoni I., and Brignole N.B. CGD-GA: A graph-based genetic algorithm for sensor network design. Information Sciences 177 22 (2007) 5091-5102
6. Carter A.E., and Ragsdale C.T. A new approach to solving the multiple traveling salesperson problem using genetic algorithms. European Journal of Operational Research (2006) 246-257
7. Chen G., Chen S., Guo W., and Chen H. The multi-criteria minimum spanning tree problem based genetic algorithm. Information Sciences 177 22 (2007) 5050-5063
8. H.J. Cho, Automatic rule generation for fuzzy controllers using genetic algorithms: a study on representation scheme and mutation rate, in: Proc. 7th IEEE Internat. Conf. on Fuzzy Systems, Anchorage, AK, 1998, 1290-1295.
9. Cook W., Espinoza D.G., and Goycoolea M. Computing with domino-parity inequalities for the traveling salesman problem (TSP). Informs Journal on Computing 19 3 (2007) 356-365
10. L. Davis, Job shop scheduling with genetic algorithms, in: J.J. Grefenstette (Ed.), Proceeding of An International Conference on Genetic Algorithms and Their Applications, Erlbaum, 1985, pp. 136-140.
11. Dorigo M., and Gambardella L.M. Ant colonies for the traveling salesman problem. Bio Systems 43 (1997) 73-81
12. Ellabib I., Calamai P.H., and Basir O.A. Exchange strategies for multiple ant colony system. Interface Science 177 5 (2007) 1248-1264
13. Favaretto D., Moretti E., and Pellegrini P. Ant colony system approach for variants of the traveling salesman problem with time windows. Journal of Information and Optimization Sciences 27 1 (2006) 35-54
14. Goldberg Jr. D.E., and Lingle R. Alleles, Loci and the TSP. Proceedings of the First International Conference on Genetic Algorithms and Their Applications (1985), Lawrence Erlbaum, Hillsdale, New Jersey pp. 154-159
15. Grefenstette J., Gopal R., Rosmaita B., and Van Gucht D. Genetic algorithms for the TSP. In: Grefenstette J.J. (Ed). Proceedings of the First International Conference on Genetic Algorithms and Their Applications (1985), Lawrence Erlbaum, Hillsdale, New Jersey 160-165
16. Huang G., and Lim A. Designing a hybrid genetic algorithm for the linear ordering problem. GECCO 2003 (2003) 1053-1064
17. Johnson D.S., and McGeoch L.A. The traveling salesman problem: a case study in local optimization. In: Aarts E.H.L., and Lenstra J.K. (Eds). Local Search in Combinatorial Optimization (1997), John Wiley & Sons, New York 215-310
18. Kim D.H., Abraham A., and Cho J.H. A hybrid genetic algorithm and bacterial foraging approach for global optimization. Information Sciences 177 18 (2007) 3918-3937
19. Larranaga P., Kuijpers C.M.H., Murga R.H., Inza I., and Dizdarevic S. Genetic algorithms for the travelling salesman problem: a review of representations and operators. Artificial Intelligence Review 13 (1999) 129-170
20. Lee Z.J. A hybrid algorithm applied to travelling salesman problem. Networking, Sensing and Control IEEE International Conference 1 (2004) 237-242
21. Maaranen H., Miettinen K., and Penttinen A. On initial populations of a genetic algorithm for continuous optimization problems. Journal of Global Optimization (2007) 405-436
22. Marinakis Y., Migdalas A., and Pardalos P.M. A hybrid genetic-GRASP algorithm using Lagrangean relaxation for the traveling salesman problem. Journal of Combinatorial Optimization 10 4 (2005) 311-326
23. Pan Z., Zhu J., Hu W., Lun H.P., and Zhou X. Interactive learning of CG in networked virtual environments. Computers and Graphics 29 (2005) 273-281
24. Oliver I.M., Smith D.J., and Holland J.R.C. A study of permutation crossover operators on the TSP, genetic algorithms and their applications. Proceedings of the Second International Conference (1987), Lawrence Erlbaum, Hillsdale, New Jersey 224-230
25. San José-Revuelta L.M. A new adaptive genetic algorithm for fixed channel assignment. Information Sciences 177 13 (2007) 2655-2678
26. Sengoku H., and Yoshihara I. A Fast TSP solver using GA on JAVA. Proc. of 3rd Int'l Symp. on Artificial Life and Robotics 1 (1998) 283-288
27. Shih F.Y., and Wu Y.-T. Robust watermarking and compression for medical images based on genetic algorithms. Information Sciences 175 3 (2005) 200-216
28. Snyder L.V., and Daskin M.S. A random-key genetic algorithm for the generalized traveling salesman problem. European Journal of Operational Research 174 1 (2006) 38-53
29. G. Syswerda, Schedule optimization using genetic algorithms. in: L. Davis (Ed.), A Handbook of Genetic Algorithms, 1991, pp. 332-349.
30. Takahashi S., Fujimura K., and Tokutaka H. The SOM-TSP method for the three-dimension city location problem. Neural Information Processing, ICONIP'02, Proceedings of the 9th International Conference 5 (2002) 2552-2555
31. Toroslu I.H., and Arslanoglu Y. Genetic algorithm for the personnel assignment problem with multiple objectives. Information Sciences 177 3 (2007) 787-803
32. Tsai C.-F., Tsai C.-W., and Tseng C.-C. A new hybrid heuristic approach for solving large traveling salesman problem. Information Sciences 166 1-4 (2004) 67-81
33. O. Unver, A. Uneri, A. Aydemir, M. Sitti, Geckobot: A Gecko Inspired Climbing Robot Using Elastomer Adhesives, IEEE International Conference on Robotics and Automation, Orlando, Florida (5) 2006.
34. M.A. Vega-Rodriguez, R. Gutierrez-Gil, J.M. Avila-Roman, J.M. Sanchez-Perez, J.A. Gomez-Pulido, Genetic algorithms using parallelism and FPGAs: the TSP as case study. International Conference Workshops on Parallel Processing, ICPP 2005 Workshops, 14-17 (6) (2005) 573-579.
35. Voudouris C., and Tsang E. Guided local search and its application to the traveling salesman problem. European Journal of Operational Research 113 (1999) 469-499
36. C.M. White, G.G. Yen, A hybrid evolutionary algorithm for traveling salesman problem, Congress on Evolutionary Computation, 19-23 June (2004) CEC2004. Vol. 2, 1473-1478.
37. X. Yan, A. Zhou, L. Kang, Y. Chen, TSP problem based on dynamic environment, in: Fifth World Congress on Intelligent Control and Automation, 15-19 June (2004) WCICA 2004. Vol. 3, 2271-2274.