Optimization of capacitated vehicle routing problem with alternative delivery, pick-up and time windows: A modified hybrid approach
In this paper, the optimization of Capacitated Vehicle Routing Problem with Alternative Delivery, Pick-up and Time windows is considered. The development of this problem was motivated by analysis of postal and courier delivery issues. In some generalization, the problem examined can be classified as...
Uloženo v:
| Vydáno v: | Neurocomputing (Amsterdam) Ročník 423; s. 670 - 678 |
|---|---|
| Hlavní autoři: | , , , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Elsevier B.V
29.01.2021
|
| Témata: | |
| ISSN: | 0925-2312, 1872-8286 |
| 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 | In this paper, the optimization of Capacitated Vehicle Routing Problem with Alternative Delivery, Pick-up and Time windows is considered. The development of this problem was motivated by analysis of postal and courier delivery issues. In some generalization, the problem examined can be classified as a combination of many variants of the classical VRP (Vehicle Routing Problem), such as CVRP (Capacitated Vehicle Routing Problem), VRPPD (Vehicle Routing Problem with Pickup and Delivery), VRPTW (Vehicle Routing Problem with Time Windows), etc. What distinguishes the presented problem from known variants of VRPs is the introduction of alternative delivery points and parcel lockers incorporated into the distribution network and the ability to take into account logical constraints. The problem model was formulated in the form of BIP (Binary Integer Programming). Moreover, the original hybrid approach integrating CP (Constraint Programming), GA (Genetic Algorithm) and MP (Mathematical Programming) was proposed for the model implementation and optimization. Numerous computational experiments verifying the correctness of the model and the effectiveness of the hybrid approach were also presented. |
|---|---|
| AbstractList | In this paper, the optimization of Capacitated Vehicle Routing Problem with Alternative Delivery, Pick-up and Time windows is considered. The development of this problem was motivated by analysis of postal and courier delivery issues. In some generalization, the problem examined can be classified as a combination of many variants of the classical VRP (Vehicle Routing Problem), such as CVRP (Capacitated Vehicle Routing Problem), VRPPD (Vehicle Routing Problem with Pickup and Delivery), VRPTW (Vehicle Routing Problem with Time Windows), etc. What distinguishes the presented problem from known variants of VRPs is the introduction of alternative delivery points and parcel lockers incorporated into the distribution network and the ability to take into account logical constraints. The problem model was formulated in the form of BIP (Binary Integer Programming). Moreover, the original hybrid approach integrating CP (Constraint Programming), GA (Genetic Algorithm) and MP (Mathematical Programming) was proposed for the model implementation and optimization. Numerous computational experiments verifying the correctness of the model and the effectiveness of the hybrid approach were also presented. |
| Author | Banaszak, Zbigniew Bocewicz, Grzegorz Wikarek, Jarosław Sitek, Paweł Rutczyńska-Wdowiak, Katarzyna |
| Author_xml | – sequence: 1 givenname: Paweł orcidid: 0000-0001-6108-0241 surname: Sitek fullname: Sitek, Paweł email: sitek@tu.kielce.pl organization: Department of Control and Management Systems, Kielce University of Technology, Poland – sequence: 2 givenname: Jarosław surname: Wikarek fullname: Wikarek, Jarosław email: j.wikarek@tu.kielce.pl organization: Department of Control and Management Systems, Kielce University of Technology, Poland – sequence: 3 givenname: Katarzyna surname: Rutczyńska-Wdowiak fullname: Rutczyńska-Wdowiak, Katarzyna email: k.rutczynska@tu.kielce.pl organization: Department of Control and Management Systems, Kielce University of Technology, Poland – sequence: 4 givenname: Grzegorz surname: Bocewicz fullname: Bocewicz, Grzegorz email: bocewicz@ie.tu.koszalin.pl organization: Faculty of Electronics and Computer Science, Koszalin University of Technology, Poland – sequence: 5 givenname: Zbigniew surname: Banaszak fullname: Banaszak, Zbigniew email: zbiniew.banaszak@tu.koszalin.pl organization: Faculty of Electronics and Computer Science, Koszalin University of Technology, Poland |
| BookMark | eNqFkM1O3DAURq2KSh1-3qALPwAJtpNJMiwqIdQCEhKbsrZu7GvmDokdOZ5B0y0vjumw6oKuvs09R7rnmB354JGx71KUUsjmYlN63JowlkooUQpVStV8YQvZtaroVNccsYVYqWWhKqm-seN53gghW6lWC_b6MCUa6Q8kCp4Hxw1MYChBQst3uCYzII9hm8g_8SmGfsCRv1BacxgSRp-5HXKLQ564P-cTmediO3Hwlmcx5ltvw8t8ya_4GCw5yt71vo9kOUxZCGZ9yr46GGY8-9gT9vjr5-_r2-L-4ebu-uq-MJVoUgF1VfWu6VfQKbm0TV-7ZeNkX7eyraV1LYBsl10FgB0624BrVwBQdaYFY3uoTlh98JoY5jmi01OkEeJeS6HfQ-qNPoTU7yG1UDqHzNjlP9jfPrlXikDD_-AfBxjzYzvCqGdD6A1aimiStoE-F7wBvo2YQg |
| CitedBy_id | crossref_primary_10_3390_su15108098 crossref_primary_10_1016_j_wasman_2021_08_034 crossref_primary_10_3390_electronics10101193 crossref_primary_10_1080_19427867_2023_2257923 crossref_primary_10_1088_1742_6596_1988_1_012053 crossref_primary_10_3390_app12146933 crossref_primary_10_1007_s43546_025_00833_8 crossref_primary_10_7717_peerj_cs_329 crossref_primary_10_1016_j_cie_2021_107728 crossref_primary_10_3390_su13073641 crossref_primary_10_1016_j_trc_2023_104022 crossref_primary_10_1038_s44333_025_00035_7 crossref_primary_10_1007_s10489_023_05212_0 crossref_primary_10_1038_s41598_024_66450_x crossref_primary_10_1016_j_cie_2025_110991 crossref_primary_10_3390_app11052100 crossref_primary_10_1016_j_neucom_2024_127670 crossref_primary_10_1016_j_asoc_2024_111846 crossref_primary_10_1051_ro_2025090 crossref_primary_10_3390_electronics14122375 crossref_primary_10_1080_23311916_2020_1805156 crossref_primary_10_3390_s21237830 crossref_primary_10_3390_su151512004 crossref_primary_10_3390_electronics10243147 crossref_primary_10_1016_j_cie_2022_108389 crossref_primary_10_1631_FITEE_2200585 crossref_primary_10_1007_s00500_024_10373_2 crossref_primary_10_3390_logistics7010003 crossref_primary_10_3390_technologies13030115 crossref_primary_10_1016_j_ifacol_2022_09_378 crossref_primary_10_1016_j_tre_2021_102556 crossref_primary_10_1016_j_dajour_2022_100113 crossref_primary_10_1016_j_ijpe_2023_109014 crossref_primary_10_3934_jimo_2025147 crossref_primary_10_1155_2021_5580083 crossref_primary_10_1177_03611981231191517 crossref_primary_10_1016_j_wasman_2024_04_001 crossref_primary_10_1007_s00521_022_07921_y crossref_primary_10_1520_JTE20220039 crossref_primary_10_1007_s10732_023_09520_z crossref_primary_10_1016_j_cor_2024_106686 crossref_primary_10_1186_s13677_024_00613_z crossref_primary_10_3390_app112110295 crossref_primary_10_1016_j_ejor_2025_07_007 crossref_primary_10_1002_net_22190 crossref_primary_10_1177_00202940221105851 crossref_primary_10_1016_j_clscn_2023_100137 |
| Cites_doi | 10.1016/j.eswa.2011.03.088 10.1007/s10479-017-2468-5 10.1007/978-3-030-23946-6_4 10.1016/j.cie.2014.10.029 10.1007/s10489-017-1107-9 10.1007/978-3-319-15705-4_5 10.1016/j.tre.2013.05.005 10.1002/net.3230110205 10.1007/978-3-662-44739-0_53 10.1016/j.ejor.2010.02.037 10.1016/j.trc.2006.03.002 10.1007/978-3-319-40162-1_54 |
| ContentType | Journal Article |
| Copyright | 2020 Elsevier B.V. |
| Copyright_xml | – notice: 2020 Elsevier B.V. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.neucom.2020.02.126 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1872-8286 |
| EndPage | 678 |
| ExternalDocumentID | 10_1016_j_neucom_2020_02_126 S0925231220307414 |
| GroupedDBID | --- --K --M .DC .~1 0R~ 123 1B1 1~. 1~5 4.4 457 4G. 53G 5VS 7-5 71M 8P~ 9JM 9JN AABNK AACTN AADPK AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAXLA AAXUO AAYFN ABBOA ABCQJ ABFNM ABJNI ABMAC ABYKQ ACDAQ ACGFS ACRLP ACZNC ADBBV ADEZE AEBSH AEKER AENEX AFKWA AFTJW AFXIZ AGHFR AGUBO AGWIK AGYEJ AHHHB AHZHX AIALX AIEXJ AIKHN AITUG AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD AXJTR BKOJK BLXMC CS3 DU5 EBS EFJIC EFLBG EO8 EO9 EP2 EP3 F5P FDB FIRID FNPLU FYGXN G-Q GBLVA GBOLZ IHE J1W KOM LG9 M41 MO0 MOBAO N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. Q38 ROL RPZ SDF SDG SDP SES SPC SPCBC SSN SSV SSZ T5K ZMT ~G- 29N 9DU AAQXK AATTM AAXKI AAYWO AAYXX ABWVN ABXDB ACLOT ACNNM ACRPL ACVFH ADCNI ADJOM ADMUD ADNMO AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP ASPBG AVWKF AZFZN CITATION EFKBS EJD FEDTE FGOYB HLZ HVGLF HZ~ R2- SBC SEW WUQ XPP ~HD |
| ID | FETCH-LOGICAL-c306t-a433bf6b9a8215d6b4f56f1b471741df7aa17583aae8efd6af79aaa38c7acdba3 |
| ISICitedReferencesCount | 60 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000599876700003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0925-2312 |
| IngestDate | Sat Nov 29 07:11:47 EST 2025 Tue Nov 18 20:38:44 EST 2025 Fri Feb 23 02:46:57 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Vehicle Routing Problem Hybrid Methods Constraint Programming Genetic Algorithms Mathematical Programming Optimization |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c306t-a433bf6b9a8215d6b4f56f1b471741df7aa17583aae8efd6af79aaa38c7acdba3 |
| ORCID | 0000-0001-6108-0241 |
| PageCount | 9 |
| ParticipantIDs | crossref_primary_10_1016_j_neucom_2020_02_126 crossref_citationtrail_10_1016_j_neucom_2020_02_126 elsevier_sciencedirect_doi_10_1016_j_neucom_2020_02_126 |
| PublicationCentury | 2000 |
| PublicationDate | 2021-01-29 |
| PublicationDateYYYYMMDD | 2021-01-29 |
| PublicationDate_xml | – month: 01 year: 2021 text: 2021-01-29 day: 29 |
| PublicationDecade | 2020 |
| PublicationTitle | Neurocomputing (Amsterdam) |
| PublicationYear | 2021 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Delivery choice - Parcel lockers Kumar, Panneerselvam (b0035) 2012; 4 Fisher, Jaikumar (b0070) 1981; 11 Accessed October 20 2019. B. Crawford, R. Soto, C. Pena, W. Palma, F. Johnson, F. Paredes, Solving the set covering problem with a shuffled frog leaping algorithm, in: Intelligent Information and Database Systems, N.T. Nguyen, B. Trawinski, R. Kosala (Eds.), Book Series: Lecture Notes in Artificial Intelligence, Vol. 9012, pp: 41–50, 2015, doi: 10.1007/978-3-319-15705-4_5_5. G. Kłosowski, A. Gola, A. Świć, Application of fuzzy logic in assigning workers to production tasks, in: S. Omatu, A. Selamat, G. Bocewicz, P. Sitek, I. Nielsen, J.A. Garcia-Garcia, J. Bajo (Eds.), Distributed Computing and Artificial Intelligence, 13th International Conference, Springer Series: Advances in Intelligent Systems and Computing, Vol. 474, 2016, pp. 505–513. Accessed October 19 2018. Rossi, Van Beek, Walsh (b0065) 2006 Sitek, Wikarek (b0015) 2017 Eurostat - Statistics Explained - Europa.eu Wassan, Wassan, Nagy, Salhi (b0040) 2016 P. Nielsen, Z. Michna, N.A.D Do, An empirical investigation of lead time distributions, IFIP Adv. Inf. Commun. Technol., 438 (Part 1), 2014, 435–442, doi: https://doi.org/10.1007/978-3-662-44739-0_53. Lindo Gurobi Toth, Vigo (b0085) 2014 P. Sitek, J Wikarek, “A multi-level approach to ubiquitous modeling and solving constraints in combinatorial optimization problems in production and distribution”, Applied Intelligence (2018) 48: 1344. doi:https://doi.org/10.1007/s10489-017-1107-9. Salhi, Wassan, Hajarat (b0045) 2013; 56 Jairo, Montoya, Francob, Isazac, Jiménezd, Herazo-Padillae (b0030) 2015; 79 Eclipse – The Eclipse Foundation open source community website Zezula, Amato, Dohnal, Batko (b0105) 2006 Ropke, Cordeau, Vigo, Iori (b0055) 2007 Bocewicz, Banaszak, Nielsen (bib121) 2019 Accessed October 2019. P. Sitek, J. Wikarek, K. Rutczyńska-Wdowiak, Capacitated Vehicle Routing Problem with Pick-up, Alternative Delivery and Time Windows (CVRPPADTW): A Hybrid Approach, in: Herrera-Viedma E., Vale Z., Nielsen P., Martin Del Rey A., Casado Vara R. (eds) Distributed Computing and Artificial Intelligence, 16th International Conference, Special Sessions. DCAI 2019. Advances in Intelligent Systems and Computing, vol 1004. Springer, Cham, 2019, doi :https://doi.org/10.1007/978-3-030-23946-6_4. Archetti, Speranza (b0050) 2014; 2 Gutiérrez-Jarpa, Desaulniers, Laporte, Marianov (b0060) 2010; 206 Gandreau, Guertin, Potvin, Seguin (b0075) 2006; 14 Peng (b0080) 2011; 38 Salhi (10.1016/j.neucom.2020.02.126_b0045) 2013; 56 Sitek (10.1016/j.neucom.2020.02.126_b0015) 2017 Archetti (10.1016/j.neucom.2020.02.126_b0050) 2014; 2 Toth (10.1016/j.neucom.2020.02.126_b0085) 2014 10.1016/j.neucom.2020.02.126_b0005 Ropke (10.1016/j.neucom.2020.02.126_b0055) 2007 Peng (10.1016/j.neucom.2020.02.126_b0080) 2011; 38 10.1016/j.neucom.2020.02.126_b0100 Gutiérrez-Jarpa (10.1016/j.neucom.2020.02.126_b0060) 2010; 206 10.1016/j.neucom.2020.02.126_b0025 10.1016/j.neucom.2020.02.126_b0020 Rossi (10.1016/j.neucom.2020.02.126_b0065) 2006 10.1016/j.neucom.2020.02.126_b0120 Wassan (10.1016/j.neucom.2020.02.126_b0040) 2016 10.1016/j.neucom.2020.02.126_b0095 10.1016/j.neucom.2020.02.126_b0090 Kumar (10.1016/j.neucom.2020.02.126_b0035) 2012; 4 Gandreau (10.1016/j.neucom.2020.02.126_b0075) 2006; 14 Jairo (10.1016/j.neucom.2020.02.126_b0030) 2015; 79 10.1016/j.neucom.2020.02.126_b0115 Bocewicz (10.1016/j.neucom.2020.02.126_bib121) 2019 Zezula (10.1016/j.neucom.2020.02.126_b0105) 2006 10.1016/j.neucom.2020.02.126_b0010 Fisher (10.1016/j.neucom.2020.02.126_b0070) 1981; 11 10.1016/j.neucom.2020.02.126_b0110 |
| References_xml | – start-page: 561 year: 2019 end-page: 585 ident: bib121 article-title: Multimodal processes prototyping subject to grid-like network and fuzzy operation time constraints. publication-title: Ann Oper Res – reference: Lindo, – reference: , Accessed October 19 2018. – start-page: 1 year: 2017 end-page: 21 ident: b0015 article-title: Capacitated vehicle routing problem with pick-up and alternative delivery (CVRPPAD): model and implementation using hybrid approach publication-title: Ann. Oper. Res. – reference: P. Nielsen, Z. Michna, N.A.D Do, An empirical investigation of lead time distributions, IFIP Adv. Inf. Commun. Technol., 438 (Part 1), 2014, 435–442, doi: https://doi.org/10.1007/978-3-662-44739-0_53. – reference: G. Kłosowski, A. Gola, A. Świć, Application of fuzzy logic in assigning workers to production tasks, in: S. Omatu, A. Selamat, G. Bocewicz, P. Sitek, I. Nielsen, J.A. Garcia-Garcia, J. Bajo (Eds.), Distributed Computing and Artificial Intelligence, 13th International Conference, Springer Series: Advances in Intelligent Systems and Computing, Vol. 474, 2016, pp. 505–513. – reference: Eurostat - Statistics Explained - Europa.eu, – reference: P. Sitek, J. Wikarek, K. Rutczyńska-Wdowiak, Capacitated Vehicle Routing Problem with Pick-up, Alternative Delivery and Time Windows (CVRPPADTW): A Hybrid Approach, in: Herrera-Viedma E., Vale Z., Nielsen P., Martin Del Rey A., Casado Vara R. (eds) Distributed Computing and Artificial Intelligence, 16th International Conference, Special Sessions. DCAI 2019. Advances in Intelligent Systems and Computing, vol 1004. Springer, Cham, 2019, doi :https://doi.org/10.1007/978-3-030-23946-6_4. – volume: 11 start-page: 109 year: 1981 end-page: 112 ident: b0070 article-title: A generalized assignment heuristic for vehicle routing publication-title: Networks – reference: B. Crawford, R. Soto, C. Pena, W. Palma, F. Johnson, F. Paredes, Solving the set covering problem with a shuffled frog leaping algorithm, in: Intelligent Information and Database Systems, N.T. Nguyen, B. Trawinski, R. Kosala (Eds.), Book Series: Lecture Notes in Artificial Intelligence, Vol. 9012, pp: 41–50, 2015, doi: 10.1007/978-3-319-15705-4_5_5. – volume: 206 start-page: 341 year: 2010 end-page: 349 ident: b0060 article-title: A branch-and-price algorithm for vehicle routing problem with deliveries, selective pickups and time windows publication-title: Eur. J. Oper. Res. – volume: 56 start-page: 22 year: 2013 end-page: 35 ident: b0045 article-title: The fleet size and mix vehicle routing problem with backhauls: formulation and set partitioning-based heuristics publication-title: Transp. Res. Part E – year: 2007 ident: b0055 article-title: Branch-and-cut-and-price for the capacitated vehicle routing problem with two-dimensional constraints publication-title: Proceedings of ROUTE – volume: 14 start-page: 157 year: 2006 end-page: 174 ident: b0075 article-title: Neighborhood search heuristics for a dynamic vehicle dispatching problem with pick-ups and deliveries publication-title: Transp. Res. Part E – volume: 79 start-page: 115 year: 2015 end-page: 129 ident: b0030 article-title: A literature review on the vehicle routing problem with multiple depots publication-title: Comput. Ind. Eng. – volume: 38 start-page: 11939 year: 2011 end-page: 11946 ident: b0080 article-title: An adaptive parallel route construction heuristic for the vehicle routing problem with time windows constraints publication-title: Expert Syst. Appl. – year: 2006 ident: b0105 article-title: Similarity Search – The Metric Space Approach – reference: , Accessed October 20 2019. – volume: 4 start-page: 66 year: 2012 end-page: 74 ident: b0035 article-title: A Survey on the Vehicle Routing Problem and Its Variants publication-title: Intell. Inf. Manage. – volume: 2 year: 2014 ident: b0050 article-title: A survey on matheuristics for routing problems publication-title: EURO J Comput. Optim. – reference: Gurobi, – reference: Delivery choice - Parcel lockers, – reference: P. Sitek, J Wikarek, “A multi-level approach to ubiquitous modeling and solving constraints in combinatorial optimization problems in production and distribution”, Applied Intelligence (2018) 48: 1344. doi:https://doi.org/10.1007/s10489-017-1107-9. – year: 2014 ident: b0085 article-title: Vehicle Routing: Problems, Methods, and Applications – year: 2006 ident: b0065 article-title: Handbook of Constraint Programming (Foundations of Artificial Intelligence) – reference: , Accessed October 2019. – year: 2016 ident: b0040 article-title: The multiple trip vehicle routing problem with backhauls: formulation and a two-level variable neighbourhood search publication-title: Comput. Oper. Res. – reference: Eclipse – The Eclipse Foundation open source community website, – volume: 38 start-page: 11939 issue: 9 year: 2011 ident: 10.1016/j.neucom.2020.02.126_b0080 article-title: An adaptive parallel route construction heuristic for the vehicle routing problem with time windows constraints publication-title: Expert Syst. Appl. doi: 10.1016/j.eswa.2011.03.088 – ident: 10.1016/j.neucom.2020.02.126_b0010 – year: 2006 ident: 10.1016/j.neucom.2020.02.126_b0105 – start-page: 561 year: 2019 ident: 10.1016/j.neucom.2020.02.126_bib121 article-title: Multimodal processes prototyping subject to grid-like network and fuzzy operation time constraints. publication-title: Ann Oper Res doi: 10.1007/s10479-017-2468-5 – ident: 10.1016/j.neucom.2020.02.126_b0100 – year: 2016 ident: 10.1016/j.neucom.2020.02.126_b0040 article-title: The multiple trip vehicle routing problem with backhauls: formulation and a two-level variable neighbourhood search publication-title: Comput. Oper. Res. – ident: 10.1016/j.neucom.2020.02.126_b0020 doi: 10.1007/978-3-030-23946-6_4 – volume: 79 start-page: 115 year: 2015 ident: 10.1016/j.neucom.2020.02.126_b0030 article-title: A literature review on the vehicle routing problem with multiple depots publication-title: Comput. Ind. Eng. doi: 10.1016/j.cie.2014.10.029 – ident: 10.1016/j.neucom.2020.02.126_b0025 doi: 10.1007/s10489-017-1107-9 – year: 2007 ident: 10.1016/j.neucom.2020.02.126_b0055 article-title: Branch-and-cut-and-price for the capacitated vehicle routing problem with two-dimensional constraints – volume: 4 start-page: 66 year: 2012 ident: 10.1016/j.neucom.2020.02.126_b0035 article-title: A Survey on the Vehicle Routing Problem and Its Variants publication-title: Intell. Inf. Manage. – ident: 10.1016/j.neucom.2020.02.126_b0115 doi: 10.1007/978-3-319-15705-4_5 – start-page: 1 year: 2017 ident: 10.1016/j.neucom.2020.02.126_b0015 article-title: Capacitated vehicle routing problem with pick-up and alternative delivery (CVRPPAD): model and implementation using hybrid approach publication-title: Ann. Oper. Res. – year: 2014 ident: 10.1016/j.neucom.2020.02.126_b0085 – ident: 10.1016/j.neucom.2020.02.126_b0090 – ident: 10.1016/j.neucom.2020.02.126_b0095 – volume: 56 start-page: 22 year: 2013 ident: 10.1016/j.neucom.2020.02.126_b0045 article-title: The fleet size and mix vehicle routing problem with backhauls: formulation and set partitioning-based heuristics publication-title: Transp. Res. Part E doi: 10.1016/j.tre.2013.05.005 – year: 2006 ident: 10.1016/j.neucom.2020.02.126_b0065 – volume: 11 start-page: 109 issue: 2 year: 1981 ident: 10.1016/j.neucom.2020.02.126_b0070 article-title: A generalized assignment heuristic for vehicle routing publication-title: Networks doi: 10.1002/net.3230110205 – ident: 10.1016/j.neucom.2020.02.126_b0110 doi: 10.1007/978-3-662-44739-0_53 – ident: 10.1016/j.neucom.2020.02.126_b0005 – volume: 206 start-page: 341 issue: 12 year: 2010 ident: 10.1016/j.neucom.2020.02.126_b0060 article-title: A branch-and-price algorithm for vehicle routing problem with deliveries, selective pickups and time windows publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2010.02.037 – volume: 14 start-page: 157 issue: 3 year: 2006 ident: 10.1016/j.neucom.2020.02.126_b0075 article-title: Neighborhood search heuristics for a dynamic vehicle dispatching problem with pick-ups and deliveries publication-title: Transp. Res. Part E doi: 10.1016/j.trc.2006.03.002 – ident: 10.1016/j.neucom.2020.02.126_b0120 doi: 10.1007/978-3-319-40162-1_54 – volume: 2 issue: 223 year: 2014 ident: 10.1016/j.neucom.2020.02.126_b0050 article-title: A survey on matheuristics for routing problems publication-title: EURO J Comput. Optim. |
| SSID | ssj0017129 |
| Score | 2.5318828 |
| Snippet | In this paper, the optimization of Capacitated Vehicle Routing Problem with Alternative Delivery, Pick-up and Time windows is considered. The development of... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 670 |
| SubjectTerms | Constraint Programming Genetic Algorithms Hybrid Methods Mathematical Programming Optimization Vehicle Routing Problem |
| Title | Optimization of capacitated vehicle routing problem with alternative delivery, pick-up and time windows: A modified hybrid approach |
| URI | https://dx.doi.org/10.1016/j.neucom.2020.02.126 |
| Volume | 423 |
| WOSCitedRecordID | wos000599876700003&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: 1872-8286 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0017129 issn: 0925-2312 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9NAEF5FLQcuvBEtD-2BnsDIWTveNbeoKoIeCqJFzc1a765V14kd5dn4yn_ldzD7sGMRxEviYll-JCvPl5nPk_lmEHpJQ8ki2deZexp4IYQoj_VhD96c_YBnXPmpb4ZN0LMzNhrFn3q9b40WZjWmZclubuLpfzU1HANja-nsX5i7_VA4APtgdNiC2WH7R4b_CE5g4tSVpmgcwqHQSjKglit1pS9_NauWCytDN-NknMJt7JKDK62lGuuCDWOBaS4Kbzm1tZb5RMHVpazWcytqn1QyzzSPvdpo8VfbpLzLek0HEGHmR7jMxHCiGzRIjcY2E3EO7LewrHatjo4HR6ytfL7MCz6zJ085xHV7dpt__7xciHpjjobzgnuXsL6cF65chM_qTblNPEDEXueitgqdWkt06m7ug-jEh0e2HnZXlGMzm2TgAW21a1TWrzNKjGK-6_hDEnRcd2QHmDgWENnBQjsBxuY6rt-UaqmrjWBRvu752ic_9PM2DOFcL0WvhGhXauat7xM6iMH77g8_nIxO2_-7aJ_YrpBu6Y3I01Qi7n7Xz0lUhxhd3EN33BsNHlok3kc9VT5Ad5tpIdgFj4foaxeYuMpwB5jYARM7YGIHTKyBiTvAxA0wX2MHSwywxBqW2MHyLR7iBpTYghI3oHyEvrw7uTh-77kRIJ6Ad9mFx8MgSLMojTkDbiqjNMwGUdZPgVLB85QZ5Rz4Lws4V0xlMuIZjTnnAROUC5ny4DHaK6tSPUGYh_CYU4hhQmShivyUkVRJpmQq4iiM6QEKmmeaCNcfX49pGSdNIeR1Yi2RaEskPknAEgfIa--a2v4wv7meNuZKHMe13DUBhP3yzsN_vvMpur398TxDe4vZUj1Ht8Rqkc9nLxwUvwOnztK1 |
| 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=Optimization+of+capacitated+vehicle+routing+problem+with+alternative+delivery%2C+pick-up+and+time+windows%3A+A+modified+hybrid+approach&rft.jtitle=Neurocomputing+%28Amsterdam%29&rft.au=Sitek%2C+Pawe%C5%82&rft.au=Wikarek%2C+Jaros%C5%82aw&rft.au=Rutczy%C5%84ska-Wdowiak%2C+Katarzyna&rft.au=Bocewicz%2C+Grzegorz&rft.date=2021-01-29&rft.pub=Elsevier+B.V&rft.issn=0925-2312&rft.eissn=1872-8286&rft.volume=423&rft.spage=670&rft.epage=678&rft_id=info:doi/10.1016%2Fj.neucom.2020.02.126&rft.externalDocID=S0925231220307414 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0925-2312&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0925-2312&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0925-2312&client=summon |