{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T02:01:43Z","timestamp":1776132103505,"version":"3.50.1"},"reference-count":73,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T00:00:00Z","timestamp":1572566400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T00:00:00Z","timestamp":1572566400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper Res Int J"],"published-print":{"date-parts":[[2021,9]]},"DOI":"10.1007\/s12351-019-00529-6","type":"journal-article","created":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T17:03:13Z","timestamp":1572627793000},"page":"1641-1661","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Two metaheuristics approaches for solving the traveling salesman problem: an Algerian waste collection case"],"prefix":"10.1007","volume":"21","author":[{"given":"Khalid","family":"Mekamcha","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mehdi","family":"Souier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hakim Nadhir","family":"Bessenouci","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammed","family":"Bennekrouf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,11,1]]},"reference":[{"issue":"17","key":"529_CR1","doi-asserted-by":"publisher","first-page":"6694","DOI":"10.1109\/JSEN.2016.2587730","volume":"16","author":"FB Abdelaziz","year":"2016","unstructured":"Abdelaziz FB, Mir H (2016) An optimization model and tabu search heuristic for scheduling of tasks on a radar sensor. IEEE Sens J 16(17):6694\u20136702","journal-title":"IEEE Sens J"},{"key":"529_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/s12351-018-0412-3","author":"MA Abdeljaoued","year":"2018","unstructured":"Abdeljaoued MA, Saadani NEH, Bahroun Z (2018) Heuristic and metaheuristic approaches for parallel machine scheduling under resource constraints. Oper Res. https:\/\/doi.org\/10.1007\/s12351-018-0412-3","journal-title":"Oper Res"},{"key":"529_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/s12351-018-0432-z","author":"KB Abdellafou","year":"2018","unstructured":"Abdellafou KB, Hadda H, Korbaa O (2018) Heuristic algorithms for scheduling intrees on m machines with non-availability constraints. Oper Res. https:\/\/doi.org\/10.1007\/s12351-018-0432-z","journal-title":"Oper Res"},{"issue":"4","key":"529_CR4","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1287\/trsc.2017.0791","volume":"52","author":"N Agatz","year":"2018","unstructured":"Agatz N, Bouman P, Schmidt M (2018) Optimization approaches for the traveling salesman problem with drone. Transp Sci 52(4):965\u2013981","journal-title":"Transp Sci"},{"key":"529_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/s12351-017-0332-7","author":"M Akbari","year":"2017","unstructured":"Akbari M, Molla-Alizadeh-Zavardehi S, Niroomand S (2017) Meta-heuristic approaches for fixed-charge solid transportation problem in two-stage supply chain network. Oper Res. https:\/\/doi.org\/10.1007\/s12351-017-0332-7","journal-title":"Oper Res"},{"issue":"1\u20132","key":"529_CR6","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10479-017-2675-0","volume":"269","author":"B Alidaee","year":"2018","unstructured":"Alidaee B, Ramalingam VP, Wang H, Kethley B (2018) Computational experiment of critical event tabu search for the general integer multidimensional knapsack problem. Ann of Oper Res 269(1\u20132):3\u201319","journal-title":"Ann of Oper Res"},{"issue":"1","key":"529_CR7","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1287\/trsc.1040.0103","volume":"40","author":"C Archetti","year":"2006","unstructured":"Archetti C, Speranza MG, Hertz A (2006) A tabu search algorithm for the split delivery vehicle routing problem. Transp Sci 40(1):64\u201373","journal-title":"Transp Sci"},{"issue":"4","key":"529_CR8","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1177\/0734242X09353435","volume":"28","author":"CA Arribas","year":"2010","unstructured":"Arribas CA, Blazquez CA, Lamas A (2010) Urban solid waste collection system using mathematical modelling and tools of geographic information systems. Waste Manag Res 28(4):355\u2013363","journal-title":"Waste Manag Res"},{"issue":"9","key":"529_CR9","doi-asserted-by":"publisher","first-page":"3020","DOI":"10.1016\/j.cor.2007.01.029","volume":"35","author":"J Bautista","year":"2008","unstructured":"Bautista J, Fern\u00e1ndez E, Pereira J (2008) Solving an urban waste collection problem using ants heuristics. Comput Oper Res 35(9):3020\u20133033","journal-title":"Comput Oper Res"},{"issue":"3","key":"529_CR10","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/j.omega.2004.10.004","volume":"34","author":"T Bektas","year":"2006","unstructured":"Bektas T (2006) The multiple traveling salesman problem: an overview of formulations and solution procedures. Omega 34(3):209\u2013219","journal-title":"Omega"},{"issue":"1","key":"529_CR11","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1287\/trsc.1120.0448","volume":"48","author":"J Beli\u00ebn","year":"2012","unstructured":"Beli\u00ebn J, De Boeck L, Van Ackere J (2012) Municipal solid waste collection and management problems: a literature review. Transp Sci 48(1):78\u2013102","journal-title":"Transp Sci"},{"issue":"1","key":"529_CR12","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1002\/net.3230040106","volume":"4","author":"EJ Beltrami","year":"1974","unstructured":"Beltrami EJ, Bodin LD (1974) Networks and vehicle routing for municipal waste collection. Networks 4(1):65\u201394","journal-title":"Networks"},{"issue":"12","key":"529_CR13","doi-asserted-by":"publisher","first-page":"2270","DOI":"10.1016\/j.cor.2010.03.019","volume":"37","author":"AM Benjamin","year":"2010","unstructured":"Benjamin AM, Beasley JE (2010) Metaheuristics for the waste collection vehicle routing problem with time windows, driver rest period and multiple disposal facilities. Comput Oper Res 37(12):2270\u20132280","journal-title":"Comput Oper Res"},{"issue":"4","key":"529_CR14","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1016\/j.wasman.2014.01.018","volume":"34","author":"X Bing","year":"2014","unstructured":"Bing X, de Keizer M, Bloemhof-Ruwaard JM, van der Vorst JG (2014) Vehicle routing for the eco-efficient collection of household plastic waste. Waste Manag 34(4):719\u2013729","journal-title":"Waste Manag"},{"issue":"4","key":"529_CR15","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1016\/j.orl.2003.10.001","volume":"32","author":"R Bosch","year":"2004","unstructured":"Bosch R, Herman A (2004) Continuous line drawings via the traveling salesman problem. Oper Res Lett 32(4):302\u2013303","journal-title":"Oper Res Lett"},{"issue":"1","key":"529_CR16","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/S0305-0548(01)00082-X","volume":"30","author":"M Bourgeois","year":"2003","unstructured":"Bourgeois M, Laporte G, Semet F (2003) Heuristics for the black and white traveling salesman problem. Comput Oper Res 30(1):75\u201385","journal-title":"Comput Oper Res"},{"issue":"4","key":"529_CR17","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1504\/IJOR.2016.077688","volume":"26","author":"C Changdar","year":"2016","unstructured":"Changdar C, Mahapatra GS, Pal RK (2016) A modified genetic algorithm-based approach to solve constrained solid TSP with time window using interval valued parameter. Int J Oper Res 26(4):398\u2013421","journal-title":"Int J Oper Res"},{"issue":"1","key":"529_CR18","first-page":"275","volume":"17","author":"SN Chaurasia","year":"2017","unstructured":"Chaurasia SN, Sundar S, Singh A (2017) Hybrid metaheuristic approaches for the single machine total stepwise tardiness problem with release dates. Oper Res 17(1):275\u2013295","journal-title":"Oper Res"},{"issue":"4","key":"529_CR19","first-page":"393","volume":"2","author":"G Dantzig","year":"1954","unstructured":"Dantzig G, Fulkerson R, Johnson S (1954) Solution of a large-scale traveling-salesman problem. J Oper Res Soc Am 2(4):393\u2013410","journal-title":"J Oper Res Soc Am"},{"issue":"3","key":"529_CR20","doi-asserted-by":"publisher","first-page":"825","DOI":"10.1016\/j.ejor.2016.03.006","volume":"253","author":"C Doppstadt","year":"2016","unstructured":"Doppstadt C, Koberstein A, Vigo D (2016) The hybrid electric vehicle\u2013traveling salesman problem. Eur J Oper Res 253(3):825\u2013842","journal-title":"Eur J Oper Res"},{"key":"529_CR21","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/j.eswa.2017.01.053","volume":"77","author":"AES Ezugwu","year":"2017","unstructured":"Ezugwu AES, Adewumi AO, Fr\u00eencu ME (2017) Simulated annealing based symbiotic organisms search optimization algorithm for traveling salesman problem. Expert Syst Appl 77:189\u2013210","journal-title":"Expert Syst Appl"},{"issue":"2","key":"529_CR22","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1287\/opre.1050.0218","volume":"54","author":"G Ghiani","year":"2006","unstructured":"Ghiani G, Laporte G, Semet F (2006) The black and white traveling salesman problem. Oper Res 54(2):366\u2013378","journal-title":"Oper Res"},{"issue":"3","key":"529_CR23","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F Glover","year":"1989","unstructured":"Glover F (1989) Tabu search: part I. ORSA J Comput 1(3):190\u2013206","journal-title":"ORSA J Comput"},{"issue":"3","key":"529_CR24","doi-asserted-by":"publisher","first-page":"908","DOI":"10.1016\/j.ejor.2017.04.061","volume":"262","author":"L Gouveia","year":"2017","unstructured":"Gouveia L, Leitner M, Ruthmair M (2017) Extended formulations and branch-and-cut algorithms for the Black-and-White traveling salesman problem. Eur J Oper Res 262(3):908\u2013928","journal-title":"Eur J Oper Res"},{"key":"529_CR25","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.wasman.2017.10.019","volume":"71","author":"MA Hannan","year":"2018","unstructured":"Hannan MA, Akhtar M, Begum RA, Basri H, Hussain A, Scavino E (2018) Capacitated vehicle-routing problem model for scheduled solid waste collection and route optimization using PSO algorithm. Waste Manag 71:31\u201341","journal-title":"Waste Manag"},{"issue":"3","key":"529_CR26","doi-asserted-by":"publisher","first-page":"036708","DOI":"10.1103\/PhysRevE.83.036708","volume":"83","author":"M Hasegawa","year":"2011","unstructured":"Hasegawa M (2011) Verification and rectification of the physical analogy of simulated annealing for the solution of the traveling salesman problem. Phys Rev E 83(3):036708","journal-title":"Phys Rev E"},{"issue":"5","key":"529_CR27","doi-asserted-by":"publisher","first-page":"871","DOI":"10.1287\/opre.25.5.871","volume":"25","author":"S Hong","year":"1977","unstructured":"Hong S, Padberg MW (1977) A note on the symmetric multiple traveling salesman problem with fixed charges. Oper Res 25(5):871\u2013874","journal-title":"Oper Res"},{"issue":"3","key":"529_CR28","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1016\/0377-2217(94)00093-R","volume":"83","author":"GH Huang","year":"1995","unstructured":"Huang GH, Baetz BW, Patry GG (1995) Grey integer programming: an application to waste management planning under uncertainty. Eur J Oper Res 83(3):594\u2013620","journal-title":"Eur J Oper Res"},{"issue":"3","key":"529_CR29","first-page":"219","volume":"8","author":"G Ioannou","year":"2008","unstructured":"Ioannou G, Kritikos MN, Prastacos GP (2008) An assignment-based heuristic for vehicle routing with time windows. Oper Res 8(3):219\u2013233","journal-title":"Oper Res"},{"issue":"4","key":"529_CR30","first-page":"460","volume":"25","author":"MOM Javad","year":"2017","unstructured":"Javad MOM, Karimi B (2017) A simulated annealing algorithm for solving multi-depot location routing problem with backhaul. Int J Ind Syst Eng 25(4):460\u2013477","journal-title":"Int J Ind Syst Eng"},{"key":"529_CR31","doi-asserted-by":"publisher","DOI":"10.1007\/s12351-018-0396-z","author":"Y Kaboudani","year":"2018","unstructured":"Kaboudani Y, Ghodsypour SH, Kia H, Shahmardan A (2018) Vehicle routing and scheduling in cross docks with forward and reverse logistics. Oper Res. https:\/\/doi.org\/10.1007\/s12351-018-0396-z","journal-title":"Oper Res"},{"issue":"3","key":"529_CR32","doi-asserted-by":"publisher","first-page":"1449","DOI":"10.1016\/j.ejor.2005.03.008","volume":"174","author":"I Kara","year":"2006","unstructured":"Kara I, Bektas T (2006) Integer linear programming formulations of multiple salesman problems and its variations. Eur J Oper Res 174(3):1449\u20131458","journal-title":"Eur J Oper Res"},{"issue":"12\u201313","key":"529_CR33","first-page":"45","volume":"6","author":"NV Karadimas","year":"2005","unstructured":"Karadimas NV, Kouzas G, Anagnostopoulos I, Loumos V (2005) Urban solid waste collection and routing: the ant colony strategic approach. Int J Simul 6(12\u201313):45\u201353","journal-title":"Int J Simul"},{"issue":"2","key":"529_CR34","doi-asserted-by":"publisher","first-page":"1275","DOI":"10.1007\/s00521-017-3069-6","volume":"31","author":"W Khaksar","year":"2019","unstructured":"Khaksar W, Hong TS, Sahari KSM, Khaksar M, Torresen J (2019) Sampling-based online motion planning for mobile robots: utilization of Tabu search and adaptive neuro-fuzzy inference system. Neural Comput Appl 31(2):1275\u20131289","journal-title":"Neural Comput Appl"},{"issue":"3","key":"529_CR35","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1504\/IJOR.2018.095627","volume":"33","author":"S Khambhampati","year":"2018","unstructured":"Khambhampati S, Calyam P, Zhang X (2018) A tabu search algorithm for a capacitated clustering problem. Int J Oper Res 33(3):387\u2013412","journal-title":"Int J Oper Res"},{"issue":"3","key":"529_CR36","doi-asserted-by":"publisher","first-page":"752","DOI":"10.1016\/S0377-2217(03)00133-4","volume":"156","author":"KH Kim","year":"2004","unstructured":"Kim KH, Park YM (2004) A crane scheduling method for port container terminals. Eur J Oper Res 156(3):752\u2013768","journal-title":"Eur J Oper Res"},{"issue":"12","key":"529_CR37","doi-asserted-by":"publisher","first-page":"3624","DOI":"10.1016\/j.cor.2005.02.045","volume":"33","author":"BI Kim","year":"2006","unstructured":"Kim BI, Kim S, Sahoo S (2006) Waste collection vehicle routing problem with time windows. Comput Oper Res 33(12):3624\u20133642","journal-title":"Comput Oper Res"},{"issue":"5","key":"529_CR38","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/j.trd.2009.03.001","volume":"14","author":"H Kim","year":"2009","unstructured":"Kim H, Yang J, Lee KD (2009) Vehicle routing in reverse logistics for recycling end-of-life consumer electronic goods in South Korea. Transp Res Part D Transp Environ 14(5):291\u2013299","journal-title":"Transp Res Part D Transp Environ"},{"issue":"2","key":"529_CR39","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1016\/j.ejor.2017.02.017","volume":"261","author":"J Kinable","year":"2017","unstructured":"Kinable J, Smeulders B, Delcour E, Spieksma FC (2017) Exact algorithms for the equitable traveling salesman problem. Eur J Oper Res 261(2):475\u2013485","journal-title":"Eur J Oper Res"},{"issue":"4598","key":"529_CR40","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220(4598):671\u2013680","journal-title":"Science"},{"issue":"23\u201324","key":"529_CR41","doi-asserted-by":"publisher","first-page":"9990","DOI":"10.1016\/j.apm.2016.06.025","volume":"40","author":"RJ Kuo","year":"2016","unstructured":"Kuo RJ, Wibowo BS, Zulvia FE (2016) Application of a fuzzy ant colony system to solve the dynamic vehicle routing problem with uncertain service time. Appl Math Model 40(23\u201324):9990\u201310001","journal-title":"Appl Math Model"},{"issue":"11","key":"529_CR42","doi-asserted-by":"publisher","first-page":"1017","DOI":"10.1057\/jors.1980.188","volume":"31","author":"G Laporte","year":"1980","unstructured":"Laporte G, Nobert Y (1980) A cutting planes algorithm for the m-salesmen problem. J Oper Res Soc 31(11):1017\u20131023","journal-title":"J Oper Res Soc"},{"issue":"16","key":"529_CR43","first-page":"55","volume":"7","author":"H Larki","year":"2014","unstructured":"Larki H, Yousefikhoshbakht M (2014) Solving the multiple traveling salesman problem by a novel meta-heuristic algorithm. J Opt Ind Eng 7(16):55\u201363","journal-title":"J Opt Ind Eng"},{"issue":"3","key":"529_CR44","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1016\/j.ejor.2017.05.039","volume":"263","author":"V Leggieri","year":"2017","unstructured":"Leggieri V, Haouari M (2017) Lifted polynomial size formulations for the homogeneous and heterogeneous vehicle routing problems. Eur J Oper Res 263(3):755\u2013767","journal-title":"Eur J Oper Res"},{"key":"529_CR45","doi-asserted-by":"publisher","first-page":"937","DOI":"10.1016\/j.asoc.2016.08.036","volume":"49","author":"Y Lin","year":"2016","unstructured":"Lin Y, Bian Z, Liu X (2016) Developing a dynamic neighborhood structure for an adaptive hybrid simulated annealing\u2013tabu search algorithm to solve the symmetrical traveling salesman problem. Appl Soft Comput 49:937\u2013952","journal-title":"Appl Soft Comput"},{"issue":"6","key":"529_CR46","doi-asserted-by":"publisher","first-page":"1463","DOI":"10.1287\/trsc.2017.0780","volume":"52","author":"FV Louveaux","year":"2018","unstructured":"Louveaux FV, Salazar-Gonz\u00e1lez JJ (2018) Exact approach for the vehicle routing problem with stochastic demands and preventive returns. Transp Sci 52(6):1463\u20131478","journal-title":"Transp Sci"},{"issue":"1","key":"529_CR47","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/BF02022093","volume":"21","author":"M Malek","year":"1989","unstructured":"Malek M, Guruswamy M, Pandya M, Owens H (1989) Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem. Ann Oper Res 21(1):59\u201384","journal-title":"Ann Oper Res"},{"issue":"1","key":"529_CR48","first-page":"27","volume":"7","author":"Y Marinakis","year":"2007","unstructured":"Marinakis Y, Migdalas A (2007) Annotated bibliography in vehicle routing. Oper Res 7(1):27\u201346","journal-title":"Oper Res"},{"key":"529_CR49","doi-asserted-by":"crossref","unstructured":"Mekamcha K, Bennekrouf M, Souier M (2018) Improvement of the municipal waste collection: the real case of city center of Tlemcen, Algeria. In: 2018 International colloquium on logistics and supply chain management (LOGISTIQUA), IEEE, pp 140\u2013145","DOI":"10.1109\/LOGISTIQUA.2018.8428267"},{"issue":"6","key":"529_CR50","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1063\/1.1699114","volume":"21","author":"N Metropolis","year":"1953","unstructured":"Metropolis N, Rosenbluth AW, Rosenbluth MN, Teller AH, Teller E (1953) Equation of state calculations by fast computing machines. J Chem Phys 21(6):1087\u20131092","journal-title":"J Chem Phys"},{"issue":"4","key":"529_CR51","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1145\/321043.321046","volume":"7","author":"CE Miller","year":"1960","unstructured":"Miller CE, Tucker AW, Zemlin RA (1960) Integer programming formulations and traveling salesman problems. J ACM (JACM) 7(4):326\u2013329","journal-title":"J ACM (JACM)"},{"issue":"2","key":"529_CR52","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1016\/S0377-2217(99)00045-4","volume":"121","author":"MC Mour\u00e3o","year":"2000","unstructured":"Mour\u00e3o MC, Almeida MT (2000) Lower-bounding and heuristic methods for a refuse collection vehicle routing problem. Eur J Oper Res 121(2):420\u2013434","journal-title":"Eur J Oper Res"},{"issue":"2","key":"529_CR53","first-page":"497","volume":"18","author":"K Murakami","year":"2018","unstructured":"Murakami K (2018) Formulation and algorithms for route planning problem of plug-in hybrid electric vehicles. Oper Res 18(2):497\u2013519","journal-title":"Oper Res"},{"key":"529_CR54","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.cor.2014.07.019","volume":"53","author":"I Muter","year":"2015","unstructured":"Muter I (2015) A new formulation and approach for the black and white traveling salesman problem. Comput Oper Res 53:96\u2013106","journal-title":"Comput Oper Res"},{"issue":"9","key":"529_CR55","doi-asserted-by":"publisher","first-page":"1013","DOI":"10.1016\/S0098-3004(96)00039-8","volume":"22","author":"RS Muttiah","year":"1996","unstructured":"Muttiah RS, Engel BA, Jones DD (1996) Waste disposal site selection using GIS-based simulated annealing. Comput Geosci 22(9):1013\u20131017","journal-title":"Comput Geosci"},{"issue":"2","key":"529_CR56","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1002\/net.3230040205","volume":"4","author":"CS Orloff","year":"1974","unstructured":"Orloff CS (1974) Routing a fleet of M vehicles to\/from a central facility. Networks 4(2):147\u2013162","journal-title":"Networks"},{"key":"529_CR57","doi-asserted-by":"publisher","DOI":"10.1007\/s11277-019-06440-9","author":"W Osamy","year":"2019","unstructured":"Osamy W, El-sawy AA, Khedr AM (2019) SATC: a simulated annealing based tree construction and scheduling algorithm for minimizing aggregation time in wireless sensor networks. Wirel Pers Commun. https:\/\/doi.org\/10.1007\/s11277-019-06440-9","journal-title":"Wirel Pers Commun"},{"key":"529_CR58","doi-asserted-by":"publisher","DOI":"10.1007\/s12351-019-00452-w","author":"M Rajabi-Bahaabadi","year":"2019","unstructured":"Rajabi-Bahaabadi M, Shariat-Mohaymany A, Babaei M, Vigo D (2019) Reliable vehicle routing problem in stochastic networks with correlated travel times. Oper Res. https:\/\/doi.org\/10.1007\/s12351-019-00452-w","journal-title":"Oper Res"},{"issue":"1","key":"529_CR59","first-page":"55","volume":"18","author":"V Riahi","year":"2018","unstructured":"Riahi V, Kazemi M (2018) A new hybrid ant colony algorithm for scheduling of no-wait flowshop. Oper Res 18(1):55\u201374","journal-title":"Oper Res"},{"issue":"12","key":"529_CR60","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0898-1221(97)00090-4","volume":"33","author":"KS Ruland","year":"1997","unstructured":"Ruland KS, Rodin EY (1997) The pickup and delivery problem: faces and branch-and-cut algorithm. Comput Math Appl 33(12):1\u201313","journal-title":"Comput Math Appl"},{"key":"529_CR61","unstructured":"Ryan JL, Bailey TG, Moore JT, Carlton WB (1998) Reactive tabu search in unmanned aerial reconnaissance simulations. In: 1998 Winter simulation conference proceedings (Cat. No. 98CH36274), IEEE, vol 1, pp 873\u2013879"},{"issue":"1","key":"529_CR62","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1504\/IJOR.2018.094229","volume":"33","author":"SK Sharma","year":"2018","unstructured":"Sharma SK, Routroy S, Yadav U (2018) Vehicle routing problem: recent literature review of its variants. Int J Oper Res 33(1):1\u201331","journal-title":"Int J Oper Res"},{"issue":"3","key":"529_CR63","doi-asserted-by":"publisher","first-page":"954","DOI":"10.1016\/j.ejor.2017.03.066","volume":"262","author":"MR Silva","year":"2017","unstructured":"Silva MR, Cunha CB (2017) A tabu search heuristic for the uncapacitated single allocation p-hub maximal covering problem. Eur J Oper Res 262(3):954\u2013965","journal-title":"Eur J Oper Res"},{"key":"529_CR64","unstructured":"Song CH, Lee K, Lee WD (2003) Extended simulated annealing for augmented TSP and multi-salesmen TSP. In: 2003 IEEE proceedings of the international joint conference on neural networks, vol 3, pp 2340\u20132343"},{"issue":"2","key":"529_CR65","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1287\/trsc.31.2.170","volume":"31","author":"\u00c9 Taillard","year":"1997","unstructured":"Taillard \u00c9, Badeau P, Gendreau M, Guertin F, Potvin JY (1997) A tabu search heuristic for the vehicle routing problem with soft time windows. Transp Sci 31(2):170\u2013186","journal-title":"Transp Sci"},{"issue":"1\u20132","key":"529_CR66","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/s10479-016-2237-x","volume":"270","author":"A Tayal","year":"2018","unstructured":"Tayal A, Singh SP (2018) Integrating big data analytic and hybrid firefly-chaotic simulated annealing approach for facility layout problem. Ann Oper Res 270(1\u20132):489\u2013514","journal-title":"Ann Oper Res"},{"key":"529_CR67","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/j.wasman.2018.03.015","volume":"76","author":"EB Tirkolaee","year":"2018","unstructured":"Tirkolaee EB, Mahdavi I, Esfahani MMS (2018) A robust periodic capacitated arc routing problem for urban waste collection considering drivers and crew\u2019s working time. Waste Manag 76:138\u2013146","journal-title":"Waste Manag"},{"issue":"4","key":"529_CR68","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1177\/0734242X0302100402","volume":"21","author":"P Viotti","year":"2003","unstructured":"Viotti P, Polettini A, Pomi R, Innocenti C (2003) Genetic algorithms as a promising tool for optimisation of the MSW collection routes. Waste Manag Res 21(4):292\u2013298","journal-title":"Waste Manag Res"},{"issue":"1","key":"529_CR69","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1287\/trsc.2017.0753","volume":"53","author":"H Wang","year":"2017","unstructured":"Wang H (2017) Routing and scheduling for a last-mile transportation system. Transp Sci 53(1):131\u2013147","journal-title":"Transp Sci"},{"key":"529_CR70","doi-asserted-by":"publisher","DOI":"10.1007\/s12351-018-0386-1","author":"S Wang","year":"2018","unstructured":"Wang S, Rao W, Hong Y (2018) A distance matrix based algorithm for solving the traveling salesman problem. Oper Res. https:\/\/doi.org\/10.1007\/s12351-018-0386-1","journal-title":"Oper Res"},{"key":"529_CR71","doi-asserted-by":"publisher","DOI":"10.1007\/s12351-018-0403-4","author":"H Yahyaoui","year":"2018","unstructured":"Yahyaoui H, Kaabachi I, Krichen S, Dekdouk A (2018) Two metaheuristic approaches for solving the multi-compartment vehicle routing problem. Oper Res. https:\/\/doi.org\/10.1007\/s12351-018-0403-4","journal-title":"Oper Res"},{"key":"529_CR72","first-page":"1","volume":"2017","author":"AA Zaidan","year":"2017","unstructured":"Zaidan AA, Atiya B, Bakar MA, Zaidan BB (2017) A new hybrid algorithm of simulated annealing and simplex downhill for solving multiple-objective aggregate production planning on fuzzy environment. Neural Comput Appl 2017:1\u201312","journal-title":"Neural Comput Appl"},{"key":"529_CR73","doi-asserted-by":"publisher","DOI":"10.1007\/s12351-019-00480-6","author":"Y Zhao","year":"2019","unstructured":"Zhao Y, Leng L, Zhang C (2019) A novel framework of hyper-heuristic approach and its application in location-routing problem with simultaneous pickup and delivery. Oper Res. https:\/\/doi.org\/10.1007\/s12351-019-00480-6","journal-title":"Oper Res"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-019-00529-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12351-019-00529-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-019-00529-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,4]],"date-time":"2021-09-04T01:06:36Z","timestamp":1630717596000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12351-019-00529-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,1]]},"references-count":73,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,9]]}},"alternative-id":["529"],"URL":"https:\/\/doi.org\/10.1007\/s12351-019-00529-6","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"value":"1109-2858","type":"print"},{"value":"1866-1505","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,11,1]]},"assertion":[{"value":"17 December 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 October 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 October 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 November 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}