Solving Vehicle Routing Problems using Constraint Programming and Lagrangean Relaxation in a metaheuristics framework

D. Guimarans, R. Herrero, Juan José Ramos, Silvia Padrón

Research output: Chapter in Book/Report/Conference proceedingChapter (Book)Otherpeer-review

Abstract

This paper presents a methodology based on the Variable Neighbourhood Search metaheuristic, applied to the Capacitated Vehicle Routing Problem. The presented approach uses Constraint Programming and Lagrangean Relaxation methods in order to improve algorithm’s efficiency. The complete problem is decomposed into two separated subproblems, to which the mentioned techniques are applied to obtain a complete solution. With this decomposition, the methodology provides a quick initial feasible solution which is rapidly improved by metaheuristics’ iterative process. Constraint Programming and Lagrangean Relaxation are also embedded within this structure to ensure constraints satisfaction and
to reduce the calculation burden. By means of the proposed methodology, promising results have been obtained. Remarkable results presented in this paper include a new best-known solution for a rarely solved 200-customers test instance, as well as a better alternative solution for another benchmark problem.
Original languageEnglish
Title of host publicationManagement Innovations for Intelligent Supply Chains
EditorsJohn Wang
Place of PublicationHershey PA USA
PublisherIGI Global
Chapter7
Pages123-143
Number of pages21
ISBN (Electronic)9781466624610, 9781466624627
DOIs
Publication statusPublished - 2013
Externally publishedYes

Cite this

Guimarans, D., Herrero, R., Ramos, J. J., & Padrón, S. (2013). Solving Vehicle Routing Problems using Constraint Programming and Lagrangean Relaxation in a metaheuristics framework. In J. Wang (Ed.), Management Innovations for Intelligent Supply Chains (pp. 123-143). Hershey PA USA: IGI Global. https://doi.org/10.4018/978-1-4666-2461-0.ch007
Guimarans, D. ; Herrero, R. ; Ramos, Juan José ; Padrón, Silvia. / Solving Vehicle Routing Problems using Constraint Programming and Lagrangean Relaxation in a metaheuristics framework. Management Innovations for Intelligent Supply Chains. editor / John Wang. Hershey PA USA : IGI Global, 2013. pp. 123-143
@inbook{bc7288d1138e45ebb04119c24931bbc6,
title = "Solving Vehicle Routing Problems using Constraint Programming and Lagrangean Relaxation in a metaheuristics framework",
abstract = "This paper presents a methodology based on the Variable Neighbourhood Search metaheuristic, applied to the Capacitated Vehicle Routing Problem. The presented approach uses Constraint Programming and Lagrangean Relaxation methods in order to improve algorithm’s efficiency. The complete problem is decomposed into two separated subproblems, to which the mentioned techniques are applied to obtain a complete solution. With this decomposition, the methodology provides a quick initial feasible solution which is rapidly improved by metaheuristics’ iterative process. Constraint Programming and Lagrangean Relaxation are also embedded within this structure to ensure constraints satisfaction andto reduce the calculation burden. By means of the proposed methodology, promising results have been obtained. Remarkable results presented in this paper include a new best-known solution for a rarely solved 200-customers test instance, as well as a better alternative solution for another benchmark problem.",
author = "D. Guimarans and R. Herrero and Ramos, {Juan Jos{\'e}} and Silvia Padr{\'o}n",
year = "2013",
doi = "10.4018/978-1-4666-2461-0.ch007",
language = "English",
pages = "123--143",
editor = "Wang, {John }",
booktitle = "Management Innovations for Intelligent Supply Chains",
publisher = "IGI Global",
address = "United States of America",

}

Guimarans, D, Herrero, R, Ramos, JJ & Padrón, S 2013, Solving Vehicle Routing Problems using Constraint Programming and Lagrangean Relaxation in a metaheuristics framework. in J Wang (ed.), Management Innovations for Intelligent Supply Chains. IGI Global, Hershey PA USA, pp. 123-143. https://doi.org/10.4018/978-1-4666-2461-0.ch007

Solving Vehicle Routing Problems using Constraint Programming and Lagrangean Relaxation in a metaheuristics framework. / Guimarans, D.; Herrero, R.; Ramos, Juan José; Padrón, Silvia.

Management Innovations for Intelligent Supply Chains. ed. / John Wang. Hershey PA USA : IGI Global, 2013. p. 123-143.

Research output: Chapter in Book/Report/Conference proceedingChapter (Book)Otherpeer-review

TY - CHAP

T1 - Solving Vehicle Routing Problems using Constraint Programming and Lagrangean Relaxation in a metaheuristics framework

AU - Guimarans, D.

AU - Herrero, R.

AU - Ramos, Juan José

AU - Padrón, Silvia

PY - 2013

Y1 - 2013

N2 - This paper presents a methodology based on the Variable Neighbourhood Search metaheuristic, applied to the Capacitated Vehicle Routing Problem. The presented approach uses Constraint Programming and Lagrangean Relaxation methods in order to improve algorithm’s efficiency. The complete problem is decomposed into two separated subproblems, to which the mentioned techniques are applied to obtain a complete solution. With this decomposition, the methodology provides a quick initial feasible solution which is rapidly improved by metaheuristics’ iterative process. Constraint Programming and Lagrangean Relaxation are also embedded within this structure to ensure constraints satisfaction andto reduce the calculation burden. By means of the proposed methodology, promising results have been obtained. Remarkable results presented in this paper include a new best-known solution for a rarely solved 200-customers test instance, as well as a better alternative solution for another benchmark problem.

AB - This paper presents a methodology based on the Variable Neighbourhood Search metaheuristic, applied to the Capacitated Vehicle Routing Problem. The presented approach uses Constraint Programming and Lagrangean Relaxation methods in order to improve algorithm’s efficiency. The complete problem is decomposed into two separated subproblems, to which the mentioned techniques are applied to obtain a complete solution. With this decomposition, the methodology provides a quick initial feasible solution which is rapidly improved by metaheuristics’ iterative process. Constraint Programming and Lagrangean Relaxation are also embedded within this structure to ensure constraints satisfaction andto reduce the calculation burden. By means of the proposed methodology, promising results have been obtained. Remarkable results presented in this paper include a new best-known solution for a rarely solved 200-customers test instance, as well as a better alternative solution for another benchmark problem.

U2 - 10.4018/978-1-4666-2461-0.ch007

DO - 10.4018/978-1-4666-2461-0.ch007

M3 - Chapter (Book)

SP - 123

EP - 143

BT - Management Innovations for Intelligent Supply Chains

A2 - Wang, John

PB - IGI Global

CY - Hershey PA USA

ER -

Guimarans D, Herrero R, Ramos JJ, Padrón S. Solving Vehicle Routing Problems using Constraint Programming and Lagrangean Relaxation in a metaheuristics framework. In Wang J, editor, Management Innovations for Intelligent Supply Chains. Hershey PA USA: IGI Global. 2013. p. 123-143 https://doi.org/10.4018/978-1-4666-2461-0.ch007