New benchmark instances for the Capacitated Vehicle Routing Problem-Reference-Cited by-同舟云学术

New benchmark instances for the Capacitated Vehicle Routing Problem

Published:2017-03 Issue:3 Volume:257 Page:845-858
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Uchoa Eduardo,Pecin Diego,Pessoa Artur,Poggi Marcus,Vidal Thibaut,Subramanian Anand

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modelling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference36 articles.

1. An improved branch-and-cut algorithm for the capacitated vehicle routing problem;Achuthan;Transportation Science,2003

2. A branch-and-cut algorithm for the vehicle routing problem;Araque;Annals of Operations Research,1994

3. Computational results with a branch and cut code for the capacitated vehicle routing problem;Augerat,1995

4. An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts;Baldacci;Mathematical Programming,2008

5. New route relaxation and pricing strategies for the vehicle routing problem;Baldacci;Operations Research,2011

Cited by 235 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Routing one million customers in a handful of minutes;Computers & Operations Research;2024-04

2. New benchmark instances for the inventory routing problem;European Journal of Operational Research;2024-03

3. Task scheduling for heterogeneous agents pickup and delivery using recurrent open shop scheduling models;Robotics and Autonomous Systems;2024-02

4. PyVRP: A High-Performance VRP Solver Package;INFORMS Journal on Computing;2024-01-29

5. A Neural Separation Algorithm for the Rounded Capacity Inequalities;INFORMS Journal on Computing;2024-01-23