Parallel asynchronous tabu search for multicommodity location-allocation with balancing requirements

Parallel asynchronous tabu search for multicommodity location-allocation with balancing requirements

0.00 Avg rating0 Votes
Article ID: iaor19971267
Country: Netherlands
Volume: 63
Issue: 1
Start Page Number: 277
End Page Number: 299
Publication Date: May 1996
Journal: Annals of Operations Research
Authors: , ,
Keywords: heuristics, allocation: resources, computational analysis: parallel computers
Abstract:

The authors study and compare asynchronous parallelization strategies for tabu search, and evaluate the impact on performance and solution quality of some important algorithmic design parameters: number of processors, handling of exchanged information, etc. Parallelization approaches are implemented and compared by using a tabu search algorithm for multicommodity location-allocation problems with balancing requirements.

Reviews

Required fields are marked *. Your email address will not be published.