Parallel computing for modified local search

Authors:
Jan Panuš
Affiliations:
Institute of System Engineering and Informatics, Faculty of economics and administration, University of Pardubice, Pardubice, Czech republic
Venue:
ACS'10 Proceedings of the 10th WSEAS international conference on Applied computer science
Year:
2010

Citing 5
Cited 1

Simulated annealing and Boltzmann machines: a stochastic approach to combinatorial optimization and neural computing

Simulated annealing and Boltzmann machines: a stochastic approach to combinatorial optimization and neural computing
Variable neighborhood search

Computers and Operations Research
Measurability of evaluative criteria used by optimization methods

MATH'06 Proceedings of the 10th WSEAS International Conference on APPLIED MATHEMATICS
Information system classification

ISTASC'08 Proceedings of the 8th conference on Systems theory and scientific computation
Advanced technologies in e-tourism

ACS'09 Proceedings of the 9th WSEAS international conference on Applied computer science

Multi-agent simulations in decision support: specifics of the biological incident management

MCBANTA'11 Proceedings of the 12th WSEAS international conference on Mathematics and computers in biology, business and acoustics

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper deals with using modified type of local search algorithm for optimizing some testing functions and one type of graph methods - travelling salesman problem. The effect of modifying of chosen algorithm is shown on travelling salesman problem and on some testing functions. We will try to modify this algorithm by using principles of parallel computing.