A study of permutation crossover operators on the traveling salesman problem
Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application
Genetic Algorithms for the Travelling Salesman Problem: A Review of Representations and Operators
Artificial Intelligence Review
Job Shop Scheduling with Genetic Algorithms
Proceedings of the 1st International Conference on Genetic Algorithms
Genetic Algorithms for the Traveling Salesman Problem
Proceedings of the 1st International Conference on Genetic Algorithms
AllelesLociand the Traveling Salesman Problem
Proceedings of the 1st International Conference on Genetic Algorithms
Polynomial time approximation schemes for Euclidean TSP and other geometric problems
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
A new hybrid heuristic approach for solving large traveling salesman problem
Information Sciences—Informatics and Computer Science: An International Journal
Genetic Algorithms Using Parallelism and FPGAs: The TSP as Case Study
ICPPW '05 Proceedings of the 2005 International Conference on Parallel Processing Workshops
A hybrid genetic-neural architecture for stock indexes forecasting
Information Sciences: an International Journal - Special issue: Computational intelligence in economics and finance
On initial populations of a genetic algorithm for continuous optimization problems
Journal of Global Optimization
Genetic algorithm for the personnel assignment problem with multiple objectives
Information Sciences: an International Journal
Exchange strategies for multiple Ant Colony System
Information Sciences: an International Journal
Software project management with GAs
Information Sciences: an International Journal
A new adaptive genetic algorithm for fixed channel assignment
Information Sciences: an International Journal
A hybrid genetic algorithm and bacterial foraging approach for global optimization
Information Sciences: an International Journal
Interactive learning of CG in networked virtual environments
Computers and Graphics
Robust watermarking and compression for medical images based on genetic algorithms
Information Sciences: an International Journal
Designing a hybrid genetic algorithm for the linear ordering problem
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
A resource-constrained assembly job shop scheduling problem with Lot Streaming technique
Computers and Industrial Engineering
Information Sciences: an International Journal
Dynamics and GA-Based Optimization of Rectilinear Snake Robot
ICIRA '09 Proceedings of the 2nd International Conference on Intelligent Robotics and Applications
Modeling and path planning of the city-climber robot part I: dynamic modeling
ROBIO'09 Proceedings of the 2009 international conference on Robotics and biomimetics
ROBIO'09 Proceedings of the 2009 international conference on Robotics and biomimetics
Effective vaccination policies
Information Sciences: an International Journal
A 2-Opt based differential evolution for global optimization
Applied Soft Computing
Computers and Operations Research
Information Sciences: an International Journal
Optimizing data collection path in sensor networks with mobile elements
International Journal of Automation and Computing
Honey bees mating optimization algorithm for the Euclidean traveling salesman problem
Information Sciences: an International Journal
Information Sciences: an International Journal
Solving a two-agent single-machine scheduling problem considering learning effect
Computers and Operations Research
An interactive and flexible information visualization method
Information Sciences: an International Journal
Information Sciences: an International Journal
Combinatorial complexity problem reduction by the use of artificial vaccines
Expert Systems with Applications: An International Journal
| Hi-index | 0.07 |
The Traveling Salesman Problem (TSP) is one of the most extensively studied problems in the fields of Combinatorial Optimization and Global Search Heuristics. A variety of heuristic algorithms are available for solving Euclidean TSP, and Planar TSPs. However, optimization on a cuboid has potential applications for areas like path planning on the faces of buildings, rooms, furniture, books, and products or simulating the behaviors of insects. In this paper, we address a variant of the TSP in which all points (cities) and paths (solution) are on the faces of a cuboid. We develop an effective hybrid method based on genetic algorithms and 2-opt to adapt the Euclidean TSP to the surface of a cuboid. The method was tested on some benchmark problems from TSPLIB with satisfactory results. A web-based interactive visualization tool has also been developed using Java 3D, and optimization results for different point densities on the cuboid are presented.