Abstract
This paper presents a generic technique for improving constraint-based heuristics through the discovery of meta-heuristics. The idea is to represent a family of “push/pull” algorithms, based on inserting and removing tasks in a current solution, with an algebra and let a learning algorithm search for the best possible algebraic term (which represents a hybrid algorithm), for a given set of problems and an optimization criterion. This paper describes an application of this idea using vehicle routing with time windows (VRPTW) as the domain example, although this approach can be applied to many other problems which can be seen as the assignment of tasks to resources (generalized assignments). We suppose that a domain-dependent (constraint-based) algorithm has been built, which is able to insert and remove tasks and handle the domain-specific constraints. Our goal is to improve such an algorithm with techniques like LDS (Limited Discrepancy Search), LNS (Large Neighborhood Search), ejection trees or chains, which can be described in a generic manner using the insertion and deletion operations. We show that the automatic tuning of the best hybrid combination of such techniques yields a better solution than hand-tuning, with considerably less effort. The contribution of the paper is thus twofold: we demonstrate a combination of meta-heuristics that yields new best-known results on the Solomon benchmarks, and we provide with a method to automatically adjust this combination to handle problems with different sizes, complexity and optimization objectives.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Caseau, Y., Laburthe, F.: Introduction to the Claire Programming Language. LIENS Report 96-15, Ecole Normale Supérieure (1996)
Caseau, Y., Laburthe, F.: Solving small TSPs with Constraints. In: Proc. of the 14th International Conference on Logic Programming. The MIT Press, Cambridge (1997)
Caseau, Y., Laburthe, F.: Heuristics for Large Constrained Vehicle Routing Problems. To appear in the Journal of Heuristics (1998)
Caseau, Y., Laburthe, F.: SALSA: A Language for Search Algorithms. In: Maher, M.J., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520, pp. 310–324. Springer, Heidelberg (1998)
De Backer, B., Furnon, V.: Local Search in Constraint Programming: Experiments with Tabu Search on the Vehicle Routing Problem. In: Voss, S., et al. (eds.) Meta Heuristics: Advances and Trends in Local Search Paradigms for Optimization. Kluwer, Dordrecht (1999)
Gendreau, M., Hertz, A., Laporte, G.: A Tabu Search Heuristic for the Vehicle Routing Problem. Management Science 40, 1276–1290 (1994)
Harvey, W., Ginsberg, M.: Limited Discrepancy Search. In: Proceedings of the 14th IJCAI, pp. 607–615. Morgan Kaufmann, San Francisco (1995)
Kontoravdis, G., Bard, J.: A GRASP for the Vehicle Routing Problem with Time Windows. ORSA Journal on Computing 7(1) (1995)
Laporte, G.: The Vehicle Routing Problem: an overview of Exact and Approximate Algorithms. European Journal of Operational Research 59, 345–358 (1992)
Minton, S.: Configurable Solvers: Tailoring General Methods to Specific Applications. In: Smolka, G. (ed.) CP 1997. LNCS, vol. 1330, pp. 372–374. Springer, Heidelberg (1997)
Rego, C., Roucairol, C.: A Parallel Tabu Search Algorithm Using Ejection Chains for the Vehicle Routing Problem. Meta-Heuristics: Theory and Applications. Kluwer, Dordrecht (1996)
Rousseau, L.-M., Gendreau, M., Pesant, G.: Using Constraint-Based Operators with Variable Neighborhood Search to solve the Vehicle Routing Problem with Time Windows, CP-AI-OR 1999 workshop, Ferrara (February 1999)
Russell, R.: Hybrid Heuristics for the Vehicle Routing Problem with Time Windows. Transportation Science 29(2) (May 1995)
Silverstein, G., Pazzani, M.: Relational clichés: Constraining constructive induction during relational learning. In: Machine Learning Proceedings of the Eighth International Workshop (ML 1991), pp. 203–207. Morgan Kaufmann, San Francisco (1991)
Solomon, M.: Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints. Operations Research 35(2) (1987)
Shaw, P.: Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems. In: Maher, M.J., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520, p. 417. Springer, Heidelberg (1998)
Taillard, E., Badeau, P., Gendreau, M., Guertain, F., Rousseau, J.-Y.: A New Neighborhood Structure for the Vehicle Routing Problem with Time Windows, technical report CRT-95-66, Université de Montréal (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Caseau, Y., Laburthe, F., Silverstein, G. (1999). A Meta-Heuristic Factory for Vehicle Routing Problems. In: Jaffar, J. (eds) Principles and Practice of Constraint Programming – CP’99. CP 1999. Lecture Notes in Computer Science, vol 1713. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-48085-3_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-48085-3_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66626-4
Online ISBN: 978-3-540-48085-3
eBook Packages: Springer Book Archive