{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T18:10:46Z","timestamp":1771006246865,"version":"3.50.1"},"reference-count":58,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2000,11,1]],"date-time":"2000-11-01T00:00:00Z","timestamp":973036800000},"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":["European Journal of Operational Research"],"published-print":{"date-parts":[[2000,11]]},"DOI":"10.1016\/s0377-2217(99)00329-x","type":"journal-article","created":{"date-parts":[[2003,4,5]],"date-time":"2003-04-05T00:21:01Z","timestamp":1049502061000},"page":"140-158","source":"Crossref","is-referenced-by-count":25,"title":["Digital data networks design using genetic algorithms"],"prefix":"10.1016","volume":"127","author":[{"given":"Chao-Hsien","family":"Chu","sequence":"first","affiliation":[]},{"given":"G.","family":"Premkumar","sequence":"additional","affiliation":[]},{"given":"Hsinghua","family":"Chou","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(99)00329-X_BIB1","first-page":"101","article-title":"The design of a multipoint line topology for a communication network using genetic algorithms","author":"Abuali","year":"1993","journal-title":"Proceedings of the Seventh Oklahoma Conference on Artificial BL Intelligence"},{"key":"10.1016\/S0377-2217(99)00329-X_BIB2","first-page":"470","article-title":"Determinant factorization: A new encoding scheme for spanning trees applied to the probabilistic minimum spanning tree problem","author":"Abuali","year":"1995","journal-title":"Proceedings of the Sixth International Conference on Genetic Algorithms"},{"key":"10.1016\/S0377-2217(99)00329-X_BIB3","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1287\/opre.45.2.226","article-title":"Optimized crossover for the independent set problem","volume":"45","author":"Aggarwal","year":"1997","journal-title":"Operations Research"},{"issue":"5","key":"10.1016\/S0377-2217(99)00329-X_BIB4","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1287\/ijoc.9.3.251","article-title":"Developing fitter genetic algorithms","volume":"9","author":"Ahuja","year":"1997","journal-title":"INFORMS Journal of Computing"},{"key":"10.1016\/S0377-2217(99)00329-X_BIB5","unstructured":"Ahuja, R.K., Magnauti, T.L., Orlin, J.B., 1993. Network Flows: Theory Algorithms Applications. Prentice-Hall, Englewood Cliffs, NJ"},{"key":"10.1016\/S0377-2217(99)00329-X_BIB6","first-page":"301","article-title":"Path assignment for call routing: An application of Tabu search","volume":"43","author":"Anderson","year":"1993","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(99)00329-X_BIB7","first-page":"92","article-title":"Extended selection mechanism in genetic algorithms","author":"Back","year":"1991","journal-title":"Proceedings of the Fourth International Conference on Genetic Algorithms"},{"key":"10.1016\/S0377-2217(99)00329-X_BIB8","doi-asserted-by":"crossref","unstructured":"Back, T., Fogel, D., Michalawecz, Z. (Eds.), 1997. Handbook of Evolutionary Computation. Oxford University Press, Oxford","DOI":"10.1887\/0750308958"},{"key":"10.1016\/S0377-2217(99)00329-X_BIB9","unstructured":"Beasley, J.E., 1990. OR Library, Imperial College, UK. URL: mscmga.ms.ic.ac.uk\/info.html"},{"issue":"2","key":"10.1016\/S0377-2217(99)00329-X_BIB10","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1002\/(SICI)1097-0037(199703)29:2<81::AID-NET2>3.0.CO;2-7","article-title":"Efficient path and vertex exchange in Steiner tree algorithms","volume":"29","author":"Chang","year":"1997","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(99)00329-X_BIB11","first-page":"290","article-title":"Applications of genetic algorithms in telecommunications","author":"Charddaire","year":"1995","journal-title":"Proceedings of the Second International Workshop on Applications of Neural Networks to Telecommunications"},{"key":"10.1016\/S0377-2217(99)00329-X_BIB12","unstructured":"Chopra, S., Rao, M.R., 1989. On the Steiner tree problem I & II. Working Paper, New York University"},{"key":"10.1016\/S0377-2217(99)00329-X_BIB13","unstructured":"Coombs, S., Davis, L., 1987. Genetic algorithms and communication link speed design: Constraints and operators. In: Grefenstette, J.J. (Ed.), Proceedings of the Second International Conference on Genetic Algorithms and their Applications, pp. 257\u2013260"},{"key":"10.1016\/S0377-2217(99)00329-X_BIB14","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1002\/ett.4460050219","article-title":"A genetic algorithm for channel assignment problems","author":"Cuppinim","year":"1994","journal-title":"European Transactions on Telecommunications Related Technologies"},{"key":"10.1016\/S0377-2217(99)00329-X_BIB15","first-page":"317","article-title":"Optimizing network link sizes with genetic algorithms","author":"Davis","year":"1989","journal-title":"Modeling and Simulation Methodology"},{"issue":"4","key":"10.1016\/S0377-2217(99)00329-X_BIB16","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1002\/net.3230260403","article-title":"Computing near-optimal solutions to the Steiner problem in a graph using genetic algorithm","volume":"26","author":"Esbensen","year":"1985","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(99)00329-X_BIB17","doi-asserted-by":"crossref","unstructured":"Gen, M., Cheng, R., 1997. Genetic Algorithms and Engineering Design. Wiley, New York, 1997","DOI":"10.1002\/9780470172254"},{"key":"10.1016\/S0377-2217(99)00329-X_BIB18","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","article-title":"Tabu search \u2013 part I","volume":"3","author":"Glover","year":"1989","journal-title":"ORSA Journal of Computing"},{"key":"10.1016\/S0377-2217(99)00329-X_BIB19","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF00175357","article-title":"Genetic algorithms and scatter search: Unsuspected potentials","volume":"4","author":"Glover","year":"1994","journal-title":"Statistics and Computing"},{"key":"10.1016\/S0377-2217(99)00329-X_BIB20","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/BF02073940","article-title":"Least cost network topology design for a new service: An application of Tabu search","volume":"33","author":"Glover","year":"1991","journal-title":"Annals of Operations Research"},{"issue":"1","key":"10.1016\/S0377-2217(99)00329-X_BIB21","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0305-0548(93)E0023-M","article-title":"Genetic algorithms and Tabu search","volume":"22","author":"Glover","year":"1995","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(99)00329-X_BIB22","unstructured":"Glover, F., Laguna, M., 1993. Tabu search. In: Reeves, C. (Ed.), Modern Heuristic Techniques for Combinatorial Problems, Basil Blackwell, Oxford"},{"key":"10.1016\/S0377-2217(99)00329-X_BIB23","doi-asserted-by":"crossref","unstructured":"Glover, F., Laguna, M., 1997. Tabu Search. Kluwer Academic Publishers, Boston, MA","DOI":"10.1007\/978-1-4615-6089-0"},{"key":"10.1016\/S0377-2217(99)00329-X_BIB24","unstructured":"Goldberg, D.E., 1989. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading, MA"},{"key":"10.1016\/S0377-2217(99)00329-X_BIB25","unstructured":"Hansen, P., 1986. The steepest ascent mildest descent heuristic for combinatorial programming. Numerical Methods in Combinatorial Optimization, Capri, Italy"},{"key":"10.1016\/S0377-2217(99)00329-X_BIB26","unstructured":"Hertz, A., Taillard, E., de Werra, D., 1996. Tabu Search, Local Search in Combinatorial Optimization. Wiley, Chichester"},{"key":"10.1016\/S0377-2217(99)00329-X_BIB27","first-page":"231","article-title":"Optimization of Steiner trees using genetic algorithms","author":"Hesser","year":"1989","journal-title":"Proceedings of the Third International Conference on Genetic Algorithms"},{"key":"10.1016\/S0377-2217(99)00329-X_BIB28","unstructured":"Holland, J., 1975. Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor, MI"},{"key":"10.1016\/S0377-2217(99)00329-X_BIB29","first-page":"258","article-title":"A genetic algorithm for the minimum broadcast time problem using a global precedence vector","author":"Hoelting","year":"1996","journal-title":"Proceedings of the ACM Symposium on Applied Computing"},{"key":"10.1016\/S0377-2217(99)00329-X_BIB30","first-page":"59","article-title":"The Steiner tree problem","volume":"53","author":"Hwang","year":"1992","journal-title":"Annals of Discrete Mathematics"},{"issue":"4","key":"10.1016\/S0377-2217(99)00329-X_BIB31","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1057\/jors.1993.69","article-title":"Solving the graphical Steiner tree problem using genetic algorithms","volume":"44","author":"Kapsalis","year":"1993","journal-title":"Journal of the Operations Research Society"},{"key":"10.1016\/S0377-2217(99)00329-X_BIB32","doi-asserted-by":"crossref","unstructured":"Karunanithi, N., Carpenter, T., 1993. A ring loading application of genetic algorithms. Technical Report TM-ARH-023337, Bellcore, Bell Communication Research, Red Bank, NJ","DOI":"10.1145\/326619.326729"},{"issue":"3","key":"10.1016\/S0377-2217(99)00329-X_BIB33","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1287\/ijoc.9.3.254","article-title":"When genetic algorithms work best","volume":"9","author":"Kershenbaum","year":"1997","journal-title":"INFORMS Journal of Computing"},{"key":"10.1016\/S0377-2217(99)00329-X_BIB34","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","article-title":"On the shortest spanning subtree of a graph and the traveling salesman problem","volume":"7","author":"Kruskal","year":"1956","journal-title":"Proceedings of the American Mathematical Society"},{"key":"10.1016\/S0377-2217(99)00329-X_BIB35","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0020-0190(94)00024-7","article-title":"Optimal network partitioning for fault-tolerant network management using evolutionary programming","volume":"25","author":"Kumar","year":"1994","journal-title":"Information Processing Letters"},{"issue":"4","key":"10.1016\/S0377-2217(99)00329-X_BIB36","doi-asserted-by":"crossref","first-page":"492","DOI":"10.1287\/mnsc.39.4.492","article-title":"Bandwidth packing: A Tabu search approach","volume":"39","author":"Laguna","year":"1993","journal-title":"Management Science"},{"issue":"3","key":"10.1016\/S0377-2217(99)00329-X_BIB37","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1287\/ijoc.8.3.194","article-title":"A branch and cut algorithm for Steiner tree-star problem","volume":"8","author":"Lee","year":"1996","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/S0377-2217(99)00329-X_BIB38","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/BF02109861","article-title":"Strong formulations and cutting planes for designing digital data networks","volume":"2","author":"Lee","year":"1994","journal-title":"Telecommunication Systems"},{"key":"10.1016\/S0377-2217(99)00329-X_BIB39","first-page":"492","article-title":"Genetic channel router","volume":"3","author":"Liu","year":"1994","journal-title":"IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences"},{"key":"10.1016\/S0377-2217(99)00329-X_BIB40","first-page":"8","article-title":"The routing problem in traffic control using genetic algorithms","author":"Marin","year":"1994","journal-title":"Proceedings of the Second IFAC Symposium on Intelligent Components and Instruments for Control Application"},{"key":"10.1016\/S0377-2217(99)00329-X_BIB41","doi-asserted-by":"crossref","unstructured":"Michalawecz, Z., 1992. Genetic Algorithms+Data Structures=Evolution Programs. Springer, Berlin","DOI":"10.1007\/978-3-662-02830-8"},{"key":"10.1016\/S0377-2217(99)00329-X_BIB42","first-page":"241","article-title":"Tracking statistics in communication traffic control using a genetic algorithm","author":"Murgu","year":"1995","journal-title":"Proceedings of the First Nordic Workshop on Genetic Algorithms and Their Applications"},{"key":"10.1016\/S0377-2217(99)00329-X_BIB43","first-page":"1341","article-title":"Concentrator location-problems using genetic algorithms","volume":"3","author":"Oyman","year":"1994","journal-title":"Proceedings of the Seventh Mediterranean Electrotechnical Conference"},{"issue":"3","key":"10.1016\/S0377-2217(99)00329-X_BIB44","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1002\/net.3230260305","article-title":"An approach to a problem in network design using genetic algorithms","volume":"26","author":"Palmer","year":"1995","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(99)00329-X_BIB45","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","article-title":"Shortest connection networks and some generalizations","volume":"36","author":"Prim","year":"1957","journal-title":"Bell System Technical Journal"},{"key":"10.1016\/S0377-2217(99)00329-X_BIB46","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1002\/(SICI)1097-0037(199705)29:3<161::AID-NET4>3.0.CO;2-F","article-title":"A Tabu search algorithm for the capacitated shortest spanning tree problem","volume":"29","author":"Sharaiha","year":"1997","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(99)00329-X_BIB47","doi-asserted-by":"crossref","first-page":"1123","DOI":"10.1109\/ICNN.1993.298715","article-title":"Dynamic routing control based on a genetic algorithm","author":"Shimamoto","year":"1993","journal-title":"Proceedings of IEEE International Conference on Neural Networks"},{"key":"10.1016\/S0377-2217(99)00329-X_BIB48","first-page":"2","article-title":"The application of a genetic algorithm to trunk network routing table optimization","author":"Sinclair","year":"1993","journal-title":"Proceedings of the Tenth UK Teletraffic Symposium"},{"key":"10.1016\/S0377-2217(99)00329-X_BIB49","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1287\/ijoc.2.1.33","article-title":"Tabu search applied to the quadratic assignment problem","volume":"2","author":"Skorin-Kapov","year":"1990","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0377-2217(99)00329-X_BIB50","doi-asserted-by":"crossref","first-page":"502","DOI":"10.1016\/0377-2217(94)90245-3","article-title":"On Tabu search for the location of interacting hub facilities","volume":"73","author":"Skorin-Kapov","year":"1994","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"10.1016\/S0377-2217(99)00329-X_BIB51","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1002\/net.3230110104","article-title":"An O(n log n) Heuristic for Steiner minimal tree problems on the Euclidean metric","volume":"11","author":"Smith","year":"1981","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(99)00329-X_BIB52","doi-asserted-by":"crossref","first-page":"1895","DOI":"10.1049\/el:19951305","article-title":"Determination of minimum number of wavelength required for all-optical WDM networks using graph coloring","author":"Tan","year":"1995","journal-title":"Electronic Letters"},{"key":"10.1016\/S0377-2217(99)00329-X_BIB53","unstructured":"UEA CALMA Group, 1994. Genetic algorithms approaches to solving the radio link frequency assignment problem. Technical Report 56, University of East Anglia, Norwich"},{"issue":"2","key":"10.1016\/S0377-2217(99)00329-X_BIB54","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1002\/net.3230170203","article-title":"Steiner problem in networks: A survey","volume":"17","author":"Winter","year":"1987","journal-title":"Networks"},{"issue":"3","key":"10.1016\/S0377-2217(99)00329-X_BIB55","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1002\/(SICI)1097-0037(199710)30:3<149::AID-NET1>3.0.CO;2-L","article-title":"Euclidean Steiner minimum trees: an improved exact algorithm","volume":"30","author":"Winter","year":"1997","journal-title":"Networks"},{"issue":"2","key":"10.1016\/S0377-2217(99)00329-X_BIB56","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/BF02114289","article-title":"Using Tabu search to solve the Steiner tree-star problem in telecommunication networks design","volume":"6","author":"Xu","year":"1996","journal-title":"Telecommunication Systems"},{"key":"10.1016\/S0377-2217(99)00329-X_BIB57","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0020-0190(93)90201-J","article-title":"A faster approximation algorithm for the Steiner tree problem in graph","volume":"46","author":"Zelikovsky","year":"1993","journal-title":"Information Processing Letters"},{"issue":"2","key":"10.1016\/S0377-2217(99)00329-X_BIB58","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1002\/(SICI)1097-0037(199709)30:2<91::AID-NET3>3.0.CO;2-F","article-title":"A note in genetic algorithms for degree constrained spanning tree problems","volume":"30","author":"Zhou","year":"1996","journal-title":"Networks"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S037722179900329X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S037722179900329X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,12,31]],"date-time":"2023-12-31T11:42:52Z","timestamp":1704022972000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S037722179900329X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,11]]},"references-count":58,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2000,11]]}},"alternative-id":["S037722179900329X"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(99)00329-x","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2000,11]]}}}