Combination of Genetic Algorithms and CLP in the Vehicle-Fleet Scheduling Problem
Constraint Logic Programming (CLP) is a technique which presents several advantages in dealing with combinatorial optimization problems as it combines the declarative aspects of Logic Programming with the efficiency of Constraint Techniques. However, the attempts to solve the Vehicle Scheduling Problem (VSP) through the application of CLP has not been successful, due to the huge complexity of the problem and the scarcity of constraints able to drive the solution.
This paper presents a new approach to the problem which attempts to combine the advantages of CLP with the benefits of Genetic Algorithms in order to obtain satisfactory results with respect to execution time and solution quality.
KeywordsGenetic Algorithm Execution Time Local Search Initial Population Travel Salesman Problem
Unable to display preview. Download preview PDF.
- 1.Christodoulou, N., Stefanitsis, E., Kaltsas, E., & Assimakopoulos, V., “A Constraint Logic Programming Approach to the Vehicle - Fleet Scheduling Problem”, Proceedings of the Second International Conference on the Practical Application of Prolog,, London, p137–149 (1994).Google Scholar
- 4.Christodoulou, N., Implementation of Constraint Logic Programming (CLP) for the solution of the Vehicle Scheduling Problem (VSP), Phd Thesis, Athens, National Technical University of Athens (1994).Google Scholar
- 5.N., Christofides, and S., Eilon, “An algorithm for the vehicle dispatching problem”, Op. Res. Quart. 20, 318 (1969)Google Scholar