𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The savings algorithm for the vehicle routing problem

✍ Scribed by H. Paessens

Publisher
Elsevier Science
Year
1988
Tongue
English
Weight
505 KB
Volume
34
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Stochastic vehicle routing with modified
Stochastic vehicle routing with modified savings algorithm
✍ Moshe Dror; Pierre Trudeau πŸ“‚ Article πŸ“… 1986 πŸ› Elsevier Science 🌐 English βš– 690 KB

A stochastic vehicle routing problem (SVRP) differs from the well known vehicle routing problem (VRP) in that the actual customer demand is not known with certainty when the vehicle routes are designed.One aspect that differentiates between these problems is the notion of route failure. Route failur

An exact algorithm for the asymmetrical
An exact algorithm for the asymmetrical capacitated vehicle routing problem
✍ 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
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.,