We introduce a parallel iterated tabu search heuristic for solving eight different variants of the vehicle routing problem. Through extensive computational results we show that the proposed heuristic is both general and competitive with specific heuristics designed for each problem type.
Solving Variants of the Vehicle Routing Problem with a Simple Parallel Iterated Tabu Search / M. Maischberger; J.-F. Cordeau. - STAMPA. - 6701:(2011), pp. 395-400. (Intervento presentato al convegno 5th International Conference on Network Optimization, INOC 2011 nel 2011) [10.1007/978-3-642-21527-8_44].
Solving Variants of the Vehicle Routing Problem with a Simple Parallel Iterated Tabu Search
MAISCHBERGER, MIRKO;
2011
Abstract
We introduce a parallel iterated tabu search heuristic for solving eight different variants of the vehicle routing problem. Through extensive computational results we show that the proposed heuristic is both general and competitive with specific heuristics designed for each problem type.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in FLORE sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
