A cooperative parallel meta-heuristic for the vehicle routing problem with time windows [An article from: Computers and Operations Research]

This digital document is a journal article from Computers and Operations Research, published by Elsevier in 2005. The article is delivered in HTML format and is available in your Amazon.com Media Library immediately after purchase. You can view it with any web browser.
Description:
This paper presents a parallel cooperative multi-search method for the vehicle routing problem with time windows. It is on the solution warehouse strategy, in which several threads cooperate search based on

List Price: $ 7.95

Price: $ 7.95

Related Posts:

• Applying the attribute based hill climber heuristic to the vehicle routing problem [An article from: European Journal of Operational Research]
• A tabu search procedure based on a random Roulette diversification for the weighted maximal planar graph problem [An article from: Computers and Operations Research]
• A hybrid scatter search/electromagnetism meta-heuristic for project scheduling [An article from: European Journal of Operational Research]
• Scheduling sports competitions at multiple venues-Revisited [An article from: European Journal of Operational Research]
• A dynamic neighborhood based tabu search algorithm for real-world flight instructor scheduling problems [An article from: European Journal of Operational Research]