Path planning on a cuboid using genetic algorithms

DOI10.1016/J.INS.2008.04.005MaRDI QIDQ942312zbMATH OpenOpenAlexFDO

Authors 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

2-optcuboidgenetic algorithmslocal searchoptimizationpath planningTSPvisualization

Mathematics Subject Classification ID

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

Recommendations

• Genetic algorithm for combinatorial path planning: the subtour problem
• The Generalized Traveling Salesman Problem: A New Genetic Algorithm Approach
• A new genetic algorithm applied to the traveling salesman problem
• A novel approach to solve multiple traveling salesmen problem by genetic algorithm
• Some issues of designing genetic algorithms for traveling salesman problems

Cites work

• A hybrid genetic-GRASP algorithm using Lagrangean relaxation for the traveling salesman problem
• A new approach to solving the multiple traveling salesperson problem using genetic algorithms
• A new hybrid heuristic approach for solving large traveling salesman problem
• A random-key genetic algorithm for the generalized traveling salesman problem
• An ant colony system approach for variants of the traveling salesman problem with time windows
• Computing with domino-parity inequalities for the traveling salesman problem (TSP)
• Guided local search and its application to the traveling salesman problem
• scientific article; zbMATH DE number 4104743 (Why is no real title available?)
• scientific article; zbMATH DE number 1082106 (Why is no real title available?)
• scientific article; zbMATH DE number 2013555 (Why is no real title available?)
• scientific article; zbMATH DE number 4115948 (Why is no real title available?)
• Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems
• On initial populations of a genetic algorithm for continuous optimization problems
• The multi-criteria minimum spanning tree problem based genetic algorithm

Cited in

(10)

• Reducing the size of combinatorial optimization problems using the operator vaccine by fuzzy selector with adaptive heuristics
• Solving a two-agent single-machine scheduling problem considering learning effect
• An efficient approach to 3D path planning
• Multi-goal motion planning using traveling salesman problem in belief space
• Variable patrol planning of multi-robot systems by a cooperative auction system
• Genetic algorithms for outlier detection in multiple regression with different information criteria
• Genetic algorithm for minimizing the total weighted completion time scheduling problem with learning and release times
• Hybrid evolutionary fuzzy learning scheme in the applications of traveling salesman problems
• A new neural network approach for torus super structured quadrilateral dynamic resistor networks and its applications
• Robot path planning based on potential function of a resistor network

Describes a project that uses

Uses Software

• TSPLIB

This page was built for publication: Path planning on a cuboid using genetic algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q942312)