Välkommen till Transportbibliotekets katalog

Normalvy MARC-vy

An incremental tabu search heuristic for the generalized vehicle routing problem with time windows Moccia, Luigi ; Cordeau, Jean-Francois ; Laporte, Gilbert

Av: Medverkande: Utgivningsinformation: Montreal Interuniversitary Research Centre on Enterprise Networks, Logistics and Transportation, CIRRELT. CIRRELT-2010-12, 2010Beskrivning: 18 sÄmnen: Onlineresurser: Abstrakt: This paper describes an incremental neighbourhood tabu search heuristic for the generalized vehicle routing problem with time windows. The purpose of this work is to offer a general tool that can successfully be applied to a large variety of specific problems.
Exemplartyp: Rapport, konferenser, monografier
Inga fysiska exemplar för denna post

This paper describes an incremental neighbourhood tabu search heuristic for the generalized vehicle routing problem with time windows. The purpose of this work is to offer a general tool that can successfully be applied to a large variety of specific problems.