Advertisement

Combination of Genetic Algorithms and CLP in the Vehicle-Fleet Scheduling Problem

  • E. Stefanitsis
  • N. Christodoulou
  • J. Psarras
Conference paper

Abstract

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[1] 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.

Keywords

Genetic Algorithm Execution Time Local Search Initial Population Travel Salesman Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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
  2. 2.
    Dantzig, G.B., & Ramser, J.H., “The Truck dispatching Problem”, Management Science 6, 81 (1959).MathSciNetGoogle Scholar
  3. 3.
    Clarke, G., & Wright, J.W., “Scheduling of vehicles from a central depot to a number of delivery points”, Op. Res. 12, 568(1964)CrossRefGoogle Scholar
  4. 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. 5.
    N., Christofides, and S., Eilon, “An algorithm for the vehicle dispatching problem”, Op. Res. Quart. 20, 318 (1969)Google Scholar
  6. 6.
    Lin, S., and Kernigham, B.W., “An effective heuristic algorithm for the travelling salesman problem”, Op. Res. 21 498 (1973)MATHCrossRefGoogle Scholar
  7. 7.
    Lin, S., “Computer Solutions to the travelling salesman problem”, Bel System Technical Journal 44, 2245 (1965)MATHGoogle Scholar

Copyright information

© Springer-Verlag/Wien 1995

Authors and Affiliations

  • E. Stefanitsis
    • 1
  • N. Christodoulou
    • 1
  • J. Psarras
    • 1
  1. 1.Management Systems Unit, Department of Electrical and Computer EngineeringNational Technical University of AthensAthensGreece

Personalised recommendations