Global optimization properties of parallel cooperative search algorithms: A simulation study

Parallel Computing

Volumn 26, Issue 1, 2000, Pages 91-112

  Toulouse, Michel ^a   Crainic, Teodor Gabriel ^b   Thulasiraman, K ^c  

^a UNIVERSITY OF MANITOBA   (Canada)

^b UNIVERSITÉ DE MONTRÉAL   (Canada)

^c University of Oklahoma   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; OPTIMIZATION;

PARALLEL COOPERATIVE SEARCH ALGORITHMS;

PARALLEL PROCESSING SYSTEMS;

EID: 0033903455     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8191(99)00097-6     Document Type: Article

References (16)

1. Bonfatti F., Gadda G., Monari P.D. Simulation of dynamic phenomena by cellular automata. Computers & Graphics. 18(6):1994;831-836.
2. Burks A.W. Essays on Cellular Automata. 1970;University of Illinois Press, Urbana.
3. Clearwater S.H., Huberman B.A., Hogg T. Cooperative solution of constraint satisfaction problems. Science. 254:1991;1181-1183.
4. Crainic T.G., Gendreau M., Soriano P., Toulouse M. A tabu search procedure for multicommodity location/allocation with balancing requirements. Annals of Operations Research. 41:1993;359-383.
5. Crainic T.G., Toulouse M., Gendreau M. Parallel asynchronous tabu search for multicommodity location-allocation with balancing requirements. Annals of Operations Research. 63:1995;277-299.
6. Gendron B., Crainic T.G. Parallel branch-and-bound algorithms: survey and synthesis. Operations Research. 42(6):1994;1042-1066.
7. Langton C.G. Studying artificial life with cellular automata. Physica D. 22:1986;120-149.
8. Laursen P.S. Problem-independent parallel simulated annealing using selection and migration. Lecture Notes in Computer Science. 866:1994;408-417.
9. Manderick B., Spiessens P. Fine-grained parallel genetic algorithm. Schaffer J. Proceedings of the Third International Conference on Genetic Algorithms. 1989;416-421 Morgan Kaufmann Publishers, Los Altos.
10. Moscato P., Norman M.G. A 'memetic' approach for the traveling salesman problem. Implementation of a Computational ecology for combinatorial optimization on message-passing systems. Valero M., Onate E., Jane M., Larriba J.L., Suarez B. Parallel Computing and Transputer Applications. 1992;187-194 IOS Press, Amsterdam.
11. Pettey C., Leuze M., Grefenstette J. A parallel genetic algorithm. Grefenstette J.J. Proceedings of the Second International Conference on Genetic Algorithms and their Applications. 1987;155-161 Lawrence Erlbaum Associates Publishers, London.
12. J.P. Rosca, Entropy-based adaptative representation. Report TR-NRL02. University of Rochester, Rochester, NY, 1995.
13. M. Toulouse, T.G. Crainic, B. Sansó, Systemic behavior of cooperative search algorithms, Publication CRT-97-55, Centre de recherche sur les transports, Université Montréal, Montréal, QC, Canada, 1997.
14. M. Toulouse, K. Thulasiraman, G. Glover, A multi-scale cooperative search with an application to graph partitioning. School of Computer Science, University of Oklahoma, Norman, OK, 1998.
15. Vichniac G.Y. Simulating physics with cellular automata. Physica D. 10:1984;96-116.
16. Wolfram S. Computation theory of cellular automata. Communications in Mathematical Physics. 96:1984;15-57.