𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Very large-scale neighborhood search algorithms for the design of

✍ Scribed by Jocelyne Elias; Fabio Martignon; Giuliana Carello

Publisher
Springer US
Year
2010
Tongue
English
Weight
679 KB
Volume
49
Category
Article
ISSN
1018-4864

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the scaling of feedback algorithms fo
On the scaling of feedback algorithms for very large multicast groups
✍ T.T. Fuhrmann; J. Widmer πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 274 KB

Feedback from multicast group members is vital for many multicast protocols. In order to avoid feedback implosion in very large groups feedback algorithms with well-behaved scaling-properties must be chosen. In this paper, we analyse the performance of three typical feedback algorithms described in

A branch-and-price-based large neighborh
A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows
✍ Eric Prescott-Gagnon; Guy Desaulniers; Louis-Martin Rousseau πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 153 KB

## Abstract Given a fleet of vehicles assigned to a single depot, the vehicle routing problem with time windows (VRPTW) consists of determining a set of feasible vehicle routes to deliver goods to a set of customers while minimizing, first, the number of vehicles used and, second, total distance tr