Using PDDL to Solve Vehicle Routing Problems - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2014

Using PDDL to Solve Vehicle Routing Problems

Wenjun Cheng
  • Function : Author
  • PersonId : 990796
Yuhui Gao
  • Function : Author
  • PersonId : 990797


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.
Fichier principal
Vignette du fichier
978-3-662-44980-6_23_Chapter.pdf (178.79 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01383334 , version 1 (18-10-2016)





Wenjun Cheng, Yuhui Gao. Using PDDL to Solve Vehicle Routing Problems. 8th International Conference on Intelligent Information Processing (IIP), Oct 2014, Hangzhou, China. pp.207-215, ⟨10.1007/978-3-662-44980-6_23⟩. ⟨hal-01383334⟩
211 View
3762 Download



Gmail Facebook Twitter LinkedIn More