Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Combining constraint programming, lagrangean relaxation and probabilistic algorithms to solve the vehicle routing problem

Autor
Guimarans, D.; Herrero, R.; Riera, D.; Juan, A.; Ramos, J.
Tipus d'activitat
Article en revista
Revista
Annals of mathematics and artificial intelligence
Data de publicació
2011
Volum
62
Número
3-4
Pàgina inicial
299
Pàgina final
315
DOI
https://doi.org/10.1007/s10472-011-9261-y Obrir en finestra nova
Repositori
http://hdl.handle.net/2117/17339 Obrir en finestra nova
Resum
This paper presents an original hybrid approach to solve the Capacitated Vehicle Routing Problem (CVRP). The approach combines a Probabilistic Algorithm with Constraint Programming (CP) and Lagrangian Relaxation (LR). After introducing the CVRP and reviewing the existing literature on the topic, the paper proposes an approach based on a probabilistic Variable Neighbourhood Search (VNS) algorithm. Given a CVRP instance, this algorithm uses a randomized version of the classical Clarke and Wright S...
Citació
Guimarans, D. [et al.]. Combining constraint programming, lagrangean relaxation and probabilistic algorithms to solve the vehicle routing problem. "Annals of mathematics and artificial intelligence", 2011, vol. 62, núm. 3-4, p. 299-315.

Participants

  • Guimarans, D  (autor)
  • Herrero, R  (autor)
  • Riera, D  (autor)
  • Juan Perez, Angel Alejandro  (autor)
  • Ramos, J  (autor)