Efficiency of parallel metaheuristics for solving combinatorial problems

Authors:
Plamenka Borovska
Affiliations:
Technical University of Sofia
Venue:
CompSysTech '07 Proceedings of the 2007 international conference on Computer systems and technologies
Year:
2007

Citing 4
Cited 0

Optimization by simulated annealing: an experimental evaluation; part II, graph coloring and number partitioning

Operations Research
Local Search in Combinatorial Optimization

Local Search in Combinatorial Optimization
Observations on Using Genetic-Algorithms for Channel Allocation in Mobile Computing

IEEE Transactions on Parallel and Distributed Systems
A Simulated Annealing Algorithm for Extended Cell Assignment Problem in a Wireless ATM Network

Proceedings of the EvoWorkshops on Applications of Evolutionary Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper investigates the speedup and quality of solution of parallel metaheuristics on multicomputer platform for the case studies of parallel genetic computation for solving the TSP and solving the room assignment problem by parallel simulated annealing. Parallel computational models have been suggested for solving the TSP by genetic approach with chromosome migration (SPMD paradigm) and for solving the room assignment problem by simulated annealing (manager/workers paradigm). The experimental study is based on flat (MPI-based) parallel program implementations on multicomputer platform. Performance and scalability analysis have been made in respect to the application size and multicomputer size. The impact of various factors on the quality of solutions have been investigated and presented.