Local search heuristics for robotic routing planner

Authors:
Stanislav Slušný;Roman Neruda
Affiliations:
Institute of Computer Science, Academy of Sciences of the Czech Republic, Praha, Czech Republic;Institute of Computer Science, Academy of Sciences of the Czech Republic, Praha, Czech Republic
Venue:
ISNN'11 Proceedings of the 8th international conference on Advances in neural networks - Volume Part III
Year:
2011

Citing 5
Cited 0

Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties

Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Solving Vehicle Routing Problems Using Constraint Programming and Metaheuristics

Journal of Heuristics
Using Constraint-Based Operators to Solve the Vehicle Routing Problem with Time Windows

Journal of Heuristics
Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems

CP '98 Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming
A genetic algorithm for the vehicle routing problem

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

Several approaches to one particular variation of robot path planning problem are introduced in this paper. A detailed description of local neighborhood search heuristics as well as a comparison with more sophisticated algorithms based on constraint programming technique is presented. The enhancements and further adaptation to the real world environment are discussed as well.