𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A new ILP-based refinement heuristic for Vehicle Routing Problems

✍ Scribed by Roberto De Franceschi; Matteo Fischetti; Paolo Toth

Publisher
Springer-Verlag
Year
2005
Tongue
English
Weight
243 KB
Volume
105
Category
Article
ISSN
0025-5610

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A tabu search heuristic for periodic and
A tabu search heuristic for periodic and multi-depot vehicle routing problems
✍ Cordeau, Jean-FranοΏ½ois; Gendreau, Michel; Laporte, Gilbert πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 142 KB πŸ‘ 1 views

We propose a tabu search heuristic capable of solving three well-known routing problems: the periodic vehicle routing problem, the periodic traveling salesman problem, and the multi-depot vehicle routing problem. Computational experiments carried out on instances taken from the literature indicate t

A branch-and-regret heuristic for stocha
A branch-and-regret heuristic for stochastic and dynamic vehicle routing problems
✍ Lars Magnus Hvattum; Arne LΓΈkketangen; Gilbert Laporte πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 184 KB

## Abstract This paper describes a new Branch‐and‐Regret Heuristic for a class of dynamic and stochastic vehicle routing problems. This work is motivated by a real‐life problem faced by a major transporter in Norway. The heuristic uses stochastic information during the solution process. The new met