Distributed parallel metaheuristics based on GRASP and VNS for solving the traveling purchaser problem

Author

de Assumpção Drummond, LÙcia M. ; Vianna, Leonardo Soares ; da Silva, Mozar B. ; Ochi, Luiz Satoru

Author_Institution

Dept. of Comput. Sci., Fluminense Fed. Univ., Rio de Janeiro, Brazil

fYear

2002

fDate

17-20 Dec. 2002

Firstpage

257

Lastpage

263

Abstract

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.

Keywords

combinatorial mathematics; heuristic programming; optimisation; parallel algorithms; randomised algorithms; resource allocation; search problems; combinatorial optimization problem; distributed models; distributed parallel metaheuristics; dynamic load balance; greedy randomized adaptive search procedure; independent models; master-worker models; parallel algorithms; performance; static load balance; traveling purchaser problem; variable neighborhood search; Algorithm design and analysis; Computer science; Costs; Electronic mail; Genetic algorithms; Parallel algorithms; Parallel processing; Performance analysis; Traveling salesman problems; Upper bound;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel and Distributed Systems, 2002. Proceedings. Ninth International Conference on

ISSN

1521-9097

Print_ISBN

0-7695-1760-9

Type

conf

DOI

10.1109/ICPADS.2002.1183409

Filename

1183409