𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The vehicle rescheduling problem: Model and algorithms

✍ Scribed by Jing-Quan Li; Pitu B. Mirchandani; Denis Borenstein

Publisher
John Wiley and Sons
Year
2007
Tongue
English
Weight
228 KB
Volume
50
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Two exact algorithms for the vehicle rou
Two exact algorithms for the vehicle routing problem on trees
✍ Pontien Mbaraga; AndrΓ© Langevin; Gilbert Laporte πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 80 KB πŸ‘ 2 views

This article describes a heuristic and two exact algorithms for several classes of vehicle routing problems defined on tree networks. These include capacitated and time-constrained vehicle routing problems. One of the exact algorithms is based on the computation of bin packing lower bounds. The othe

The split delivery vehicle routing probl
The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results
✍ Si Chen; Bruce Golden; Edward Wasil πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 277 KB

## Abstract In the split delivery vehicle routing problem (SDVRP), a customer's demand can be split among several vehicles. In this article, we review applications of the SDVRP including the routing of helicopters in the North Sea and solution methods such as integer programming and tabu search. We

Edge assembly-based memetic algorithm fo
Edge assembly-based memetic algorithm for the capacitated vehicle routing problem
✍ Yuichi Nagata; Olli BrΓ€ysy πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 200 KB

## Abstract Vehicle routing problems are at the heart of most decision support systems for real‐life distribution problems. In vehicle routing problem a set of routes must be determined at lowest total cost for a number of resources (i.e., fleet of vehicles) located at one or several points (e.g.,