Decomposition algorithm for the multi-trip single vehicle routing problem with AND-type precedence constraints

This paper addresses a new variant of the multi-trip single vehicle routing problem where the nodes are related to each other through AND-type precedence constraints. The problem aims at determining a sequence of trips to visit all the nodes respecting every precedence constraint within and among th...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Operational research Ročník 22; číslo 4; s. 4253 - 4285
Hlavní autoři:	Roohnavazfar, Mina, Pasandideh, Seyed Hamid Reza
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Berlin/Heidelberg Springer Berlin Heidelberg 01.09.2022 Springer Nature B.V
Témata:	Algorithms Benders decomposition Business and Management Computational Intelligence Integer programming Management Science Mixed integer Nodes Operations Research Operations Research/Decision Theory Optimization Original Paper Precedence constraints Route planning Vehicle routing AND-type precedence constraints Capacitated single vehicle routing problem Logic based benders decomposition algorithm Multiple trips
ISSN:	1109-2858, 1866-1505
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Abstract	This paper addresses a new variant of the multi-trip single vehicle routing problem where the nodes are related to each other through AND-type precedence constraints. The problem aims at determining a sequence of trips to visit all the nodes respecting every precedence constraint within and among the routes so to minimize the total traveling cost. Our motivation comes from routing problems where a node may have a set of predecessors (not just single one proposed in the dial-a-ride or pickup and delivery problems) resulting in a set of pairwise relations that specify which customers need to be visited before which other ones. We develop three Mixed Integer Programming models to formulate the problem. The models are experimentally compared to determine the best one. Moreover, a solution approach based on the Logic-Based Benders Decomposition algorithm is developed which allows to decompose the original problem into an assignment master problem and independent sequencing subproblems. A new valid optimality cut is devised to achieve faster convergence. The cut performance is experimentally investigated by comparing with a recently proposed one in the literature. We further relax the algorithm to find the sub-optimal solution and demonstrate its efficiency. Extensive computational experiments are conducted to assess the proposed algorithms in terms of solution quality and CPU time.
AbstractList	This paper addresses a new variant of the multi-trip single vehicle routing problem where the nodes are related to each other through AND-type precedence constraints. The problem aims at determining a sequence of trips to visit all the nodes respecting every precedence constraint within and among the routes so to minimize the total traveling cost. Our motivation comes from routing problems where a node may have a set of predecessors (not just single one proposed in the dial-a-ride or pickup and delivery problems) resulting in a set of pairwise relations that specify which customers need to be visited before which other ones. We develop three Mixed Integer Programming models to formulate the problem. The models are experimentally compared to determine the best one. Moreover, a solution approach based on the Logic-Based Benders Decomposition algorithm is developed which allows to decompose the original problem into an assignment master problem and independent sequencing subproblems. A new valid optimality cut is devised to achieve faster convergence. The cut performance is experimentally investigated by comparing with a recently proposed one in the literature. We further relax the algorithm to find the sub-optimal solution and demonstrate its efficiency. Extensive computational experiments are conducted to assess the proposed algorithms in terms of solution quality and CPU time.
Author	Roohnavazfar, Mina Pasandideh, Seyed Hamid Reza
Author_xml	– sequence: 1 givenname: Mina surname: Roohnavazfar fullname: Roohnavazfar, Mina organization: Department of Industrial Engineering, Faculty of Engineering, Kharazmi University, Department of Control and Computer Engineering, Politecnico di Torino – sequence: 2 givenname: Seyed Hamid Reza surname: Pasandideh fullname: Pasandideh, Seyed Hamid Reza email: shr_pasandideh@khu.ac.ir organization: Department of Industrial Engineering, Faculty of Engineering, Kharazmi University
BookMark	eNp9kEtLAzEQgINUsGr_gKeA52gebnb3WOoTRC-9h2x2tk3ZTdYkVfrvTa0geGggTBjmm5l852jivAOErhi9YZSWt5FxUTBCeb5USkHoCZqySkrCClpM8pvRmvCqqM7QLMYNzUfwsrqrpsjdg_HD6KNN1jus-5UPNq0H3PmA0xrwsO2TJSnYEUfrVj3gT1hbk2Pw25QzeAy-6WHAX5nD87d7knYj5CwYaMEZwMa7mIK2LsVLdNrpPsLsN16g5ePDcvFMXt-fXhbzV2JEKRPRXBqQspVd0zR1C1A0UHeaFtwYXdZN2zHZlpwyzQUXEnjXFlJXNWsK3VRCXKDrQ9u828cWYlIbvw0uT1S8pEKWgooyV_FDlQk-xgCdGoMddNgpRtXerDqYVdms-jGraIaqf5CxSe_l7b_YH0fFAY15jltB-NvqCPUNviGR5A
CitedBy_id	crossref_primary_10_1080_23249935_2024_2338249 crossref_primary_10_1007_s12351_025_00905_5 crossref_primary_10_1080_21681015_2024_2405113
Cites_doi	10.1007/s10845-009-0296-4 10.1016/j.ejor.2019.02.025 10.3390/a12120250 10.1287/opre.45.3.365 10.1016/j.ejor.2013.06.001 10.1016/j.ejor.2016.06.015 10.1007/s10288-016-0306-2 10.1080/0952813X.2019.1652356 10.1016/j.cor.2018.05.004 10.1016/S0377-2217(01)00227-2 10.1016/j.jda.2013.04.002 10.1017/S0269888916000254 10.1002/net.3230110205 10.1007/s10951-008-0064-x 10.1007/s10479-018-2988-7 10.1016/j.ejor.2016.08.024 10.1007/s10951-017-0519-z 10.1016/j.orl.2004.03.007 10.1016/j.ejor.2006.02.019 10.1016/j.ejor.2015.11.020 10.1057/jors.2014.92 10.1137/S009753970037727X 10.1080/00207543.2016.1251625 10.1080/00207543.2011.561375 10.1016/j.cie.2018.06.015 10.1287/inte.1040.0083 10.1016/j.trb.2018.02.001 10.1007/11841036_58 10.1007/s10479-007-0170-8 10.1016/S0305-0548(99)00066-0 10.1016/j.ejor.2007.07.033 10.1007/s12351-019-00521-0 10.1137/1.9780898718515 10.1287/ijoc.1110.0458 10.1142/S0218195999000248 10.1016/j.eswa.2016.09.002 10.1016/j.ejor.2019.09.041 10.1287/trsc.1050.0135 10.1016/j.cie.2010.07.001 10.1016/j.omega.2019.01.003 10.1016/j.eswa.2008.09.001 10.1016/j.tre.2019.03.018 10.1137/S0097539791218664 10.1016/j.endm.2013.05.102 10.1016/j.ejor.2015.08.067 10.1016/j.endm.2018.07.025 10.1111/j.1475-3995.2000.tb00196.x
ContentType	Journal Article
Copyright	The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2021 The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2021.
Copyright_xml	– notice: The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2021 – notice: The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2021.
DBID	AAYXX CITATION 3V. 7TB 7WY 7WZ 7XB 87Z 8FD 8FE 8FG 8FK 8FL ABJCF ABUWG AFKRA BENPR BEZIV BGLVJ CCPQU DWQXO FR3 FRNLG F~G HCIFZ K60 K6~ K8~ KR7 L.- L6V M0C M7S PHGZM PHGZT PKEHL PQBIZ PQBZA PQEST PQGLB PQQKQ PQUKI PRINS PTHSS Q9U
DOI	10.1007/s12351-021-00663-0
DatabaseName	CrossRef ProQuest Central (Corporate) Mechanical & Transportation Engineering Abstracts ABI/INFORM Collection ABI/INFORM Global (PDF only) ProQuest Central (purchase pre-March 2016) ABI/INFORM Global (Alumni Edition) Technology Research Database ProQuest SciTech Collection ProQuest Technology Collection ProQuest Central (Alumni) (purchase pre-March 2016) ABI/INFORM Collection (Alumni Edition) Materials Science & Engineering Collection (subscription) ProQuest Central (Alumni) ProQuest Central UK/Ireland ProQuest Central Business Premium Collection Technology collection ProQuest One Community College ProQuest Central Engineering Research Database Business Premium Collection (Alumni) ABI/INFORM Global (Corporate) SciTech Premium Collection ProQuest Business Collection (Alumni Edition) ProQuest Business Collection DELNET Management Collection Civil Engineering Abstracts ABI/INFORM Professional Advanced ProQuest Engineering Collection ABI/INFORM Global Engineering Database ProQuest Central Premium ProQuest One Academic ProQuest One Academic Middle East (New) ProQuest One Business (UW System Shared) ProQuest One Business (Alumni) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central China Engineering collection ProQuest Central Basic
DatabaseTitle	CrossRef ABI/INFORM Global (Corporate) ProQuest Business Collection (Alumni Edition) ProQuest One Business Technology Collection Technology Research Database ProQuest One Academic Middle East (New) Mechanical & Transportation Engineering Abstracts ProQuest Central (Alumni Edition) SciTech Premium Collection ProQuest One Community College ProQuest Central China ABI/INFORM Complete ProQuest Central ABI/INFORM Professional Advanced ProQuest One Applied & Life Sciences ProQuest Engineering Collection ProQuest Central Korea ProQuest Central (New) ABI/INFORM Complete (Alumni Edition) Engineering Collection Business Premium Collection Civil Engineering Abstracts ABI/INFORM Global Engineering Database ABI/INFORM Global (Alumni Edition) ProQuest Central Basic ProQuest One Academic Eastern Edition ProQuest Technology Collection ProQuest SciTech Collection ProQuest Business Collection ProQuest One Academic UKI Edition ProQuest DELNET Management Collection Materials Science & Engineering Collection ProQuest One Business (Alumni) Engineering Research Database ProQuest One Academic ProQuest Central (Alumni) Business Premium Collection (Alumni) ProQuest One Academic (New)
DatabaseTitleList	ABI/INFORM Global (Corporate)
Database_xml	– sequence: 1 dbid: BENPR name: ProQuest Central url: https://www.proquest.com/central sourceTypes: Aggregation Database
DeliveryMethod	fulltext_linktorsrc
Discipline	Engineering
EISSN	1866-1505
EndPage	4285
ExternalDocumentID	10_1007_s12351_021_00663_0
GroupedDBID	-57 -5G -BR -EM -Y2 -~C .VR 06D 0R~ 0VY 123 1N0 203 29N 2J2 2JN 2JY 2KG 2KM 2LR 2VQ 30V 3V. 4.4 406 408 40D 40E 5VS 67Z 6NX 7WY 875 8FE 8FG 8FL 8TC 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYZH ABAKF ABDZT ABECU ABFTV ABHQN ABJCF ABJNI ABJOX ABKCH ABMNI ABMQK ABNWP ABQBU ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABUWG ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACHSB ACHXU ACIWK ACKNC ACMDZ ACMLO ACOKC ACPIV ACSNA ACZOJ ADHHG ADHIR ADINQ ADKNI ADKPE ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFQL AEGAL AEGNC AEJHL AEJRE AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFBBN AFGCZ AFKRA AFLOW AFQWF AFWTZ AFZKB AGAYW AGDGC AGJBK AGMZJ AGQEE AGQMX AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHSBF AHYZX AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO AJZVZ ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG ARMRJ AXYYD AYQZM B-. BA0 BAPOH BDATZ BENPR BEZIV BGLVJ BGNMA BPHCQ CAG CCPQU COF CS3 CSCUP DDRTE DNIVK DPUIP DWQXO EBLON EBS EIOEI EJD ESBYG FERAY FFXSO FIGPU FINBP FNLPD FRNLG FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNWQR GQ6 GQ7 GROUPED_ABI_INFORM_COMPLETE H13 HCIFZ HF~ HG6 HLICF HMJXF HRMNR HZ~ IKXTQ IWAJR IXD I~X I~Z J-C J0Z JBSCW JZLTJ K60 K6~ K8~ KOV L6V LLZTM M0C M4Y M7S MA- NPVJJ NQJWS NU0 O9- O93 O9G O9J P9M PF0 PQBIZ PQBZA PQQKQ PROAC PT4 PTHSS Q2X QOS R89 R9I ROL RPX RSV S16 S1Z S27 S3B SAP SBE SDH SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 TSG TSK TUC U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW W48 WK8 YLTOR Z45 Z5O Z81 ZMTXR ~A9 AAPKM AAYXX ABBRH ABDBE ABFSG ABRTQ ACSTC AEZWR AFDZB AFFHD AFHIU AFOHR AHPBZ AHWEU AIXLP ATHPR AYFIA CITATION PHGZM PHGZT PQGLB 7TB 7XB 8FD 8FK FR3 KR7 L.- PKEHL PQEST PQUKI PRINS Q9U
ID	FETCH-LOGICAL-c376t-a26ce66d6fbbb9dee5be9fa052cca79bdf16d7201a23236e2fd56a891b5ab833
IEDL.DBID	RSV
ISICitedReferencesCount	5
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000676070700002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	1109-2858
IngestDate	Wed Nov 05 00:43:30 EST 2025 Sat Nov 29 05:50:50 EST 2025 Tue Nov 18 21:58:52 EST 2025 Fri Feb 21 02:45:52 EST 2025
IsPeerReviewed	true
IsScholarly	true
Issue	4
Keywords	AND-type precedence constraints Capacitated single vehicle routing problem Logic based benders decomposition algorithm Multiple trips
Language	English
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c376t-a26ce66d6fbbb9dee5be9fa052cca79bdf16d7201a23236e2fd56a891b5ab833
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14
PQID	2703673037
PQPubID	326268
PageCount	33
ParticipantIDs	proquest_journals_2703673037 crossref_primary_10_1007_s12351_021_00663_0 crossref_citationtrail_10_1007_s12351_021_00663_0 springer_journals_10_1007_s12351_021_00663_0
PublicationCentury	2000
PublicationDate	2022-09-01
PublicationDateYYYYMMDD	2022-09-01
PublicationDate_xml	– month: 09 year: 2022 text: 2022-09-01 day: 01
PublicationDecade	2020
PublicationPlace	Berlin/Heidelberg
PublicationPlace_xml	– name: Berlin/Heidelberg – name: Heidelberg
PublicationSubtitle	An International Journal
PublicationTitle	Operational research
PublicationTitleAbbrev	Oper Res Int J
PublicationYear	2022
Publisher	Springer Berlin Heidelberg Springer Nature B.V
Publisher_xml	– name: Springer Berlin Heidelberg – name: Springer Nature B.V
References	Rabbouch, Saadaoui, Mraihi (CR46) 2020; 32 Gillies, Liu (CR25) 1995; 24 Goldwasser, Motwani (CR27) 1999; 9 Roshanaei, Luong, Aleman, Urbach (CR51) 2017; 257 Chabot, Lahyani, Coelho, Renaud (CR11) 2017; 55 Sarin, Sherali, Bhootra (CR52) 2005; 33 Rivera, Afsar, Prins (CR48) 2016; 249 Mingozzi, Bianco, Ricciardelli (CR35) 1997; 45 Soares, Marques, Amorim, Rasinmaki (CR56) 2019; 277 Moon, Kim, Choi, Seo (CR39) 2002; 140 Cheng, Wang (CR12) 2009; 36 Molenbruch, Braekers, Caris, Schneide (CR37) 2017; 259 Bockenhauer, Momke, Steinova (CR7) 2013; 21 CR3 Angel-Bello, Martinez-Salazar, Alvarez (CR2) 2013; 41 CR45 Fagerholt, Christiansen (CR20) 2000; 7 Matusiak, De-Koster, Saarinen (CR34) 2014; 236 Riise, Mannino, Lamorgese (CR49) 2016; 255 Lee, Moon, Bae, Kim (CR31) 2012; 50 Ropke, Pisinger (CR50) 2006; 40 Ho, Szeto, Luo, Leung, Petering, Tou (CR29) 2018; 111 Dekker, deKoster, Roodbergen, Van Kalleveen (CR17) 2004; 34 Prot, Bellenguez-Morineau (CR43) 2018; 21 R-A-Haddadene, Labadie, Prodho, Schneide (CR44) 2016; 66 Bredstrom, Ronnqvist (CR8) 2008; 191 Derriesel, Monch (CR18) 2011; 61 Faganello Fachini, Armentano (CR22) 2020; 148 Fisher, Jaikumar (CR23) 1981; 11 Barzanji, Naderi, Begen (CR5) 2020; 93 Fazel-Zarandi, Beck (CR21) 2012; 24 CR59 Bai, Cao, Ge (CR6) 2019; 17 Van Den Akker, Hoogeveen, van Kempen (CR62) 2005; 4168 Cordeau, Laporte (CR15) 2007; 153 CR54 Cire, Coban, Hooker (CR14) 2016; 31 Agnetis, Rossi, Smriglio (CR1) 2019; 12 Azi, Gendreau, Potvin, Schneide (CR4) 2007; 178 Zulj, H-Glock, H-Grosse, Schneide (CR65) 2018; 123 Gedik, Rainwater, Nachtmann, Pohl (CR24) 2016; 251 Cattaruzz, Absi, Feillet (CR9) 2016; 14 Unsal, Oguz (CR61) 2019; 126 Casazza, Ceselli, Wolfler-Calvo (CR13) 2018; 69 Yun, Moon (CR63) 2011; 22 Mohring, Skutella, Stork (CR38) 2004; 33 Cattaruzz, Absi, Feillet (CR10) 2018; 271 Gordon, Potts, Strusevich, Whitehead (CR26) 2008; 11 Martinez-Salazar, Angel-Bello, Alvarez, Schneide (CR33) 2014; 66 Renaud, Boctor, Ouenniche (CR47) 2000; 27 Zhang, Qi, Li (CR64) 2020; 282 Miranda, Cordeau, Ferreira, Jans, Morabito (CR36) 2018; 98 Toth, Vigo (CR57) 2002 R Faganello Fachini (663_CR22) 2020; 148 M Matusiak (663_CR34) 2014; 236 A Mingozzi (663_CR35) 1997; 45 M Fazel-Zarandi (663_CR21) 2012; 24 663_CR45 T Chabot (663_CR11) 2017; 55 Y Yun (663_CR63) 2011; 22 HJ Bockenhauer (663_CR7) 2013; 21 JF Cordeau (663_CR15) 2007; 153 A Agnetis (663_CR1) 2019; 12 R Fisher (663_CR23) 1981; 11 C Moon (663_CR39) 2002; 140 S Ropke (663_CR50) 2006; 40 SC Sarin (663_CR52) 2005; 33 B Rabbouch (663_CR46) 2020; 32 R Soares (663_CR56) 2019; 277 JM Van Den Akker (663_CR62) 2005; 4168 I Zulj (663_CR65) 2018; 123 O Unsal (663_CR61) 2019; 126 R Barzanji (663_CR5) 2020; 93 M Casazza (663_CR13) 2018; 69 RH Mohring (663_CR38) 2004; 33 AA Cire (663_CR14) 2016; 31 F Angel-Bello (663_CR2) 2013; 41 D Cattaruzz (663_CR9) 2016; 14 S Ho (663_CR29) 2018; 111 N Azi (663_CR4) 2007; 178 J Renaud (663_CR47) 2000; 27 PL Miranda (663_CR36) 2018; 98 I Martinez-Salazar (663_CR33) 2014; 66 VS Gordon (663_CR26) 2008; 11 A Riise (663_CR49) 2016; 255 JC Rivera (663_CR48) 2016; 249 V Roshanaei (663_CR51) 2017; 257 X Bai (663_CR6) 2019; 17 MH Goldwasser (663_CR27) 1999; 9 Y Molenbruch (663_CR37) 2017; 259 D Prot (663_CR43) 2018; 21 R Derriesel (663_CR18) 2011; 61 DW Gillies (663_CR25) 1995; 24 K Fagerholt (663_CR20) 2000; 7 P Toth (663_CR57) 2002 D Bredstrom (663_CR8) 2008; 191 S Lee (663_CR31) 2012; 50 663_CR3 R Dekker (663_CR17) 2004; 34 663_CR54 A Zhang (663_CR64) 2020; 282 663_CR59 D Cattaruzz (663_CR10) 2018; 271 CB Cheng (663_CR12) 2009; 36 R Gedik (663_CR24) 2016; 251 S R-A-Haddadene (663_CR44) 2016; 66
References_xml	– ident: CR45 – volume: 98 start-page: 211 year: 2018 end-page: 230 ident: CR36 article-title: A decomposition heuristic for a rich production routing problem publication-title: Comput Oper Res – volume: 36 start-page: 7758 year: 2009 end-page: 7763 ident: CR12 article-title: Solving a vehicle routing problem with time windows by a decomposition technique and a genetic algorithm publication-title: Expert Syst Appl – volume: 7 start-page: 231 year: 2000 end-page: 244 ident: CR20 article-title: A travelling salesman problem with allocation time window and precedence constraints an application to ship scheduling publication-title: J Int Trans Oper Res – volume: 24 start-page: 387 year: 2012 end-page: 398 ident: CR21 article-title: Using logic-based benders decomposition to solve the capacity- and distance-constrained plant location problem publication-title: Informs J Comput – volume: 111 start-page: 395 year: 2018 end-page: 421 ident: CR29 article-title: A survey of dial-a-ride problems: literature review and recent developments publication-title: Transp Res Part B – volume: 259 start-page: 295 year: 2017 end-page: 325 ident: CR37 article-title: Typology and literature review for dial-a-ride problems publication-title: J Expert Syst Appl – volume: 61 start-page: 336 year: 2011 end-page: 345 ident: CR18 article-title: Variable neighbourhood search approaches for scheduling jobs on parallel machines with sequence-dependent setup times, precedence constraints, and ready times publication-title: Comput Ind Eng – volume: 33 start-page: 62 year: 2005 end-page: 70 ident: CR52 article-title: New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints publication-title: Oper Res Lett – volume: 251 start-page: 640 year: 2016 end-page: 650 ident: CR24 article-title: Analysis of a parallel machine scheduling problem with sequence dependent setup times and job availability intervals publication-title: Eur J Oper Res – volume: 12 start-page: 1 year: 2019 end-page: 12 ident: CR1 article-title: Some results on shop scheduling with S-precedence constraints among job tasks publication-title: Algorithms – volume: 271 start-page: 127 year: 2018 end-page: 159 ident: CR10 article-title: Vehicle routing problems with multiple trips publication-title: J Ann Oper Res – ident: CR54 – volume: 50 start-page: 1979 year: 2012 end-page: 2001 ident: CR31 article-title: Flexible job-shop scheduling problems with AND/OR precedence constraints publication-title: Int J Prod Res – volume: 45 start-page: 365 year: 1997 end-page: 377 ident: CR35 article-title: Dynamic programming strategies for the TSP with time windows and precedence constraints publication-title: J Oper Res – volume: 32 start-page: 1 year: 2020 end-page: 16 ident: CR46 article-title: Empirical-type simulated annealing for solving the capacitated vehicle routing problem publication-title: J Exp Theor Artif Intell – volume: 282 start-page: 491 year: 2020 end-page: 505 ident: CR64 article-title: Machine scheduling with soft precedence constraints publication-title: Eur J Oper Res – volume: 140 start-page: 606 year: 2002 end-page: 617 ident: CR39 article-title: An efficient genetic algorithm for the traveling salesman problem with precedence constraints publication-title: Eur J Oper Res – volume: 40 start-page: 455 year: 2006 end-page: 472 ident: CR50 article-title: An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows publication-title: J Transp Sci – volume: 255 start-page: 719 year: 2016 end-page: 728 ident: CR49 article-title: Recursive logic-based Benders’ decomposition for multi-mode outpatient scheduling publication-title: Eur J Oper Res – year: 2002 ident: CR57 publication-title: The vehicle routing problem – volume: 24 start-page: 797 year: 1995 end-page: 810 ident: CR25 article-title: Scheduling tasks with AND/OR precedence constraints publication-title: SIAM J Comput – volume: 9 start-page: 371 year: 1999 end-page: 418 ident: CR27 article-title: Complexity measures for assembly sequences publication-title: Int J Comput Geom Appl – volume: 249 start-page: 93 year: 2016 end-page: 104 ident: CR48 article-title: Mathematical formulations and exact algorithm for the multitrip cumulative capacitated single-vehicle routing problem publication-title: Eur J Oper Res – volume: 14 start-page: 223 year: 2016 end-page: 259 ident: CR9 article-title: Vehicle routing problems with multiple trips publication-title: J Oper Res – volume: 34 start-page: 303 year: 2004 end-page: 313 ident: CR17 article-title: Improving order-picking response time at Ankor’s warehouse publication-title: Interfaces – volume: 123 start-page: 338 year: 2018 end-page: 347 ident: CR65 article-title: Picker routing and storage-assignment strategies for precedence-constrained order picking publication-title: J Comput Ind Eng – volume: 148 start-page: 1 year: 2020 end-page: 18 ident: CR22 article-title: Logic-based Benders decomposition for the heterogeneous fixed fleet vehicle routing problem with time windows publication-title: Comput Ind Eng – volume: 55 start-page: 6361 year: 2017 end-page: 6379 ident: CR11 article-title: Order picking problems under weight, fragility and category constraints publication-title: Int J Prod Res – volume: 17 start-page: 1 year: 2019 end-page: 13 ident: CR6 article-title: Efficient routing for precedence-constrained package delivery for heterogeneous vehicles publication-title: J IEEE Trans Autom – volume: 11 start-page: 109 year: 1981 end-page: 124 ident: CR23 article-title: A generalized assignment heuristic for vehicle routing publication-title: Networks – volume: 126 start-page: 103 year: 2019 end-page: 121 ident: CR61 article-title: An exact algorithm for integrated planning of operations in dry bulk terminals publication-title: Transp Res Part E Log Transp Rev – volume: 236 start-page: 968 year: 2014 end-page: 977 ident: CR34 article-title: A fast simulated annealing method for batching precedence-constrained customer orders in a warehouse publication-title: Eur J Oper Res – volume: 178 start-page: 755 year: 2007 end-page: 766 ident: CR4 article-title: An exact algorithm for a single-vehicle routing problem with time windows and multiple routes publication-title: Eur J Oper Res – volume: 93 start-page: 1 year: 2020 end-page: 13 ident: CR5 article-title: Decomposition algorithms for the integrated process planning and scheduling problem publication-title: Omega – volume: 21 start-page: 3 year: 2018 end-page: 16 ident: CR43 article-title: How the structure of precedence constraints may change the complexity class of scheduling problems publication-title: J Sched – volume: 41 start-page: 269 year: 2013 end-page: 276 ident: CR2 article-title: Minimizing waiting times in a route design problem with multiple use of a single vehicle publication-title: J Electron Notes Discrete Math – volume: 69 start-page: 189 year: 2018 end-page: 196 ident: CR13 article-title: A branch and price approach for the split pickup and split delivery VRP publication-title: Electron Notes Discrete Math – volume: 33 start-page: 393 year: 2004 end-page: 415 ident: CR38 article-title: Scheduling with AND/OR precedence constraints publication-title: SIAM J Comput – volume: 21 start-page: 32 year: 2013 end-page: 40 ident: CR7 article-title: Improved approximations for TSP with simple precedence constraints publication-title: J Discrete Algorithms – volume: 4168 start-page: 648 year: 2005 end-page: 659 ident: CR62 article-title: Parallel machine scheduling through column generation: minimax objective functions, release dates, deadlines, and/or generalized precedence constraints publication-title: Lect Notes Comput Sci – volume: 27 start-page: 905 year: 2000 end-page: 916 ident: CR47 article-title: A heuristic for the pickup and delivery traveling salesman problem publication-title: J Comput Oper Res – ident: CR3 – volume: 31 start-page: 440 year: 2016 end-page: 451 ident: CR14 article-title: Logic-based Benders decomposition for planning and scheduling: a computational analysis publication-title: Knowl Eng Rev – volume: 66 start-page: 274 year: 2016 end-page: 294 ident: CR44 article-title: A GRASP × ILS for the vehicle routing problem with time windows, synchronization and precedence constraints publication-title: J Expert Syst Appl – volume: 277 start-page: 174 year: 2019 end-page: 194 ident: CR56 article-title: Multiple vehicle synchronisation in a full truck-load pickup and delivery problem: a case-study in the biomass supply chain publication-title: Eur J Oper Res – ident: CR59 – volume: 257 start-page: 439 year: 2017 end-page: 455 ident: CR51 article-title: Propagating logic-based Benders’ decomposition approaches for distributed operating room scheduling publication-title: Eur J Oper Res – volume: 153 start-page: 29 year: 2007 end-page: 46 ident: CR15 article-title: The dial-a-ride problem: models and algorithms publication-title: J Annu Oper Res – volume: 11 start-page: 357 year: 2008 end-page: 370 ident: CR26 article-title: Single machine scheduling models with deterioration and learning: handling precedence constraints via priority generation publication-title: Scheduling – volume: 66 start-page: 1312 year: 2014 end-page: 1323 ident: CR33 article-title: A customer-centric routing problem with multiple trips of a single vehicle publication-title: J Oper Res Soc – volume: 191 start-page: 19 year: 2008 end-page: 31 ident: CR8 article-title: Combined vehicle routing and scheduling with temporal precedence and synchronization constraints publication-title: Eur J Oper Res – volume: 22 start-page: 379 year: 2011 end-page: 388 ident: CR63 article-title: Genetic algorithm approach for precedence constrained sequencing problems publication-title: J Intell Manuf – volume: 22 start-page: 379 year: 2011 ident: 663_CR63 publication-title: J Intell Manuf doi: 10.1007/s10845-009-0296-4 – volume: 277 start-page: 174 year: 2019 ident: 663_CR56 publication-title: Eur J Oper Res doi: 10.1016/j.ejor.2019.02.025 – volume: 12 start-page: 1 year: 2019 ident: 663_CR1 publication-title: Algorithms doi: 10.3390/a12120250 – volume: 45 start-page: 365 year: 1997 ident: 663_CR35 publication-title: J Oper Res doi: 10.1287/opre.45.3.365 – volume: 236 start-page: 968 year: 2014 ident: 663_CR34 publication-title: Eur J Oper Res doi: 10.1016/j.ejor.2013.06.001 – ident: 663_CR3 – volume: 148 start-page: 1 year: 2020 ident: 663_CR22 publication-title: Comput Ind Eng – volume: 259 start-page: 295 year: 2017 ident: 663_CR37 publication-title: J Expert Syst Appl – volume: 255 start-page: 719 year: 2016 ident: 663_CR49 publication-title: Eur J Oper Res doi: 10.1016/j.ejor.2016.06.015 – volume: 14 start-page: 223 year: 2016 ident: 663_CR9 publication-title: J Oper Res doi: 10.1007/s10288-016-0306-2 – volume: 32 start-page: 1 year: 2020 ident: 663_CR46 publication-title: J Exp Theor Artif Intell doi: 10.1080/0952813X.2019.1652356 – volume: 98 start-page: 211 year: 2018 ident: 663_CR36 publication-title: Comput Oper Res doi: 10.1016/j.cor.2018.05.004 – volume: 140 start-page: 606 year: 2002 ident: 663_CR39 publication-title: Eur J Oper Res doi: 10.1016/S0377-2217(01)00227-2 – volume: 21 start-page: 32 year: 2013 ident: 663_CR7 publication-title: J Discrete Algorithms doi: 10.1016/j.jda.2013.04.002 – volume: 31 start-page: 440 year: 2016 ident: 663_CR14 publication-title: Knowl Eng Rev doi: 10.1017/S0269888916000254 – volume: 11 start-page: 109 year: 1981 ident: 663_CR23 publication-title: Networks doi: 10.1002/net.3230110205 – volume: 11 start-page: 357 year: 2008 ident: 663_CR26 publication-title: Scheduling doi: 10.1007/s10951-008-0064-x – volume: 271 start-page: 127 year: 2018 ident: 663_CR10 publication-title: J Ann Oper Res doi: 10.1007/s10479-018-2988-7 – volume: 257 start-page: 439 year: 2017 ident: 663_CR51 publication-title: Eur J Oper Res doi: 10.1016/j.ejor.2016.08.024 – volume: 21 start-page: 3 year: 2018 ident: 663_CR43 publication-title: J Sched doi: 10.1007/s10951-017-0519-z – volume: 33 start-page: 62 year: 2005 ident: 663_CR52 publication-title: Oper Res Lett doi: 10.1016/j.orl.2004.03.007 – ident: 663_CR54 – volume: 178 start-page: 755 year: 2007 ident: 663_CR4 publication-title: Eur J Oper Res doi: 10.1016/j.ejor.2006.02.019 – volume: 251 start-page: 640 year: 2016 ident: 663_CR24 publication-title: Eur J Oper Res doi: 10.1016/j.ejor.2015.11.020 – volume: 66 start-page: 1312 year: 2014 ident: 663_CR33 publication-title: J Oper Res Soc doi: 10.1057/jors.2014.92 – volume: 33 start-page: 393 year: 2004 ident: 663_CR38 publication-title: SIAM J Comput doi: 10.1137/S009753970037727X – volume: 55 start-page: 6361 year: 2017 ident: 663_CR11 publication-title: Int J Prod Res doi: 10.1080/00207543.2016.1251625 – volume: 50 start-page: 1979 year: 2012 ident: 663_CR31 publication-title: Int J Prod Res doi: 10.1080/00207543.2011.561375 – volume: 123 start-page: 338 year: 2018 ident: 663_CR65 publication-title: J Comput Ind Eng doi: 10.1016/j.cie.2018.06.015 – volume: 34 start-page: 303 year: 2004 ident: 663_CR17 publication-title: Interfaces doi: 10.1287/inte.1040.0083 – volume: 111 start-page: 395 year: 2018 ident: 663_CR29 publication-title: Transp Res Part B doi: 10.1016/j.trb.2018.02.001 – ident: 663_CR59 – volume: 4168 start-page: 648 year: 2005 ident: 663_CR62 publication-title: Lect Notes Comput Sci doi: 10.1007/11841036_58 – volume: 153 start-page: 29 year: 2007 ident: 663_CR15 publication-title: J Annu Oper Res doi: 10.1007/s10479-007-0170-8 – volume: 27 start-page: 905 year: 2000 ident: 663_CR47 publication-title: J Comput Oper Res doi: 10.1016/S0305-0548(99)00066-0 – volume: 191 start-page: 19 year: 2008 ident: 663_CR8 publication-title: Eur J Oper Res doi: 10.1016/j.ejor.2007.07.033 – ident: 663_CR45 doi: 10.1007/s12351-019-00521-0 – volume-title: The vehicle routing problem year: 2002 ident: 663_CR57 doi: 10.1137/1.9780898718515 – volume: 24 start-page: 387 year: 2012 ident: 663_CR21 publication-title: Informs J Comput doi: 10.1287/ijoc.1110.0458 – volume: 9 start-page: 371 year: 1999 ident: 663_CR27 publication-title: Int J Comput Geom Appl doi: 10.1142/S0218195999000248 – volume: 66 start-page: 274 year: 2016 ident: 663_CR44 publication-title: J Expert Syst Appl doi: 10.1016/j.eswa.2016.09.002 – volume: 282 start-page: 491 year: 2020 ident: 663_CR64 publication-title: Eur J Oper Res doi: 10.1016/j.ejor.2019.09.041 – volume: 40 start-page: 455 year: 2006 ident: 663_CR50 publication-title: J Transp Sci doi: 10.1287/trsc.1050.0135 – volume: 61 start-page: 336 year: 2011 ident: 663_CR18 publication-title: Comput Ind Eng doi: 10.1016/j.cie.2010.07.001 – volume: 93 start-page: 1 year: 2020 ident: 663_CR5 publication-title: Omega doi: 10.1016/j.omega.2019.01.003 – volume: 17 start-page: 1 year: 2019 ident: 663_CR6 publication-title: J IEEE Trans Autom – volume: 36 start-page: 7758 year: 2009 ident: 663_CR12 publication-title: Expert Syst Appl doi: 10.1016/j.eswa.2008.09.001 – volume: 126 start-page: 103 year: 2019 ident: 663_CR61 publication-title: Transp Res Part E Log Transp Rev doi: 10.1016/j.tre.2019.03.018 – volume: 24 start-page: 797 year: 1995 ident: 663_CR25 publication-title: SIAM J Comput doi: 10.1137/S0097539791218664 – volume: 41 start-page: 269 year: 2013 ident: 663_CR2 publication-title: J Electron Notes Discrete Math doi: 10.1016/j.endm.2013.05.102 – volume: 249 start-page: 93 year: 2016 ident: 663_CR48 publication-title: Eur J Oper Res doi: 10.1016/j.ejor.2015.08.067 – volume: 69 start-page: 189 year: 2018 ident: 663_CR13 publication-title: Electron Notes Discrete Math doi: 10.1016/j.endm.2018.07.025 – volume: 7 start-page: 231 year: 2000 ident: 663_CR20 publication-title: J Int Trans Oper Res doi: 10.1111/j.1475-3995.2000.tb00196.x
SSID	ssj0000327848 ssib004298988
Score	2.2570543
Snippet	This paper addresses a new variant of the multi-trip single vehicle routing problem where the nodes are related to each other through AND-type precedence...
SourceID	proquest crossref springer
SourceType	Aggregation Database Enrichment Source Index Database Publisher
StartPage	4253
SubjectTerms	Algorithms Benders decomposition Business and Management Computational Intelligence Integer programming Management Science Mixed integer Nodes Operations Research Operations Research/Decision Theory Optimization Original Paper Precedence constraints Route planning Vehicle routing
SummonAdditionalLinks	– databaseName: Engineering Database dbid: M7S link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV07T8MwELagMMDAG1Fe8sAGFo1DHGdCFQ8xoAoJBrbIds6AVFpoA7-fO9ehgAQLQ6Qoj1Oiu5y_3OM7xg68KWQOUAgFuReIwLWwKnO4ZyA7OfEI6AJl_nXe6-n7--ImBtzGsayy8YnBUVdDRzHyY0lMUWiOaX768ipoahRlV-MIjVk2RywJSSjdu_3qa3VDxxU8c0ppttAdl1BiQWc69tFMuulkmuG_tcSNFmLR-b5WTQHoj5xpWIoul__7EitsKYJQ3p1YzSqbgcEaW_xCTbjOBudA1eaxpIub_gPKqR-fOYJcjqCRh0pEUaPP4RRu6AN_h0cSx0fDN6ql5nFWDadQL-_2zgWFe_EoOAiDTLkjbEojKurxBru7vLg7uxJxNoNw6JJqYaRyoFSlvLW2qAAyC4U3nUyiSeSFrXyiqhzRhUHIliqQvsqU0UViM2N1mm6y1mA4gC3GQSqvEm0Sh_92lTPWWEgpYeu99sYlbZY0Sihd5C2nZ-uXU8ZlUlyJiiuD4spOmx1-3vMyYe348-rdRltl_ILH5VRVbXbU6Ht6-ndp239L22ELkjooQpnaLmvVozfYY_PuvX4aj_aD_X4A3pf1xg priority: 102 providerName: ProQuest
Title	Decomposition algorithm for the multi-trip single vehicle routing problem with AND-type precedence constraints
URI	https://link.springer.com/article/10.1007/s12351-021-00663-0 https://www.proquest.com/docview/2703673037
Volume	22
WOSCitedRecordID	wos000676070700002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVAVX databaseName: Springer Online Journals customDbUrl: eissn: 1866-1505 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000327848 issn: 1109-2858 databaseCode: RSV dateStart: 20010101 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LT9wwEB7x6IEeoA9QF-jKB25gaeMQxznyVA90hQAVOEW2MwakZbfaDfz-zpiEBQSV4JAoD2dkjZ2Zz54XwEawhcoRC6kxD5IQuJFOZ56uLGbb24EAXUyZf5T3--biojhugsImrbd7a5KMknoa7KbSjJa-ig7Wk5IW6vOk7gwXbDg5_fNUwpo2CVeUxykb12JMXMLmBJOZJnrmdbLPNdQUdr6wlEYFdLj0sa5_gcUGcIqdhxnyFWZw-A0-P0lD-B2G-8ie5Y37lrCDq9H4pr6-FQRoBQFEEb0OZU3yRfDWwgDFPV4zOTEe3bHftGjq0gje1hU7_X3JW7v0FD3GoqXCMw7lchT1ZBnODg_O9n7Jpg6D9CR-ammV9qh1pYNzrqgQM4dFsL1M0fDnhatCoquckIQleJZqVKHKtDVF4jLrTJquwNxwNMQfIFDpoBNjE0_ruMpbZx2mbJwNwQTrkw4kLetL3-Qo574Nyml2ZWZlSawsIyvLXgc2H7_5-5Ch47-t19sRLZu_dVIqzkJGoi7NO7DVjuD09dvUVt_XfA0WFEdPRBe1dZirx3f4Ez75-_pmMu7CbH5-2YX53YP-8Qnd_e7t8Tk_7cb5_Q8z4vAZ
linkProvider	Springer Nature
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V3Nb9MwFH-aBhJw4HuiMMAHOIFF4zSOc0BoWpk2rVQcetjNsp1nhtS1o82G-KP2P-49N6EDid124BApyodlJ7_34fcJ8Ca6SpWIldRYRkkauJFeF4HOHBaDQSSFLpXMH5XjsTk6qr5uwEWXC8NhlR1PTIy6nge2kX9QXCmK4JiXn05_SO4axd7VroXGChaH-OsnbdmWHw-G9H_fKrX3ebK7L9uuAjIQMTXSKR1Q61pH731VIxYeq-j6haLFlJWvY6brkuSiI2Uj16hiXWhnqswXzhu2fxLHvzUYEHVwpGB_9yprN131ryQIcvbqpWS8jP0YpjBt2s4qeU_lBW3lFR0s92X_T9G41nf_ctEmybf34D_7Zg_hfqtii50VTTyCDZw9hntXCi8-gdkQOZa-DVgTbvqNpt0cnwhS4QWpxCLFWcqGOKpgY8oUxTke83BiMT_jSHHRduIRbMgWO-OhZGM2XcWAqU2rCKx5cwOOZvkUJjex3i3YnM1n-AwEKh11ZlwWaOdaB-edx5zd0TGa6ELWg6z75za0Vdl5blO7rifNOLGEE5twYvs9ePf7ndNVTZJrn97uwGFb_rS0a2T04H0Hr_Xtf4_2_PrRXsOd_cmXkR0djA9fwF3FuSIpIG8bNpvFGb6E2-G8-b5cvEqkI8DeMOwuAWSyVPk
linkToPdf	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Lb9QwEB5VBSF64F11oYAPcAKrG2fjOAeEqi4rqlarHnrozbKdMUXa7pbdtIifxr9jxpt0WyR664FDpCgPK4_PM5_nCfAuukqViJXUWEZJDNxIr4tAew6LwSASoUsl8w_L8dicnFRHa_C7y4XhsMpOJiZBXc8C28h3FFeKIjjm5U5swyKOhqPP5z8kd5BiT2vXTmMJkQP89ZOWb4tP-0P61--VGn053vsq2w4DMtDEaqRTOqDWtY7e-6pGLDxW0fULRS9WVr6Oma5L0pGOiEeuUcW60M5UmS-cN2wLJel_rxyQ1uSowf7edTFvukpgSSnk7OFLiXkZ-zRMYdoUnmUin8oLWtYr2pgDyP5NNbnivn-5a5MWHD3-j7_fE3jUUm-xu5wrT2ENp89g41pBxucwHSLH2LeBbMJNvtFjN6dngqi9IKosUvylbEjSCjayTFBc4ikPJ-azC44gF22HHsEGbrE7Hko2ctNRDJjat4rAjJwbczSLF3B8F--7CevT2RS3QKDSUWfGZYFWtHVw3nnM2U0do4kuZD3Iuv9vQ1utnZ9tYld1phkzljBjE2Zsvwcfru45X9YqufXq7Q4otpVbC7tCSQ8-dlBbnf73aC9vH-0tPCC02cP98cEreKg4hSTF6W3DejO_wNdwP1w23xfzN2kWCbB3jLo_lPFdvw
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Decomposition+algorithm+for+the+multi-trip+single+vehicle+routing+problem+with+AND-type+precedence+constraints&rft.jtitle=Operational+research&rft.au=Roohnavazfar%2C+Mina&rft.au=Pasandideh%2C+Seyed+Hamid+Reza&rft.date=2022-09-01&rft.pub=Springer+Berlin+Heidelberg&rft.issn=1109-2858&rft.eissn=1866-1505&rft.volume=22&rft.issue=4&rft.spage=4253&rft.epage=4285&rft_id=info:doi/10.1007%2Fs12351-021-00663-0&rft.externalDocID=10_1007_s12351_021_00663_0
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1109-2858&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1109-2858&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1109-2858&client=summon