Constraint programming-based solution approaches for three-dimensional loading capacitated vehicle routing problems
•Novel Constraint Programming (CP) models are proposed for the 3l-CVRP.•CP based decomposition models are more effective than the MIP model.•A hybrid CP model is proposed for large-size problems.•New best solutions are obtained for 36 benchmark instances. This paper presents constraint programming-b...
Uloženo v:
| Vydáno v: | Computers & industrial engineering Ročník 171; s. 108505 |
|---|---|
| Hlavní autoři: | , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Elsevier Ltd
01.09.2022
|
| Témata: | |
| ISSN: | 0360-8352, 1879-0550 |
| 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 | •Novel Constraint Programming (CP) models are proposed for the 3l-CVRP.•CP based decomposition models are more effective than the MIP model.•A hybrid CP model is proposed for large-size problems.•New best solutions are obtained for 36 benchmark instances.
This paper presents constraint programming-based solution approaches for the three-dimensional loading capacitated vehicle routing problem (3l-CVRP) that consists of vehicle routing and three-dimensional loading problems in distribution logistics. Despite the practical benefits in the logistics world, the 3l-CVRP has not been extensively studied in the literature for its high combinatorial complexity. Therefore, we developed integrated and decomposed constraint programming-based solution methods in this study. The decomposed models outperformed the mixed-integer programming model proposed earlier in the literature for small-size problems. Furthermore, we solved the well-known benchmark problems with a decomposed model using constraint programming for the vehicle routing part of the problem and an evolutionary algorithm for the loading part. The computational study results show that the best-known results are improved in 36 of 93 problems. |
|---|---|
| AbstractList | •Novel Constraint Programming (CP) models are proposed for the 3l-CVRP.•CP based decomposition models are more effective than the MIP model.•A hybrid CP model is proposed for large-size problems.•New best solutions are obtained for 36 benchmark instances.
This paper presents constraint programming-based solution approaches for the three-dimensional loading capacitated vehicle routing problem (3l-CVRP) that consists of vehicle routing and three-dimensional loading problems in distribution logistics. Despite the practical benefits in the logistics world, the 3l-CVRP has not been extensively studied in the literature for its high combinatorial complexity. Therefore, we developed integrated and decomposed constraint programming-based solution methods in this study. The decomposed models outperformed the mixed-integer programming model proposed earlier in the literature for small-size problems. Furthermore, we solved the well-known benchmark problems with a decomposed model using constraint programming for the vehicle routing part of the problem and an evolutionary algorithm for the loading part. The computational study results show that the best-known results are improved in 36 of 93 problems. |
| ArticleNumber | 108505 |
| Author | Topaloglu Yildiz, Seyda Küçük, Mustafa |
| Author_xml | – sequence: 1 givenname: Mustafa surname: Küçük fullname: Küçük, Mustafa email: mustafa.kucuk218@ogr.deu.edu.tr organization: Graduate School of Natural and Applied Sciences, Dokuz Eylul University, Izmir, Turkiye – sequence: 2 givenname: Seyda surname: Topaloglu Yildiz fullname: Topaloglu Yildiz, Seyda email: seyda.topaloglu@deu.edu.tr organization: Department of Industrial Engineering, Dokuz Eylul University, Izmir, Turkiye |
| BookMark | eNp9kE1OwzAQhS0EEm3hAOxygRTbiWNHrFDFn1SJDawtezJpXSV2ZYdK3B6XsmLR1Wjmzfc08-bk0gePhNwxumSUNfe7JThccsp57pWg4oLMmJJtSYWgl2RGq4aWqhL8msxT2lFKa9GyGUmr4NMUjfNTsY9hE804Or8prUnYFSkMX5MLvjD7LBrYYir6EItpGxHLzo3oU5bNUAzBdJkrwOwNuMlMmT7g1sGARQzZJGvZwg44phty1Zsh4e1fXZDP56eP1Wu5fn95Wz2uS-CtnMpeUYBaAdZMSlBA60Y1fWeVrRpQ2FKr6sYAk41opRJMVsy2quksA-Dc8mpB5MkXYkgpYq9_L8sHHx8eNKP6mJ3e5TnqY3b6lF0m2T9yH91o4vdZ5uHEYH7p4DDqlFc8YOciwqS74M7QP8NMjCg |
| CitedBy_id | crossref_primary_10_1016_j_jclepro_2024_141249 crossref_primary_10_1016_j_tre_2025_104032 crossref_primary_10_3390_pr13051449 crossref_primary_10_1016_j_cie_2023_109619 crossref_primary_10_1016_j_tre_2023_103208 crossref_primary_10_1007_s12046_024_02578_w crossref_primary_10_1109_TASE_2024_3393507 crossref_primary_10_3390_logistics9020070 crossref_primary_10_1016_j_aei_2023_102029 crossref_primary_10_1016_j_cie_2025_111194 crossref_primary_10_1007_s10479_023_05533_w crossref_primary_10_7717_peerj_cs_1613 crossref_primary_10_1680_jtran_23_00041 crossref_primary_10_3390_su162310272 crossref_primary_10_3390_su15043594 crossref_primary_10_1016_j_dajour_2022_100139 crossref_primary_10_1016_j_asoc_2025_112938 crossref_primary_10_1080_00207543_2023_2290699 crossref_primary_10_1016_j_asej_2025_103462 crossref_primary_10_3390_agriculture13071430 crossref_primary_10_1007_s40747_025_01920_x crossref_primary_10_1109_ACCESS_2024_3363417 |
| Cites_doi | 10.2478/emj-2018-0009 10.1016/j.cor.2011.11.008 10.1016/j.engappai.2013.03.012 10.1016/j.ejor.2017.05.034 10.1016/j.cie.2015.06.005 10.1080/00207543.2016.1231940 10.1007/978-3-642-01929-6_12 10.1111/itor.12570 10.1016/j.ejor.2019.09.024 10.1023/B:ANOR.0000032576.73681.29 10.1016/j.trb.2015.10.001 10.1287/opre.8.1.101 10.1016/j.cor.2012.09.005 10.1007/s00291-014-0386-3 10.1016/j.cor.2011.11.013 10.1007/978-3-540-30198-1_45 10.1007/s10479-015-2034-y 10.1002/net.21848 10.1287/trsc.32.1.12 10.1111/j.1475-3995.2012.00872.x 10.1109/VTCSpring.2019.8746416 10.1287/trsc.1050.0145 10.1016/j.ejor.2017.10.029 10.1007/s10287-004-0020-y 10.1016/j.ejtl.2021.100043 10.1023/A:1013653332557 10.1016/j.cie.2016.05.008 10.1109/MCI.2014.2350933 10.1016/j.ejor.2016.04.016 10.5267/j.ijiec.2019.8.002 10.1016/j.cie.2013.07.025 10.1051/ro/2012008 10.1016/j.cie.2017.03.017 10.1108/JM2-11-2018-0183 10.1007/s00291-008-0129-4 10.1016/j.eswa.2016.05.023 10.1007/s10479-010-0698-x 10.1111/itor.12586 10.1287/opre.35.2.254 10.1080/00207543.2019.1630773 10.1007/s10479-019-03205-2 10.1016/j.cor.2013.10.017 10.1016/j.ejor.2014.12.001 10.1016/j.ejor.2009.03.046 10.1007/978-1-84882-215-3_16 10.1016/j.ejor.2017.08.035 10.1016/j.ejor.2012.12.006 10.1016/j.ejor.2016.06.072 10.1109/ICSMC.2010.5642203 10.1137/1.9780898718515 10.1023/A:1013661617536 10.1023/A:1009621410177 10.1109/RIVF.2010.5632215 10.1016/0305-0483(95)00015-G 10.1016/j.ejor.2013.02.056 10.1016/j.eswa.2015.10.013 10.1016/j.ejor.2021.08.025 10.1109/CSO.2009.127 10.1016/j.procs.2015.05.382 10.1016/j.cor.2011.11.001 10.1016/j.cie.2016.03.030 |
| ContentType | Journal Article |
| Copyright | 2022 Elsevier Ltd |
| Copyright_xml | – notice: 2022 Elsevier Ltd |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.cie.2022.108505 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Applied Sciences Engineering |
| EISSN | 1879-0550 |
| ExternalDocumentID | 10_1016_j_cie_2022_108505 S0360835222005228 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 1B1 1RT 1~. 1~5 29F 4.4 457 4G. 5GY 5VS 7-5 71M 8P~ 9JN 9JO AAAKG AABNK AACTN AAEDT AAEDW AAFWJ AAIAV AAIKC AAIKJ AAKOC AALRI AAMNW AAOAW AAQFI AAQXK AARIN AAXUO ABAOU ABMAC ABUCO ABXDB ABYKQ ACAZW ACDAQ ACGFO ACGFS ACNCT ACNNM ACRLP ADBBV ADEZE ADGUI ADMUD ADRHT ADTZH AEBSH AECPX AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHJVU AIEXJ AIGVJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ APLSM ARUGR ASPBG AVWKF AXJTR AZFZN BJAXD BKOJK BKOMP BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 FDB FEDTE FGOYB FIRID FNPLU FYGXN G-2 G-Q G8K GBLVA HAMUX HLZ HVGLF HZ~ H~9 IHE J1W JJJVA KOM LX9 LY1 LY7 M41 MHUIS MO0 MS~ N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ Q38 R2- RIG RNS ROL RPZ RXW SBC SDF SDG SDP SDS SES SET SEW SPC SPCBC SSB SSD SST SSW SSZ T5K TAE TN5 WUQ XPP ZMT ~G- 9DU AATTM AAXKI AAYWO AAYXX ABDPE ABJNI ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD |
| ID | FETCH-LOGICAL-c297t-f80cc48ce4177c8c04686fdb8b36c8e90b846ac176597851731b986db1cc22b23 |
| ISICitedReferencesCount | 23 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000879227500002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0360-8352 |
| IngestDate | Tue Nov 18 21:50:51 EST 2025 Sat Nov 29 07:22:37 EST 2025 Fri Feb 23 02:38:42 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Time windows Decomposition Container loading problem Constraint programming Vehicle routing problem |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c297t-f80cc48ce4177c8c04686fdb8b36c8e90b846ac176597851731b986db1cc22b23 |
| ParticipantIDs | crossref_citationtrail_10_1016_j_cie_2022_108505 crossref_primary_10_1016_j_cie_2022_108505 elsevier_sciencedirect_doi_10_1016_j_cie_2022_108505 |
| PublicationCentury | 2000 |
| PublicationDate | September 2022 2022-09-00 |
| PublicationDateYYYYMMDD | 2022-09-01 |
| PublicationDate_xml | – month: 09 year: 2022 text: September 2022 |
| PublicationDecade | 2020 |
| PublicationTitle | Computers & industrial engineering |
| PublicationYear | 2022 |
| Publisher | Elsevier Ltd |
| Publisher_xml | – name: Elsevier Ltd |
| References | Moura (b0265) 2019; 26 Rousseau, Gendreau, Pesant, Focacci (b0320) 2004; 130 Talbi (b0355) 2009; Vol. 74 Gendreau, Iori, Laporte, Martello (b0130) 2006; 40 (pp. 4029-4034). IEEE. Bortfeldt (b0035) 2012; 39 (pp. 148-162). Springer, Berlin, Heidelberg. Ahmeti, A., & Musliu, N. (2021). Hybridizing Constraint Programming and Meta-Heuristics for Multi-Mode Resource-Constrained Multiple Projects Scheduling Problem. In Gedik, Kirac, Milburn, Rainwater (b0120) 2017; 107 Moura, Oliveira (b0270) 2009; 31 Pace, Turky, Moser, Aleti (b0280) 2015; 51 IBM. 2019. “IBM ILOG CPLEX Optimization Studio V12. 9.0 documentation.” Toth, P., & Vigo, D. (Eds.). (2002). Apt (b0015) 2003 Vega-Mejía, González-Neira, Montoya-Torres, Islam (b0375) 2020; 11 Miao, Ruan, Woghiren, Ruo (b0260) 2012; 46 Männel, Bortfeldt (b0245) 2018; 264 Karabulut, K., & İnceoğlu, M. M. (2004, October). A hybrid genetic algorithm for packing in 3D with deepest bottom left with fill method. In Çavdar, Sokol (b0080) 2019; 73 De Backer, Furnon, Shaw, Kilby, Prosser (b0090) 2000; 6 Wei, Zhang, Lim (b0390) 2014; 9 Focacci, Lodi, Milano (b0110) 2002; 8 Kucuk, M., & Ermis, M. (2010, October). A new hybrid evolutionary algorithm for three-dimensional packing problems. In Zhang, Wei, Lim (b0405) 2015; 82 Ngoenriang, N., Sawadsitang, S., Leangsuksun, C., Niyato, D., & Tan, P. S. (2019, April). Joint Vehicle Routing and Loading in Delivery Planning: A Stochastic Programming Approach. In Corne, Lones (bib411) 2018 Dantzig, Wolfe (b0085) 1960; 8 Hooker (b0150) 2007 (pp. 1-5). IEEE. Song, Jones, Asgari, Pigden (b0340) 2020; 291 . Junqueira, Morabito (b0190) 2015; 88 Society for Industrial and Applied Mathematics. Shaw (b0330) 1998 Józefowska, Pawlak, Pesch, Morze, Kowalski (b0185) 2018; 10 Vega-Mejía, Montoya-Torres, Islam (b0370) 2019; 26 Ruan, Zhang, Miao, Shen (b0325) 2013; 40 Mahvash, Awasthi, Chauhan (b0230) 2017; 55 Qu, R., & He, F. (2008, December). A hybrid constraint programming approach for nurse rostering problems. In Junqueira, Oliveira, Carravilla, Morabito (b0195) 2013; 20 Talbi (b0345) 2016; 240 Bortfeldt, Yi (b0050) 2020; 282 Quoc, N. H. B., & Anh, D. T. (2010, November). Combining constraint programming and Tabu search to solve vehicle routing problem with time windows. In Benders (b0025) 2005; 2 Zachariadis, Tarantilis, Kiranoudis (b0400) 2013; 229 Mak-Hau, Moser, Aleti (b0235) 2018 Wei, Zhang, Zhang, Leung (b0395) 2018; 265 Martin, Hokama, Morabito, Munari (b0250) 2020; 58 Bortfeldt, Hahn, Männel, Mönch (b0055) 2015; 243 (pp. 441-450). Springer, Berlin, Heidelberg. Fuellerer, Doerner, Hartl, Iori (b0115) 2010; 201 (Vol. 2, pp. 602-606). IEEE. Wallace (b0380) 2006 Rajaei, Moslehi, Reisi-Nafchi (b0305) 2022; 299 Akpinar (b0010) 2016; 61 Laborie, P. (2009, May). IBM ILOG CP Optimizer for detailed scheduling illustrated on three problems. In El Hachemi, Gendreau, Rousseau (b0100) 2011; 184 Krebs, Ehmke (b0205) 2021; 10 Tao, Wang (b0360) 2015; 55 Ceschia, Schaerf, Stützle (b0070) 2013; 66 Rousseau, Gendreau, Pesant (b0315) 2002; 8 Solomon (b0335) 1987; 35 (b0350) 2013 (pp. 1-4). IEEE. Bortfeldt, Homberger (b0040) 2013; 40 Côté, Guastaroba, Speranza (b0075) 2017; 257 Männel, Bortfeldt (b0240) 2016; 254 Iori, Martello (b0170) 2010; 18 Zhu, Qin, Lim, Wang (b0410) 2012; 39 Pollaris, Braekers, Caris, Janssens, Limbourg (b0290) 2015; 37 Huang, Hwang, Lu (b0155) 2016; 97 Lacomme, Toussaint, Duhamel (b0225) 2013; 26 Ayough, Khorshidvand, Massomnedjad, Motameni (b0020) 2020; 15 Pesant, Gendreau, Potvin, Rousseau (b0285) 1998; 32 Wang, F., Tao, Y., & Shi, N. (2009, April). A survey on vehicle routing problem with loading constraints. In (Vol. 1). Bortfeldt, Wäscher (b0045) 2013; 229 Jamrus, Chien (b0180) 2016; 96 Reil, Bortfeldt, Mönch (b0310) 2018; 266 Hokama, Miyazawa, Xavier (b0145) 2016; 47 Bischoff, Ratcliff (b0030) 1995; 23 Escobar-Falcón, Álvarez-Martínez, Granada-Echeverri, Escobar, Romero-Lázaro (b0105) 2016; 78 (pp. 211-224). Springer, London. Küçük, Yıldız (b0215) 2019; 25 Wei (10.1016/j.cie.2022.108505_b0390) 2014; 9 Shaw (10.1016/j.cie.2022.108505_b0330) 1998 Côté (10.1016/j.cie.2022.108505_b0075) 2017; 257 Martin (10.1016/j.cie.2022.108505_b0250) 2020; 58 Vega-Mejía (10.1016/j.cie.2022.108505_b0370) 2019; 26 Küçük (10.1016/j.cie.2022.108505_b0215) 2019; 25 Song (10.1016/j.cie.2022.108505_b0340) 2020; 291 Gedik (10.1016/j.cie.2022.108505_b0120) 2017; 107 Akpinar (10.1016/j.cie.2022.108505_b0010) 2016; 61 Pollaris (10.1016/j.cie.2022.108505_b0290) 2015; 37 Gendreau (10.1016/j.cie.2022.108505_b0130) 2006; 40 10.1016/j.cie.2022.108505_b0160 Vega-Mejía (10.1016/j.cie.2022.108505_b0375) 2020; 11 Pace (10.1016/j.cie.2022.108505_b0280) 2015; 51 Bortfeldt (10.1016/j.cie.2022.108505_b0040) 2013; 40 10.1016/j.cie.2022.108505_b0200 10.1016/j.cie.2022.108505_b0365 Junqueira (10.1016/j.cie.2022.108505_b0195) 2013; 20 Bortfeldt (10.1016/j.cie.2022.108505_b0035) 2012; 39 10.1016/j.cie.2022.108505_b0005 Corne (10.1016/j.cie.2022.108505_bib411) 2018 Escobar-Falcón (10.1016/j.cie.2022.108505_b0105) 2016; 78 Krebs (10.1016/j.cie.2022.108505_b0205) 2021; 10 Ceschia (10.1016/j.cie.2022.108505_b0070) 2013; 66 Zhu (10.1016/j.cie.2022.108505_b0410) 2012; 39 Pesant (10.1016/j.cie.2022.108505_b0285) 1998; 32 Dantzig (10.1016/j.cie.2022.108505_b0085) 1960; 8 Hooker (10.1016/j.cie.2022.108505_b0150) 2007 Zachariadis (10.1016/j.cie.2022.108505_b0400) 2013; 229 Rajaei (10.1016/j.cie.2022.108505_b0305) 2022; 299 Jamrus (10.1016/j.cie.2022.108505_b0180) 2016; 96 10.1016/j.cie.2022.108505_b0275 Lacomme (10.1016/j.cie.2022.108505_b0225) 2013; 26 Männel (10.1016/j.cie.2022.108505_b0240) 2016; 254 Çavdar (10.1016/j.cie.2022.108505_b0080) 2019; 73 Junqueira (10.1016/j.cie.2022.108505_b0190) 2015; 88 Wallace (10.1016/j.cie.2022.108505_b0380) 2006 Focacci (10.1016/j.cie.2022.108505_b0110) 2002; 8 Benders (10.1016/j.cie.2022.108505_b0025) 2005; 2 Fuellerer (10.1016/j.cie.2022.108505_b0115) 2010; 201 Bischoff (10.1016/j.cie.2022.108505_b0030) 1995; 23 Bortfeldt (10.1016/j.cie.2022.108505_b0045) 2013; 229 Mahvash (10.1016/j.cie.2022.108505_b0230) 2017; 55 Józefowska (10.1016/j.cie.2022.108505_b0185) 2018; 10 Huang (10.1016/j.cie.2022.108505_b0155) 2016; 97 Rousseau (10.1016/j.cie.2022.108505_b0315) 2002; 8 Ruan (10.1016/j.cie.2022.108505_b0325) 2013; 40 Bortfeldt (10.1016/j.cie.2022.108505_b0050) 2020; 282 10.1016/j.cie.2022.108505_b0220 10.1016/j.cie.2022.108505_b0385 (10.1016/j.cie.2022.108505_b0350) 2013 Iori (10.1016/j.cie.2022.108505_b0170) 2010; 18 10.1016/j.cie.2022.108505_b0300 Talbi (10.1016/j.cie.2022.108505_b0355) 2009; Vol. 74 Talbi (10.1016/j.cie.2022.108505_b0345) 2016; 240 Apt (10.1016/j.cie.2022.108505_b0015) 2003 Männel (10.1016/j.cie.2022.108505_b0245) 2018; 264 Tao (10.1016/j.cie.2022.108505_b0360) 2015; 55 Solomon (10.1016/j.cie.2022.108505_b0335) 1987; 35 Hokama (10.1016/j.cie.2022.108505_b0145) 2016; 47 Miao (10.1016/j.cie.2022.108505_b0260) 2012; 46 Reil (10.1016/j.cie.2022.108505_b0310) 2018; 266 El Hachemi (10.1016/j.cie.2022.108505_b0100) 2011; 184 Moura (10.1016/j.cie.2022.108505_b0265) 2019; 26 Rousseau (10.1016/j.cie.2022.108505_b0320) 2004; 130 10.1016/j.cie.2022.108505_b0295 Ayough (10.1016/j.cie.2022.108505_b0020) 2020; 15 De Backer (10.1016/j.cie.2022.108505_b0090) 2000; 6 Mak-Hau (10.1016/j.cie.2022.108505_b0235) 2018 Wei (10.1016/j.cie.2022.108505_b0395) 2018; 265 Bortfeldt (10.1016/j.cie.2022.108505_b0055) 2015; 243 10.1016/j.cie.2022.108505_b0210 Moura (10.1016/j.cie.2022.108505_b0270) 2009; 31 Zhang (10.1016/j.cie.2022.108505_b0405) 2015; 82 |
| References_xml | – volume: 184 start-page: 163 year: 2011 end-page: 178 ident: b0100 article-title: A hybrid constraint programming approach to the log-truck scheduling problem publication-title: Annals of Operations Research – reference: Wang, F., Tao, Y., & Shi, N. (2009, April). A survey on vehicle routing problem with loading constraints. In – reference: (pp. 211-224). Springer, London. – volume: Vol. 74 year: 2009 ident: b0355 publication-title: Metaheuristics: from design to implementation – volume: 37 start-page: 297 year: 2015 end-page: 330 ident: b0290 article-title: Vehicle routing problems with loading constraints: State-of-the-art and future directions publication-title: OR Spectrum – volume: 257 start-page: 89 year: 2017 end-page: 105 ident: b0075 article-title: The value of integrating loading and routing publication-title: European Journal of Operational Research – volume: 55 start-page: 127 year: 2015 end-page: 140 ident: b0360 article-title: An effective tabu search approach with improved loading algorithms for the 3L-CVRP publication-title: Computers & Operations Research – year: 2003 ident: b0015 article-title: Principles of constraint programming – volume: 25 start-page: 1041 year: 2019 end-page: 1049 ident: b0215 article-title: A constraint programming approach for the pickup and delivery problem with time windows publication-title: Pamukkale Üniversitesi Mühendislik Bilimleri Dergisi – volume: 88 start-page: 110 year: 2015 end-page: 130 ident: b0190 article-title: Heuristic algorithms for a three-dimensional loading capacitated vehicle routing problem in a carrier publication-title: Computers & Industrial Engineering – start-page: 417 year: 1998 end-page: 431 ident: b0330 article-title: Using constraint programming and local search methods to solve vehicle routing problems publication-title: International Conference on Principles and Practice of Constraint Programming – volume: 23 start-page: 377 year: 1995 end-page: 390 ident: b0030 article-title: Issues in the development of approaches to container loading publication-title: Omega – volume: 26 start-page: 794 year: 2019 end-page: 835 ident: b0370 article-title: A nonlinear optimization model for the balanced vehicle routing problem with loading constraints publication-title: International Transactions in Operational Research – volume: 266 start-page: 877 year: 2018 end-page: 894 ident: b0310 article-title: Heuristics for vehicle routing problems with backhauls, time windows, and 3D loading constraints publication-title: European Journal of Operational Research – volume: 58 start-page: 2712 year: 2020 end-page: 2729 ident: b0250 article-title: The constrained two-dimensional guillotine cutting problem with defects: An ILP formulation, a Benders decomposition and a CP-based algorithm publication-title: International Journal of Production Research – volume: 8 start-page: 43 year: 2002 end-page: 58 ident: b0315 article-title: Using constraint-based operators to solve the vehicle routing problem with time windows publication-title: Journal of Heuristics – volume: 20 start-page: 645 year: 2013 end-page: 666 ident: b0195 article-title: An optimization model for the vehicle routing problem with practical three-dimensional loading constraints publication-title: International Transactions in Operational Research – volume: 31 start-page: 775 year: 2009 end-page: 800 ident: b0270 article-title: An integrated approach to the vehicle routing and container loading problems publication-title: OR Spectrum – volume: 40 start-page: 873 year: 2013 end-page: 885 ident: b0040 article-title: Packing first, routing second—a heuristic for the vehicle routing and loading problem publication-title: Computers & Operations Research – volume: 10 year: 2018 ident: b0185 article-title: Fast truck-packing of 3D boxes publication-title: Engineering Management in Production and Services – start-page: 1 year: 2006 end-page: 32 ident: b0380 article-title: Hybrid algorithms in constraint programming publication-title: International Workshop on Constraint Solving and Constraint Logic Programming – reference: Kucuk, M., & Ermis, M. (2010, October). A new hybrid evolutionary algorithm for three-dimensional packing problems. In – volume: 55 start-page: 1730 year: 2017 end-page: 1747 ident: b0230 article-title: A column generation based heuristic for the capacitated vehicle routing problem with three-dimensional loading constraints publication-title: International Journal of Production Research – reference: IBM. 2019. “IBM ILOG CPLEX Optimization Studio V12. 9.0 documentation.” – volume: 35 start-page: 254 year: 1987 end-page: 265 ident: b0335 article-title: Algorithms for the vehicle routing and scheduling problems with time window constraints publication-title: Operations Research – volume: 47 start-page: 1 year: 2016 end-page: 13 ident: b0145 article-title: A branch-and-cut approach for the vehicle routing problem with loading constraints publication-title: Expert Systems with Applications – volume: 9 start-page: 18 year: 2014 end-page: 30 ident: b0390 article-title: An adaptive variable neighborhood search for a heterogeneous fleet vehicle routing problem with three-dimensional loading constraints publication-title: IEEE Computational Intelligence Magazine – reference: (Vol. 1). – volume: 107 start-page: 178 year: 2017 end-page: 195 ident: b0120 article-title: A constraint programming approach for the team orienteering problem with time windows publication-title: Computers & Industrial Engineering – volume: 97 start-page: 212 year: 2016 end-page: 221 ident: b0155 article-title: An effective placement method for the single container loading problem publication-title: Computers & Industrial Engineering – reference: Ngoenriang, N., Sawadsitang, S., Leangsuksun, C., Niyato, D., & Tan, P. S. (2019, April). Joint Vehicle Routing and Loading in Delivery Planning: A Stochastic Programming Approach. In – reference: Toth, P., & Vigo, D. (Eds.). (2002). “ – year: 2013 ident: b0350 publication-title: Hybrid metaheuristics (Vol. 166) – reference: (pp. 148-162). Springer, Berlin, Heidelberg. – volume: 39 start-page: 2248 year: 2012 end-page: 2257 ident: b0035 article-title: A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints publication-title: Computers & Operations Research – reference: (pp. 441-450). Springer, Berlin, Heidelberg. – volume: 32 start-page: 12 year: 1998 end-page: 29 ident: b0285 article-title: An exact constraint logic programming algorithm for the traveling salesman problem with time windows publication-title: Transportation Science – volume: 201 start-page: 751 year: 2010 end-page: 759 ident: b0115 article-title: Metaheuristics for vehicle routing problems with three-dimensional loading constraints publication-title: European Journal of Operational Research – volume: 240 start-page: 171 year: 2016 end-page: 215 ident: b0345 article-title: Combining metaheuristics with mathematical programming, constraint programming and machine learning publication-title: Annals of Operations Research – volume: 291 start-page: 799 year: 2020 end-page: 825 ident: b0340 article-title: Multi-objective vehicle routing and loading with time window constraints: A real-life application publication-title: Annals of Operations Research – volume: 229 start-page: 1 year: 2013 end-page: 20 ident: b0045 article-title: Constraints in container loading–A state-of-the-art review publication-title: European Journal of Operational Research – volume: 8 start-page: 101 year: 1960 end-page: 111 ident: b0085 article-title: Decomposition principle for linear programs publication-title: Operations Research – year: 2007 ident: b0150 article-title: Integrated Methods for Optimization publication-title: International Series in Operations Research and Management Science – volume: 46 start-page: 63 year: 2012 end-page: 82 ident: b0260 article-title: A hybrid genetic algorithm for the vehicle routing problem with three-dimensional loading constraints publication-title: RAIRO-Operations Research-Recherche Opérationnelle – reference: Karabulut, K., & İnceoğlu, M. M. (2004, October). A hybrid genetic algorithm for packing in 3D with deepest bottom left with fill method. In – volume: 299 start-page: 706 year: 2022 end-page: 721 ident: b0305 article-title: The split heterogeneous vehicle routing problem with three-dimensional loading constraints on a large scale publication-title: European Journal of Operational Research – volume: 243 start-page: 82 year: 2015 end-page: 96 ident: b0055 article-title: Hybrid algorithms for the vehicle routing problem with clustered backhauls and 3D loading constraints publication-title: European Journal of Operational Research – reference: Quoc, N. H. B., & Anh, D. T. (2010, November). Combining constraint programming and Tabu search to solve vehicle routing problem with time windows. In – volume: 82 start-page: 20 year: 2015 end-page: 35 ident: b0405 article-title: An evolutionary local search for the capacitated vehicle routing problem minimizing fuel consumption under three-dimensional loading constraints publication-title: Transportation Research Part B: Methodological – volume: 66 start-page: 1138 year: 2013 end-page: 1149 ident: b0070 article-title: Local search techniques for a routing-packing problem publication-title: Computers & Industrial Engineering – volume: 78 start-page: 09 year: 2016 end-page: 20 ident: b0105 article-title: A matheuristic algorithm for the three-dimensional loading capacitated vehicle routing problem (3L-CVRP) publication-title: Revista Facultad de Ingeniería Universidad de Antioquia – reference: (Vol. 2, pp. 602-606). IEEE. – volume: 6 start-page: 501 year: 2000 end-page: 523 ident: b0090 article-title: Solving vehicle routing problems using constraint programming and metaheuristics publication-title: Journal of Heuristics – start-page: 409 year: 2018 end-page: 430 ident: bib411 article-title: Evolutionary algorithms publication-title: Handbook of Heuristics – reference: (pp. 1-4). IEEE. – volume: 265 start-page: 843 year: 2018 end-page: 859 ident: b0395 article-title: A simulated annealing algorithm for the capacitated vehicle routing problem with two-dimensional loading constraints publication-title: European Journal of Operational Research – volume: 254 start-page: 840 year: 2016 end-page: 858 ident: b0240 article-title: A hybrid algorithm for the vehicle routing problem with pickup and delivery and three-dimensional loading constraints publication-title: European Journal of Operational Research – volume: 40 start-page: 1579 year: 2013 end-page: 1589 ident: b0325 article-title: A hybrid approach for the vehicle routing problem with three-dimensional loading constraints publication-title: Computers & Operations Research – volume: 18 start-page: 4 year: 2010 end-page: 27 ident: b0170 publication-title: Routing problems with loading constraints. – volume: 40 start-page: 342 year: 2006 end-page: 350 ident: b0130 article-title: A tabu search algorithm for a routing and container loading problem publication-title: Transportation Science – volume: 264 start-page: 119 year: 2018 end-page: 137 ident: b0245 article-title: Solving the pickup and delivery problem with three-dimensional loading constraints and reloading ban publication-title: European Journal of Operational Research – volume: 11 start-page: 255 year: 2020 end-page: 280 ident: b0375 article-title: Using a hybrid heuristic to solve the balanced vehicle routing problem with loading constraints publication-title: International Journal of Industrial Engineering Computations – start-page: 91 year: 2018 end-page: 101 ident: b0235 article-title: An exact algorithm for the heterogeneous fleet vehicle routing problem with time windows and three-dimensional loading constraints publication-title: Data and Decision Sciences in Action – volume: 26 start-page: 888 year: 2019 end-page: 907 ident: b0265 article-title: A model-based heuristic to the vehicle routing and loading problem publication-title: International Transactions in Operational Research – volume: 26 start-page: 1795 year: 2013 end-page: 1810 ident: b0225 article-title: A GRASP× ELS for the vehicle routing problem with basic three-dimensional loading constraints publication-title: Engineering Applications of Artificial Intelligence – volume: 61 start-page: 28 year: 2016 end-page: 38 ident: b0010 article-title: Hybrid large neighbourhood search algorithm for capacitated vehicle routing problem publication-title: Expert Systems with Applications – reference: (pp. 1-5). IEEE. – volume: 51 start-page: 2257 year: 2015 end-page: 2266 ident: b0280 article-title: Distributing fibre boards: A practical application of the heterogeneous fleet vehicle routing problem with time windows and three-dimensional loading constraints publication-title: Procedia Computer Science – reference: Society for Industrial and Applied Mathematics. – volume: 2 start-page: 3 year: 2005 end-page: 19 ident: b0025 article-title: Partitioning procedures for solving mixed-variables programming problems publication-title: Computational Management Science – volume: 96 start-page: 227 year: 2016 end-page: 236 ident: b0180 article-title: Extended priority-based hybrid genetic algorithm for the less-than-container loading problem publication-title: Computers & Industrial Engineering – volume: 130 start-page: 199 year: 2004 end-page: 216 ident: b0320 article-title: Solving VRPTWs with constraint programming based column generation publication-title: Annals of Operations Research – volume: 229 start-page: 303 year: 2013 end-page: 317 ident: b0400 article-title: Designing vehicle routes for a mix of different request types, under time windows and loading constraints publication-title: European Journal of Operational Research – reference: Qu, R., & He, F. (2008, December). A hybrid constraint programming approach for nurse rostering problems. In – reference: . – volume: 282 start-page: 545 year: 2020 end-page: 558 ident: b0050 article-title: The split delivery vehicle routing problem with three-dimensional loading constraints publication-title: European Journal of Operational Research – volume: 39 start-page: 2178 year: 2012 end-page: 2195 ident: b0410 article-title: A two-stage tabu search algorithm with enhanced packing heuristics for the 3L-CVRP and M3L-CVRP publication-title: Computers & Operations Research – volume: 8 start-page: 7 year: 2002 end-page: 17 ident: b0110 article-title: Mathematical programming techniques in constraint programming: A short overview publication-title: Journal of Heuristics – volume: 15 start-page: 995 year: 2020 end-page: 1015 ident: b0020 article-title: An integrated approach for three-dimensional capacitated vehicle routing problem considering time windows publication-title: Journal of Modelling in Management – volume: 73 start-page: 119 year: 2019 end-page: 134 ident: b0080 article-title: A computation-implementation parallelization approach to the vehicle loading and routing problem publication-title: Networks – reference: Ahmeti, A., & Musliu, N. (2021). Hybridizing Constraint Programming and Meta-Heuristics for Multi-Mode Resource-Constrained Multiple Projects Scheduling Problem. In – volume: 10 year: 2021 ident: b0205 article-title: Axle weights in combined vehicle routing and container loading problems publication-title: EURO Journal on Transportation and Logistics – reference: Laborie, P. (2009, May). IBM ILOG CP Optimizer for detailed scheduling illustrated on three problems. In – reference: (pp. 4029-4034). IEEE. – volume: 10 issue: 2 year: 2018 ident: 10.1016/j.cie.2022.108505_b0185 article-title: Fast truck-packing of 3D boxes publication-title: Engineering Management in Production and Services doi: 10.2478/emj-2018-0009 – volume: 39 start-page: 2248 issue: 9 year: 2012 ident: 10.1016/j.cie.2022.108505_b0035 article-title: A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints publication-title: Computers & Operations Research doi: 10.1016/j.cor.2011.11.008 – volume: 26 start-page: 1795 issue: 8 year: 2013 ident: 10.1016/j.cie.2022.108505_b0225 article-title: A GRASP× ELS for the vehicle routing problem with basic three-dimensional loading constraints publication-title: Engineering Applications of Artificial Intelligence doi: 10.1016/j.engappai.2013.03.012 – volume: 264 start-page: 119 issue: 1 year: 2018 ident: 10.1016/j.cie.2022.108505_b0245 article-title: Solving the pickup and delivery problem with three-dimensional loading constraints and reloading ban publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2017.05.034 – volume: 88 start-page: 110 year: 2015 ident: 10.1016/j.cie.2022.108505_b0190 article-title: Heuristic algorithms for a three-dimensional loading capacitated vehicle routing problem in a carrier publication-title: Computers & Industrial Engineering doi: 10.1016/j.cie.2015.06.005 – volume: 55 start-page: 1730 issue: 6 year: 2017 ident: 10.1016/j.cie.2022.108505_b0230 article-title: A column generation based heuristic for the capacitated vehicle routing problem with three-dimensional loading constraints publication-title: International Journal of Production Research doi: 10.1080/00207543.2016.1231940 – ident: 10.1016/j.cie.2022.108505_b0220 doi: 10.1007/978-3-642-01929-6_12 – volume: 26 start-page: 794 issue: 3 year: 2019 ident: 10.1016/j.cie.2022.108505_b0370 article-title: A nonlinear optimization model for the balanced vehicle routing problem with loading constraints publication-title: International Transactions in Operational Research doi: 10.1111/itor.12570 – start-page: 409 year: 2018 ident: 10.1016/j.cie.2022.108505_bib411 article-title: Evolutionary algorithms – volume: 78 start-page: 09 year: 2016 ident: 10.1016/j.cie.2022.108505_b0105 article-title: A matheuristic algorithm for the three-dimensional loading capacitated vehicle routing problem (3L-CVRP) publication-title: Revista Facultad de Ingeniería Universidad de Antioquia – volume: 282 start-page: 545 issue: 2 year: 2020 ident: 10.1016/j.cie.2022.108505_b0050 article-title: The split delivery vehicle routing problem with three-dimensional loading constraints publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2019.09.024 – volume: 130 start-page: 199 issue: 1–4 year: 2004 ident: 10.1016/j.cie.2022.108505_b0320 article-title: Solving VRPTWs with constraint programming based column generation publication-title: Annals of Operations Research doi: 10.1023/B:ANOR.0000032576.73681.29 – volume: 82 start-page: 20 year: 2015 ident: 10.1016/j.cie.2022.108505_b0405 article-title: An evolutionary local search for the capacitated vehicle routing problem minimizing fuel consumption under three-dimensional loading constraints publication-title: Transportation Research Part B: Methodological doi: 10.1016/j.trb.2015.10.001 – ident: 10.1016/j.cie.2022.108505_b0005 – volume: 8 start-page: 101 issue: 1 year: 1960 ident: 10.1016/j.cie.2022.108505_b0085 article-title: Decomposition principle for linear programs publication-title: Operations Research doi: 10.1287/opre.8.1.101 – volume: 40 start-page: 873 issue: 3 year: 2013 ident: 10.1016/j.cie.2022.108505_b0040 article-title: Packing first, routing second—a heuristic for the vehicle routing and loading problem publication-title: Computers & Operations Research doi: 10.1016/j.cor.2012.09.005 – volume: 37 start-page: 297 issue: 2 year: 2015 ident: 10.1016/j.cie.2022.108505_b0290 article-title: Vehicle routing problems with loading constraints: State-of-the-art and future directions publication-title: OR Spectrum doi: 10.1007/s00291-014-0386-3 – volume: 40 start-page: 1579 issue: 6 year: 2013 ident: 10.1016/j.cie.2022.108505_b0325 article-title: A hybrid approach for the vehicle routing problem with three-dimensional loading constraints publication-title: Computers & Operations Research doi: 10.1016/j.cor.2011.11.013 – ident: 10.1016/j.cie.2022.108505_b0200 doi: 10.1007/978-3-540-30198-1_45 – volume: 240 start-page: 171 issue: 1 year: 2016 ident: 10.1016/j.cie.2022.108505_b0345 article-title: Combining metaheuristics with mathematical programming, constraint programming and machine learning publication-title: Annals of Operations Research doi: 10.1007/s10479-015-2034-y – volume: 73 start-page: 119 issue: 1 year: 2019 ident: 10.1016/j.cie.2022.108505_b0080 article-title: A computation-implementation parallelization approach to the vehicle loading and routing problem publication-title: Networks doi: 10.1002/net.21848 – volume: 32 start-page: 12 issue: 1 year: 1998 ident: 10.1016/j.cie.2022.108505_b0285 article-title: An exact constraint logic programming algorithm for the traveling salesman problem with time windows publication-title: Transportation Science doi: 10.1287/trsc.32.1.12 – volume: 20 start-page: 645 issue: 5 year: 2013 ident: 10.1016/j.cie.2022.108505_b0195 article-title: An optimization model for the vehicle routing problem with practical three-dimensional loading constraints publication-title: International Transactions in Operational Research doi: 10.1111/j.1475-3995.2012.00872.x – start-page: 91 year: 2018 ident: 10.1016/j.cie.2022.108505_b0235 article-title: An exact algorithm for the heterogeneous fleet vehicle routing problem with time windows and three-dimensional loading constraints – ident: 10.1016/j.cie.2022.108505_b0275 doi: 10.1109/VTCSpring.2019.8746416 – year: 2003 ident: 10.1016/j.cie.2022.108505_b0015 – volume: 40 start-page: 342 issue: 3 year: 2006 ident: 10.1016/j.cie.2022.108505_b0130 article-title: A tabu search algorithm for a routing and container loading problem publication-title: Transportation Science doi: 10.1287/trsc.1050.0145 – volume: 266 start-page: 877 issue: 3 year: 2018 ident: 10.1016/j.cie.2022.108505_b0310 article-title: Heuristics for vehicle routing problems with backhauls, time windows, and 3D loading constraints publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2017.10.029 – volume: 2 start-page: 3 issue: 1 year: 2005 ident: 10.1016/j.cie.2022.108505_b0025 article-title: Partitioning procedures for solving mixed-variables programming problems publication-title: Computational Management Science doi: 10.1007/s10287-004-0020-y – volume: 10 year: 2021 ident: 10.1016/j.cie.2022.108505_b0205 article-title: Axle weights in combined vehicle routing and container loading problems publication-title: EURO Journal on Transportation and Logistics doi: 10.1016/j.ejtl.2021.100043 – volume: 8 start-page: 7 issue: 1 year: 2002 ident: 10.1016/j.cie.2022.108505_b0110 article-title: Mathematical programming techniques in constraint programming: A short overview publication-title: Journal of Heuristics doi: 10.1023/A:1013653332557 – volume: 97 start-page: 212 year: 2016 ident: 10.1016/j.cie.2022.108505_b0155 article-title: An effective placement method for the single container loading problem publication-title: Computers & Industrial Engineering doi: 10.1016/j.cie.2016.05.008 – start-page: 417 year: 1998 ident: 10.1016/j.cie.2022.108505_b0330 article-title: Using constraint programming and local search methods to solve vehicle routing problems – volume: 9 start-page: 18 issue: 4 year: 2014 ident: 10.1016/j.cie.2022.108505_b0390 article-title: An adaptive variable neighborhood search for a heterogeneous fleet vehicle routing problem with three-dimensional loading constraints publication-title: IEEE Computational Intelligence Magazine doi: 10.1109/MCI.2014.2350933 – volume: 254 start-page: 840 issue: 3 year: 2016 ident: 10.1016/j.cie.2022.108505_b0240 article-title: A hybrid algorithm for the vehicle routing problem with pickup and delivery and three-dimensional loading constraints publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2016.04.016 – volume: 11 start-page: 255 issue: 2 year: 2020 ident: 10.1016/j.cie.2022.108505_b0375 article-title: Using a hybrid heuristic to solve the balanced vehicle routing problem with loading constraints publication-title: International Journal of Industrial Engineering Computations doi: 10.5267/j.ijiec.2019.8.002 – volume: 66 start-page: 1138 issue: 4 year: 2013 ident: 10.1016/j.cie.2022.108505_b0070 article-title: Local search techniques for a routing-packing problem publication-title: Computers & Industrial Engineering doi: 10.1016/j.cie.2013.07.025 – volume: 46 start-page: 63 issue: 1 year: 2012 ident: 10.1016/j.cie.2022.108505_b0260 article-title: A hybrid genetic algorithm for the vehicle routing problem with three-dimensional loading constraints publication-title: RAIRO-Operations Research-Recherche Opérationnelle doi: 10.1051/ro/2012008 – volume: 107 start-page: 178 year: 2017 ident: 10.1016/j.cie.2022.108505_b0120 article-title: A constraint programming approach for the team orienteering problem with time windows publication-title: Computers & Industrial Engineering doi: 10.1016/j.cie.2017.03.017 – volume: 18 start-page: 4 issue: 1 year: 2010 ident: 10.1016/j.cie.2022.108505_b0170 publication-title: Routing problems with loading constraints. Top – volume: 15 start-page: 995 issue: 3 year: 2020 ident: 10.1016/j.cie.2022.108505_b0020 article-title: An integrated approach for three-dimensional capacitated vehicle routing problem considering time windows publication-title: Journal of Modelling in Management doi: 10.1108/JM2-11-2018-0183 – volume: 31 start-page: 775 issue: 4 year: 2009 ident: 10.1016/j.cie.2022.108505_b0270 article-title: An integrated approach to the vehicle routing and container loading problems publication-title: OR Spectrum doi: 10.1007/s00291-008-0129-4 – year: 2007 ident: 10.1016/j.cie.2022.108505_b0150 article-title: Integrated Methods for Optimization – start-page: 1 year: 2006 ident: 10.1016/j.cie.2022.108505_b0380 article-title: Hybrid algorithms in constraint programming – volume: 61 start-page: 28 year: 2016 ident: 10.1016/j.cie.2022.108505_b0010 article-title: Hybrid large neighbourhood search algorithm for capacitated vehicle routing problem publication-title: Expert Systems with Applications doi: 10.1016/j.eswa.2016.05.023 – volume: 184 start-page: 163 issue: 1 year: 2011 ident: 10.1016/j.cie.2022.108505_b0100 article-title: A hybrid constraint programming approach to the log-truck scheduling problem publication-title: Annals of Operations Research doi: 10.1007/s10479-010-0698-x – volume: 26 start-page: 888 issue: 3 year: 2019 ident: 10.1016/j.cie.2022.108505_b0265 article-title: A model-based heuristic to the vehicle routing and loading problem publication-title: International Transactions in Operational Research doi: 10.1111/itor.12586 – volume: 35 start-page: 254 issue: 2 year: 1987 ident: 10.1016/j.cie.2022.108505_b0335 article-title: Algorithms for the vehicle routing and scheduling problems with time window constraints publication-title: Operations Research doi: 10.1287/opre.35.2.254 – ident: 10.1016/j.cie.2022.108505_b0160 – volume: 58 start-page: 2712 issue: 9 year: 2020 ident: 10.1016/j.cie.2022.108505_b0250 article-title: The constrained two-dimensional guillotine cutting problem with defects: An ILP formulation, a Benders decomposition and a CP-based algorithm publication-title: International Journal of Production Research doi: 10.1080/00207543.2019.1630773 – volume: 291 start-page: 799 issue: 1 year: 2020 ident: 10.1016/j.cie.2022.108505_b0340 article-title: Multi-objective vehicle routing and loading with time window constraints: A real-life application publication-title: Annals of Operations Research doi: 10.1007/s10479-019-03205-2 – volume: 55 start-page: 127 year: 2015 ident: 10.1016/j.cie.2022.108505_b0360 article-title: An effective tabu search approach with improved loading algorithms for the 3L-CVRP publication-title: Computers & Operations Research doi: 10.1016/j.cor.2013.10.017 – volume: 243 start-page: 82 issue: 1 year: 2015 ident: 10.1016/j.cie.2022.108505_b0055 article-title: Hybrid algorithms for the vehicle routing problem with clustered backhauls and 3D loading constraints publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2014.12.001 – year: 2013 ident: 10.1016/j.cie.2022.108505_b0350 – volume: 201 start-page: 751 issue: 3 year: 2010 ident: 10.1016/j.cie.2022.108505_b0115 article-title: Metaheuristics for vehicle routing problems with three-dimensional loading constraints publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2009.03.046 – ident: 10.1016/j.cie.2022.108505_b0295 doi: 10.1007/978-1-84882-215-3_16 – volume: 265 start-page: 843 issue: 3 year: 2018 ident: 10.1016/j.cie.2022.108505_b0395 article-title: A simulated annealing algorithm for the capacitated vehicle routing problem with two-dimensional loading constraints publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2017.08.035 – volume: 229 start-page: 1 issue: 1 year: 2013 ident: 10.1016/j.cie.2022.108505_b0045 article-title: Constraints in container loading–A state-of-the-art review publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2012.12.006 – volume: 257 start-page: 89 issue: 1 year: 2017 ident: 10.1016/j.cie.2022.108505_b0075 article-title: The value of integrating loading and routing publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2016.06.072 – ident: 10.1016/j.cie.2022.108505_b0210 doi: 10.1109/ICSMC.2010.5642203 – ident: 10.1016/j.cie.2022.108505_b0365 doi: 10.1137/1.9780898718515 – volume: 8 start-page: 43 issue: 1 year: 2002 ident: 10.1016/j.cie.2022.108505_b0315 article-title: Using constraint-based operators to solve the vehicle routing problem with time windows publication-title: Journal of Heuristics doi: 10.1023/A:1013661617536 – volume: 25 start-page: 1041 issue: 9 year: 2019 ident: 10.1016/j.cie.2022.108505_b0215 article-title: A constraint programming approach for the pickup and delivery problem with time windows publication-title: Pamukkale Üniversitesi Mühendislik Bilimleri Dergisi – volume: 6 start-page: 501 issue: 4 year: 2000 ident: 10.1016/j.cie.2022.108505_b0090 article-title: Solving vehicle routing problems using constraint programming and metaheuristics publication-title: Journal of Heuristics doi: 10.1023/A:1009621410177 – volume: Vol. 74 year: 2009 ident: 10.1016/j.cie.2022.108505_b0355 – ident: 10.1016/j.cie.2022.108505_b0300 doi: 10.1109/RIVF.2010.5632215 – volume: 23 start-page: 377 issue: 4 year: 1995 ident: 10.1016/j.cie.2022.108505_b0030 article-title: Issues in the development of approaches to container loading publication-title: Omega doi: 10.1016/0305-0483(95)00015-G – volume: 229 start-page: 303 issue: 2 year: 2013 ident: 10.1016/j.cie.2022.108505_b0400 article-title: Designing vehicle routes for a mix of different request types, under time windows and loading constraints publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2013.02.056 – volume: 47 start-page: 1 year: 2016 ident: 10.1016/j.cie.2022.108505_b0145 article-title: A branch-and-cut approach for the vehicle routing problem with loading constraints publication-title: Expert Systems with Applications doi: 10.1016/j.eswa.2015.10.013 – volume: 299 start-page: 706 issue: 2 year: 2022 ident: 10.1016/j.cie.2022.108505_b0305 article-title: The split heterogeneous vehicle routing problem with three-dimensional loading constraints on a large scale publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2021.08.025 – ident: 10.1016/j.cie.2022.108505_b0385 doi: 10.1109/CSO.2009.127 – volume: 51 start-page: 2257 year: 2015 ident: 10.1016/j.cie.2022.108505_b0280 article-title: Distributing fibre boards: A practical application of the heterogeneous fleet vehicle routing problem with time windows and three-dimensional loading constraints publication-title: Procedia Computer Science doi: 10.1016/j.procs.2015.05.382 – volume: 39 start-page: 2178 issue: 9 year: 2012 ident: 10.1016/j.cie.2022.108505_b0410 article-title: A two-stage tabu search algorithm with enhanced packing heuristics for the 3L-CVRP and M3L-CVRP publication-title: Computers & Operations Research doi: 10.1016/j.cor.2011.11.001 – volume: 96 start-page: 227 year: 2016 ident: 10.1016/j.cie.2022.108505_b0180 article-title: Extended priority-based hybrid genetic algorithm for the less-than-container loading problem publication-title: Computers & Industrial Engineering doi: 10.1016/j.cie.2016.03.030 |
| SSID | ssj0004591 |
| Score | 2.5169322 |
| Snippet | •Novel Constraint Programming (CP) models are proposed for the 3l-CVRP.•CP based decomposition models are more effective than the MIP model.•A hybrid CP model... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 108505 |
| SubjectTerms | Constraint programming Container loading problem Decomposition Time windows Vehicle routing problem |
| Title | Constraint programming-based solution approaches for three-dimensional loading capacitated vehicle routing problems |
| URI | https://dx.doi.org/10.1016/j.cie.2022.108505 |
| Volume | 171 |
| WOSCitedRecordID | wos000879227500002&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 customDbUrl: eissn: 1879-0550 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0004591 issn: 0360-8352 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Jb9NAFB6FlgMcWAqIsmkOnIgmcuyJZ-ZYqiJAUCERpHCy4uex2io4VexE5Qfwv3mz2W5DET1wsSzLs8jv89vmLYS8FskECqEVm-hkwnisU6aSEthcRoXSIpccbHX9T-L4WM5m6stg8CvkwmwWoqrkxYU6_6-kxmdIbJM6ewNyt5PiA7xHouMVyY7XfyK8acFpGz80IfjqB4onZsSVcZG7pdta4rr2gYYrrVlhSv27Mh3DxdJG1w8BpSmYRDQcvdEnZrXharluXBa77UZT9zXc0CaitqA67TqD6K7yYcvlzTH920N7WC_cvWXOn01WV9kKjCka9siiF-vhd9PD27q8v-qf3pfgXRZo7YaYrC5VK2JG9bvEhl0rFs9ITVKEzcfe5vHO3XA2Qt43MrOPuncv19O-Iufa6MMQ2HaW4RSZmSJzU9wiu7GYKGSOuwcfjmYfe2XnXevFsO9wPG4DBa_s488KTk9pmT4g97y1QQ8cSh6Sga72yH1veVDP1-s9crdXlvIRqTsI0S0I0QAh2kGIIoToFoSohxDtQYh6CFEPIRog9Jh8e3c0PXzPfHMOBrESDStlBMAlaD4WAiREPJVpWeQyT1KQWkX4m6dzGIsUTVZU60UyzpVMi3wMEMd5nDwhO9Wy0k8J5QUvJGqKgMKAKyjlHLX0spjMtQS0J_g-icIXzcBXrjcfYZFdS8l98qYdcu7KtvztZR7IlHm90-mTGULu-mHPbrLGc3Kn-xNekJ1mtdYvyW3YNKf16pXH228ucaY- |
| 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=Constraint+programming-based+solution+approaches+for+three-dimensional+loading+capacitated+vehicle+routing+problems&rft.jtitle=Computers+%26+industrial+engineering&rft.au=K%C3%BC%C3%A7%C3%BCk%2C+Mustafa&rft.au=Topaloglu+Yildiz%2C+Seyda&rft.date=2022-09-01&rft.issn=0360-8352&rft.volume=171&rft.spage=108505&rft_id=info:doi/10.1016%2Fj.cie.2022.108505&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_cie_2022_108505 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0360-8352&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0360-8352&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0360-8352&client=summon |