{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T17:31:08Z","timestamp":1770744668162,"version":"3.49.0"},"reference-count":80,"publisher":"Oxford University Press (OUP)","issue":"3","license":[{"start":{"date-parts":[[2023,4,15]],"date-time":"2023-04-15T00:00:00Z","timestamp":1681516800000},"content-version":"vor","delay-in-days":1,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/4.0\/"}],"funder":[{"name":"University Natural Science Research Project in Jiangsu Province","award":["22KJB520035"],"award-info":[{"award-number":["22KJB520035"]}]},{"name":"Jiangsu Key Laboratory for Elevator Intelligent Safety","award":["JSKLESS202104"],"award-info":[{"award-number":["JSKLESS202104"]}]},{"name":"Special Teaching Project of Jiangsu Computer Society","award":["JSCS2022049"],"award-info":[{"award-number":["JSCS2022049"]}]},{"DOI":"10.13039\/501100018525","name":"Key Research and Development Program of Sichuan Province","doi-asserted-by":"publisher","award":["2022YFN0017"],"award-info":[{"award-number":["2022YFN0017"]}],"id":[{"id":"10.13039\/501100018525","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002886","name":"China National Petroleum Corporation","doi-asserted-by":"publisher","award":["2021DQ02-0903"],"award-info":[{"award-number":["2021DQ02-0903"]}],"id":[{"id":"10.13039\/501100002886","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,4,29]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Combinatorial optimization problems have very important applications in information technology, transportation, economics, management, network communication, and other fields. Since the problem size in real-scenario application is in large-scale, the demand for real-time and efficient solving approaches increases rapidly. The traditional exact methods guarantee the optimality of the final solution, but these methods can hardly solve the problem in acceptable time due to extremely high computational costs. Heuristic approaches can find feasible solutions in a limited time, while these approaches cannot meet the demand of solution quality. In recent years, hybrid algorithms based on exact methods and heuristic algorithms show outstanding performance in solving large-scale combinatorial optimization problems. The hybridization not only overcomes the shortcomings from single algorithm but also fully utilizes the search ability for population-based approaches as well as the interpretability in exact methods, which promotes the application of combinatorial optimization in real-world problems. This paper reviews existing studies on hybrid algorithms combining exact method and evolutionary computation, summarizes the characteristics of the existing algorithms, and directs the future research.<\/jats:p>","DOI":"10.1093\/jcde\/qwad029","type":"journal-article","created":{"date-parts":[[2023,4,16]],"date-time":"2023-04-16T05:59:06Z","timestamp":1681624746000},"page":"934-946","source":"Crossref","is-referenced-by-count":1,"title":["The applications of hybrid approach combining exact method and evolutionary algorithm in combinatorial optimization"],"prefix":"10.1093","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0055-2353","authenticated-orcid":false,"given":"Suling","family":"Duan","sequence":"first","affiliation":[{"name":"School of Statistics, Chengdu University of Information Technology , Sichuan, 610103, China"}]},{"given":"Shanlin","family":"Jiang","sequence":"additional","affiliation":[{"name":"College of Computer Science, Sichuan University , Sichuan, 610065, China"}]},{"given":"Huan","family":"Dai","sequence":"additional","affiliation":[{"name":"School of Electronic and Information Engineering, Suzhou University of Science and Technology , Jiangsu, 215009, China"}]},{"given":"Luping","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Electronic and Information Engineering, Suzhou University of Science and Technology , Jiangsu, 215009, China"},{"name":"Jiangsu Key Laboratory for Elevator Intelligent Safety , Jiangsu, 215506, China"}]},{"given":"Zhenan","family":"He","sequence":"additional","affiliation":[{"name":"College of Computer Science, Sichuan University , Sichuan, 610065, China"}]}],"member":"286","published-online":{"date-parts":[[2023,4,14]]},"reference":[{"key":"2023050109042882400_bib1","doi-asserted-by":"crossref","first-page":"113566","DOI":"10.1016\/j.eswa.2020.113566","article-title":"A hybrid artificial neural network, genetic algorithm and column generation heuristic for minimizing makespan in manual order picking operations","volume":"159","author":"Ardjmand","year":"2020","journal-title":"Expert Systems with Applications"},{"key":"2023050109042882400_bib2","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1016\/j.artint.2015.01.002","article-title":"Overview and analysis of the SAT challenge 2012 solver competition","volume":"223","author":"Balint","year":"2015","journal-title":"Artificial Intelligence"},{"key":"2023050109042882400_bib3","doi-asserted-by":"crossref","first-page":"116900","DOI":"10.1016\/j.eswa.2022.116900","article-title":"Capability-based machine layout with a matheuristic-based approach","volume":"198","author":"Baykaso\u011flu","year":"2022","journal-title":"Expert Systems with Applications"},{"issue":"3","key":"2023050109042882400_bib4","doi-asserted-by":"crossref","first-page":"1326","DOI":"10.1080\/00207543.2017.1338778","article-title":"A hybrid benders approach for coordinated capacitated lot-sizing of multiple product families with set-up times","volume":"56","author":"Bayley","year":"2018","journal-title":"International Journal of Production Research"},{"key":"2023050109042882400_bib5","doi-asserted-by":"crossref","first-page":"598","DOI":"10.1016\/j.ins.2014.11.037","article-title":"A novel hybrid column generation-metaheuristic approach for the vehicle routing problem with general soft time window","volume":"316","author":"Beheshti","year":"2015","journal-title":"Information Sciences"},{"key":"2023050109042882400_bib6","doi-asserted-by":"crossref","first-page":"103479","DOI":"10.1016\/j.engappai.2020.103479","article-title":"Differential evolution: A review of more than two decades of research","volume":"90","author":"","year":"2020","journal-title":"Engineering Applications of Artificial Intelligence"},{"key":"2023050109042882400_bib7","article-title":"Matheuristics: Optimization, simulation and control. Hybrid Metaheuristics. HM 2009. Lecture Notes in Computer Science","author":"Boschetti","year":"2009"},{"issue":"1","key":"2023050109042882400_bib8","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1016\/j.cor.2010.06.006","article-title":"A branch and bound enhanced genetic algorithm for scheduling a flowline manufacturing cell with sequence dependent family setup times","volume":"38","author":"Bouabda","year":"2011","journal-title":"Computers & Operations Research"},{"issue":"8","key":"2023050109042882400_bib9","doi-asserted-by":"crossref","first-page":"2219","DOI":"10.1016\/j.cor.2005.02.005","article-title":"A new branch-&-bound-enhanced genetic algorithm for the manufacturing cell formation problem","volume":"33","author":"Boulif","year":"2006","journal-title":"Computers & Operations Research"},{"key":"2023050109042882400_bib10","volume-title":"Combinatorial optimization","author":"Cook","year":"2011"},{"issue":"2","key":"2023050109042882400_bib11","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1023\/A:1021934325079","article-title":"Embedding branch and bound within evolutionary algorithms","volume":"18","author":"Cotta","year":"2003","journal-title":"Applied Intelligence"},{"key":"2023050109042882400_bib12","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/978-3-7091-7535-4_73","article-title":"Hybridizing genetic algorithms with branch and bound techniques for the resolution of the TSP","volume-title":"Artificial neural nets and genetic algorithms","author":"Cotta","year":"1995"},{"key":"2023050109042882400_bib13","doi-asserted-by":"crossref","first-page":"2317","DOI":"10.1109\/CEC.1999.785563","article-title":"On cooperation between evolutionary algorithms and other search paradigms","volume-title":"Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406)","author":"Denzinger","year":"1999"},{"key":"2023050109042882400_bib14","volume-title":"Column generation","author":"Desaulniers","year":"2006"},{"key":"2023050109042882400_bib15","volume-title":"Ant colony optimization: Overview and recent advances","author":"Dorigo","year":"2019"},{"issue":"4","key":"2023050109042882400_bib16","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1109\/MCI.2006.329691","article-title":"Ant colony optimization","volume":"1","author":"Dorigo","year":"2006","journal-title":"IEEE computational intelligence magazine"},{"key":"2023050109042882400_bib17","doi-asserted-by":"crossref","first-page":"1799","DOI":"10.1109\/CEC.2009.4983159","article-title":"General hybrid column generation algorithm for crew scheduling problems using genetic algorithm","volume-title":"Proceedings of the 2009 IEEE Congress on Evolutionary Computation","author":"Dos\u00a0Santos","year":"2009"},{"issue":"1","key":"2023050109042882400_bib18","doi-asserted-by":"crossref","first-page":"923","DOI":"10.1007\/s10479-018-2911-2","article-title":"A genetic column generation algorithm for sustainable spare part delivery: Application to the sydney droppoint network","volume":"290","author":"Dunbar","year":"2020","journal-title":"Annals of Operations Research"},{"issue":"1","key":"2023050109042882400_bib19","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1016\/j.cie.2008.04.008","article-title":"A genetic algorithm and a simulated annealing algorithm combined with column generation technique for solving the problem of scheduling in the hybrid flowshop with additional resources","volume":"56","author":"Figielska","year":"2009","journal-title":"Computers & Industrial Engineering"},{"issue":"6","key":"2023050109042882400_bib20","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1023\/A:1011921025322","article-title":"Using a hybrid genetic-algorithm\/branch and bound approach to solve feasibility and optimization integer programming problems","volume":"7","author":"French","year":"2001","journal-title":"Journal of Heuristics"},{"issue":"3","key":"2023050109042882400_bib21","doi-asserted-by":"crossref","first-page":"A1632","DOI":"10.1137\/21M140732X","article-title":"Genetic column generation: Fast computation of high-dimensional multimarginal optimal transport problems","volume":"44","author":"Friesecke","year":"2022","journal-title":"SIAM Journal on Scientific Computing"},{"key":"2023050109042882400_bib22","first-page":"21","article-title":"Solving the multidimensional knapsack problem using an evolutionary algorithm hybridized with branch and bound","volume-title":"Proceedings of the International Work-Conference on the Interplay Between Natural and Artificial Computation","author":"Gallardo","year":"2005"},{"key":"2023050109042882400_bib23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/CEC55065.2022.9870265","article-title":"Multi-objective 3D path planning for UAVS in large-scale urban scenarios","volume-title":"Proceedings of the 2022 IEEE Congress on Evolutionary Computation (CEC)","author":"Hohmann","year":"2022"},{"key":"2023050109042882400_bib24","first-page":"119","article-title":"Hybrid genetic algorithm with exact techniques applied to TSP","volume-title":"Proceedings of the Second International Workshop on Intelligent Systems Design and Application","author":"Jahuira","year":"2002"},{"key":"2023050109042882400_bib25","doi-asserted-by":"crossref","first-page":"108977","DOI":"10.1016\/j.cie.2023.108977","article-title":"Modified benders decomposition and metaheuristics for multi-machine parallel-batch scheduling and resource allocation under deterioration effect","volume":"176","author":"Jiang","year":"2023","journal-title":"Computers & Industrial Engineering"},{"issue":"3","key":"2023050109042882400_bib26","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1016\/j.ejor.2007.07.035","article-title":"Hybridizing exact methods and metaheuristics: A taxonomy","volume":"199","author":"Jourdan","year":"2009","journal-title":"European Journal of Operational Research"},{"key":"2023050109042882400_bib27","doi-asserted-by":"crossref","first-page":"104888","DOI":"10.1016\/j.cor.2020.104888","article-title":"A multi-stage stochastic integer programming approach for locating electric vehicle charging stations","volume":"117","author":"Kadri","year":"2020","journal-title":"Computers & Operations Research"},{"issue":"5","key":"2023050109042882400_bib28","doi-asserted-by":"crossref","first-page":"8091","DOI":"10.1007\/s11042-020-10139-6","article-title":"A review on genetic algorithm: Past, present, and future","volume":"80","author":"Katoch","year":"2021","journal-title":"Multimedia Tools and Applications"},{"key":"2023050109042882400_bib29","doi-asserted-by":"crossref","first-page":"1942","DOI":"10.1109\/ICNN.1995.488968","article-title":"Particle swarm optimization","volume-title":"Proceedings of ICNN\u201995-International Conference on Neural Networks","author":"Kennedy","year":"1995"},{"key":"2023050109042882400_bib30","first-page":"1304","article-title":"Combining a memetic algorithm with integer programming to solve the prize-collecting steiner tree problem","volume-title":"Proceedings of the Genetic and Evolutionary Computation Conference","author":"Klau","year":"2004"},{"key":"2023050109042882400_bib31","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/978-3-540-24650-3_11","article-title":"Genetic programming applied to mixed integer programming","volume-title":"Proceedings of the European Conference on Genetic Programming","author":"Kostikas","year":"2004"},{"issue":"1","key":"2023050109042882400_bib32","first-page":"33","article-title":"A hybrid benders\/genetic algorithm for vehicle routing and scheduling problem","volume":"19","author":"Lai","year":"2012","journal-title":"International Journal of Industrial Engineering"},{"issue":"12","key":"2023050109042882400_bib33","doi-asserted-by":"crossref","first-page":"8599","DOI":"10.1016\/j.eswa.2010.06.104","article-title":"A hybrid algorithm for capacitated plant location problem","volume":"37","author":"Lai","year":"2010","journal-title":"Expert Systems with Applications"},{"issue":"4","key":"2023050109042882400_bib34","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1287\/opre.14.4.699","article-title":"Branch-and-bound methods: A survey","volume":"14","author":"Lawler","year":"1966","journal-title":"Operations Research"},{"issue":"1","key":"2023050109042882400_bib35","doi-asserted-by":"crossref","first-page":"36","DOI":"10.3141\/2159-05","article-title":"Genetic algorithm-based column generation approach to passenger rail crew scheduling","volume":"2159","author":"Liu","year":"2010","journal-title":"Transportation Research Record"},{"issue":"6","key":"2023050109042882400_bib36","doi-asserted-by":"crossref","first-page":"1007","DOI":"10.1287\/opre.1050.0234","article-title":"Selected topics in column generation","volume":"53","author":"L\u00fcbbecke","year":"2005","journal-title":"Operations Research"},{"key":"2023050109042882400_bib37","volume-title":"Linear and nonlinear programming","author":"Luenberger","year":"1984"},{"issue":"2","key":"2023050109042882400_bib38","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1016\/j.ejor.2016.04.014","article-title":"A benders decomposition-based matheuristic for the cardinality constrained shift design problem","volume":"254","author":"Lusby","year":"2016","journal-title":"European Journal of Operational Research"},{"key":"2023050109042882400_bib39","doi-asserted-by":"crossref","first-page":"1275","DOI":"10.1145\/3449726.3463158","article-title":"The bee-benders hybrid algorithm with application to transmission expansion planning","volume-title":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","author":"MacRae","year":"2021"},{"key":"2023050109042882400_bib40","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-030-70277-9","volume-title":"Matheuristics","author":"Maniezzo","year":"2021"},{"key":"2023050109042882400_bib41","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/3927.001.0001","volume-title":"An introduction to genetic algorithms","author":"Mitchell","year":"1998"},{"issue":"11","key":"2023050109042882400_bib42","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","article-title":"Variable neighborhood search","volume":"24","author":"Mladenovi\u0107","year":"1997","journal-title":"Computers & Operations Research"},{"key":"2023050109042882400_bib43","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/CEC.2018.8477762","article-title":"Hybrid genetic algorithms applied to the glass container industry problem","volume-title":"Proceedings of the 2018 IEEE Congress on Evolutionary Computation (CEC)","author":"Moreira\u00a0de\u00a0Souza\u00a0Amorim","year":"2018"},{"key":"2023050109042882400_bib44","doi-asserted-by":"crossref","first-page":"104935","DOI":"10.1016\/j.cor.2020.104935","article-title":"Decomposition-based algorithms for the crew scheduling and routing problem in road restoration","volume":"119","author":"Moreno","year":"2020","journal-title":"Computers & Operations Research"},{"key":"2023050109042882400_bib45","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/j.disopt.2016.01.005","article-title":"Branch-and-bound algorithms: A survey of recent advances in searching, branching, and pruning","volume":"19","author":"Morrison","year":"2016","journal-title":"Discrete Optimization"},{"issue":"3","key":"2023050109042882400_bib46","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/BF02125405","article-title":"A combined branch-and-bound and genetic algorithm based approach for a flowshop scheduling problem","volume":"63","author":"Nagar","year":"1996","journal-title":"Annals of Operations Research"},{"issue":"3","key":"2023050109042882400_bib47","doi-asserted-by":"crossref","first-page":"1113","DOI":"10.1016\/j.ejor.2020.12.058","article-title":"An efficient column generation approach for practical railway crew scheduling with attendance rates","volume":"293","author":"Neufeld","year":"2021","journal-title":"European Journal of Operational Research"},{"key":"2023050109042882400_bib48","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/j.cor.2019.05.009","article-title":"A hybrid differential evolution algorithm with column generation for resource constrained job scheduling","volume":"109","author":"Nguyen","year":"2019","journal-title":"Computers & Operations Research"},{"issue":"5","key":"2023050109042882400_bib49","doi-asserted-by":"crossref","first-page":"1334","DOI":"10.1080\/00207543.2013.842017","article-title":"Balancing transfer lines using benders decomposition and ant colony optimisation techniques","volume":"52","author":"Osman","year":"2014","journal-title":"International Journal of Production Research"},{"issue":"1","key":"2023050109042882400_bib50","doi-asserted-by":"crossref","first-page":"115","DOI":"10.5267\/j.ijiec.2022.9.003","article-title":"A matheuristic based solution approach for the general lot sizing and scheduling problem with sequence dependent changeovers and back ordering","volume":"14","author":"\u00d6zbel","year":"2023","journal-title":"International Journal of Industrial Engineering Computations"},{"key":"2023050109042882400_bib51","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4614-2361-4","volume-title":"Scheduling: Theory, algorithms, and systems","author":"Pinedo","year":"2012"},{"issue":"1","key":"2023050109042882400_bib52","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/j.ejor.2008.10.033","article-title":"Improving benders decomposition using a genetic algorithm","volume":"199","author":"Poojari","year":"2009","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"2023050109042882400_bib53","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1016\/S0377-2217(97)00333-0","article-title":"Branch and bound crossed with GA to solve hybrid flowshops","volume":"107","author":"Portmann","year":"1998","journal-title":"European Journal of Operational Research"},{"key":"2023050109042882400_bib54","first-page":"642","article-title":"An evolutionary algorithm for column generation in integer programming: An effective approach for 2D bin packing","volume-title":"Proceedings of the International Conference on Parallel Problem Solving from Nature","author":"Puchinger","year":"2004"},{"key":"2023050109042882400_bib55","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/978-3-540-24652-7_17","article-title":"Solving a real-world glass cutting problem","volume-title":"Proceedings of the European Conference on Evolutionary Computation in Combinatorial Optimization","author":"Puchinger","year":"2004"},{"key":"2023050109042882400_bib56","first-page":"775","article-title":"Cooperating memetic and branch-and-cut algorithms for solving the multidimensional knapsack problem","volume-title":"Proceedings of MIC2005, the 6th Metaheuristics International Conference","author":"Puchinger","year":"2005"},{"issue":"3","key":"2023050109042882400_bib58","doi-asserted-by":"crossref","first-page":"801","DOI":"10.1016\/j.ejor.2016.12.005","article-title":"The benders decomposition algorithm: A literature review","volume":"259","author":"Rahmaniani","year":"2017","journal-title":"European Journal of Operational Research"},{"issue":"8","key":"2023050109042882400_bib59","doi-asserted-by":"crossref","first-page":"2161","DOI":"10.1007\/s11590-020-01542-x","article-title":"A branch-and-bound embedded genetic algorithm for resource-constrained project scheduling problem with resource transfer time of aircraft moving assembly line","volume":"14","author":"Ren","year":"2020","journal-title":"Optimization Letters"},{"key":"2023050109042882400_bib60","doi-asserted-by":"crossref","first-page":"107985","DOI":"10.1016\/j.asoc.2021.107985","article-title":"Benders decomposition-based particle swarm optimization for competitive supply networks with a sustainable multi-agent platform and virtual alliances","volume":"114","author":"Rezaei","year":"2022","journal-title":"Applied Soft Computing"},{"key":"2023050109042882400_bib61","doi-asserted-by":"crossref","first-page":"130073","DOI":"10.1016\/j.jclepro.2021.130073","article-title":"Competitive planning of partnership supply networks focusing on sustainable multi-agent transportation and virtual alliance: A matheuristic approach","volume":"333","author":"Rezaei","year":"2022","journal-title":"Journal of Cleaner Production"},{"key":"2023050109042882400_bib62","article-title":"Constructive genetic algorithm and column generation: An application to graph coloring","volume-title":"Proceedings of APORS","author":"Ribeiro\u00a0Filho","year":"2000"},{"issue":"3","key":"2023050109042882400_bib63","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1002\/net.20466","article-title":"Column generation algorithm for sensor coverage scheduling under bandwidth constraints","volume":"60","author":"Rossi","year":"2012","journal-title":"Networks"},{"key":"2023050109042882400_bib64","doi-asserted-by":"crossref","first-page":"6111","DOI":"10.1007\/s00500-017-2666-8","article-title":"Solving binary cutting stock with matheuristics using particle swarm optimization and simulated annealing","volume":"22","author":"Sanchez","year":"2018","journal-title":"Soft Computing"},{"key":"2023050109042882400_bib65","doi-asserted-by":"crossref","first-page":"1725","DOI":"10.1109\/CEC.2007.4424681","article-title":"Crew scheduling urban problem: An exact column generation approach improved by a genetic algorithm","volume-title":"Proceedings of the 2007 IEEE Congress on Evolutionary Computation","author":"Santos","year":"2007"},{"key":"2023050109042882400_bib66","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/978-3-319-55702-1_43","article-title":"Splitting procedure of genetic algorithm for column generation to solve a vehicle routing problem","volume-title":"Operations Research Proceedings 2016","author":"Scheffler","year":"2018"},{"issue":"3","key":"2023050109042882400_bib67","doi-asserted-by":"crossref","first-page":"1092","DOI":"10.1109\/TPWRS.2007.901092","article-title":"A new efficient GA-benders\u2019 decomposition method: For power generation expansion planning with emission controls","volume":"22","author":"Sirikum","year":"2007","journal-title":"IEEE Transactions on Power Systems"},{"key":"2023050109042882400_bib68","doi-asserted-by":"crossref","first-page":"5566002","DOI":"10.1155\/2021\/5566002","article-title":"A column generation algorithm for the resource-constrained order acceptance and scheduling on unrelated parallel machines","volume":"2021","author":"Song","year":"2021","journal-title":"Mathematical Problems in Engineering"},{"issue":"3","key":"2023050109042882400_bib69","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/s007780050040","article-title":"Heuristic and randomized optimization for the join ordering problem","volume":"6","author":"Steinbrunn","year":"1997","journal-title":"The VLDB Journal"},{"key":"2023050109042882400_bib70","doi-asserted-by":"crossref","first-page":"119199","DOI":"10.1016\/j.eswa.2022.119199","article-title":"Unequal-area capability-based facility layout design problem with a heuristic decomposition-based iterative mathematical programming approach","volume":"214","author":"Subulan","year":"2023","journal-title":"Expert Systems with Applications"},{"key":"2023050109042882400_bib57","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1016\/j.cie.2019.03.009","article-title":"A decomposition-based matheuristic for supply chain network design with assembly line balancing","volume":"131","author":"Sun","year":"2019","journal-title":"Computers & Industrial Engineering"},{"issue":"4","key":"2023050109042882400_bib71","doi-asserted-by":"crossref","first-page":"60","DOI":"10.5539\/cis.v3n4p60","article-title":"Globally convergent particle swarm optimization via branch-and-bound","volume":"3","author":"Tang","year":"2010","journal-title":"Computer and Information Science"},{"key":"2023050109042882400_bib72","first-page":"130","article-title":"Hybrids of integer programming and ACO for resource constrained job scheduling","volume-title":"International Workshop on Hybrid Metaheuristics","author":"Thiruvady","year":"2014"},{"key":"2023050109042882400_bib73","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611973594","volume-title":"Vehicle routing: Problems, methods, and applications","author":"Toth","year":"2014","edition":"2nd ed."},{"issue":"2","key":"2023050109042882400_bib74","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1287\/ijoc.1030.0060","article-title":"Using extra dual cuts to accelerate column generation","volume":"17","author":"Val\u00e9rio\u00a0de\u00a0Carvalho","year":"2005","journal-title":"INFORMS Journal on Computing"},{"key":"2023050109042882400_bib75","doi-asserted-by":"crossref","first-page":"107774","DOI":"10.1016\/j.asoc.2021.107774","article-title":"Solving multi-depot electric vehicle scheduling problem by column generation and genetic algorithm","volume":"112","author":"Wang","year":"2021","journal-title":"Applied Soft Computing"},{"issue":"4","key":"2023050109042882400_bib76","doi-asserted-by":"crossref","first-page":"1329","DOI":"10.1007\/s00500-015-1590-z","article-title":"Using a branch-and-bound and a genetic algorithm for a single-machine total late work scheduling problem","volume":"20","author":"Wu","year":"2016","journal-title":"Soft Computing"},{"key":"2023050109042882400_bib77","doi-asserted-by":"crossref","first-page":"105970","DOI":"10.1016\/j.cor.2022.105970","article-title":"A column generation-based heuristic for a rehabilitation patient scheduling and routing problem","volume":"148","author":"Xiao","year":"2022","journal-title":"Computers & Operations Research"},{"issue":"2","key":"2023050109042882400_bib78","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1109\/TCYB.2014.2339495","article-title":"Differential evolution with auto-enhanced population diversity","volume":"45","author":"Yang","year":"2015","journal-title":"IEEE Transactions on Cybernetics"},{"key":"2023050109042882400_bib79","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1016\/j.asoc.2018.04.008","article-title":"A novel particle swarm optimization based on prey\u2013predator relationship","volume":"68","author":"Zhang","year":"2018","journal-title":"Applied Soft Computing"},{"key":"2023050109042882400_bib80","doi-asserted-by":"crossref","first-page":"105868","DOI":"10.1016\/j.cor.2022.105868","article-title":"Heterogeneous fleet management for one-way electric carsharing system with optional orders, vehicle relocation and on-demand recharging","volume":"145","author":"Zhang","year":"2022","journal-title":"Computers & Operations Research"}],"container-title":["Journal of Computational Design and Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/jcde\/advance-article-pdf\/doi\/10.1093\/jcde\/qwad029\/49914412\/qwad029.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/jcde\/article-pdf\/10\/3\/934\/50149978\/qwad029.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/jcde\/article-pdf\/10\/3\/934\/50149978\/qwad029.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T09:05:36Z","timestamp":1682931936000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/jcde\/article\/10\/3\/934\/7120040"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,14]]},"references-count":80,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,4,29]]}},"URL":"https:\/\/doi.org\/10.1093\/jcde\/qwad029","relation":{},"ISSN":["2288-5048"],"issn-type":[{"value":"2288-5048","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2023,6]]},"published":{"date-parts":[[2023,4,14]]}}}