𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A new subtour elimination constraint for the vehicle routing problem

✍ Scribed by N.R. Achuthan; L. Caccetta; S.P. Hill

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
747 KB
Volume
91
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

A Tabu search heuristic for the vehicle
A Tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints
✍ Michel Gendreau; Manuel Iori; Gilbert Laporte; Silvaro Martello πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 233 KB

## Abstract This article addresses the well‐known Capacitated Vehicle Routing Problem (CVRP), in the special case where the demand of a customer consists of a certain number of two‐dimensional weighted items. The problem calls for the minimization of the cost of transportation needed for the delive

A column generation approach for the spl
A column generation approach for the split delivery vehicle routing problem
✍ C. Archetti; N. Bianchessi; M. G. Speranza πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 151 KB

## Abstract In this article we present a branch‐and‐price‐and‐cut method for the solution of the split delivery vehicle routing problem (SDVRP). The SDVRP is the problem to serve customers with a fleet of capacitated vehicles at minimum traveling cost. With respect to the classical vehicle routing