{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T11:55:59Z","timestamp":1774007759930,"version":"3.50.1"},"reference-count":53,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2021,7,23]],"date-time":"2021-07-23T00:00:00Z","timestamp":1626998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,7,23]],"date-time":"2021-07-23T00:00:00Z","timestamp":1626998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper Res Int J"],"published-print":{"date-parts":[[2022,9]]},"DOI":"10.1007\/s12351-021-00663-0","type":"journal-article","created":{"date-parts":[[2021,7,23]],"date-time":"2021-07-23T11:02:56Z","timestamp":1627038176000},"page":"4253-4285","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Decomposition algorithm for the multi-trip single vehicle routing problem with AND-type precedence constraints"],"prefix":"10.1007","volume":"22","author":[{"given":"Mina","family":"Roohnavazfar","sequence":"first","affiliation":[]},{"given":"Seyed Hamid Reza","family":"Pasandideh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,7,23]]},"reference":[{"key":"663_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3390\/a12120250","volume":"12","author":"A Agnetis","year":"2019","unstructured":"Agnetis A, Rossi F, Smriglio S (2019) Some results on shop scheduling with S-precedence constraints among job tasks. Algorithms 12:1\u201312","journal-title":"Algorithms"},{"key":"663_CR2","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/j.endm.2013.05.102","volume":"41","author":"F Angel-Bello","year":"2013","unstructured":"Angel-Bello F, Martinez-Salazar I, Alvarez A (2013) Minimizing waiting times in a route design problem with multiple use of a single vehicle. J Electron Notes Discrete Math 41:269\u2013276","journal-title":"J Electron Notes Discrete Math"},{"key":"663_CR3","unstructured":"Augerat P, Belenguer J, Benavent E, Corberan A, Naddef D, Rinaldi G (1995) Computational results with a branch and cut code for the capacitated vehicle routing problem. Tech. Rep. 949-M, Universit e Joseph Fourier, Grenoble, France"},{"key":"663_CR4","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1016\/j.ejor.2006.02.019","volume":"178","author":"N Azi","year":"2007","unstructured":"Azi N, Gendreau M, Potvin J-Y, Schneide M (2007) An exact algorithm for a single-vehicle routing problem with time windows and multiple routes. Eur J Oper Res 178:755\u2013766","journal-title":"Eur J Oper Res"},{"key":"663_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.omega.2019.01.003","volume":"93","author":"R Barzanji","year":"2020","unstructured":"Barzanji R, Naderi B, Begen M (2020) Decomposition algorithms for the integrated process planning and scheduling problem. Omega 93:1\u201313","journal-title":"Omega"},{"key":"663_CR6","first-page":"1","volume":"17","author":"X Bai","year":"2019","unstructured":"Bai X, Cao M, Ge SS (2019) Efficient routing for precedence-constrained package delivery for heterogeneous vehicles. J IEEE Trans Autom 17:1\u201313","journal-title":"J IEEE Trans Autom"},{"key":"663_CR7","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.jda.2013.04.002","volume":"21","author":"HJ Bockenhauer","year":"2013","unstructured":"Bockenhauer HJ, Momke T, Steinova M (2013) Improved approximations for TSP with simple precedence constraints. J Discrete Algorithms 21:32\u201340","journal-title":"J Discrete Algorithms"},{"key":"663_CR8","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.ejor.2007.07.033","volume":"191","author":"D Bredstrom","year":"2008","unstructured":"Bredstrom D, Ronnqvist M (2008) Combined vehicle routing and scheduling with temporal precedence and synchronization constraints. Eur J Oper Res 191:19\u201331","journal-title":"Eur J Oper Res"},{"key":"663_CR9","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/s10288-016-0306-2","volume":"14","author":"D Cattaruzz","year":"2016","unstructured":"Cattaruzz D, Absi N, Feillet D (2016) Vehicle routing problems with multiple trips. J Oper Res 14:223\u2013259","journal-title":"J Oper Res"},{"key":"663_CR10","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/s10479-018-2988-7","volume":"271","author":"D Cattaruzz","year":"2018","unstructured":"Cattaruzz D, Absi N, Feillet D (2018) Vehicle routing problems with multiple trips. J Ann Oper Res 271:127\u2013159","journal-title":"J Ann Oper Res"},{"key":"663_CR11","doi-asserted-by":"publisher","first-page":"6361","DOI":"10.1080\/00207543.2016.1251625","volume":"55","author":"T Chabot","year":"2017","unstructured":"Chabot T, Lahyani R, Coelho LC, Renaud J (2017) Order picking problems under weight, fragility and category constraints. Int J Prod Res 55:6361\u20136379","journal-title":"Int J Prod Res"},{"key":"663_CR12","doi-asserted-by":"publisher","first-page":"7758","DOI":"10.1016\/j.eswa.2008.09.001","volume":"36","author":"CB Cheng","year":"2009","unstructured":"Cheng CB, Wang KP (2009) Solving a vehicle routing problem with time windows by a decomposition technique and a genetic algorithm. Expert Syst Appl 36:7758\u20137763","journal-title":"Expert Syst Appl"},{"key":"663_CR13","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/j.endm.2018.07.025","volume":"69","author":"M Casazza","year":"2018","unstructured":"Casazza M, Ceselli A, Wolfler-Calvo R (2018) A branch and price approach for the split pickup and split delivery VRP. Electron Notes Discrete Math 69:189\u2013196","journal-title":"Electron Notes Discrete Math"},{"key":"663_CR14","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1017\/S0269888916000254","volume":"31","author":"AA Cire","year":"2016","unstructured":"Cire AA, Coban E, Hooker JN (2016) Logic-based Benders decomposition for planning and scheduling: a computational analysis. Knowl Eng Rev 31:440\u2013451","journal-title":"Knowl Eng Rev"},{"key":"663_CR15","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s10479-007-0170-8","volume":"153","author":"JF Cordeau","year":"2007","unstructured":"Cordeau JF, Laporte G (2007) The dial-a-ride problem: models and algorithms. J Annu Oper Res 153:29\u201346","journal-title":"J Annu Oper Res"},{"key":"663_CR17","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1287\/inte.1040.0083","volume":"34","author":"R Dekker","year":"2004","unstructured":"Dekker R, deKoster MBM, Roodbergen KJ, Van Kalleveen H (2004) Improving order-picking response time at Ankor\u2019s warehouse. Interfaces 34:303\u2013313","journal-title":"Interfaces"},{"key":"663_CR18","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1016\/j.cie.2010.07.001","volume":"61","author":"R Derriesel","year":"2011","unstructured":"Derriesel R, Monch L (2011) Variable neighbourhood search approaches for scheduling jobs on parallel machines with sequence-dependent setup times, precedence constraints, and ready times. Comput Ind Eng 61:336\u2013345","journal-title":"Comput Ind Eng"},{"key":"663_CR20","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1111\/j.1475-3995.2000.tb00196.x","volume":"7","author":"K Fagerholt","year":"2000","unstructured":"Fagerholt K, Christiansen M (2000) A travelling salesman problem with allocation time window and precedence constraints an application to ship scheduling. J Int Trans Oper Res 7:231\u2013244","journal-title":"J Int Trans Oper Res"},{"key":"663_CR21","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1287\/ijoc.1110.0458","volume":"24","author":"M Fazel-Zarandi","year":"2012","unstructured":"Fazel-Zarandi M, Beck C (2012) Using logic-based benders decomposition to solve the capacity- and distance-constrained plant location problem. Informs J Comput 24:387\u2013398","journal-title":"Informs J Comput"},{"key":"663_CR22","first-page":"1","volume":"148","author":"R Faganello Fachini","year":"2020","unstructured":"Faganello Fachini R, Armentano VA (2020) Logic-based Benders decomposition for the heterogeneous fixed fleet vehicle routing problem with time windows. Comput Ind Eng 148:1\u201318","journal-title":"Comput Ind Eng"},{"key":"663_CR23","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1002\/net.3230110205","volume":"11","author":"R Fisher","year":"1981","unstructured":"Fisher R, Jaikumar VA (1981) A generalized assignment heuristic for vehicle routing. Networks 11:109\u2013124","journal-title":"Networks"},{"key":"663_CR24","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1016\/j.ejor.2015.11.020","volume":"251","author":"R Gedik","year":"2016","unstructured":"Gedik R, Rainwater C, Nachtmann H, Pohl EA (2016) Analysis of a parallel machine scheduling problem with sequence dependent setup times and job availability intervals. Eur J Oper Res 251:640\u2013650","journal-title":"Eur J Oper Res"},{"key":"663_CR25","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1137\/S0097539791218664","volume":"24","author":"DW Gillies","year":"1995","unstructured":"Gillies DW, Liu WS (1995) Scheduling tasks with AND\/OR precedence constraints. SIAM J Comput 24:797\u2013810","journal-title":"SIAM J Comput"},{"key":"663_CR26","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/s10951-008-0064-x","volume":"11","author":"VS Gordon","year":"2008","unstructured":"Gordon VS, Potts CN, Strusevich VA, Whitehead JD (2008) Single machine scheduling models with deterioration and learning: handling precedence constraints via priority generation. Scheduling 11:357\u2013370","journal-title":"Scheduling"},{"key":"663_CR27","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1142\/S0218195999000248","volume":"9","author":"MH Goldwasser","year":"1999","unstructured":"Goldwasser MH, Motwani R (1999) Complexity measures for assembly sequences. Int J Comput Geom Appl 9:371\u2013418","journal-title":"Int J Comput Geom Appl"},{"key":"663_CR29","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1016\/j.trb.2018.02.001","volume":"111","author":"S Ho","year":"2018","unstructured":"Ho S, Szeto WY, Luo YH, Leung JMY, Petering M, Tou JMY (2018) A survey of dial-a-ride problems: literature review and recent developments. Transp Res Part B 111:395\u2013421","journal-title":"Transp Res Part B"},{"key":"663_CR31","doi-asserted-by":"publisher","first-page":"1979","DOI":"10.1080\/00207543.2011.561375","volume":"50","author":"S Lee","year":"2012","unstructured":"Lee S, Moon I, Bae H, Kim J (2012) Flexible job-shop scheduling problems with AND\/OR precedence constraints. Int J Prod Res 50:1979\u20132001","journal-title":"Int J Prod Res"},{"key":"663_CR33","doi-asserted-by":"publisher","first-page":"1312","DOI":"10.1057\/jors.2014.92","volume":"66","author":"I Martinez-Salazar","year":"2014","unstructured":"Martinez-Salazar I, Angel-Bello F, Alvarez A, Schneide M (2014) A customer-centric routing problem with multiple trips of a single vehicle. J Oper Res Soc 66:1312\u20131323","journal-title":"J Oper Res Soc"},{"key":"663_CR34","doi-asserted-by":"publisher","first-page":"968","DOI":"10.1016\/j.ejor.2013.06.001","volume":"236","author":"M Matusiak","year":"2014","unstructured":"Matusiak M, De-Koster R, Saarinen J (2014) A fast simulated annealing method for batching precedence-constrained customer orders in a warehouse. Eur J Oper Res 236:968\u2013977","journal-title":"Eur J Oper Res"},{"key":"663_CR35","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1287\/opre.45.3.365","volume":"45","author":"A Mingozzi","year":"1997","unstructured":"Mingozzi A, Bianco L, Ricciardelli A (1997) Dynamic programming strategies for the TSP with time windows and precedence constraints. J Oper Res 45:365\u2013377","journal-title":"J Oper Res"},{"key":"663_CR36","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/j.cor.2018.05.004","volume":"98","author":"PL Miranda","year":"2018","unstructured":"Miranda PL, Cordeau JF, Ferreira D, Jans R, Morabito R (2018) A decomposition heuristic for a rich production routing problem. Comput Oper Res 98:211\u2013230","journal-title":"Comput Oper Res"},{"key":"663_CR37","first-page":"295","volume":"259","author":"Y Molenbruch","year":"2017","unstructured":"Molenbruch Y, Braekers K, Caris A, Schneide M (2017) Typology and literature review for dial-a-ride problems. J Expert Syst Appl 259:295\u2013325","journal-title":"J Expert Syst Appl"},{"key":"663_CR38","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1137\/S009753970037727X","volume":"33","author":"RH Mohring","year":"2004","unstructured":"Mohring RH, Skutella M, Stork F (2004) Scheduling with AND\/OR precedence constraints. SIAM J Comput 33:393\u2013415","journal-title":"SIAM J Comput"},{"key":"663_CR39","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1016\/S0377-2217(01)00227-2","volume":"140","author":"C Moon","year":"2002","unstructured":"Moon C, Kim J, Choi G, Seo Y (2002) An efficient genetic algorithm for the traveling salesman problem with precedence constraints. Eur J Oper Res 140:606\u2013617","journal-title":"Eur J Oper Res"},{"key":"663_CR43","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10951-017-0519-z","volume":"21","author":"D Prot","year":"2018","unstructured":"Prot D, Bellenguez-Morineau O (2018) How the structure of precedence constraints may change the complexity class of scheduling problems. J Sched 21:3\u201316","journal-title":"J Sched"},{"key":"663_CR44","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1016\/j.eswa.2016.09.002","volume":"66","author":"S R-A-Haddadene","year":"2016","unstructured":"R-A-Haddadene S, Labadie N, Prodho C, Schneide M (2016) A GRASP \u00d7 ILS for the vehicle routing problem with time windows, synchronization and precedence constraints. J Expert Syst Appl 66:274\u2013294","journal-title":"J Expert Syst Appl"},{"key":"663_CR45","doi-asserted-by":"crossref","unstructured":"Rabbouch B, Saadaoui F, Mraihi R (2019) Efficient implementation of the genetic algorithm to solve rich vehicle routing problems. Oper Res 1\u201329","DOI":"10.1007\/s12351-019-00521-0"},{"key":"663_CR46","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/0952813X.2019.1652356","volume":"32","author":"B Rabbouch","year":"2020","unstructured":"Rabbouch B, Saadaoui F, Mraihi R (2020) Empirical-type simulated annealing for solving the capacitated vehicle routing problem. J Exp Theor Artif Intell 32:1\u201316","journal-title":"J Exp Theor Artif Intell"},{"key":"663_CR47","doi-asserted-by":"publisher","first-page":"905","DOI":"10.1016\/S0305-0548(99)00066-0","volume":"27","author":"J Renaud","year":"2000","unstructured":"Renaud J, Boctor FF, Ouenniche J (2000) A heuristic for the pickup and delivery traveling salesman problem. J Comput Oper Res 27:905\u2013916","journal-title":"J Comput Oper Res"},{"key":"663_CR48","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.ejor.2015.08.067","volume":"249","author":"JC Rivera","year":"2016","unstructured":"Rivera JC, Afsar HM, Prins C (2016) Mathematical formulations and exact algorithm for the multitrip cumulative capacitated single-vehicle routing problem. Eur J Oper Res 249:93\u2013104","journal-title":"Eur J Oper Res"},{"key":"663_CR49","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1016\/j.ejor.2016.06.015","volume":"255","author":"A Riise","year":"2016","unstructured":"Riise A, Mannino C, Lamorgese L (2016) Recursive logic-based Benders\u2019 decomposition for multi-mode outpatient scheduling. Eur J Oper Res 255:719\u2013728","journal-title":"Eur J Oper Res"},{"key":"663_CR50","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1287\/trsc.1050.0135","volume":"40","author":"S Ropke","year":"2006","unstructured":"Ropke S, Pisinger D (2006) An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. J Transp Sci 40:455\u2013472","journal-title":"J Transp Sci"},{"key":"663_CR51","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1016\/j.ejor.2016.08.024","volume":"257","author":"V Roshanaei","year":"2017","unstructured":"Roshanaei V, Luong C, Aleman D, Urbach D (2017) Propagating logic-based Benders\u2019 decomposition approaches for distributed operating room scheduling. Eur J Oper Res 257:439\u2013455","journal-title":"Eur J Oper Res"},{"key":"663_CR52","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.orl.2004.03.007","volume":"33","author":"SC Sarin","year":"2005","unstructured":"Sarin SC, Sherali HD, Bhootra A (2005) New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints. Oper Res Lett 33:62\u201370","journal-title":"Oper Res Lett"},{"key":"663_CR54","unstructured":"Sen A, Bulbul K, Feillet D (2018) A survey on multi trip vehicle routing problem. In: International logistics and supply chain congress"},{"key":"663_CR56","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1016\/j.ejor.2019.02.025","volume":"277","author":"R Soares","year":"2019","unstructured":"Soares R, Marques A, Amorim P, Rasinmaki J (2019) Multiple vehicle synchronisation in a full truck-load pickup and delivery problem: a case-study in the biomass supply chain. Eur J Oper Res 277:174\u2013194","journal-title":"Eur J Oper Res"},{"key":"663_CR57","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718515","volume-title":"The vehicle routing problem","author":"P Toth","year":"2002","unstructured":"Toth P, Vigo D (2002) The vehicle routing problem. Society for Industrial and Applied Mathematics, Philadelphia"},{"key":"663_CR59","unstructured":"Tran TT, Beck JC (2012) Logic-based benders decomposition for alternative resource scheduling with sequence dependent setups. In: Proceedings of the 20th European conference on artificial intelligence, pp 774\u2013779"},{"key":"663_CR61","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.tre.2019.03.018","volume":"126","author":"O Unsal","year":"2019","unstructured":"Unsal O, Oguz C (2019) An exact algorithm for integrated planning of operations in dry bulk terminals. Transp Res Part E Log Transp Rev 126:103\u2013121","journal-title":"Transp Res Part E Log Transp Rev"},{"key":"663_CR62","doi-asserted-by":"publisher","first-page":"648","DOI":"10.1007\/11841036_58","volume":"4168","author":"JM Van Den Akker","year":"2005","unstructured":"Van Den Akker JM, Hoogeveen JA, van Kempen JW (2005) Parallel machine scheduling through column generation: minimax objective functions, release dates, deadlines, and\/or generalized precedence constraints. Lect Notes Comput Sci 4168:648\u2013659","journal-title":"Lect Notes Comput Sci"},{"key":"663_CR63","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/s10845-009-0296-4","volume":"22","author":"Y Yun","year":"2011","unstructured":"Yun Y, Moon C (2011) Genetic algorithm approach for precedence constrained sequencing problems. J Intell Manuf 22:379\u2013388","journal-title":"J Intell Manuf"},{"key":"663_CR64","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1016\/j.ejor.2019.09.041","volume":"282","author":"A Zhang","year":"2020","unstructured":"Zhang A, Qi X, Li G (2020) Machine scheduling with soft precedence constraints. Eur J Oper Res 282:491\u2013505","journal-title":"Eur J Oper Res"},{"key":"663_CR65","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1016\/j.cie.2018.06.015","volume":"123","author":"I Zulj","year":"2018","unstructured":"Zulj I, H-Glock C, H-Grosse E, Schneide M (2018) Picker routing and storage-assignment strategies for precedence-constrained order picking. J Comput Ind Eng 123:338\u2013347","journal-title":"J Comput Ind Eng"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-021-00663-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12351-021-00663-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-021-00663-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,5]],"date-time":"2023-02-05T07:31:47Z","timestamp":1675582307000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12351-021-00663-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,23]]},"references-count":53,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["663"],"URL":"https:\/\/doi.org\/10.1007\/s12351-021-00663-0","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"value":"1109-2858","type":"print"},{"value":"1866-1505","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,7,23]]},"assertion":[{"value":"24 January 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 May 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 July 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 July 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}