loading...
Distributed Parallel Metaheuristics based on GRASP and VNS for Solving the Traveling Purchaser Problem
Taiwan, ROC December 17-December 20
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICPADS.2002.1183409Ninth International Conference on Par ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
This paper presents several strategies for parallel implementations of the Greedy Randomized Adaptive Search Procedure (GRASP) and the Variable Neighborhood Search (VNS) applied to a combinatorial optimization problem known as the Traveling Purchaser Problem (TPP). Parallel algorithms based on master-worker, completely distributed and independent models, using static and dynamic load balance were proposed. The performance of these parallel algorithms was analyzed comparing them among themselves and with their sequential versions.
Citation:
Lúcia M. de Assumpção Drummond, Leonardo Soares Vianna, Mozar B. da Silva, Luiz Satoru Ochi, "Distributed Parallel Metaheuristics based on GRASP and VNS for Solving the Traveling Purchaser Problem," icpads, pp.257, Ninth International Conference on Parallel and Distributed Systems (ICPADS'02), 2002
Usage of this product signifies your acceptance of the Terms of Use.