Path planning on a cuboid using genetic algorithms

DOI10.1016/j.ins.2008.04.005zbMath1154.68512OpenAlexW2117976840MaRDI QIDQ942312

Aybars Uğur

Publication date: 5 September 2008

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2008.04.005

zbMATH Keywords

TSPoptimizationvisualizationgenetic algorithmslocal searchpath planningcuboid2-opt

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

Reducing the size of combinatorial optimization problems using the operator vaccine by fuzzy selector with adaptive heuristics, Genetic algorithm for minimizing the total weighted completion time scheduling problem with learning and release times, Multi-goal motion planning using traveling salesman problem in belief space, An efficient approach to 3D path planning, Solving a two-agent single-machine scheduling problem considering learning effect, VARIABLE PATROL PLANNING OF MULTI-ROBOT SYSTEMS BY A COOPERATIVE AUCTION SYSTEM, Hybrid evolutionary fuzzy learning scheme in the applications of traveling salesman problems, Genetic algorithms for outlier detection in multiple regression with different information criteria

Uses Software

• TSPLIB

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A random-key genetic algorithm for the generalized traveling salesman problem
• On initial populations of a genetic algorithm for continuous optimization problems
• Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems
• Guided local search and its application to the traveling salesman problem
• A new hybrid heuristic approach for solving large traveling salesman problem
• A new approach to solving the multiple traveling salesperson problem using genetic algorithms
• The multi-criteria minimum spanning tree problem based genetic algorithm
• A hybrid genetic-GRASP algorithm using Lagrangean relaxation for the traveling salesman problem
• Computing with Domino-Parity Inequalities for the Traveling Salesman Problem (TSP)
• An ant colony system approach for variants of the traveling salesman problem with time windows