𝔖 Bobbio Scriptorium
✦   LIBER   ✦

EVE-OPT: a hybrid algorithm for the capacitated vehicle routing problem

✍ Scribed by Guido Perboli; Ferdinando Pezzella; Roberto Tadei

Publisher
Springer
Year
2008
Tongue
English
Weight
420 KB
Volume
68
Category
Article
ISSN
0340-9422

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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.,

A new hybrid ant colony optimization alg
A new hybrid ant colony optimization algorithm for the vehicle routing problem
✍ Xiaoxia Zhang; Lixin Tang πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 251 KB

This paper presents a novel hybrid ant colony optimization approach called SS\_ACO algorithm to solve the vehicle routing problem. The main feature of the hybrid algorithm is to hybridize the solution construction mechanism of the ant colony optimization (ACO) with scatter search (SS). In our hybrid