The Vehicle Routing Problem

By Paolo Toth, Daniele Vigo. SIAM monographs on discrete mathematics and applications, 2002

2,459 citations recorded by the source corpus.

Subfields: Industrial and Manufacturing Engineering

View Paper: https://www.semanticscholar.org/paper/26fccc070f05c4cbc738d64c2977745c460242ce

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Industrial and Manufacturing Engineering

Citations in the corpus

The vehicle routing problem: State of the art classification and review (2016, background): “A number of books (e.g. Golden, Raghavan, & Wasil, 2008; Toth & Vigo, 2002, 2014) and a considerable amount of proceedings have also contributed to the VRP literature that exists today.”
A Branch-and-Cut Algorithm for a Vendor-Managed Inventory-Routing Problem (2007, methodology): “To solve the VMIR-OU problem, we have implemented the model defined by (1)–(16), excluding the subtour elimination constraints (12) but including the valid inequalities (17)–(19) and (22)–(24).”
An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts (2008, neutral): “A recent survey of the CVRP, covering both exact and heuristic algorithms, can be found in the chapter of Cordeau et al. [16] of the book edited by Barnhart and Laporte [ 9 ].”
Traveling Salesman Problems with Profits (2005, background): “…DEJAX Ecole des Mines de Nantes and IRCCyN, 4, rue Alfred Kastler, 44307 Nantes, France Pierre.Dejax@emn.fr MICHEL GENDREAU CRT, Université de Montréal, C.P. 6128, succursale centre-ville, Montréal, Canada H3C 3J7 michelg@crt.umontreal.ca Traveling Salesman Problems with Profits (TSPs with…”
When immediate interactive feedback boosts optimization problem solving: A 'human-in-the-loop' approach for solving Capacitated Vehicle Routing Problems (2017, background): “…solving constitutes a cognitive process that relates strongly to everyday applied tasks (e.g. finding the best and most efficient route between two locations) and has strong applications in the field of Operational Research (OR) and Transport Logistics (Danzig & Ramser, 1959; Toth & Vigo, 2002).”
Routing problems with loading constraints (2010, methodology): “The reader is referred again to the books and surveys [87, 54, 30, 6, 7] mentioned above, and, for the area of pickup&delivery routing problems, to the web page maintained at the University of La Laguna, see http://webpages.”
Heuristics for multi-attribute vehicle routing problems: A survey and synthesis (2013, background): “…have been presented in the literature, as illustrated by various surveys (see Baldacci et al. 2007, Cordeau et al. 2007, Gendreau et al. 2008, Eksioglu et al. 2009, Potvin 2009 and Laporte 2009, for the most recent) and books (Golden and Assad 1988, Toth and Vigo 2002b, Golden et al. 2008).”
Oppositional biogeography-based optimization (2009, background): “, for postal services or buses) [198, 199, 200], and printed circuit board (PCB) drilling problems [201, 202].”
A unified solution framework for multi-attribute vehicle routing problems (2014, methodology): “The proposed UHGS is an extension of the Hybrid Genetic Search with Advanced Diversity Control of Vidal et al. (2012a), and aims to address MAVRPs in a unified manner by means of the proposed component-based design.”
Vehicle routing problems for city logistics (2017, background): “Previous research has demonstrated how vehicle routing optimization can lead to significant economic savings (estimated between 5% to 30% by Hasle and Kloster [50] or 5% to 20% by Toth and Vigo [109]).”