{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:18:20Z","timestamp":1759666700777},"reference-count":30,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Future Generation Computer Systems"],"published-print":{"date-parts":[[2001,1]]},"DOI":"10.1016\/s0167-739x(99)00134-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T09:47:41Z","timestamp":1027590461000},"page":"477-488","source":"Crossref","is-referenced-by-count":39,"title":["Implementation of a parallel Genetic Algorithm on a cluster of workstations: Traveling Salesman Problem, a case study"],"prefix":"10.1016","volume":"17","author":[{"given":"Giuseppe A.","family":"Sena","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dalila","family":"Megherbi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Germinal","family":"Isern","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-739X(99)00134-X_BIB1","doi-asserted-by":"crossref","unstructured":"T.E. Anderson, D.E. Culler, D.A. Patterson, and the NoW team, A case of NoW (Networks of Workstations), IEEE Micro 15 (1) (1995) 54\u201364.","DOI":"10.1109\/40.342018"},{"key":"10.1016\/S0167-739X(99)00134-X_BIB2","unstructured":"Douglas E. Comer, Internetworking with TCP\/IP: Principles, Protocols and Architecture, vol. I, 3rd ed., Prentice-Hall, Englewood Cliffs, NJ, 1995."},{"key":"10.1016\/S0167-739X(99)00134-X_BIB3","unstructured":"T.H. Cormen, C.E. Leiserson, R.L. Rivest, Introduction to Algorithms, The MIT Press, Cambridge, MA, and McGraw-Hill, New York, 1990."},{"key":"10.1016\/S0167-739X(99)00134-X_BIB4","unstructured":"L. Davis (Ed.), Handbook of GA, Van Nostrand Reinhold, New York, 1991."},{"key":"10.1016\/S0167-739X(99)00134-X_BIB5","unstructured":"K. DeJong, An analysis of the behavior of a class of genetic adaptive systems, Ph.D. Thesis, University of Michigan, Ann Arbor, MI, 1975."},{"key":"10.1016\/S0167-739X(99)00134-X_BIB6","doi-asserted-by":"crossref","first-page":"689","DOI":"10.1038\/326689a0","article-title":"An analogue approach to the Traveling Salesman Problem using Elastic Net Method","volume":"326","author":"Durbin","year":"1987","journal-title":"Nature"},{"key":"10.1016\/S0167-739X(99)00134-X_BIB7","doi-asserted-by":"crossref","unstructured":"B.R. Fox, M.B. McMahon, Genetic operators for sequencing problems, in: G.J.E. Rawlins (Ed.), Foundations of Genetic Algorithms, Morgan\u2013Kaufmann Publishers, San Mateo, CA, 1991, pp. 284\u2013300.","DOI":"10.1016\/B978-0-08-050684-5.50021-5"},{"key":"10.1016\/S0167-739X(99)00134-X_BIB8","unstructured":"M.R. Garey, D.S. Johnson, Computers and Interactability: A Guide to the Theory of NP-completeness, Freeman, New York, 1979."},{"key":"10.1016\/S0167-739X(99)00134-X_BIB9","doi-asserted-by":"crossref","unstructured":"A. Geist, A. Beguellin, J. Dongarra, et al., PVM: Parallel Virtual Machine, An User\u2019s Guide and Tutorial for Net. Parallel Comput., The MIT Press, Cambridge, MA, 1994.","DOI":"10.7551\/mitpress\/5712.001.0001"},{"key":"10.1016\/S0167-739X(99)00134-X_BIB10","unstructured":"D.E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley, Reading, MA, 1989."},{"key":"10.1016\/S0167-739X(99)00134-X_BIB11","doi-asserted-by":"crossref","unstructured":"M. Gorges-Schleuter, Explicit parallelism of Genetic Algorithms through population structures, Parallel Problem Solving from Nature, 1991, pp. 150\u2013159.","DOI":"10.1007\/BFb0029746"},{"key":"10.1016\/S0167-739X(99)00134-X_BIB12","unstructured":"J. Holland, Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Arbor, MI, 1975."},{"key":"10.1016\/S0167-739X(99)00134-X_BIB13","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","article-title":"Optimization by simulated annealing","volume":"220","author":"Kirkpatrick","year":"1983","journal-title":"Science"},{"key":"10.1016\/S0167-739X(99)00134-X_BIB14","unstructured":"J.A. Kohl, G.A. Geist, XPVM: 1.0 User\u2019s Guide, Technical report, Oak Ridge National Laboratory, November 1996."},{"key":"10.1016\/S0167-739X(99)00134-X_BIB15","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/opre.21.2.498","article-title":"An effective heuristic Algorithm for the Traveling Salesman Problem","volume":"21","author":"Lin","year":"1973","journal-title":"Operations Research"},{"key":"10.1016\/S0167-739X(99)00134-X_BIB16","doi-asserted-by":"crossref","unstructured":"Z. Michalewicz, Genetic Algorithms+Data Structures=Evolutionary Programs, Springer, Berlin, 1993.","DOI":"10.1007\/978-3-662-02830-8"},{"key":"10.1016\/S0167-739X(99)00134-X_BIB17","unstructured":"T.M. Mitchell, Machine Learning, Series in CS, McGraw-Hill, New York, 1997."},{"key":"10.1016\/S0167-739X(99)00134-X_BIB18","doi-asserted-by":"crossref","unstructured":"H. M\u00fchlenbein, Evolution in Times and Space \u2014 The Parallel Genetic Algorithm, in: G.J.E. Rawlins (Ed.), Foundations of Genetic Algorithms, Morgan\u2013Kaufmann Publishers, San Mateo, CA, 1991, pp. 317\u2013337.","DOI":"10.1016\/B978-0-08-050684-5.50023-9"},{"key":"10.1016\/S0167-739X(99)00134-X_BIB19","unstructured":"S. Rana, A.E. Howe, D. Whitley, K. Mathias, Comparing heuristic, evolutionary and local search approaches to scheduling, in: Proceedings of the Third Artificial Intelligence Planning Systems Conference, 1996."},{"key":"10.1016\/S0167-739X(99)00134-X_BIB20","unstructured":"G.J.E. Rawlins (Ed.), Foundations of Genetic Algorithms, Morgan\u2013Kaufmann Publishers, San Mateo, CA, 1991."},{"key":"10.1016\/S0167-739X(99)00134-X_BIB21","unstructured":"G. Richard, Tim Appenzellel, Complex Systems, Sci. Mag. (1999) 79\u2013109."},{"key":"10.1016\/S0167-739X(99)00134-X_BIB22","doi-asserted-by":"crossref","unstructured":"T. Starkweather, D. Whitley, K. Mathias, Optimization using distributed Genetic Algorithms, Parallel Problem Solving from Nature, 1991.","DOI":"10.1007\/BFb0029750"},{"key":"10.1016\/S0167-739X(99)00134-X_BIB23","unstructured":"W.R. Stevens, UNIX Network Programming, Prentice-Hall Software Series, Prentice-Hall, Englewood Cliffs, NJ, 1990."},{"key":"10.1016\/S0167-739X(99)00134-X_BIB24","unstructured":"R. Tanese, Distributed Genetic Algorithms, in: Proceedings of the Third International Conference on Genetic Algorithms, Morgan\u2013Kaufmann Publishers, 1989, pp. 434\u2013439."},{"key":"10.1016\/S0167-739X(99)00134-X_BIB25","unstructured":"G. Telfar, Generally applicable heuristics for global optimization: An investigation of Algorithm performance for the Euclidean Traveling Salesman Problem, M.Sc. Thesis, Victoria University of Wellington, New Zealand, October 1994."},{"key":"10.1016\/S0167-739X(99)00134-X_BIB26","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/BF00175354","article-title":"A Genetic Algorithm Tutorial","volume":"4","author":"Whitley","year":"1994","journal-title":"Statist. Comput."},{"key":"10.1016\/S0167-739X(99)00134-X_BIB27","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1080\/09528139008953723","article-title":"Genitor II: a distributed Genetic Algorithm","volume":"2","author":"Whitley","year":"1990","journal-title":"J. Expt. Theory Artificial Intelligence"},{"key":"10.1016\/S0167-739X(99)00134-X_BIB28","unstructured":"D. Whitley, T. Starkweather, D. Shaner, The Travelling Salesman and Sequence Scheduling: Quality Solutions Using Genetic Edge Recombination, in: L. Davis (Ed.), Handbook of GA, Van Nostrand Reinhold, New York, 1991, pp. 350\u2013372 (Chapter 22)."},{"key":"10.1016\/S0167-739X(99)00134-X_BIB29","doi-asserted-by":"crossref","first-page":"1683","DOI":"10.1103\/PhysRevLett.75.1683","article-title":"New method of solving the TSP based on real space normalization theory","volume":"75","author":"Yoshiyuki","year":"1995","journal-title":"Phys. Rev. Lett."},{"key":"10.1016\/S0167-739X(99)00134-X_BIB30","unstructured":"M. Zbigniew, Genetic Algorithms+Data Structure=Evolution Programs, Springer, New York, 1994."}],"container-title":["Future Generation Computer Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167739X9900134X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167739X9900134X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,7]],"date-time":"2020-01-07T23:44:25Z","timestamp":1578440665000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167739X9900134X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,1]]},"references-count":30,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2001,1]]}},"alternative-id":["S0167739X9900134X"],"URL":"https:\/\/doi.org\/10.1016\/s0167-739x(99)00134-x","relation":{},"ISSN":["0167-739X"],"issn-type":[{"value":"0167-739X","type":"print"}],"subject":[],"published":{"date-parts":[[2001,1]]}}}