{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T22:13:40Z","timestamp":1773699220454,"version":"3.50.1"},"reference-count":27,"publisher":"Computers, Materials and Continua (Tech Science Press)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Intelligent Automation & Soft Computing"],"published-print":{"date-parts":[[2005,1]]},"DOI":"10.1080\/10798587.2005.10642906","type":"journal-article","created":{"date-parts":[[2013,3,2]],"date-time":"2013-03-02T07:53:09Z","timestamp":1362210789000},"page":"217-234","source":"Crossref","is-referenced-by-count":16,"title":["A Study of Five Parallel Approaches to a Genetic Algorithm for the Traveling Salesman Problem"],"prefix":"10.32604","volume":"11","author":[{"given":"L.","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. A.","family":"Maciejewski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H. J.","family":"Siegel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V. P.","family":"Roychowdhury","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B. D.","family":"Eldridge","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"17807","reference":[{"key":"CIT0002","doi-asserted-by":"crossref","unstructured":"J. T. Alander,An Indexed Bibliography of Distributed Genetic Algorithms, Technical Report No. 941-PARR, Department of Information Technology and Production Economics, University of Vaasa, Finland, 1997.","DOI":"10.1007\/978-1-4615-6135-4_13"},{"key":"CIT0003","unstructured":"A. Chipperfield and P. Fleming, \u201cParallel genetic algorithms,\u201d inHandbook of Parallel and Distributed Computing, A Y. Zomaya, Ed. New York, NY: McGraw-Hill, pp. 1118\u20131143, 1996."},{"key":"CIT0004","unstructured":"M. Gorges-Schleuter, \u201cASPARAGOS: An asynchronous parallel genetic optimization strategy,\u201d3rd Int\u2019l Conf. Genetic Algorithms, pp. 422\u2013427, 1989."},{"key":"CIT0008","unstructured":"H. Muhlenbein, \u201cParallel genetic algorithms, population, genetics and combinatorial optimization,\u201dThird Int\u2019l Conf. Genetic Algorithms, pp. 416\u2013421, 1989."},{"key":"CIT0010","unstructured":"C. C. Pettey, M. Leuze, and J. Grefenstette, \u201cA parallel genetic algorithm,\u201dSecond Int\u2019l Conf. Genetic Algorithms, pp. 155\u2013164, 1987."},{"key":"CIT0011","doi-asserted-by":"crossref","unstructured":"T. Starkweather, D. Whitley, and K. Mathias, \u201cOptimization using distributed genetic algorithms,\u201din Parallel Problem Solving from Nature, H. P. Schwefel and R. Manner, Eds. New York, NY: Springer-Verlag, pp. 176\u2013183, 1992.","DOI":"10.1007\/BFb0029750"},{"key":"CIT0012","unstructured":"R. Tanese, \u201cParallel genetic algorithm for a hypercube,\u201dSecond Int\u2019l Conf. Genetic Algorithms, pp. 177\u2013183, 1987."},{"key":"CIT0013","unstructured":"R. Tanese, \u201cDistributed genetic algorithms,\u201d3rd Int\u2019l Conf. Genetic Algorithms, pp. 434\u2013439, 1989."},{"key":"CIT0017","unstructured":"E. L. Lawler, J. K. Lenstra, and D. B. Shmoys,The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. New York, NY: Wiley-Interscience, 1985."},{"key":"CIT0021","unstructured":"W. Gropp, E. Lusk, and A. Skjellum,Using MPI: Portable Parallel Programming with the Message-Passing Interface. Cambridge, MA: The MIT Press, 1994."},{"key":"CIT0022","unstructured":"M. Snir, S. Otto, S. Huss-Lederman, D. Walker, and J. Dongarra,MPI: The Complete Reference. Cambridge, MA: The MIT Press, 1996."},{"key":"CIT0024","doi-asserted-by":"crossref","unstructured":"J. Dzubera and D. Whitley, \u201cAdvanced correlation analysis of operators for the traveling salesman problem,\u201d inParallel Problem Solving from Nature -PPSNIII, H. P. Schwefel and R. Manner, Eds. New York, NY: Springer-Verlag, pp. 68\u201377, 1994.","DOI":"10.1007\/3-540-58484-6_251"},{"key":"CIT0025","doi-asserted-by":"crossref","unstructured":"B. Freisleben and P. Mertz, \u201cNew genetic local search operators for the traveling salesman problem,\u201d inParallel Problem Solving from Nature - PPSN IV, H. P. Schwefel and R. Manner, Eds. New York, NY: Springer-Verlag, pp. 890\u2013899, 1996.","DOI":"10.1007\/3-540-61723-X_1052"},{"key":"CIT0026","unstructured":"D. E. Goldberg and R. Lingle, \u201cAlleles, loci, and the traveling salesman problem,\u201d1st Int\u2019l Conf. Genetic Algorithms, pp. 154\u2013159, 1985."},{"key":"CIT0027","unstructured":"D. E. Goldberg,Genetic Algorithms in Search, Optimization and Machine Learning. Reading MA: Addison-Wesley, 1989."},{"key":"CIT0028","unstructured":"J. J. Grefenstette, \u201cIncorporating problem specific knowledge into genetic algorithms,\u201d inGenetic Algorithms and Simulated Annealing, L. Davis, Ed. Los Altos, CA: Morgan Kaufmann, 1987."},{"key":"CIT0029","unstructured":"J. J. Grefenstette, R. Gopal, B. J. Rosmaita, and D. Van Gucht, \u201cGenetic algorithms for the traveling salesman problem,\u201d1st Int\u2019l Conf. Genetic Algorithms, pp. 160\u2013168, 1985."},{"key":"CIT0030","unstructured":"P. Jog, J. Y. Suh, and D. Van Gucht, \u201cThe effects of population size, heuristic crossover and local improvement on a genetic algorithm for the traveling salesman problem,\u201d3rd Int\u2019l Conf. Genetic Algorithms, pp. 110\u2013115, 1989."},{"key":"CIT0031","unstructured":"G. Liepins and H. Hilliard, \u201cGreedy genetics,\u201d2nd Int\u2019l Conf. Genetic Algorithms, pp. 90\u201399, 1987."},{"key":"CIT0033","unstructured":"I. Oliver, D. Smith, and J. Holland, \u201cA study of permutation crossover operators on the traveling salesman problem,\u201d2nd Int\u2019l Conf. Genetic Algorithms, pp. 224\u2013230, 1987."},{"key":"CIT0034","unstructured":"D. Sirag and P. Weisser, \u201cToward a unified thermodynamic genetic operator,\u201d2nd Int\u2019l Conf. Genetic Algorithms, pp. 100\u2013107, 1987."},{"key":"CIT0035","doi-asserted-by":"crossref","unstructured":"A. Y-C. Tang and K-S Leung, \u201cA modified edge recombination operator for the traveling salesman problem,\u201d inParallel Problem Solving from Nature -PPSN III, H. P. Schwefel and R. Manner, Eds. New York, NY: Springer-Verlag, pp. 180\u2013188, 1994.","DOI":"10.1007\/3-540-58484-6_262"},{"key":"CIT0036","unstructured":"P. Moscato and M. G. Norman, \u201cA memetic approach for the traveling salesman problem: Implementation of a computational ecology for combinatorial optimization on message-passing systems,\u201dParallel Computing and Transputer Applications, M. Valero, E. Onate, M. Jane, J.L. Larriba and B. Suarez, Ed. Amsterdam: IOS Press, pp. 187\u2013194, 1992."},{"key":"CIT0037","doi-asserted-by":"crossref","unstructured":"N. J. Radcliffe and P. D. Sorry, \u201cFormal Memetic Algorithms,\u201dSelected Papers from AISB Workshop on Evolutionary Computing, London: Springer-Verlag, pp. 1\u201316, 1994.","DOI":"10.1007\/3-540-58483-8_1"},{"key":"CIT0039","doi-asserted-by":"crossref","unstructured":"L. Wang,A Genetic Algorithm-Based Approach for Task Matching and Scheduling in Heterogeneous Computing Environments and a Comparative Study on Parallel Genetic Algorithms, Ph.D. Thesis, School of Electrical and Computer Engineering, Purdue University, 1997.","DOI":"10.1006\/jpdc.1997.1392"},{"key":"CIT0040","unstructured":"H. J. Siegel, L. Wang, J. J. E. So, and M. Maheswaran, \u201cData parallel algorithms,\u201d inHandbook of Parallel and Distributed Computing, A Y. Zomaya, Ed. New York, NY: McGraw-Hill, pp. 466\u2013499, 1996."},{"key":"CIT0041","unstructured":"A M. Law and W. D. Kelton,Simulation Modeling and Analysis. New York, NY: McGraw-Hill, 1982."}],"container-title":["Intelligent Automation & Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/autosoftjournal.net\/viewPaper.php?paper=10642906","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,3]],"date-time":"2020-06-03T13:08:40Z","timestamp":1591189720000},"score":1,"resource":{"primary":{"URL":"http:\/\/autosoftjournal.net\/paperShow.php?paper=10642906"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,1]]},"references-count":27,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2005,1]]}},"alternative-id":["10.1080\/10798587.2005.10642906"],"URL":"https:\/\/doi.org\/10.1080\/10798587.2005.10642906","relation":{},"ISSN":["1079-8587","2326-005X"],"issn-type":[{"value":"1079-8587","type":"print"},{"value":"2326-005X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,1]]}}}