This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Guided Cooperative Search for the Vehicle Routing Problem with Time Windows
July/August 2005 (vol. 20 no. 4)
pp. 36-42
Alexandre Le Bouthillier, Universit? de Montr?al
Teodor G. Crainic, Universit? du Qu?bec a Montr?al
Peter Kropf, Universit? de Neuchatel
An enhanced cooperative-search mechanism creates new information and guides global search. On the basis of attribute patterns shared by the solutions exchanged among search threads, the mechanism sends information to independent metaheuristics about promising and unpromising solution space patterns. This process results in better coordination among methods and the possibility of guiding the diversification and intensification of the global search. Experimental results on an extended set of benchmark problem sets for the vehicle routing problem with time windows illustrate and confirm the proposed methodology's benefits.

This article is part of a special issue on transportation and logistics.

Index Terms:
parallel computation, parallel cooperative search, vehicle routing problem with time windows
Citation:
Alexandre Le Bouthillier, Teodor G. Crainic, Peter Kropf, "A Guided Cooperative Search for the Vehicle Routing Problem with Time Windows," IEEE Intelligent Systems, vol. 20, no. 4, pp. 36-42, July-Aug. 2005, doi:10.1109/MIS.2005.58
Usage of this product signifies your acceptance of the Terms of Use.