Drop-and-pull container drayage with flexible assignment of work break for vehicle drivers
•A drop-and-pull container drayage with flexible work break is addressed.•A mixed-integer programming model is constructed to formulate this problem.•Three families of valid inequalities are proposed to strengthen the model.•A model-based backtracking adaptive threshold accepting algorithm is develo...
Uloženo v:
| Vydáno v: | Computers & operations research Ročník 162; s. 106475 |
|---|---|
| Hlavní autoři: | , , , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Elsevier Ltd
01.02.2024
|
| Témata: | |
| ISSN: | 0305-0548 |
| 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 | •A drop-and-pull container drayage with flexible work break is addressed.•A mixed-integer programming model is constructed to formulate this problem.•Three families of valid inequalities are proposed to strengthen the model.•A model-based backtracking adaptive threshold accepting algorithm is developed.•Managerial insights are presented on the work break.
Consideration of driver-related constraints, such as mandatory work break, in vehicle scheduling and routing is of extraordinary importance for safety driving and guaranteeing the interests of vehicle drivers. Drop-and-pull transportation is an efficient mode in container drayage services and creates interdependencies between the routes of vehicle drivers. The situation becomes even more complicated when the drivers must comply with requirements of the mandatory work break. This paper addresses a drop-and-pull container drayage problem with flexible assignment of work break. The time and location of work break for drivers can be flexibly chosen based on scheduling, routing and optimization requirements. The transportation vehicle is comprised of two parts as a tractor and a trailer. The tractor can drag at most one trailer at a time, and is separable from the trailer when executing drayage activities. The problem is formulated as a mixed-integer programming model, which is then strengthened by proposing several families of valid inequalities. To efficiently solve realistic-sized instances, a backtracking adaptive threshold accepting algorithm with a mixed-integer programming model specially coping with the assignment of work break is proposed. Mechanisms of tabu search are incorporated to enhance the searching ability of the algorithm. Experiments indicate that the proposed algorithm can efficiently handle the vehicle scheduling and routing as well as the work break assignment and outperforms the mathematical programming approach. Sensitivity analyses about different policies and varied length of the work break are also conducted with some managerial insights presented. |
|---|---|
| AbstractList | •A drop-and-pull container drayage with flexible work break is addressed.•A mixed-integer programming model is constructed to formulate this problem.•Three families of valid inequalities are proposed to strengthen the model.•A model-based backtracking adaptive threshold accepting algorithm is developed.•Managerial insights are presented on the work break.
Consideration of driver-related constraints, such as mandatory work break, in vehicle scheduling and routing is of extraordinary importance for safety driving and guaranteeing the interests of vehicle drivers. Drop-and-pull transportation is an efficient mode in container drayage services and creates interdependencies between the routes of vehicle drivers. The situation becomes even more complicated when the drivers must comply with requirements of the mandatory work break. This paper addresses a drop-and-pull container drayage problem with flexible assignment of work break. The time and location of work break for drivers can be flexibly chosen based on scheduling, routing and optimization requirements. The transportation vehicle is comprised of two parts as a tractor and a trailer. The tractor can drag at most one trailer at a time, and is separable from the trailer when executing drayage activities. The problem is formulated as a mixed-integer programming model, which is then strengthened by proposing several families of valid inequalities. To efficiently solve realistic-sized instances, a backtracking adaptive threshold accepting algorithm with a mixed-integer programming model specially coping with the assignment of work break is proposed. Mechanisms of tabu search are incorporated to enhance the searching ability of the algorithm. Experiments indicate that the proposed algorithm can efficiently handle the vehicle scheduling and routing as well as the work break assignment and outperforms the mathematical programming approach. Sensitivity analyses about different policies and varied length of the work break are also conducted with some managerial insights presented. |
| ArticleNumber | 106475 |
| Author | Wang, Decheng Zhang, Ruiyou Chen, Wenpeng Qiu, Bin Xie, Xiaolan |
| Author_xml | – sequence: 1 givenname: Decheng orcidid: 0000-0002-9257-5543 surname: Wang fullname: Wang, Decheng email: decheng_wang@glut.edu.cn organization: College of Information Science and Engineering, Guangxi Key Laboratory of Embedded Technology and Intelligent System, Guilin University of Technology, No. 319, Yanshan Street, Yanshan District, Guilin 541006, Guangxi Zhuang Autonomous Region, China – sequence: 2 givenname: Ruiyou surname: Zhang fullname: Zhang, Ruiyou email: zhangruiyou@ise.neu.edu.cn organization: College of Information Science and Engineering, Northeastern University, No. 11, Lane 3, Wenhua Road, Heping District, Shenyang 110819, Liaoning Province, China – sequence: 3 givenname: Bin surname: Qiu fullname: Qiu, Bin organization: College of Information Science and Engineering, Guangxi Key Laboratory of Embedded Technology and Intelligent System, Guilin University of Technology, No. 319, Yanshan Street, Yanshan District, Guilin 541006, Guangxi Zhuang Autonomous Region, China – sequence: 4 givenname: Wenpeng surname: Chen fullname: Chen, Wenpeng email: chenwp@glut.edu.cn organization: College of Information Science and Engineering, Guangxi Key Laboratory of Embedded Technology and Intelligent System, Guilin University of Technology, No. 319, Yanshan Street, Yanshan District, Guilin 541006, Guangxi Zhuang Autonomous Region, China – sequence: 5 givenname: Xiaolan orcidid: 0000-0001-9546-5115 surname: Xie fullname: Xie, Xiaolan email: xie_xiao_lan@foxmail.com organization: College of Information Science and Engineering, Guangxi Key Laboratory of Embedded Technology and Intelligent System, Guilin University of Technology, No. 319, Yanshan Street, Yanshan District, Guilin 541006, Guangxi Zhuang Autonomous Region, China |
| BookMark | eNp9kD1PwzAQhj0UCQr8ADb_gRQ7juNKTKh8SkgssLBYF_vSuk3t6hxa-u9JVSaG3nI66X1Oep8xG8UUkbEbKSZSyPp2OXGJJqUo1XDXldEjdiGU0IXQ1fScjXNeimFMKS_Y1wOlTQHRF5vvruMuxR5CROKeYA9z5LvQL3jb4U9oOuSQc5jHNcaep5bvEq14Qwgr3ibiW1wEN4Q8hS1SvmJnLXQZr__2Jft8evyYvRRv78-vs_u3wqmy7ItWQy0aV2vpvHbaC9kI1JV3ZqoalFBjKaRE44VXxgjty0qpyqAB8NKDV5dMHv86SjkTtnZDYQ20t1LYgxC7tIMQexBij0IGxvxjXOihD0N9gtCdJO-OJA6VtgHJZhcwOvSB0PXWp3CC_gXUiICA |
| CitedBy_id | crossref_primary_10_1016_j_cor_2025_107080 crossref_primary_10_3390_math13071210 crossref_primary_10_1016_j_eswa_2024_124625 crossref_primary_10_1093_jcde_qwae107 crossref_primary_10_1016_j_omega_2025_103422 crossref_primary_10_1016_j_tre_2025_104137 crossref_primary_10_3390_app142411958 crossref_primary_10_2174_0126671212401455250710054908 crossref_primary_10_1002_qre_3736 |
| Cites_doi | 10.1109/TITS.2022.3156547 10.1016/j.ejor.2012.09.001 10.1080/01605682.2018.1457487 10.1016/j.ejtl.2022.100099 10.1016/j.tre.2017.07.010 10.1016/j.eswa.2022.117170 10.1016/j.ifacol.2018.08.305 10.1016/j.ejor.2023.02.041 10.1016/j.cor.2017.01.020 10.1287/trsc.2015.0611 10.1016/j.trb.2015.05.009 10.1016/j.cie.2023.109440 10.1016/j.cor.2005.02.045 10.1016/j.ejor.2021.06.019 10.1016/j.tre.2016.02.010 10.1016/j.cie.2022.108835 10.1287/trsc.2014.0571 10.1287/trsc.1050.0135 10.1016/j.tre.2018.06.003 10.1007/s00291-010-0229-9 10.1016/j.cor.2023.106318 10.1109/TITS.2020.2991098 10.1016/j.tre.2020.102211 10.1016/j.trb.2019.12.009 10.1016/j.cor.2020.104987 10.1016/j.tre.2023.103138 10.1057/jors.2015.90 10.1016/j.omega.2015.01.011 10.1287/trsc.1030.0046 10.1287/trsc.1050.0145 10.1016/j.trb.2022.10.010 10.1016/j.tre.2022.102922 10.1016/j.tre.2022.102992 10.1016/j.tre.2022.102633 10.1016/j.trc.2022.103809 10.1016/j.tre.2023.103131 10.1287/trsc.2016.0730 10.1111/itor.12264 10.1016/j.cie.2023.109207 10.1016/j.ejor.2021.06.040 10.1016/j.cor.2014.06.008 10.1016/j.cie.2019.106143 10.1016/j.tre.2020.101973 10.1016/j.cie.2022.108879 10.1007/s00291-012-0310-7 10.1016/j.tra.2018.10.033 10.1016/j.cor.2020.105189 10.1016/j.trb.2014.05.007 10.1016/j.tre.2021.102241 10.2112/SI98-077.1 10.1016/j.eswa.2021.115307 10.1080/00207543.2016.1213917 10.1504/IJCAET.2010.035390 10.3390/ijerph181910173 10.1016/j.tre.2013.11.009 10.1016/j.cor.2020.105102 10.1287/trsc.1100.0330 10.1016/S0305-0548(00)00056-3 10.1002/net.21566 10.1016/j.ijpe.2016.03.005 10.1016/j.tre.2018.07.011 10.1287/trsc.2018.0836 10.1287/ijoc.2013.0550 10.1016/j.tre.2013.06.001 10.1287/trsc.1070.0217 10.1016/j.tre.2013.12.007 |
| ContentType | Journal Article |
| Copyright | 2023 Elsevier Ltd |
| Copyright_xml | – notice: 2023 Elsevier Ltd |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.cor.2023.106475 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science Business |
| ExternalDocumentID | 10_1016_j_cor_2023_106475 S0305054823003398 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 186 1B1 1OL 1RT 1~. 1~5 29F 4.4 457 4G. 5GY 5VS 6J9 7-5 71M 8P~ 9JN 9JO AAAKF AAAKG AABNK AACTN AAEDT AAEDW AAFJI AAIKJ AAKOC AALRI AAOAW AAQXK AARIN AAXKI AAXUO AAYFN AAYOK ABAOU ABBOA ABDPE ABEFU ABFNM ABFRF ABJNI ABMAC ABMMH ABUCO ABWVN ABXDB ACDAQ ACGFO ACGFS ACNCT ACNNM ACRLP ACRPL ACZNC ADBBV ADEZE ADGUI ADJOM ADMUD ADNMO AEBSH AEFWE AEHXG AEIPS AEKER AENEX AFFNX AFJKZ AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AI. AIALX AIEXJ AIGVJ AIKHN AITUG AJOXV AKRWK ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOMHK AOUOD APLSM ARUGR ASPBG AVARZ AVWKF AXJTR AZFZN BKOJK BKOMP BLXMC CS3 DU5 EBS EFJIC EJD EO8 EO9 EP2 EP3 FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HAMUX HVGLF HZ~ H~9 IHE J1W KOM LY1 M41 MHUIS MO0 MS~ O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ PRBVW Q38 R2- RIG ROL RPZ RXW SDF SDG SDP SDS SES SEW SPC SPCBC SSB SSD SSO SSV SSW SSZ T5K TAE TN5 U5U UAO UPT VH1 WUQ XPP ZMT ~02 ~G- 9DU AATTM AAYWO AAYXX ACLOT ACVFH ADCNI AEUPX AFPUW AGQPQ AIGII AIIUN AKBMS AKYEP ANKPU APXCP CITATION EFKBS EFLBG ~HD |
| ID | FETCH-LOGICAL-c322t-f5a60bc651cd5c5d01b0e54dc783be1a6e2011e7d0d37705d243347e7aad1dad3 |
| ISICitedReferencesCount | 10 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001125808500001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0305-0548 |
| IngestDate | Tue Nov 18 21:43:31 EST 2025 Sat Nov 29 03:23:46 EST 2025 Sat Jan 18 16:10:18 EST 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Container drayage Drop-and-pull transportation Backtracking adaptive threshold accepting algorithm Mixed-integer programming model Work break |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c322t-f5a60bc651cd5c5d01b0e54dc783be1a6e2011e7d0d37705d243347e7aad1dad3 |
| ORCID | 0000-0001-9546-5115 0000-0002-9257-5543 |
| ParticipantIDs | crossref_primary_10_1016_j_cor_2023_106475 crossref_citationtrail_10_1016_j_cor_2023_106475 elsevier_sciencedirect_doi_10_1016_j_cor_2023_106475 |
| PublicationCentury | 2000 |
| PublicationDate | 2024-02-01 |
| PublicationDateYYYYMMDD | 2024-02-01 |
| PublicationDate_xml | – month: 02 year: 2024 text: 2024-02-01 day: 01 |
| PublicationDecade | 2020 |
| PublicationTitle | Computers & operations research |
| PublicationYear | 2024 |
| Publisher | Elsevier Ltd |
| Publisher_xml | – name: Elsevier Ltd |
| References | Wang, Dessouky, Van Woensel, Ioannou (b0255) 2023; 12 Song, Zhang, Liang, Ye (b0225) 2017; 106 Funke, Kopfer (b0100) 2016; 89 Braekers, Caris, Janssens (b0025) 2014; 67 Rincon-Garcia, Waterson, Cherrett, Salazar-Arrieta (b0195) 2020; 137 Xue, Zhang, Lin, Miao, Yang (b0285) 2014; 62 Goel (b0115) 2010; 44 Zhang, Lu, Wang (b0310) 2014; 61 Chao (b0055) 2002; 29 Shiri, Huynh (b0215) 2016; 176 Parragh, Cordeau (b0175) 2017; 83 Lu, Yang, Wang (b0160) 2019; 98 Zhang, Liu, Lim (b0325) 2015; 54 El Hachemi, El Hallaoui, Gendreau, Rousseau (b0090) 2015; 232 Xu, Wei (b0275) 2023; 175 Bräysy, Dullaert, Hasle, Mester, Gendreau (b0030) 2008; 42 Fazi, Choudhary, Dong (b0095) 2023; 310 Ghezelsoflu, Di Francesco, Frangioni, Zuddas (b0110) 2021; 129 Chen, Meng, Jia (b0065) 2022; 159 You, Wang, Xue (b0305) 2023; 175 Chen, Chen, Cui, Meng (b0060) 2021; 147 Bruglieri, Mancini, Peruzzini, Pisacane (b0035) 2021; 125 Wang, Moon, Zhang (b0260) 2022; 23 Meisel, Kopfer (b0165) 2014; 36 Tilk, Bianchessi, Drexl, Irnich, Meisel (b0235) 2018; 52 Wy, Kim, Kim (b0265) 2013; 224 Sartori, Smet, Vanden Berghe (b0205) 2022; 298 You, Miao, Zhang, Xue (b0300) 2020; 133 Liu, Dridi, Fei, El Hassani (b0145) 2021; 183 Ropke, Pisinger (b0200) 2006; 40 Zhang, Zhao, Moon (b0315) 2018; 118 Schiffer, Schneider, Walther, Laporte (b0210) 2019; 53 Zhang, Huang, Wang (b0320) 2020; 139 Gendreau, Iori, Laporte, Martello (b0105) 2006; 40 Peters, S.E., Grogan, H., Henderson, G.M., López Gómez, M.A., Martínez Maldonado, M., Silva Sanhueza, I., Dennerlein, J.T., 2021. Working conditions influencing drivers' safety and well-being in the transportation industry: “on Board” program. 18(19). Vidović, Popović, Ratković, Radivojević (b0250) 2017; 24 Zhao, Dong, Wang (b0335) 2023; 159 Jia, Cui, Chen, Meng (b0120) 2022; 166 Campbell, Savelsbergh (b0045) 2004; 38 Trautsamwieser, Hirsch (b0245) 2014; 64 Lai, Crainic, Di Francesco, Zuddas (b0135) 2013; 56 Torkjazi, Huynh, Shiri (b0240) 2018; 116 Bustos-Coral, Costa (b0040) 2022; 168 Coelho, Gagliardi, Renaud, Ruiz (b0070) 2016; 67 Moghaddam, Pearce, Mokhtar, Prato (b0170) 2020; 139 Bjelić, Vidović, Popović, Ratković (b0020) 2022; 201 Adulyasak, Cordeau, Jans (b0005) 2014; 26 Yan, Xu, Xie (b0295) 2023; 169 Zhang, Wang, Wang (b0330) 2021; 22 Xu, Yan, Yin (b0280) 2022; 143 Shiri, Ng, Huynh (b0220) 2019; 70 Cui, Chen, Chen, Meng (b0080) 2022; 299 Koç, Laporte, Tükenmez (b0130) 2020; 122 Peng, Xue (b0185) 2023; 175 Du, Zhang, Wang, Lau (b0085) 2023; 175 Xue, Lin, You (b0290) 2021; 147 Tao, Zhuo, Lai (b0230) 2023; 182 Belenguer, Benavent, Martinez, Prins, Prodhon, Villegas (b0015) 2016; 50 Cuda, Guastaroba, Speranza (b0075) 2015; 55 Caris, Janssens (b0050) 2010; 2 Parragh, Cordeau, Doerner, Hartl (b0180) 2012; 34 Kim, Seongbae, Sahoo (b0125) 2006; 33 Lim, Zhang, Qin (b0140) 2017; 51 Agrali, Lee (b0010) 2023; 179 Liu, Luo, Lim (b0150) 2015; 81 Liu, Yuan, Jiang (b0155) 2017; 55 Xiao, Dridi, El Hassani (b0270) 2018; 51 Xu (10.1016/j.cor.2023.106475_b0280) 2022; 143 Caris (10.1016/j.cor.2023.106475_b0050) 2010; 2 Chen (10.1016/j.cor.2023.106475_b0065) 2022; 159 Trautsamwieser (10.1016/j.cor.2023.106475_b0245) 2014; 64 Zhang (10.1016/j.cor.2023.106475_b0325) 2015; 54 Yan (10.1016/j.cor.2023.106475_b0295) 2023; 169 Ghezelsoflu (10.1016/j.cor.2023.106475_b0110) 2021; 129 You (10.1016/j.cor.2023.106475_b0300) 2020; 133 Bustos-Coral (10.1016/j.cor.2023.106475_b0040) 2022; 168 Cuda (10.1016/j.cor.2023.106475_b0075) 2015; 55 Sartori (10.1016/j.cor.2023.106475_b0205) 2022; 298 Liu (10.1016/j.cor.2023.106475_b0155) 2017; 55 Cui (10.1016/j.cor.2023.106475_b0080) 2022; 299 Lai (10.1016/j.cor.2023.106475_b0135) 2013; 56 10.1016/j.cor.2023.106475_b0190 Chen (10.1016/j.cor.2023.106475_b0060) 2021; 147 Goel (10.1016/j.cor.2023.106475_b0115) 2010; 44 Zhang (10.1016/j.cor.2023.106475_b0310) 2014; 61 Ropke (10.1016/j.cor.2023.106475_b0200) 2006; 40 Bräysy (10.1016/j.cor.2023.106475_b0030) 2008; 42 Du (10.1016/j.cor.2023.106475_b0085) 2023; 175 Zhang (10.1016/j.cor.2023.106475_b0315) 2018; 118 Wang (10.1016/j.cor.2023.106475_b0255) 2023; 12 Zhang (10.1016/j.cor.2023.106475_b0320) 2020; 139 Xue (10.1016/j.cor.2023.106475_b0285) 2014; 62 Bruglieri (10.1016/j.cor.2023.106475_b0035) 2021; 125 Kim (10.1016/j.cor.2023.106475_b0125) 2006; 33 Braekers (10.1016/j.cor.2023.106475_b0025) 2014; 67 Adulyasak (10.1016/j.cor.2023.106475_b0005) 2014; 26 Liu (10.1016/j.cor.2023.106475_b0150) 2015; 81 Wang (10.1016/j.cor.2023.106475_b0260) 2022; 23 Shiri (10.1016/j.cor.2023.106475_b0220) 2019; 70 Coelho (10.1016/j.cor.2023.106475_b0070) 2016; 67 Meisel (10.1016/j.cor.2023.106475_b0165) 2014; 36 Chao (10.1016/j.cor.2023.106475_b0055) 2002; 29 Xiao (10.1016/j.cor.2023.106475_b0270) 2018; 51 Zhao (10.1016/j.cor.2023.106475_b0335) 2023; 159 Belenguer (10.1016/j.cor.2023.106475_b0015) 2016; 50 Wy (10.1016/j.cor.2023.106475_b0265) 2013; 224 Lu (10.1016/j.cor.2023.106475_b0160) 2019; 98 Funke (10.1016/j.cor.2023.106475_b0100) 2016; 89 Campbell (10.1016/j.cor.2023.106475_b0045) 2004; 38 Tao (10.1016/j.cor.2023.106475_b0230) 2023; 182 Song (10.1016/j.cor.2023.106475_b0225) 2017; 106 Jia (10.1016/j.cor.2023.106475_b0120) 2022; 166 Koç (10.1016/j.cor.2023.106475_b0130) 2020; 122 Gendreau (10.1016/j.cor.2023.106475_b0105) 2006; 40 Xue (10.1016/j.cor.2023.106475_b0290) 2021; 147 Schiffer (10.1016/j.cor.2023.106475_b0210) 2019; 53 Liu (10.1016/j.cor.2023.106475_b0145) 2021; 183 Moghaddam (10.1016/j.cor.2023.106475_b0170) 2020; 139 Vidović (10.1016/j.cor.2023.106475_b0250) 2017; 24 You (10.1016/j.cor.2023.106475_b0305) 2023; 175 Peng (10.1016/j.cor.2023.106475_b0185) 2023; 175 Agrali (10.1016/j.cor.2023.106475_b0010) 2023; 179 Bjelić (10.1016/j.cor.2023.106475_b0020) 2022; 201 Shiri (10.1016/j.cor.2023.106475_b0215) 2016; 176 El Hachemi (10.1016/j.cor.2023.106475_b0090) 2015; 232 Rincon-Garcia (10.1016/j.cor.2023.106475_b0195) 2020; 137 Torkjazi (10.1016/j.cor.2023.106475_b0240) 2018; 116 Parragh (10.1016/j.cor.2023.106475_b0180) 2012; 34 Fazi (10.1016/j.cor.2023.106475_b0095) 2023; 310 Tilk (10.1016/j.cor.2023.106475_b0235) 2018; 52 Zhang (10.1016/j.cor.2023.106475_b0330) 2021; 22 Parragh (10.1016/j.cor.2023.106475_b0175) 2017; 83 Xu (10.1016/j.cor.2023.106475_b0275) 2023; 175 Lim (10.1016/j.cor.2023.106475_b0140) 2017; 51 |
| References_xml | – volume: 42 start-page: 371 year: 2008 end-page: 386 ident: b0030 article-title: An effective multirestart deterministic annealing metaheuristic for the fleet size and mix vehicle-routing problem with time windows publication-title: Transp. Sci. – volume: 176 start-page: 7 year: 2016 end-page: 20 ident: b0215 article-title: Optimization of drayage operations with time-window constraints publication-title: Int. J. Prod. Econ. – volume: 201 year: 2022 ident: b0020 article-title: Rolling-horizon approach in solving dynamic multisize multi-trailer container drayage problem publication-title: Expert Syst. Appl. – volume: 139 year: 2020 ident: b0170 article-title: A generalised model for container drayage operations with heterogeneous fleet, multi-container sizes and two modes of operation publication-title: Transp. Res. Part E: Logistics Transp. Rev. – volume: 40 start-page: 342 year: 2006 end-page: 350 ident: b0105 article-title: A Tabu Search Algorithm for a Routing and Container Loading Problem publication-title: Transp. Sci. – volume: 298 start-page: 76 year: 2022 end-page: 88 ident: b0205 article-title: Scheduling truck drivers with interdependent routes under European Union regulations publication-title: Eur. J. Oper. Res. – volume: 122 year: 2020 ident: b0130 article-title: A review of vehicle routing with simultaneous pickup and delivery publication-title: Comput. Oper. Res. – volume: 33 start-page: 3624 year: 2006 end-page: 3642 ident: b0125 article-title: Waste collection vehicle routing problem with time windows publication-title: Comput. Oper. Res. – volume: 159 year: 2022 ident: b0065 article-title: Container port drayage operations and management: Past and future publication-title: Transp. Res. Part E: Logistics Transp. Rev. – volume: 137 start-page: 429 year: 2020 end-page: 446 ident: b0195 article-title: A metaheuristic for the time-dependent vehicle routing problem considering driving hours regulations – An application in city logistics publication-title: Transp. Res. A Policy Pract. – volume: 129 year: 2021 ident: b0110 article-title: A multiperiod drayage problem with customer-dependent service periods publication-title: Comput. Oper. Res. – volume: 182 year: 2023 ident: b0230 article-title: The pickup and delivery problem with multiple depots and dynamic occasional drivers in crowdshipping delivery publication-title: Comput. Ind. Eng. – volume: 24 start-page: 583 year: 2017 end-page: 614 ident: b0250 article-title: Generalized mixed integer and VNS heuristic approach to solving the multisize containers drayage problem publication-title: Int. Trans. Oper. Res. – volume: 26 start-page: 103 year: 2014 end-page: 120 ident: b0005 article-title: Formulations and branch-and-cut algorithms for multivehicle production and inventory routing problems publication-title: Informs J. Comput. – volume: 116 start-page: 208 year: 2018 end-page: 228 ident: b0240 article-title: Truck appointment systems considering impact to drayage truck tours publication-title: Transp. Res. Part E: Logistics Transp. Rev. – volume: 51 start-page: 688 year: 2017 end-page: 705 ident: b0140 article-title: Pickup and delivery service with manpower planning in Hong Kong public hospitals publication-title: Transp. Sci. – volume: 168 year: 2022 ident: b0040 article-title: Drayage routing with heterogeneous fleet, compatibility constraints, and truck load configurations publication-title: Transp. Res. Part E: Logistics Transp. Rev. – volume: 175 year: 2023 ident: b0085 article-title: A hierarchical optimization approach for dynamic pickup and delivery problem with LIFO constraints publication-title: Transp. Res. Part E: Logistics Transp. Rev. – volume: 67 start-page: 166 year: 2014 end-page: 186 ident: b0025 article-title: Exact and meta-heuristic approach for a general heterogeneous dial-a-ride problem with multiple depots publication-title: Transp. Res. Part B-Methodol. – volume: 175 year: 2023 ident: b0275 article-title: Dynamic pickup and delivery problem with transshipments and LIFO constraints publication-title: Comput. Ind. Eng. – volume: 147 year: 2021 ident: b0290 article-title: Local container drayage problem with truck platooning mode publication-title: Transp. Res. Part E: Logistics Transp. Rev. – volume: 2 start-page: 340 year: 2010 end-page: 355 ident: b0050 article-title: A deterministic annealing algorithm for the pre- and end-haulage of intermodal container terminals publication-title: Int. J. Comput. Aided Eng. Technol. – volume: 166 start-page: 237 year: 2022 end-page: 258 ident: b0120 article-title: Dynamic container drayage with uncertain request arrival times and service time windows publication-title: Transp. Res. B Methodol. – volume: 106 start-page: 231 year: 2017 end-page: 254 ident: b0225 article-title: An exact algorithm for the container drayage problem under a separation mode publication-title: Transp. Res. Part E: Logistics Transp. Rev. – volume: 139 year: 2020 ident: b0320 article-title: A novel mathematical model and a large neighborhood search algorithm for container drayage operations with multi-resource constraints publication-title: Comput. Ind. Eng. – volume: 183 year: 2021 ident: b0145 article-title: Hybrid metaheuristics for solving a home health care routing and scheduling problem with time windows, synchronized visits and lunch breaks publication-title: Expert Syst. Appl. – volume: 55 start-page: 185 year: 2015 end-page: 199 ident: b0075 article-title: A survey on two-echelon routing problems publication-title: Comput. Oper. Res. – volume: 118 start-page: 225 year: 2018 end-page: 239 ident: b0315 article-title: Range-based truck-state transition modeling method for foldable container drayage services publication-title: Transp. Res. Part E: Logistics Transp. Rev. – volume: 147 year: 2021 ident: b0060 article-title: The container drayage problem for heterogeneous trucks with multiple loads: A revisit publication-title: Transp. Res. Part E: Logistics Transp. Rev. – volume: 159 year: 2023 ident: b0335 article-title: Green split multiple-commodity pickup and delivery vehicle routing problem publication-title: Comput. Oper. Res. – volume: 64 start-page: 143 year: 2014 end-page: 159 ident: b0245 article-title: A branch-price-and-cut approach for solving the medium-term home health care planning problem publication-title: Networks – volume: 62 start-page: 136 year: 2014 end-page: 150 ident: b0285 article-title: A tabu search heuristic for the local container drayage problem under a new operation mode publication-title: Transp. Res. Part E: Logistics Transp. Rev. – volume: 50 start-page: 735 year: 2016 end-page: 749 ident: b0015 article-title: A branch-and-cut algorithm for the single truck and trailer routing problem with satellite depots publication-title: Transp. Sci. – volume: 36 start-page: 297 year: 2014 end-page: 322 ident: b0165 article-title: Synchronized routing of active and passive means of transport publication-title: OR Spectr. – volume: 38 start-page: 369 year: 2004 end-page: 378 ident: b0045 article-title: Efficient insertion heuristics for vehicle routing and scheduling problems publication-title: Transp. Sci. – volume: 224 start-page: 466 year: 2013 end-page: 476 ident: b0265 article-title: The rollon–rolloff waste collection vehicle routing problem with time windows publication-title: Eur. J. Oper. Res. – volume: 175 year: 2023 ident: b0305 article-title: An exact algorithm for the multi-trip container drayage problem with truck platooning publication-title: Transp. Res. Part E: Logistics Transp. Rev. – volume: 89 start-page: 70 year: 2016 end-page: 85 ident: b0100 article-title: A model for a multi-size inland container transportation problem publication-title: Transp. Res. Part E: Logistics Transp. Rev. – volume: 52 start-page: 300 year: 2018 end-page: 319 ident: b0235 article-title: Branch-and-price-and-cut for the active-passive vehicle-routing problem publication-title: Transp. Sci. – volume: 51 start-page: 334 year: 2018 end-page: 339 ident: b0270 article-title: Mathematical model for the home health care scheduling and routing problem with flexible lunch break requirements publication-title: IFAC-PapersOnLine – volume: 232 start-page: 87 year: 2015 end-page: 97 ident: b0090 article-title: Flow-based integer linear programs to solve the weekly log-truck scheduling problem publication-title: Ann. Oper. Res. – volume: 54 start-page: 60 year: 2015 end-page: 71 ident: b0325 article-title: A memetic algorithm for the patient transportation problem publication-title: Omega – volume: 56 start-page: 108 year: 2013 end-page: 118 ident: b0135 article-title: An heuristic search for the routing of heterogeneous trucks with single and double container loads publication-title: Transport Res. E-Log. – volume: 98 year: 2019 ident: b0160 article-title: Multi-Depot Vehicle Scheduling Optimization for Port Container Drop and Pull Transport publication-title: J. Coast. Res. – volume: 67 start-page: 743 year: 2016 end-page: 751 ident: b0070 article-title: Solving the vehicle routing problem with lunch break arising in the furniture delivery industry publication-title: J. Oper. Res. Soc. – volume: 175 year: 2023 ident: b0185 article-title: Route planning and benefit assessment of container drayage platooning considering truck laden-or-empty state publication-title: Comput. Ind. Eng. – volume: 299 start-page: 468 year: 2022 end-page: 482 ident: b0080 article-title: A two-stage hybrid heuristic solution for the container drayage problem with trailer reposition publication-title: Eur. J. Oper. Res. – volume: 143 year: 2022 ident: b0280 article-title: Truck routing and platooning optimization considering drivers’ mandatory breaks publication-title: Transp. Res. Part C Emerg. Technol. – volume: 22 start-page: 5708 year: 2021 end-page: 5720 ident: b0330 article-title: Multi-trailer drop-and-pull container drayage problem publication-title: IEEE Trans. Intell. Transp. Syst. – volume: 70 start-page: 793 year: 2019 end-page: 806 ident: b0220 article-title: Integrated drayage scheduling problem with stochastic container packing and unpacking times publication-title: J. Oper. Res. Soc. – volume: 133 start-page: 181 year: 2020 end-page: 209 ident: b0300 article-title: A generic model for the local container drayage problem using the emerging truck platooning operation mode publication-title: Transp. Res. B Methodol. – volume: 12 year: 2023 ident: b0255 article-title: Pickup and delivery problem with hard time windows considering stochastic and time-dependent travel times publication-title: EURO J. Transp. Logistics – volume: 179 year: 2023 ident: b0010 article-title: The multi-depot pickup and delivery problem with capacitated electric vehicles, transfers, and time windows publication-title: Comput. Ind. Eng. – volume: 310 start-page: 343 year: 2023 end-page: 359 ident: b0095 article-title: The multi-trip container drayage problem with synchronization for efficient empty containers re-usage publication-title: Eur. J. Oper. Res. – volume: 125 year: 2021 ident: b0035 article-title: The multi-period multi-trip container drayage problem with release and due dates publication-title: Comput. Oper. Res. – volume: 40 start-page: 455 year: 2006 end-page: 472 ident: b0200 article-title: An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows publication-title: Transp. Sci. – volume: 53 start-page: 319 year: 2019 end-page: 343 ident: b0210 article-title: Vehicle routing and location routing with intermediate stops: A review publication-title: Transp. Sci. – volume: 29 start-page: 33 year: 2002 end-page: 51 ident: b0055 article-title: A tabu search method for the truck and trailer routing problem publication-title: Comput. Oper. Res. – volume: 83 start-page: 28 year: 2017 end-page: 44 ident: b0175 article-title: Branch-and-price and adaptive large neighborhood search for the truck and trailer routing problem with time windows publication-title: Comput. Oper. Res. – volume: 55 start-page: 558 year: 2017 end-page: 575 ident: b0155 article-title: Mathematical model and exact algorithm for the home care worker scheduling and routing problem with lunch break requirements publication-title: Int. J. Prod. Res. – volume: 81 start-page: 267 year: 2015 end-page: 288 ident: b0150 article-title: A branch-and-cut algorithm for a realistic dial-a-ride problem publication-title: Transp. Res. B Methodol. – volume: 61 start-page: 235 year: 2014 end-page: 251 ident: b0310 article-title: Container drayage problem with flexible orders and its near real-time solution strategies publication-title: Transp. Res. Part E: Logistics Transp. Rev. – volume: 34 start-page: 593 year: 2012 end-page: 633 ident: b0180 article-title: Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints publication-title: OR Spectr. – volume: 23 start-page: 19088 year: 2022 end-page: 19104 ident: b0260 article-title: Multi-trip multi-trailer drop-and-pull container drayage problem publication-title: IEEE Trans. Intell. Transp. Syst. – volume: 169 year: 2023 ident: b0295 article-title: Local container drayage problem with improved truck platooning operations publication-title: Transp. Res. Part E: Logistics Transp. Rev. – volume: 44 start-page: 429 year: 2010 end-page: 441 ident: b0115 article-title: Truck driver scheduling in the European Union publication-title: Transp. Sci. – reference: Peters, S.E., Grogan, H., Henderson, G.M., López Gómez, M.A., Martínez Maldonado, M., Silva Sanhueza, I., Dennerlein, J.T., 2021. Working conditions influencing drivers' safety and well-being in the transportation industry: “on Board” program. 18(19). – volume: 23 start-page: 19088 issue: 10 year: 2022 ident: 10.1016/j.cor.2023.106475_b0260 article-title: Multi-trip multi-trailer drop-and-pull container drayage problem publication-title: IEEE Trans. Intell. Transp. Syst. doi: 10.1109/TITS.2022.3156547 – volume: 224 start-page: 466 issue: 3 year: 2013 ident: 10.1016/j.cor.2023.106475_b0265 article-title: The rollon–rolloff waste collection vehicle routing problem with time windows publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2012.09.001 – volume: 70 start-page: 793 issue: 5 year: 2019 ident: 10.1016/j.cor.2023.106475_b0220 article-title: Integrated drayage scheduling problem with stochastic container packing and unpacking times publication-title: J. Oper. Res. Soc. doi: 10.1080/01605682.2018.1457487 – volume: 12 year: 2023 ident: 10.1016/j.cor.2023.106475_b0255 article-title: Pickup and delivery problem with hard time windows considering stochastic and time-dependent travel times publication-title: EURO J. Transp. Logistics doi: 10.1016/j.ejtl.2022.100099 – volume: 106 start-page: 231 year: 2017 ident: 10.1016/j.cor.2023.106475_b0225 article-title: An exact algorithm for the container drayage problem under a separation mode publication-title: Transp. Res. Part E: Logistics Transp. Rev. doi: 10.1016/j.tre.2017.07.010 – volume: 201 year: 2022 ident: 10.1016/j.cor.2023.106475_b0020 article-title: Rolling-horizon approach in solving dynamic multisize multi-trailer container drayage problem publication-title: Expert Syst. Appl. doi: 10.1016/j.eswa.2022.117170 – volume: 51 start-page: 334 issue: 11 year: 2018 ident: 10.1016/j.cor.2023.106475_b0270 article-title: Mathematical model for the home health care scheduling and routing problem with flexible lunch break requirements publication-title: IFAC-PapersOnLine doi: 10.1016/j.ifacol.2018.08.305 – volume: 310 start-page: 343 issue: 1 year: 2023 ident: 10.1016/j.cor.2023.106475_b0095 article-title: The multi-trip container drayage problem with synchronization for efficient empty containers re-usage publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2023.02.041 – volume: 83 start-page: 28 year: 2017 ident: 10.1016/j.cor.2023.106475_b0175 article-title: Branch-and-price and adaptive large neighborhood search for the truck and trailer routing problem with time windows publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2017.01.020 – volume: 51 start-page: 688 issue: 2 year: 2017 ident: 10.1016/j.cor.2023.106475_b0140 article-title: Pickup and delivery service with manpower planning in Hong Kong public hospitals publication-title: Transp. Sci. doi: 10.1287/trsc.2015.0611 – volume: 81 start-page: 267 year: 2015 ident: 10.1016/j.cor.2023.106475_b0150 article-title: A branch-and-cut algorithm for a realistic dial-a-ride problem publication-title: Transp. Res. B Methodol. doi: 10.1016/j.trb.2015.05.009 – volume: 182 year: 2023 ident: 10.1016/j.cor.2023.106475_b0230 article-title: The pickup and delivery problem with multiple depots and dynamic occasional drivers in crowdshipping delivery publication-title: Comput. Ind. Eng. doi: 10.1016/j.cie.2023.109440 – volume: 33 start-page: 3624 issue: 12 year: 2006 ident: 10.1016/j.cor.2023.106475_b0125 article-title: Waste collection vehicle routing problem with time windows publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2005.02.045 – volume: 298 start-page: 76 issue: 1 year: 2022 ident: 10.1016/j.cor.2023.106475_b0205 article-title: Scheduling truck drivers with interdependent routes under European Union regulations publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2021.06.019 – volume: 89 start-page: 70 year: 2016 ident: 10.1016/j.cor.2023.106475_b0100 article-title: A model for a multi-size inland container transportation problem publication-title: Transp. Res. Part E: Logistics Transp. Rev. doi: 10.1016/j.tre.2016.02.010 – volume: 175 year: 2023 ident: 10.1016/j.cor.2023.106475_b0275 article-title: Dynamic pickup and delivery problem with transshipments and LIFO constraints publication-title: Comput. Ind. Eng. doi: 10.1016/j.cie.2022.108835 – volume: 50 start-page: 735 issue: 2 year: 2016 ident: 10.1016/j.cor.2023.106475_b0015 article-title: A branch-and-cut algorithm for the single truck and trailer routing problem with satellite depots publication-title: Transp. Sci. doi: 10.1287/trsc.2014.0571 – volume: 40 start-page: 455 issue: 4 year: 2006 ident: 10.1016/j.cor.2023.106475_b0200 article-title: An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows publication-title: Transp. Sci. doi: 10.1287/trsc.1050.0135 – volume: 116 start-page: 208 year: 2018 ident: 10.1016/j.cor.2023.106475_b0240 article-title: Truck appointment systems considering impact to drayage truck tours publication-title: Transp. Res. Part E: Logistics Transp. Rev. doi: 10.1016/j.tre.2018.06.003 – volume: 34 start-page: 593 issue: 3 year: 2012 ident: 10.1016/j.cor.2023.106475_b0180 article-title: Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints publication-title: OR Spectr. doi: 10.1007/s00291-010-0229-9 – volume: 159 year: 2023 ident: 10.1016/j.cor.2023.106475_b0335 article-title: Green split multiple-commodity pickup and delivery vehicle routing problem publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2023.106318 – volume: 22 start-page: 5708 issue: 9 year: 2021 ident: 10.1016/j.cor.2023.106475_b0330 article-title: Multi-trailer drop-and-pull container drayage problem publication-title: IEEE Trans. Intell. Transp. Syst. doi: 10.1109/TITS.2020.2991098 – volume: 147 year: 2021 ident: 10.1016/j.cor.2023.106475_b0290 article-title: Local container drayage problem with truck platooning mode publication-title: Transp. Res. Part E: Logistics Transp. Rev. doi: 10.1016/j.tre.2020.102211 – volume: 133 start-page: 181 year: 2020 ident: 10.1016/j.cor.2023.106475_b0300 article-title: A generic model for the local container drayage problem using the emerging truck platooning operation mode publication-title: Transp. Res. B Methodol. doi: 10.1016/j.trb.2019.12.009 – volume: 122 year: 2020 ident: 10.1016/j.cor.2023.106475_b0130 article-title: A review of vehicle routing with simultaneous pickup and delivery publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2020.104987 – volume: 175 year: 2023 ident: 10.1016/j.cor.2023.106475_b0305 article-title: An exact algorithm for the multi-trip container drayage problem with truck platooning publication-title: Transp. Res. Part E: Logistics Transp. Rev. doi: 10.1016/j.tre.2023.103138 – volume: 67 start-page: 743 issue: 5 year: 2016 ident: 10.1016/j.cor.2023.106475_b0070 article-title: Solving the vehicle routing problem with lunch break arising in the furniture delivery industry publication-title: J. Oper. Res. Soc. doi: 10.1057/jors.2015.90 – volume: 54 start-page: 60 year: 2015 ident: 10.1016/j.cor.2023.106475_b0325 article-title: A memetic algorithm for the patient transportation problem publication-title: Omega doi: 10.1016/j.omega.2015.01.011 – volume: 38 start-page: 369 issue: 3 year: 2004 ident: 10.1016/j.cor.2023.106475_b0045 article-title: Efficient insertion heuristics for vehicle routing and scheduling problems publication-title: Transp. Sci. doi: 10.1287/trsc.1030.0046 – volume: 40 start-page: 342 issue: 3 year: 2006 ident: 10.1016/j.cor.2023.106475_b0105 article-title: A Tabu Search Algorithm for a Routing and Container Loading Problem publication-title: Transp. Sci. doi: 10.1287/trsc.1050.0145 – volume: 166 start-page: 237 year: 2022 ident: 10.1016/j.cor.2023.106475_b0120 article-title: Dynamic container drayage with uncertain request arrival times and service time windows publication-title: Transp. Res. B Methodol. doi: 10.1016/j.trb.2022.10.010 – volume: 168 year: 2022 ident: 10.1016/j.cor.2023.106475_b0040 article-title: Drayage routing with heterogeneous fleet, compatibility constraints, and truck load configurations publication-title: Transp. Res. Part E: Logistics Transp. Rev. doi: 10.1016/j.tre.2022.102922 – volume: 169 year: 2023 ident: 10.1016/j.cor.2023.106475_b0295 article-title: Local container drayage problem with improved truck platooning operations publication-title: Transp. Res. Part E: Logistics Transp. Rev. doi: 10.1016/j.tre.2022.102992 – volume: 159 year: 2022 ident: 10.1016/j.cor.2023.106475_b0065 article-title: Container port drayage operations and management: Past and future publication-title: Transp. Res. Part E: Logistics Transp. Rev. doi: 10.1016/j.tre.2022.102633 – volume: 143 year: 2022 ident: 10.1016/j.cor.2023.106475_b0280 article-title: Truck routing and platooning optimization considering drivers’ mandatory breaks publication-title: Transp. Res. Part C Emerg. Technol. doi: 10.1016/j.trc.2022.103809 – volume: 175 year: 2023 ident: 10.1016/j.cor.2023.106475_b0085 article-title: A hierarchical optimization approach for dynamic pickup and delivery problem with LIFO constraints publication-title: Transp. Res. Part E: Logistics Transp. Rev. doi: 10.1016/j.tre.2023.103131 – volume: 52 start-page: 300 issue: 2 year: 2018 ident: 10.1016/j.cor.2023.106475_b0235 article-title: Branch-and-price-and-cut for the active-passive vehicle-routing problem publication-title: Transp. Sci. doi: 10.1287/trsc.2016.0730 – volume: 24 start-page: 583 issue: 3 year: 2017 ident: 10.1016/j.cor.2023.106475_b0250 article-title: Generalized mixed integer and VNS heuristic approach to solving the multisize containers drayage problem publication-title: Int. Trans. Oper. Res. doi: 10.1111/itor.12264 – volume: 179 year: 2023 ident: 10.1016/j.cor.2023.106475_b0010 article-title: The multi-depot pickup and delivery problem with capacitated electric vehicles, transfers, and time windows publication-title: Comput. Ind. Eng. doi: 10.1016/j.cie.2023.109207 – volume: 299 start-page: 468 issue: 2 year: 2022 ident: 10.1016/j.cor.2023.106475_b0080 article-title: A two-stage hybrid heuristic solution for the container drayage problem with trailer reposition publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2021.06.040 – volume: 55 start-page: 185 year: 2015 ident: 10.1016/j.cor.2023.106475_b0075 article-title: A survey on two-echelon routing problems publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2014.06.008 – volume: 139 year: 2020 ident: 10.1016/j.cor.2023.106475_b0320 article-title: A novel mathematical model and a large neighborhood search algorithm for container drayage operations with multi-resource constraints publication-title: Comput. Ind. Eng. doi: 10.1016/j.cie.2019.106143 – volume: 139 year: 2020 ident: 10.1016/j.cor.2023.106475_b0170 article-title: A generalised model for container drayage operations with heterogeneous fleet, multi-container sizes and two modes of operation publication-title: Transp. Res. Part E: Logistics Transp. Rev. doi: 10.1016/j.tre.2020.101973 – volume: 175 year: 2023 ident: 10.1016/j.cor.2023.106475_b0185 article-title: Route planning and benefit assessment of container drayage platooning considering truck laden-or-empty state publication-title: Comput. Ind. Eng. doi: 10.1016/j.cie.2022.108879 – volume: 36 start-page: 297 issue: 2 year: 2014 ident: 10.1016/j.cor.2023.106475_b0165 article-title: Synchronized routing of active and passive means of transport publication-title: OR Spectr. doi: 10.1007/s00291-012-0310-7 – volume: 137 start-page: 429 year: 2020 ident: 10.1016/j.cor.2023.106475_b0195 article-title: A metaheuristic for the time-dependent vehicle routing problem considering driving hours regulations – An application in city logistics publication-title: Transp. Res. A Policy Pract. doi: 10.1016/j.tra.2018.10.033 – volume: 129 year: 2021 ident: 10.1016/j.cor.2023.106475_b0110 article-title: A multiperiod drayage problem with customer-dependent service periods publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2020.105189 – volume: 67 start-page: 166 issue: 9 year: 2014 ident: 10.1016/j.cor.2023.106475_b0025 article-title: Exact and meta-heuristic approach for a general heterogeneous dial-a-ride problem with multiple depots publication-title: Transp. Res. Part B-Methodol. doi: 10.1016/j.trb.2014.05.007 – volume: 147 year: 2021 ident: 10.1016/j.cor.2023.106475_b0060 article-title: The container drayage problem for heterogeneous trucks with multiple loads: A revisit publication-title: Transp. Res. Part E: Logistics Transp. Rev. doi: 10.1016/j.tre.2021.102241 – volume: 98 issue: sp1 year: 2019 ident: 10.1016/j.cor.2023.106475_b0160 article-title: Multi-Depot Vehicle Scheduling Optimization for Port Container Drop and Pull Transport publication-title: J. Coast. Res. doi: 10.2112/SI98-077.1 – volume: 183 year: 2021 ident: 10.1016/j.cor.2023.106475_b0145 article-title: Hybrid metaheuristics for solving a home health care routing and scheduling problem with time windows, synchronized visits and lunch breaks publication-title: Expert Syst. Appl. doi: 10.1016/j.eswa.2021.115307 – volume: 55 start-page: 558 issue: 2 year: 2017 ident: 10.1016/j.cor.2023.106475_b0155 article-title: Mathematical model and exact algorithm for the home care worker scheduling and routing problem with lunch break requirements publication-title: Int. J. Prod. Res. doi: 10.1080/00207543.2016.1213917 – volume: 2 start-page: 340 issue: 4 year: 2010 ident: 10.1016/j.cor.2023.106475_b0050 article-title: A deterministic annealing algorithm for the pre- and end-haulage of intermodal container terminals publication-title: Int. J. Comput. Aided Eng. Technol. doi: 10.1504/IJCAET.2010.035390 – ident: 10.1016/j.cor.2023.106475_b0190 doi: 10.3390/ijerph181910173 – volume: 61 start-page: 235 year: 2014 ident: 10.1016/j.cor.2023.106475_b0310 article-title: Container drayage problem with flexible orders and its near real-time solution strategies publication-title: Transp. Res. Part E: Logistics Transp. Rev. doi: 10.1016/j.tre.2013.11.009 – volume: 125 year: 2021 ident: 10.1016/j.cor.2023.106475_b0035 article-title: The multi-period multi-trip container drayage problem with release and due dates publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2020.105102 – volume: 44 start-page: 429 issue: 4 year: 2010 ident: 10.1016/j.cor.2023.106475_b0115 article-title: Truck driver scheduling in the European Union publication-title: Transp. Sci. doi: 10.1287/trsc.1100.0330 – volume: 29 start-page: 33 issue: 1 year: 2002 ident: 10.1016/j.cor.2023.106475_b0055 article-title: A tabu search method for the truck and trailer routing problem publication-title: Comput. Oper. Res. doi: 10.1016/S0305-0548(00)00056-3 – volume: 232 start-page: 87 year: 2015 ident: 10.1016/j.cor.2023.106475_b0090 article-title: Flow-based integer linear programs to solve the weekly log-truck scheduling problem publication-title: Ann. Oper. Res. – volume: 64 start-page: 143 issue: 3 year: 2014 ident: 10.1016/j.cor.2023.106475_b0245 article-title: A branch-price-and-cut approach for solving the medium-term home health care planning problem publication-title: Networks doi: 10.1002/net.21566 – volume: 176 start-page: 7 year: 2016 ident: 10.1016/j.cor.2023.106475_b0215 article-title: Optimization of drayage operations with time-window constraints publication-title: Int. J. Prod. Econ. doi: 10.1016/j.ijpe.2016.03.005 – volume: 118 start-page: 225 year: 2018 ident: 10.1016/j.cor.2023.106475_b0315 article-title: Range-based truck-state transition modeling method for foldable container drayage services publication-title: Transp. Res. Part E: Logistics Transp. Rev. doi: 10.1016/j.tre.2018.07.011 – volume: 53 start-page: 319 issue: 2 year: 2019 ident: 10.1016/j.cor.2023.106475_b0210 article-title: Vehicle routing and location routing with intermediate stops: A review publication-title: Transp. Sci. doi: 10.1287/trsc.2018.0836 – volume: 26 start-page: 103 issue: 1 year: 2014 ident: 10.1016/j.cor.2023.106475_b0005 article-title: Formulations and branch-and-cut algorithms for multivehicle production and inventory routing problems publication-title: Informs J. Comput. doi: 10.1287/ijoc.2013.0550 – volume: 56 start-page: 108 year: 2013 ident: 10.1016/j.cor.2023.106475_b0135 article-title: An heuristic search for the routing of heterogeneous trucks with single and double container loads publication-title: Transport Res. E-Log. doi: 10.1016/j.tre.2013.06.001 – volume: 42 start-page: 371 issue: 3 year: 2008 ident: 10.1016/j.cor.2023.106475_b0030 article-title: An effective multirestart deterministic annealing metaheuristic for the fleet size and mix vehicle-routing problem with time windows publication-title: Transp. Sci. doi: 10.1287/trsc.1070.0217 – volume: 62 start-page: 136 issue: 1 year: 2014 ident: 10.1016/j.cor.2023.106475_b0285 article-title: A tabu search heuristic for the local container drayage problem under a new operation mode publication-title: Transp. Res. Part E: Logistics Transp. Rev. doi: 10.1016/j.tre.2013.12.007 |
| SSID | ssj0000721 |
| Score | 2.4726846 |
| Snippet | •A drop-and-pull container drayage with flexible work break is addressed.•A mixed-integer programming model is constructed to formulate this problem.•Three... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 106475 |
| SubjectTerms | Backtracking adaptive threshold accepting algorithm Container drayage Drop-and-pull transportation Mixed-integer programming model Work break |
| Title | Drop-and-pull container drayage with flexible assignment of work break for vehicle drivers |
| URI | https://dx.doi.org/10.1016/j.cor.2023.106475 |
| Volume | 162 |
| WOSCitedRecordID | wos001125808500001&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: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 issn: 0305-0548 databaseCode: AIEXJ dateStart: 19950101 customDbUrl: isFulltext: true dateEnd: 99991231 titleUrlDefault: https://www.sciencedirect.com omitProxy: false ssIdentifier: ssj0000721 providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Nb9QwELWWFiE48LGAKF_ygRNVUBLbcXKs2iLgUCFU1BWXyLGdklIlUbq7Wv49Y8f2bqsW0QOXKIri2SjzdjyevHlG6B3VxIiSsCiVUkY00Qr-czmLSJZoYuRjikzazSb40VE-mxVfJ5OV74VZnvO2zVerov-vroZr4GzTOnsLdwejcAHOwelwBLfD8Z8cfzB0fSRaFfWwurRUdGEa_HbVIIxgxVh5rY0Opmmagty5OQ2MAMPS2oVFsvhl6YdL_dNYh6GWvbGZyPrdIC4sdrpeD45T59SDQpX5xBWkDzTAw02Tm4Xqb4vmd7cI9ddmYRHXBMzuu_aRE932fryrUqTUE5tDMCOGJMhGVc0QeV0gHmNnYvpe2bVhfawwnIFXjIRrSj6s770soX1laguEQ89lOyvBRGlMlKOJO2g75ayAeLi99_lw9mU9i3Pbsxee238Rt9zAK89xfU6zkaccP0YP3QID743AeIImup2ie76_YYoeec9hF9an6MGGKOVT9OMSgHAAEHYAwgZA2AMIrwGEuxobAGELIAwAwg5A2AHoGfr-8fB4_1PkduCIJAT6eVQzkcWVzFgiFZNMxUkVa0aV5DmpdCIybfJHzVWsCOcxUyklhHLNhVCJEoo8R1tt1-oXCEse00rWiaiqmjJd57GQuch1Wug6yQXbQbF_h6V08vRml5Tz8kbf7aD3YUg_arP87WbqHVO65HJMGksA2c3DXt7mN16h-2vsv0Zb82Gh36C7cjlvLoa3DmF_AAXzmzg |
| linkProvider | Elsevier |
| 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=Drop-and-pull+container+drayage+with+flexible+assignment+of+work+break+for+vehicle+drivers&rft.jtitle=Computers+%26+operations+research&rft.au=Wang%2C+Decheng&rft.au=Zhang%2C+Ruiyou&rft.au=Qiu%2C+Bin&rft.au=Chen%2C+Wenpeng&rft.date=2024-02-01&rft.issn=0305-0548&rft.volume=162&rft.spage=106475&rft_id=info:doi/10.1016%2Fj.cor.2023.106475&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_cor_2023_106475 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0305-0548&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0305-0548&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0305-0548&client=summon |