{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T18:59:01Z","timestamp":1775761141986,"version":"3.50.1"},"reference-count":25,"publisher":"Elsevier BV","issue":"14","license":[{"start":{"date-parts":[[2004,12,1]],"date-time":"2004-12-01T00:00:00Z","timestamp":1101859200000},"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":["Computers & Operations Research"],"published-print":{"date-parts":[[2004,12]]},"DOI":"10.1016\/s0305-0548(03)00198-9","type":"journal-article","created":{"date-parts":[[2003,9,16]],"date-time":"2003-09-16T21:31:23Z","timestamp":1063747883000},"page":"2453-2471","source":"Crossref","is-referenced-by-count":47,"title":["Hybrid genetic algorithm for optimization problems with permutation property"],"prefix":"10.1016","volume":"31","author":[{"given":"Hsiao-Fan","family":"Wang","sequence":"first","affiliation":[]},{"given":"Kuang-Yao","family":"Wu","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(03)00198-9_BIB1","series-title":"Integer and combinatorial optimization","author":"Nemhauser","year":"1988"},{"key":"10.1016\/S0305-0548(03)00198-9_BIB2","series-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"Garey","year":"1979"},{"issue":"6","key":"10.1016\/S0305-0548(03)00198-9_BIB3","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1016\/0305-0548(95)00063-1","article-title":"Comparison of genetic algorithms, random restart, and two-opt switching for solving large location\u2013allocation problems","volume":"23","author":"Houck","year":"1996","journal-title":"Computers & Operations Research"},{"key":"10.1016\/S0305-0548(03)00198-9_BIB4","unstructured":"Kirkpatrick S, Gelatt Jr CD, Vecchi MP. Optimization by simulated annealing. IBM Research Report RC 9355, 1982."},{"key":"10.1016\/S0305-0548(03)00198-9_BIB5","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF02078647","article-title":"A user's guide to tabu search","volume":"41","author":"Glover","year":"1993","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0305-0548(03)00198-9_BIB6","unstructured":"Holland JH. Adaptation in natural and artificial systems, 2nd ed. Ann Arbor: University of Michigan Press; 1975. Cambridge: MIT Press; 1992."},{"key":"10.1016\/S0305-0548(03)00198-9_BIB7","series-title":"An introduction to genetic algorithm","author":"Mitchell","year":"1996"},{"key":"10.1016\/S0305-0548(03)00198-9_BIB8","series-title":"Genetic algorithms and engineering optimization","author":"Gen","year":"1997"},{"key":"10.1016\/S0305-0548(03)00198-9_BIB9","series-title":"Modern heuristic techniques for combinatorial problems","author":"Reeves","year":"1993"},{"key":"10.1016\/S0305-0548(03)00198-9_BIB10","unstructured":"Aarts E, Lenstra JK, editors. Local search in combinatorial optimization. Chichester: Wiley; 1997."},{"key":"10.1016\/S0305-0548(03)00198-9_BIB11","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/S0377-2217(98)00308-7","article-title":"Application of the simulated annealing algorithm to the combinatorial optimization problem with permutation property","volume":"118","author":"Tian","year":"1999","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(03)00198-9_BIB12","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1111\/j.1475-3995.2000.tb00222.x","article-title":"How to keep good schemata using cross-over operators for permutation problems","volume":"7","author":"Djerid","year":"2000","journal-title":"International Transactions in Operational Research"},{"issue":"2","key":"10.1016\/S0305-0548(03)00198-9_BIB13","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1109\/3477.485836","article-title":"Hybrid methods using genetic algorithms for global optimization","volume":"26","author":"Renders","year":"1996","journal-title":"IEEE Transactions on Systems, Man and Cybernetics Part B"},{"issue":"1","key":"10.1016\/S0305-0548(03)00198-9_BIB14","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/S0305-0548(96)00032-9","article-title":"A genetic algorithm for the generalized assignment problem","volume":"24","author":"Chu","year":"1997","journal-title":"Computers & Operations Research"},{"key":"10.1016\/S0305-0548(03)00198-9_BIB15","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1016\/0377-2217(94)00301-7","article-title":"The use of dynamic programming in genetic algorithms for permutation problems","volume":"92","author":"Yagiura","year":"1996","journal-title":"European Journal of Operational Research"},{"issue":"5","key":"10.1016\/S0305-0548(03)00198-9_BIB16","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1080\/10170669.2000.10432875","article-title":"A hybrid genetic algorithm for manufacturing cell design","volume":"17","author":"Joines","year":"2000","journal-title":"Journal of Chinese Institute of Industrial Engineers"},{"key":"10.1016\/S0305-0548(03)00198-9_BIB17","doi-asserted-by":"crossref","unstructured":"Whitley D, Gordan V, Mathias K. Lamarckian evolution, the Baldwin effect and function optimization. In: Davidor et al., editors. Parallel problem solving from nature: PPSN III. Berlin: Springer-Verlag; 1994. p. 6\u201315.","DOI":"10.1007\/3-540-58484-6_245"},{"issue":"2","key":"10.1016\/S0305-0548(03)00198-9_BIB18","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1287\/ijoc.6.2.154","article-title":"Genetic algorithms and random keys for sequencing and optimization","volume":"6","author":"Bean","year":"1994","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0305-0548(03)00198-9_BIB19","unstructured":"Hansen P, Mladenovi\u0107 N. First improvement may be better than best improvement: an empirical study. Les Cahiers du GERAD G-99-40, Montr\u00e9al, Canada, 1999."},{"key":"10.1016\/S0305-0548(03)00198-9_BIB20","unstructured":"Johnson DS, Bentley JL, McGeoch LA, Rothberg EE. Near-optimal solutions to very large traveling salesman problems. Monograph 2003, to be published."},{"issue":"1","key":"10.1016\/S0305-0548(03)00198-9_BIB21","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0305-0548(93)E0024-N","article-title":"Genetic algorithm crossover operators for ordering applications","volume":"22","author":"Poon","year":"1995","journal-title":"Computers & Operations Research"},{"issue":"4","key":"10.1016\/S0305-0548(03)00198-9_BIB22","doi-asserted-by":"crossref","first-page":"1061","DOI":"10.1016\/0360-8352(96)00053-8","article-title":"Genetic algorithms for flowshop scheduling problems","volume":"30","author":"Murata","year":"1996","journal-title":"Computers & Industrial Engineering"},{"issue":"3","key":"10.1016\/S0305-0548(03)00198-9_BIB23","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1023\/A:1024645608673","article-title":"Modeling and analysis for multi-period, multi-product and multi-resource production scheduling","volume":"14","author":"Wang","year":"2003","journal-title":"Journal of Intelligent Manufacturing"},{"key":"10.1016\/S0305-0548(03)00198-9_BIB24","unstructured":"ILOG. Using the CPLEX Callable Library. ILOG CPLEX Division, 1997."},{"issue":"5","key":"10.1016\/S0305-0548(03)00198-9_BIB25","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1109\/9.580891","article-title":"On the numerical solution of stochastic optimization problem","volume":"42","author":"Ho","year":"1997","journal-title":"IEEE Transactions on Automatic Control"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054803001989?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054803001989?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T09:25:42Z","timestamp":1551000342000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054803001989"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,12]]},"references-count":25,"journal-issue":{"issue":"14","published-print":{"date-parts":[[2004,12]]}},"alternative-id":["S0305054803001989"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(03)00198-9","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2004,12]]}}}