{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T13:55:43Z","timestamp":1762005343817,"version":"build-2065373602"},"reference-count":86,"publisher":"MDPI AG","issue":"11","license":[{"start":{"date-parts":[[2021,10,27]],"date-time":"2021-10-27T00:00:00Z","timestamp":1635292800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>This paper considers a variant of the Vehicle Routing Problem with Time Windows, with site dependencies, multiple depots and outsourcing costs. This problem is the basis for many technician routing problems. Having both site-dependency and time window constraints lresults in difficulties in finding feasible solutions and induces highly constrained instances. Matheuristics based on Mixed Integer Linear Programming compact formulations are firstly designed. Column Generation matheuristics are then described by using previous matheuristics and machine learning techniques to stabilize and speed up the convergence of the Column Generation algorithm. The computational experiments are analyzed on public instances with graduated difficulties in order to analyze the accuracy of algorithms for ensuring feasibility and the quality of solutions for weakly to highly constrained instances. The results emphasize the interest of the multiple types of hybridization between mathematical programming, machine learning and heuristics inside the Column Generation framework. This work offers perspectives for many extensions of technician routing problems.<\/jats:p>","DOI":"10.3390\/a14110313","type":"journal-article","created":{"date-parts":[[2021,10,27]],"date-time":"2021-10-27T22:00:23Z","timestamp":1635372023000},"page":"313","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Matheuristics and Column Generation for a Basic Technician Routing Problem"],"prefix":"10.3390","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3775-5629","authenticated-orcid":false,"given":"Nicolas","family":"Dupin","sequence":"first","affiliation":[{"name":"Universit\u00e9 Paris-Saclay, Laboratoire Interdisciplinaire des Sciences du Num\u00e9rique (LISN), 91405 Orsay, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R\u00e9mi","family":"Parize","sequence":"additional","affiliation":[{"name":"Independent Researcher, 75000 Paris, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4549-1010","authenticated-orcid":false,"given":"El-Ghazali","family":"Talbi","sequence":"additional","affiliation":[{"name":"CNRS UMR 9189-CRIStAL-Centre de Recherche en Informatique Signal et Automatique de Lille, Universit\u00e9 Lille, F-59000 Lille, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2021,10,27]]},"reference":[{"key":"ref_1","unstructured":"Williams, H.P. (2013). Model Building in Mathematical Programming, John Wiley & Sons."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"4135","DOI":"10.1016\/j.asoc.2011.02.032","article-title":"Hybrid metaheuristics in combinatorial optimization: A survey","volume":"11","author":"Blum","year":"2011","journal-title":"Appl. Soft Comput."},{"key":"ref_3","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":"Eur. J. Oper. Res."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/s10732-020-09450-0","article-title":"Matheuristics to optimize refueling and maintenance planning of nuclear power plants","volume":"27","author":"Dupin","year":"2021","journal-title":"J. Heuristics"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1111\/itor.12557","article-title":"Parallel matheuristics for the discrete unit commitment problem with min-stop ramping constraints","volume":"27","author":"Dupin","year":"2020","journal-title":"Int. Trans. Oper. Res."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/s10479-015-2034-y","article-title":"Combining metaheuristics with mathematical programming, constraint programming and machine learning","volume":"240","author":"Talbi","year":"2016","journal-title":"Ann. Oper. Res."},{"key":"ref_7","first-page":"635","article-title":"A novel solution approach with ML-based pseudo-cuts for the Flight and Maintenance Planning problem","volume":"43","author":"Peschiera","year":"2021","journal-title":"Spectr."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1111\/itor.12445","article-title":"An iterative time-bucket refinement algorithm for a high-resolution resource-constrained project scheduling problem","volume":"27","author":"Riedler","year":"2020","journal-title":"Int. Trans. Oper. Res."},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Dupin, N., and Talbi, E. (2020). Machine learning-guided dual heuristics and new lower bounds for the refueling and maintenance planning problem of nuclear power plants. Algorithms, 13.","DOI":"10.3390\/a13080185"},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Toth, P., and Vigo, D. (2014). Vehicle Routing: Problems, Methods, and Applications, SIAM.","DOI":"10.1137\/1.9781611973594"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1007\/s10288-010-0130-z","article-title":"A tutorial on column generation and branch-and-price for vehicle routing problems","volume":"8","author":"Feillet","year":"2010","journal-title":"4OR Q. J. Oper. Res."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1007\/s10107-020-01523-z","article-title":"A generic exact solver for vehicle routing and related problems","volume":"183","author":"Pessoa","year":"2020","journal-title":"Math. Program."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/0-387-25486-2_4","article-title":"Branch-and-price heuristics: A case study on the vehicle routing problem with time windows","volume":"Volume 18","author":"Danna","year":"2005","journal-title":"Column Generation"},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Doerner, K.F., and Schmid, V. (2010). Survey: Matheuristics for rich vehicle routing problems. International Workshop on Hybrid Metaheuristics, Springer.","DOI":"10.1007\/978-3-642-16054-7_15"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/s13675-014-0030-7","article-title":"A survey on matheuristics for routing problems","volume":"2","author":"Archetti","year":"2014","journal-title":"EURO J. Comput. Optim."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"693","DOI":"10.1007\/s00291-020-00615-8","article-title":"A machine learning-based branch and price algorithm for a sampled vehicle routing problem","volume":"43","author":"Furian","year":"2021","journal-title":"OR Spectrum"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"815","DOI":"10.1287\/trsc.2021.1045","article-title":"Machine-Learning-Based Column Selection for Column Generation","volume":"5","author":"Morabit","year":"2021","journal-title":"Transp. Sci."},{"key":"ref_18","unstructured":"Dutot, P.F., Laugier, A., and Bustos, A.M. (2006). Technicians and Interventions Scheduling for Telecommunications, Technical Report for France Telecom R&D."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/s41604-019-00011-8","article-title":"The VeRoLog verolog solver challenge 2019","volume":"2","author":"Gromicho","year":"2019","journal-title":"J. Veh. Rout. Algorithms"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"928","DOI":"10.1057\/palgrave.jors.2601163","article-title":"A unified tabu search heuristic for vehicle routing problems with time windows","volume":"52","author":"Cordeau","year":"2001","journal-title":"J. Oper. Res. Soc."},{"key":"ref_21","first-page":"292","article-title":"A tabu search algorithm for the site dependent vehicle routing problem with time windows","volume":"39","author":"Cordeau","year":"2001","journal-title":"INFOR Inf. Syst. Oper. Res."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1007\/s10732-005-5432-5","article-title":"A variable neighborhood search for the multi depot vehicle routing problem with time windows","volume":"10","author":"Polacek","year":"2004","journal-title":"J. Heuristics"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1002\/net.20033","article-title":"An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems","volume":"44","author":"Feillet","year":"2004","journal-title":"Networks"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/s13676-012-0012-y","article-title":"Models and valid inequalities to asymmetric skill-based routing problems","volume":"2","author":"Cappanera","year":"2013","journal-title":"EURO J. Transp. Logist."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"105054","DOI":"10.1016\/j.cor.2020.105054","article-title":"Temporal constraints and device management for the Skill VRP: Mathematical model and lower bounding techniques","volume":"124","author":"Cappanera","year":"2020","journal-title":"Comput. Oper. Res."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1016\/j.ejor.2018.04.009","article-title":"Enhanced Branch-Cut-and-Price algorithm for heterogeneous fleet vehicle routing problems","volume":"270","author":"Pessoa","year":"2018","journal-title":"Eur. J. Oper. Res."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"1805","DOI":"10.1007\/s11590-012-0524-2","article-title":"Improved load balancing and resource utilization for the skill vehicle routing problem","volume":"7","author":"Schwarze","year":"2013","journal-title":"Optim. Lett."},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Schwarze, S., and Vo\u00df, S. (2015). A bicriteria skill vehicle routing problem with time windows and an application to pushback operations at airports. Logistics Management, Springer.","DOI":"10.1007\/978-3-319-13177-1_23"},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"77208","DOI":"10.1109\/ACCESS.2019.2919963","article-title":"Skill vehicle routing problem with time windows considering dynamic service times and time-skill-dependent costs","volume":"7","author":"Yan","year":"2019","journal-title":"IEEE Access"},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/s10479-014-1687-2","article-title":"and Landa-Silva, D.; Qu, R. Workforce scheduling and routing problems: Literature survey and computational study","volume":"239","year":"2016","journal-title":"Ann. Oper. Res."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1007\/s10951-011-0246-9","article-title":"Adaptive large neighborhood search for service technician routing and scheduling problems","volume":"15","author":"Kovacs","year":"2012","journal-title":"J. Sched."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1007\/s10732-017-9347-8","article-title":"Iterated local search for workforce scheduling and routing problems","volume":"23","author":"Xie","year":"2017","journal-title":"J. Heuristics"},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"1525","DOI":"10.1007\/s11590-012-0567-4","article-title":"A parallel matheuristic for the technician routing and scheduling problem","volume":"7","author":"Pillac","year":"2013","journal-title":"Optim. Lett."},{"key":"ref_34","unstructured":"Mendoza, J., Montoya, A., Gu\u00e9ret, C., and Villegas, J. (2017, January 19\u201324). A parallel matheuristic for the technician routing problem with conventional and electric vehicles. Proceedings of the 12th Metaheuristics International Conference, Municipality of Las Palmas, Spain."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/j.omega.2015.07.006","article-title":"The technician routing problem with experience-based service times","volume":"61","author":"Chen","year":"2016","journal-title":"Omega"},{"key":"ref_36","doi-asserted-by":"crossref","unstructured":"Pillac, V., Gu\u00e9ret, C., and Medaglia, A. (2018). A fast reoptimization approach for the dynamic technician routing and scheduling problem. Recent Developments in Metaheuristics, Springer.","DOI":"10.1007\/978-3-319-58253-5_20"},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"100012","DOI":"10.1016\/j.ejtl.2020.100012","article-title":"Interday routing and scheduling of multi-skilled teams with consistency consideration and intraday rescheduling","volume":"9","author":"Anoshkina","year":"2020","journal-title":"EURO J. Transp. Logist."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/j.endm.2013.05.092","article-title":"WDM fiber replacement scheduling","volume":"41","author":"Bley","year":"2013","journal-title":"Electron. Notes Discret. Math."},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1002\/net.21511","article-title":"A survey of resource constrained shortest path problems: Exact solution approaches","volume":"62","author":"Pugliese","year":"2013","journal-title":"Networks"},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/trsc.2020.0985","article-title":"A bucket graph\u2014Based labeling algorithm with application to vehicle routing","volume":"55","author":"Sadykov","year":"2021","journal-title":"Transp. Sci."},{"key":"ref_41","unstructured":"Baldacci, R., Battarra, M., and Vigo, D. (2008). Routing a heterogeneous fleet of vehicles. The Vehicle Routing Problem: Latest Advances and New Challenges, Springer."},{"key":"ref_42","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/s10107-008-0218-9","article-title":"A unified exact method for solving different classes of vehicle routing problems","volume":"120","author":"Baldacci","year":"2009","journal-title":"Math. Program."},{"key":"ref_43","doi-asserted-by":"crossref","first-page":"723","DOI":"10.1016\/j.trc.2010.07.008","article-title":"A branch-and-cut-and-price algorithm for the multi-depot heterogeneous vehicle routing problem with time windows","volume":"19","author":"Bettinelli","year":"2011","journal-title":"Transp. Res. Part C Emerg. Technol."},{"key":"ref_44","unstructured":"Gendreau, M., Potvin, J.Y., Br\u00e4ysy, O., Hasle, G., and L\u00f8kketangen, A. (2008). Metaheuristics for the vehicle routing problem and its extensions: A categorized bibliography. The Vehicle Routing Problem: Latest Advances and New Challenges, Springer."},{"key":"ref_45","doi-asserted-by":"crossref","first-page":"2403","DOI":"10.1016\/j.cor.2005.09.012","article-title":"A general heuristic for vehicle routing problems","volume":"34","author":"Pisinger","year":"2007","journal-title":"Comput. Oper. Res."},{"key":"ref_46","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1016\/j.cor.2012.07.018","article-title":"A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows","volume":"40","author":"Vidal","year":"2013","journal-title":"Comput. Oper. Res."},{"key":"ref_47","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/s11721-007-0005-x","article-title":"Ant colony optimization for real-world vehicle routing problems","volume":"1","author":"Rizzoli","year":"2007","journal-title":"Swarm Intell."},{"key":"ref_48","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1051\/ro\/2009026","article-title":"Incorporating the strength of MIP modeling in schedule construction","volume":"43","author":"Hurkens","year":"2009","journal-title":"RAIRO-Oper. Res."},{"key":"ref_49","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1016\/j.trc.2015.06.016","article-title":"A real-life multi depot multi period vehicle routing problem with a heterogeneous fleet: Formulation and adaptive large neighborhood search based matheuristic","volume":"70","author":"Mancini","year":"2016","journal-title":"Transp. Res. Part C Emerg. Technol."},{"key":"ref_50","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1051\/ro:1999101","article-title":"A heuristic column generation method for the heterogeneous fleet VRP","volume":"33","author":"Taillard","year":"1999","journal-title":"RAIRO Oper. Res."},{"key":"ref_51","doi-asserted-by":"crossref","first-page":"658","DOI":"10.1016\/j.ejor.2013.09.045","article-title":"A unified solution framework for multi-attribute vehicle routing problems","volume":"234","author":"Vidal","year":"2014","journal-title":"Eur. J. Oper. Res."},{"key":"ref_52","doi-asserted-by":"crossref","first-page":"19007","DOI":"10.1007\/s00500-020-05333-5","article-title":"Solving technician routing and scheduling problem using improved particle swarm optimization","volume":"24","author":"Pekel","year":"2020","journal-title":"Soft Comput."},{"key":"ref_53","doi-asserted-by":"crossref","first-page":"104930","DOI":"10.1016\/j.cor.2020.104930","article-title":"A multiperiod workforce scheduling and routing problem with dependent tasks","volume":"118","author":"Pereira","year":"2020","journal-title":"Comput. Oper. Res."},{"key":"ref_54","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1016\/j.ejor.2014.03.006","article-title":"Branch-and-price and constraint programming for solving a real-life technician dispatching problem","volume":"238","author":"Gendreau","year":"2014","journal-title":"Eur. J. Oper. Res."},{"key":"ref_55","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/j.ejor.2016.06.058","article-title":"Branch-and-price approaches for the multiperiod technician routing and scheduling problem","volume":"257","author":"Zamorano","year":"2017","journal-title":"Eur. J. Oper. Res."},{"key":"ref_56","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s43069-020-00044-x","article-title":"Branch-and-price for a multi-attribute technician routing and scheduling problem","volume":"2","author":"Mathlouthi","year":"2021","journal-title":"SN Oper. Res. Forum"},{"key":"ref_57","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s10479-017-2642-9","article-title":"A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet","volume":"273","author":"Penna","year":"2019","journal-title":"Ann. Oper. Res."},{"key":"ref_58","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1002\/net.21959","article-title":"Adaptive large variable neighborhood search for a multiperiod vehicle and technician routing problem","volume":"76","author":"Graf","year":"2020","journal-title":"Networks"},{"key":"ref_59","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1002\/net.21961","article-title":"Columnwise neighborhood search: A novel set partitioning matheuristic and its application to the VeRoLog Solver Challenge 2019","volume":"76","author":"Jagtenberg","year":"2020","journal-title":"Networks"},{"key":"ref_60","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1002\/net.21962","article-title":"Exact and hyper-heuristic solutions for the distribution-installation problem from the VeRoLog 2019 challenge","volume":"76","author":"Kheiri","year":"2020","journal-title":"Networks"},{"key":"ref_61","unstructured":"Kastrati, V., Ahmeti, A., and Musliu, N. (2021, January 24\u201327). Solving Vehicle Routing and Scheduling with Delivery and Installation of Machines using ILS. Proceedings of the 13th International Conference on the Practice and Theory of Automated Timetabling-PATAT, Bruges, Belgium."},{"key":"ref_62","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1007\/s10951-011-0245-x","article-title":"An improved MIP-based approach for a multi-skill workforce scheduling problem","volume":"15","author":"Hurkens","year":"2012","journal-title":"J. Sched."},{"key":"ref_63","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1051\/ro\/2009025","article-title":"France Telecom workforce scheduling problem: A challenge","volume":"43","author":"Pokutta","year":"2009","journal-title":"RAIRO Oper. Res."},{"key":"ref_64","doi-asserted-by":"crossref","unstructured":"Estellon, B., Gardi, F., and Nouioua, K. (2009). High-Performance Local Search for Task Scheduling with Human Resource Allocation. International Workshop on Engineering Stochastic Local Search Algorithms, Springer.","DOI":"10.1007\/978-3-642-03751-1_1"},{"key":"ref_65","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1007\/s10951-010-0188-7","article-title":"Scheduling technicians and tasks in a telecommunications company","volume":"13","author":"Cordeau","year":"2010","journal-title":"J. Sched."},{"key":"ref_66","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/s10479-009-0545-0","article-title":"A GRASP-based approach for technicians and interventions scheduling for telecommunications","volume":"183","author":"Hashimoto","year":"2011","journal-title":"Ann. Oper. Res."},{"key":"ref_67","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1002\/1097-0037(200009)36:2<69::AID-NET1>3.0.CO;2-Q","article-title":"A polyhedral study of the asymmetric traveling salesman problem with time windows","volume":"36","author":"Ascheuer","year":"2000","journal-title":"Networks"},{"key":"ref_68","first-page":"637","article-title":"A comparative analysis of several asymmetric traveling salesman problem formulations","volume":"36","author":"Laporte","year":"2009","journal-title":"Comput."},{"key":"ref_69","doi-asserted-by":"crossref","first-page":"1018","DOI":"10.1287\/opre.28.4.1018","article-title":"An n-Constraint Formulation of the (Time-Dependent) Traveling Salesman Problem","volume":"28","author":"Fox","year":"1980","journal-title":"Oper. Res."},{"key":"ref_70","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1007\/s10732-018-9371-3","article-title":"A fix-and-optimize matheuristic for university timetabling","volume":"24","author":"Lindahl","year":"2018","journal-title":"J. Heuristics"},{"key":"ref_71","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s10107-003-0395-5","article-title":"Local branching","volume":"98","author":"Fischetti","year":"2003","journal-title":"Math Program."},{"key":"ref_72","doi-asserted-by":"crossref","unstructured":"Taillard, \u00c9., and Voss, S. (2002). POPMUSIC-Partial optimization metaheuristic under special intensification conditions. Essays and Surveys in Metaheuristics, Springer.","DOI":"10.1007\/978-1-4615-1507-4_27"},{"key":"ref_73","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1016\/j.cor.2017.06.021","article-title":"A combined multistart random constructive heuristic and set partitioning based formulation for the vehicle routing problem with time dependent travel time","volume":"88","author":"Mancini","year":"2017","journal-title":"Comput. Oper. Res."},{"key":"ref_74","doi-asserted-by":"crossref","first-page":"105475","DOI":"10.1016\/j.cor.2021.105475","article-title":"A POPMUSIC matheuristic for the capacitated vehicle routing problem","volume":"136","author":"Queiroga","year":"2021","journal-title":"Comput. Oper. Res."},{"key":"ref_75","first-page":"229","article-title":"Stabilized column generation","volume":"94","author":"Villeneuve","year":"1999","journal-title":"Discret. Math."},{"key":"ref_76","doi-asserted-by":"crossref","first-page":"1055","DOI":"10.1016\/j.cor.2009.09.010","article-title":"Variable Neighbourhood Decomposition Search for 0-1 Mixed Integer Programs","volume":"37","author":"Lazic","year":"2010","journal-title":"Comput. Oper. Res."},{"key":"ref_77","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1287\/trsc.1070.0223","article-title":"Tabu search, partial elementarity, and generalized k-path inequalities for the vehicle routing problem with time windows","volume":"42","author":"Desaulniers","year":"2008","journal-title":"Transp. Sci."},{"key":"ref_78","doi-asserted-by":"crossref","unstructured":"Desrosiers, J., and L\u00fcbbecke, M. (2005). A primer in column generation. Column Generation, Springer.","DOI":"10.1007\/0-387-25486-2_1"},{"key":"ref_79","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1016\/j.ifacol.2019.11.186","article-title":"Column generation for the discrete UC problem with min-stop ramping constraints","volume":"52","author":"Dupin","year":"2019","journal-title":"IFAC-PapersOnLine"},{"key":"ref_80","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1287\/opre.1120.1048","article-title":"A hybrid genetic algorithm for multidepot and periodic vehicle routing problems","volume":"60","author":"Vidal","year":"2012","journal-title":"Oper. Res."},{"key":"ref_81","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":"Appl. Soft Comput."},{"key":"ref_82","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1016\/j.ins.2018.01.027","article-title":"A hybrid particle swarm optimization algorithm using adaptive learning strategy","volume":"436","author":"Wang","year":"2018","journal-title":"Inf. Sci."},{"key":"ref_83","doi-asserted-by":"crossref","unstructured":"Nurcahyadi, T., and Blum, C. (2021). Adding Negative Learning to Ant Colony Optimization: A Comprehensive Study. Mathematics, 9.","DOI":"10.3390\/math9040361"},{"key":"ref_84","doi-asserted-by":"crossref","first-page":"856","DOI":"10.1016\/j.cor.2012.10.002","article-title":"The robust vehicle routing problem with time windows","volume":"40","author":"Agra","year":"2013","journal-title":"Comput. Oper. Res."},{"key":"ref_85","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/j.ejor.2007.05.055","article-title":"Multi-objective vehicle routing problems","volume":"189","author":"Jozefowiez","year":"2008","journal-title":"Eur. J. Oper. Res."},{"key":"ref_86","doi-asserted-by":"crossref","first-page":"105570","DOI":"10.1016\/j.cor.2021.105570","article-title":"An \u03b5-constraint column generation-and-enumeration algorithm for Bi-Objective Vehicle Routing Problems","volume":"138","author":"Glize","year":"2021","journal-title":"Comput. Oper. Res."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/14\/11\/313\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T07:24:37Z","timestamp":1760167477000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/14\/11\/313"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,27]]},"references-count":86,"journal-issue":{"issue":"11","published-online":{"date-parts":[[2021,11]]}},"alternative-id":["a14110313"],"URL":"https:\/\/doi.org\/10.3390\/a14110313","relation":{},"ISSN":["1999-4893"],"issn-type":[{"type":"electronic","value":"1999-4893"}],"subject":[],"published":{"date-parts":[[2021,10,27]]}}}