Abstract
In this paper, we describe a search method based on the language PDDL for solving vehicle routing problems. The Vehicle Routing Problem (VRP) is a classical problem in Operations Research, and there are many different variants of the VRP. This paper describes a new approach to model standard VRP and some variants based on PDDL language, explains how the method constructs model and solves the problem using several PDDL planners, and analyses the planning results of these planners.
Keywords
Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Laporte, G.: Fifty Years of Vehicle Routing. Transportation Science 43, 408–416 (2009)
McDermott, D., Ghallab, M.: PDDL-The Planning Domain Definition Language. Technical Report, CVC TR-98-003/DCS TR-1165, Yale Center for Computational Vision and Control (1998)
Fox, M., Long, D.: PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains. Journal of Artificial Intelligence Research (JAIR) 20, 61–124 (2003)
Edelkamp, S., Hoffmann, J.: PDDL2.2: The Language for the Classical Part of the 4th International planning Competition. Technical Report, the 4th International planning Competition (2004)
Do, M.B., Kambhampati, S.: SAPA: A multi-objective metric temporal planner. Journal of Artificial Intelligence Research (JAIR) 20, 155–194 (2003)
Gerevini, A., Serina, I.: LPG: A planner based on a local search for planning graphs with action costs. In: 6th International Conference on Artificial Intelligence Planning and Scheduling (AIPS 2002), pp. 13–22 (2002)
Gerevini, A., Saetti, A., Serina, I.: Integrating Planning and Temporal Reasoning for Domains with Durations and Time Windows. In: 19th International Joint Conference on Artificial Intelligence (2005)
Gerevini, A., Saetti, A., Serina, I.: An approach to temporal planning and scheduling in domains with predictable exogenous events. Journal of Artificial Intelligence Research (JAIR) 25, 187–231 (2006)
Chen, Y., Benjamin, W.: Wah, Chih-Wei Hsu: Temporal planning using subgoal partitioning and resolution in SGPlan. Journal of Artificial Intelligence Research 26, 323–369 (2006)
Eyerich, P., Mattmüller, R., Röger, G.: Using the context enhanced additive heuristic for temporal and numeric planning. In: 19th International Conference on Automated Planning and Scheduling (ICAPS), Thessaloniki, Greece (2009)
Coles, A.J., Coles, A., Fox, M., Long, D.: Forward chaining partial-order planning. In: 20th International Conference on Automated Planning and Scheduling (ICAPS), Toronto, Ontario, Canada, pp. 42–49 (2010)
Dréo, J., Savéant, P., Schoenauer, M., Vidal, V.: Divide-and-Evolve: The marriage of Descartes and Darwin. In: 2011 International Planning Competition (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 IFIP International Federation for Information Processing
About this paper
Cite this paper
Cheng, W., Gao, Y. (2014). Using PDDL to Solve Vehicle Routing Problems. In: Shi, Z., Wu, Z., Leake, D., Sattler, U. (eds) Intelligent Information Processing VII. IIP 2014. IFIP Advances in Information and Communication Technology, vol 432. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-44980-6_23
Download citation
DOI: https://doi.org/10.1007/978-3-662-44980-6_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-44979-0
Online ISBN: 978-3-662-44980-6
eBook Packages: Computer ScienceComputer Science (R0)