𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the capacitated vehicle routing problem

✍ Scribed by T.K. Ralphs; L. Kopman; W.R. Pulleyblank; L.E. Trotter


Publisher
Springer-Verlag
Year
2003
Tongue
English
Weight
141 KB
Volume
94
Category
Article
ISSN
0025-5610

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


An exact algorithm for the asymmetrical
✍ Gilbert Laporte; HΓ©lΓ¨ne Mercure; Yves Nobert πŸ“‚ Article πŸ“… 1986 πŸ› John Wiley and Sons 🌐 English βš– 619 KB

The aim of this article is to develop an exact algorithm for the asymmetrical capacitated vehicle routing problem, i.e., the multiple traveling salesman problem subject to capacity restrictions. The problem is solved by means of a branch and bound tree in which subproblems are modified assignment pr

Edge assembly-based memetic algorithm fo
✍ 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.,