The scheduling of deliveries and the routing of vehicles are of great importance for supply
chain operations, as both determine to a great extent the distribution costs, as well as …

Path-relinking is a major enhancement to the basic greedy randomized adaptive search
procedure (GRASP), leading to significant improvements in solution time and quality. Path …

Greedy randomized adaptive search procedures, or GRASP, were introduced by T. Feo and
M. Resende in 1989 as a probabilistic heuristic for solving hard set covering problems. Soon …

A greedy randomized adaptive search procedure (GRASP) is a multi-start metaheuristic for
combinatorial optimization problems, in which each iteration consists basically of two …

In order to reduce waste collection costs and realize sustainable urban development, this
paper investigates a two-echelon collaborative waste collection vehicle routing problem (2E …

The vehicle routing problem with trailers and transshipments (VRPTT) is a recent and
challenging extension of the well-known vehicle routing problem. The VRPTT constitutes an …

This book is dedicated to metaheuristics as applied to vehicle routing problems. Several
implementations are given as illustrative examples, along with applications to several typical …

The number of arc routing publications has increased significantly in the last decade. Such
an increase justifies a second annotated bibliography, a sequel to Corberán and Prins …

The capacitated arc routing problem (CARP) is a difficult combinatorial optimization problem
that has been intensively studied in the last decades. We present a hybrid metaheuristic …

The Open Capacitated Arc Routing Problem OCARP is a well-known NP-hard real-world
combinatorial optimization problem. It consists of determining optimal routes for vehicles in a …