{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T22:47:31Z","timestamp":1759963651767},"reference-count":52,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,8,1]],"date-time":"2003-08-01T00:00:00Z","timestamp":1059696000000},"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":[[2003,8]]},"DOI":"10.1016\/s0377-2217(02)00484-8","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:55:41Z","timestamp":1052783741000},"page":"77-101","source":"Crossref","is-referenced-by-count":12,"title":["A genetic-based framework for solving (multi-criteria) weighted matching problems"],"prefix":"10.1016","volume":"149","author":[{"given":"Andr\u00e9s L.","family":"Medaglia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shu-Cherng","family":"Fang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(02)00484-8_BIB1","first-page":"90","article-title":"Solving large-scale matching problems","volume":"vol. 12","author":"Applegate","year":"1993"},{"key":"10.1016\/S0377-2217(02)00484-8_BIB2","series-title":"Evolutionary Algorithms in Theory and Practice","author":"B\u00e4ck","year":"1996"},{"key":"10.1016\/S0377-2217(02)00484-8_BIB3","series-title":"Proceedings of the Fourth International Conference on Genetic Algorithms","first-page":"92","article-title":"Extended selection mechanisms in genetic algorithms","author":"B\u00e4ck","year":"1991"},{"key":"10.1016\/S0377-2217(02)00484-8_BIB4","series-title":"Proceedings of the First European Conference on Artificial Life","first-page":"263","article-title":"Self-adaptation in genetic algorithms","author":"B\u00e4ck","year":"1992"},{"key":"10.1016\/S0377-2217(02)00484-8_BIB5","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/trsc.17.1.4","article-title":"A matching based heuristic for scheduling mass transit crews and vehicles","volume":"17","author":"Ball","year":"1983","journal-title":"Transportation Science"},{"key":"10.1016\/S0377-2217(02)00484-8_BIB6","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/0377-2217(94)90237-2","article-title":"Weighted matching with vertex weights: An application to scheduling training sessions in NASA space shuttle cockpit simulators","volume":"73","author":"Bell","year":"1994","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00484-8_BIB7","article-title":"Assignment and Matching Problems: Solution Methods with FORTRAN-Programs","volume":"volume 184","author":"Burkard","year":"1980"},{"issue":"3","key":"10.1016\/S0377-2217(02)00484-8_BIB8","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF03325101","article-title":"A comprehensive survey of evolutionary-based multiobjective optimization techniques","volume":"1","author":"Coello","year":"1999","journal-title":"Knowledge and Information Systems"},{"key":"10.1016\/S0377-2217(02)00484-8_BIB9","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1287\/ijoc.11.2.138","article-title":"Computing minimum-weighted perfect matchings","volume":"11","author":"Cook","year":"1999","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/S0377-2217(02)00484-8_BIB10","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1007\/BFb0121194","article-title":"A primal algorithm for optimum matching","volume":"8","author":"Cunningham","year":"1978","journal-title":"Mathematical Programming Study"},{"issue":"1","key":"10.1016\/S0377-2217(02)00484-8_BIB11","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/BF01197559","article-title":"A closer look at drawbacks of minimizing weighted sums of objectives for Pareto set generation in multicriteria optimization problems","volume":"14","author":"Daas","year":"1997","journal-title":"Structural Optimization"},{"key":"10.1016\/S0377-2217(02)00484-8_BIB12","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/BF02288324","article-title":"Solving non-bipartite matching problems via shortest path techniques","volume":"13","author":"Derigs","year":"1988","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(02)00484-8_BIB13","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/BF01594929","article-title":"Solving (large scale) matching problems combinatorially","volume":"50","author":"Derigs","year":"1991","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(02)00484-8_BIB14","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/BF01720353","article-title":"A matching-based approach for solving a delivery\/pick-up vehicle routing problem with time constraints","volume":"14","author":"Derigs","year":"1992","journal-title":"OR Spektrum"},{"key":"10.1016\/S0377-2217(02)00484-8_BIB15","doi-asserted-by":"crossref","first-page":"125","DOI":"10.6028\/jres.069B.013","article-title":"Maximum matching and a polyhedron with 0,1 vertices","volume":"69B","author":"Edmonds","year":"1965","journal-title":"Journal of Research of the National Bureau of Standards"},{"issue":"4","key":"10.1016\/S0377-2217(02)00484-8_BIB16","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/s002910000046","article-title":"A survey and annotated bibliography of multiobjective combinatorial optimization","volume":"22","author":"Ehrgott","year":"2000","journal-title":"OR Spektrum"},{"key":"10.1016\/S0377-2217(02)00484-8_BIB17","series-title":"Artificial Intelligence through Simulated Evolution","author":"Fogel","year":"1966"},{"key":"10.1016\/S0377-2217(02)00484-8_BIB18","series-title":"Proceedings of the 5th International Conference on Genetic Algorithms","first-page":"416","article-title":"Genetic algorithms for multiobjective optimization: Formulation, discussion and generalization","author":"Fonseca","year":"1993"},{"issue":"1","key":"10.1016\/S0377-2217(02)00484-8_BIB19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1162\/evco.1995.3.1.1","article-title":"An overview of evolutionary algorithms in multiobjective optimization","volume":"3","author":"Fonseca","year":"1995","journal-title":"Evolutionary Computation"},{"key":"10.1016\/S0377-2217(02)00484-8_BIB20","series-title":"Parallel Problem Solving From Nature\u2013\u2013PPSN-IV","first-page":"584","article-title":"On the performance assessment and comparison of stochastic multiobjective optimizers","author":"Fonseca","year":"1996"},{"key":"10.1016\/S0377-2217(02)00484-8_BIB21","series-title":"Proceedings of the First Annual ACM\u2013SIAM Symposium on Discrete Algorithms","first-page":"434","article-title":"Data structures for weighted matching and nearest common ancestors with linking","author":"Gabow","year":"1990"},{"key":"10.1016\/S0377-2217(02)00484-8_BIB22","doi-asserted-by":"crossref","first-page":"540","DOI":"10.1145\/65950.65954","article-title":"Efficient implementations of graph algorithms using contraction","volume":"36","author":"Gabow","year":"1989","journal-title":"Journal of the ACM"},{"issue":"4","key":"10.1016\/S0377-2217(02)00484-8_BIB23","doi-asserted-by":"crossref","first-page":"815","DOI":"10.1145\/115234.115366","article-title":"Faster scaling algorithms for general graph\u2013\u2013matching problems","volume":"38","author":"Gabow","year":"1991","journal-title":"Journal of the ACM"},{"key":"10.1016\/S0377-2217(02)00484-8_BIB24","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1137\/0215009","article-title":"An O(EVlogV) algorithm for finding a maximal weighted matching in general graphs","volume":"15","author":"Galil","year":"1986","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/S0377-2217(02)00484-8_BIB25","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0377-2217(02)00484-8_BIB26","series-title":"Genetic Algorithms and Engineering Design","author":"Gen","year":"1997"},{"key":"10.1016\/S0377-2217(02)00484-8_BIB27","doi-asserted-by":"crossref","unstructured":"M. Gen, K. Ida, J. Kim, A spanning tree-based genetic algorithm for bicriteria topological network design, in: 1998 IEEE International Conference on Evolutionary Computation, 1998, pp. 15\u201320","DOI":"10.1109\/ICEC.1998.699068"},{"key":"10.1016\/S0377-2217(02)00484-8_BIB28","unstructured":"H.J. Greenberg, Mathematical Programming Glossary. World Wide Web, http:\/\/www.cudenver.edu\/hgreenbe\/glossary\/glossary.html, 1996\u20132000"},{"key":"10.1016\/S0377-2217(02)00484-8_BIB29","series-title":"Proceedings of the 4th IEEE Conference on Evolutionary Computation","first-page":"65","article-title":"Adaptation in evolutionary computation: A survey","author":"Hinterding","year":"1997"},{"key":"10.1016\/S0377-2217(02)00484-8_BIB30","series-title":"Adaptation in Natural and Artificial Systems","author":"Holland","year":"1975"},{"key":"10.1016\/S0377-2217(02)00484-8_BIB31","series-title":"Handbook of Evolutionary Computation","first-page":"F1.9:1","article-title":"Multicriterion decision making","author":"Horn","year":"1997"},{"key":"10.1016\/S0377-2217(02)00484-8_BIB32","series-title":"Proceedings of the 1st IEEE Conference on Evolutionary Computation","first-page":"82","article-title":"A niched pareto genetic algorithm for multiobjective optimization","author":"Horn","year":"1994"},{"key":"10.1016\/S0377-2217(02)00484-8_BIB33","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0020-0190(91)90246-E","article-title":"Maximum bounded 3-dimensional matching is MAX SNP-complete","volume":"37","author":"Kann","year":"1991","journal-title":"Information Processing Letters"},{"key":"10.1016\/S0377-2217(02)00484-8_BIB34","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\/S0377-2217(02)00484-8_BIB35","unstructured":"M. Laumanns, G. Rudolph, H.-P. Schwefel, Approximating the Pareto set: Concepts, diversity issues, and performance assessment, Technical Report CI-72\/99, University of Dortmund, 1999"},{"key":"10.1016\/S0377-2217(02)00484-8_BIB36","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1002\/net.3230190406","article-title":"A new algorithm for general matching problems using network flow subproblems","volume":"19","author":"Lessard","year":"1989","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(02)00484-8_BIB37","series-title":"Genetic Algorithms+Data Structures=Evolution Programs","author":"Michalewicz","year":"1996"},{"key":"10.1016\/S0377-2217(02)00484-8_BIB38","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1287\/ijoc.7.3.298","article-title":"A staged primal-dual algorithm for perfect b-matching with edge capacities","volume":"7","author":"Miller","year":"1995","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0377-2217(02)00484-8_BIB39","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1016\/0377-2217(96)00007-0","article-title":"General local search methods","volume":"92","author":"Pirlot","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00484-8_BIB40","series-title":"Evolutionsstrategie\u2013\u2013Optimierung technischer Systeme nach Prinzipien der biologischen evolution","author":"Rechenberg","year":"1973"},{"key":"10.1016\/S0377-2217(02)00484-8_BIB41","doi-asserted-by":"crossref","first-page":"676","DOI":"10.1137\/0210050","article-title":"On a greedy heuristic for complete matching","volume":"10","author":"Reingold","year":"1981","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/S0377-2217(02)00484-8_BIB42","series-title":"Numerical optimization of computer models","author":"Schwefel","year":"1981"},{"issue":"3","key":"10.1016\/S0377-2217(02)00484-8_BIB43","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1162\/evco.1994.2.3.221","article-title":"Multiobjective optimization using nondominated sorting in genetic algorithms","volume":"2","author":"Srinivas","year":"1995","journal-title":"Evolutionary Computation"},{"key":"10.1016\/S0377-2217(02)00484-8_BIB44","series-title":"Multiple Criteria Optimization. Series in Probability and Mathematical Statistics","author":"Steuer","year":"1985"},{"key":"10.1016\/S0377-2217(02)00484-8_BIB45","doi-asserted-by":"crossref","unstructured":"H. Tamaki, H. Kita, S. Kobayashi, Multi-objective optimization by genetic algorithms: A review, in: Proceedings of the 1996 IEEE ICEC, 1996, pp. 517\u2013522","DOI":"10.1109\/ICEC.1996.542653"},{"key":"10.1016\/S0377-2217(02)00484-8_BIB46","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1002\/(SICI)1099-1360(199907)8:4<221::AID-MCDA247>3.0.CO;2-O","article-title":"MOSA method: a tool for solving multi-objective combinatorial optimization problems","volume":"8","author":"Ulungu","year":"1999","journal-title":"Journal of Multi-Criteria Decision Analysis"},{"key":"10.1016\/S0377-2217(02)00484-8_BIB47","series-title":"Proceedings of the 1999 ACM Symposium on Applied Computing","first-page":"351","article-title":"Multiobjective evolutionary algorithm test suites","author":"Van Veldhuizen","year":"1999"},{"issue":"2","key":"10.1016\/S0377-2217(02)00484-8_BIB48","first-page":"1","article-title":"Multiobjective evolutionary algorithms: Analyzing the state-of-the-art","volume":"8","author":"Van Veldhuizen","year":"2000","journal-title":"Evolutionary Computation"},{"key":"10.1016\/S0377-2217(02)00484-8_BIB49","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/S0377-2217(98)00016-2","article-title":"Genetic algorithm approach on multi-criteria minimum spanning tree problem","volume":"114","author":"Zhou","year":"1999","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/S0377-2217(02)00484-8_BIB50","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1162\/106365600568202","article-title":"Comparison of multiobjectivc evolutionary algorithms: Empirical results","volume":"8","author":"Zitzler","year":"2000","journal-title":"Evolutionary Computation"},{"key":"10.1016\/S0377-2217(02)00484-8_BIB51","series-title":"Parallel Problem Solving from Nature\u2013\u2013PPSN-V","first-page":"292","article-title":"Multiobjective optimization using evolutionary algorithms\u2013\u2013a comparative case study","author":"Zitzler","year":"1998"},{"issue":"4","key":"10.1016\/S0377-2217(02)00484-8_BIB52","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1109\/4235.797969","article-title":"Multiobjective evolutionary algorithms: A comparative case study and the strength pareto approach","volume":"3","author":"Zitzler","year":"1999","journal-title":"IEEE Transactions on Evolutionary Computation"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702004848?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702004848?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T03:59:07Z","timestamp":1553918347000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221702004848"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,8]]},"references-count":52,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,8]]}},"alternative-id":["S0377221702004848"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(02)00484-8","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2003,8]]}}}