𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Corrigendum: A New Tabu Search Heuristic for the Open Vehicle Routing Problem

✍ Scribed by Z. Fu, R. Eglese and L. Y. O. Li

Book ID
125583761
Publisher
Palgrave Publishers Ltd.
Year
2006
Tongue
English
Weight
189 KB
Volume
57
Category
Article
ISSN
0160-5682

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A reactive tabu search meta-heuristic fo
A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls
✍ Ibrahim H. Osman; Niaz A. Wassan πŸ“‚ Article πŸ“… 2002 πŸ› Springer US 🌐 English βš– 195 KB

The vehicle routing problem with back-hauls involves the design of a set of minimum cost routes, originating and terminating at a central depot, for a set of vehicles to service a set of customers with known quantities to be either delivered or collected. This paper describes two route-construction

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