Optimization Online


New Benchmark Instances for the Capacitated Vehicle Routing Problem

Eduardo Uchoa (uchoa***at***producao.uff.br)
Diego Pecin (diegopecin***at***gmail.com)
Artur Pessoa (artur***at***producao.uff.br)
Marcus Poggi (poggi***at***inf.puc-rio.br)
Anand Subramanian (anand***at***ct.ufpb.br)
Thibaut Vidal (thibaut.vidal***at***cirrelt.ca )

Abstract: The recent research on the CVRP is being slowed down by the lack of a good set of benchmark instances. The existing sets suff er from at least one of the following drawbacks: (i) became too easy for current algorithms; (ii) are too arti cial; (iii) are too homogeneous, not covering the wide range of characteristics found in real applications. We propose a new set of instances ranging from 100 to 1000 customers, designed in order to provide a more comprehensive and balanced experimental setting. We report results with state-of-the-art exact and heuristic methods.

Keywords: Vehicle Routing Problem, Benchmark Instances, Experimental Analysis of Algorithms

Category 1: Applications -- OR and Management Sciences (Transportation )

Category 2: Combinatorial Optimization (Meta Heuristics )

Category 3: Integer Programming ((Mixed) Integer Linear Programming )

Citation: Relatório de pesquisa em engenharia de produção - Universidade Federal Fluminense (2014)

Download: [PDF]

Entry Submitted: 10/14/2014
Entry Accepted: 10/14/2014
Entry Last Modified: 10/16/2014

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society