Forty years of periodic vehicle routing
The periodic vehicle routing problem (PVRP) first appeared in 1974 in a paper about
garbage collection (Beltrami and Bodin, Networks 4 (1974), 65–74). The wide applicability …
garbage collection (Beltrami and Bodin, Networks 4 (1974), 65–74). The wide applicability …
Heuristics for multi-attribute vehicle routing problems: A survey and synthesis
The attributes of vehicle routing problems are additional characteristics or constraints that
aim to better take into account the specificities of real applications. The variants thus formed …
aim to better take into account the specificities of real applications. The variants thus formed …
Parallel computational optimization in operations research: A new integrative framework, literature review and research directions
Solving optimization problems with parallel algorithms has a long tradition in OR. Its future
relevance for solving hard optimization problems in many fields, including finance, logistics …
relevance for solving hard optimization problems in many fields, including finance, logistics …
A clustering-based extended genetic algorithm for the multidepot vehicle routing problem with time windows and three-dimensional loading constraints
Since the multidepot vehicle routing problem with time windows and three-dimensional
loading constraints (MDVRPTW-TDLC) is a multiconstraint and combinatorial optimization …
loading constraints (MDVRPTW-TDLC) is a multiconstraint and combinatorial optimization …
From managing urban freight to smart city logistics networks
T Bektas, TG Crainic, T Van Woensel - 2015 - eprints.soton.ac.uk
We present City Logistics by taking a systemic view, describing its main components and
elements, as an emerging field of study with wide and significant social and economic …
elements, as an emerging field of study with wide and significant social and economic …
A variable neighborhood search-based algorithm with adaptive local search for the Vehicle Routing Problem with Time Windows and multi-depots aiming for vehicle …
This article addresses the Multi-Depot Vehicle Routing Problem with Time Windows with the
minimization of the number of used vehicles, denominated as MDVRPTW*. This problem is …
minimization of the number of used vehicles, denominated as MDVRPTW*. This problem is …
An adaptive large-neighborhood search heuristic for a multi-period vehicle routing problem
This problem involves optimizing product collection and redistribution from production
locations to a set of processing plants over a planning horizon. This horizon consists of …
locations to a set of processing plants over a planning horizon. This horizon consists of …
Combining statistical learning with metaheuristics for the multi-depot vehicle routing problem with market segmentation
In real-life logistics and distribution activities it is usual to face situations in which the
distribution of goods has to be made from multiple warehouses or depots to the final …
distribution of goods has to be made from multiple warehouses or depots to the final …
Chapter 9: Four variants of the vehicle routing problem
Vehicle Routing : Chapter 9: Four Variants of the Vehicle Routing Problem Page 1 Chapter 9
Four Variants of the Vehicle Routing Problem Stefan Irnich Michael Schneider Daniele Vigo 9.1 …
Four Variants of the Vehicle Routing Problem Stefan Irnich Michael Schneider Daniele Vigo 9.1 …
PILS: exploring high-order neighborhoods by pattern mining and injection
We introduce pattern injection local search (PILS), an optimization strategy that uses pattern
mining to explore high-order local-search neighborhoods, and illustrate its application on …
mining to explore high-order local-search neighborhoods, and illustrate its application on …