A new constraint programming model and a linear programming-based adaptive large neighborhood search for the vehicle routing problem with synchronization constraints
We consider a vehicle routing problem which seeks to minimize cost subject to time window and synchronization constraints. In this problem, the fleet of vehicles is categorized into regular and special vehicles. Some customers require both vehicles’ services, whose service start times at the custome...
Gespeichert in:
| Veröffentlicht in: | Computers & operations research Jg. 124; S. 105085 |
|---|---|
| Hauptverfasser: | , , , , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
New York
Elsevier Ltd
01.12.2020
Pergamon Press Inc |
| Schlagworte: | |
| ISSN: | 0305-0548, 0305-0548 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | We consider a vehicle routing problem which seeks to minimize cost subject to time window and synchronization constraints. In this problem, the fleet of vehicles is categorized into regular and special vehicles. Some customers require both vehicles’ services, whose service start times at the customer are synchronized. Despite its important real-world application, this problem has rarely been studied in the literature. To solve the problem, we propose a Constraint Programming (CP) model and an Adaptive Large Neighborhood Search (ALNS) in which the design of insertion operators is based on solving linear programming (LP) models to check the insertion feasibility. A number of acceleration techniques is also proposed to significantly reduce the computational time. The computational experiments show that our new CP model finds better solutions than an existing CP-based ALNS, when used on small instances with 25 customers and with a much shorter running time. Our LP-based ALNS dominates the CP-based ALNS, in terms of solution quality, when it provides solutions with better objective values, on average, for all instance classes. This demonstrates the advantage of using linear programming instead of constraint programming when dealing with a variant of vehicle routing problems with relatively tight constraints, which is often considered to be more favorable for CP-based methods. We also adapt our algorithm to solve a well-studied variant of the problem, and the obtained results show that the algorithm provides good solutions as state-of-the-art approaches and improves four best known solutions. |
|---|---|
| AbstractList | We consider a vehicle routing problem which seeks to minimize cost subject to time window and synchronization constraints. In this problem, the fleet of vehicles is categorized into regular and special vehicles. Some customers require both vehicles’ services, whose service start times at the customer are synchronized. Despite its important real-world application, this problem has rarely been studied in the literature. To solve the problem, we propose a Constraint Programming (CP) model and an Adaptive Large Neighborhood Search (ALNS) in which the design of insertion operators is based on solving linear programming (LP) models to check the insertion feasibility. A number of acceleration techniques is also proposed to significantly reduce the computational time. The computational experiments show that our new CP model finds better solutions than an existing CP-based ALNS, when used on small instances with 25 customers and with a much shorter running time. Our LP-based ALNS dominates the CP-based ALNS, in terms of solution quality, when it provides solutions with better objective values, on average, for all instance classes. This demonstrates the advantage of using linear programming instead of constraint programming when dealing with a variant of vehicle routing problems with relatively tight constraints, which is often considered to be more favorable for CP-based methods. We also adapt our algorithm to solve a well-studied variant of the problem, and the obtained results show that the algorithm provides good solutions as state-of-the-art approaches and improves four best known solutions. |
| ArticleNumber | 105085 |
| Author | Pham, Hoang Giang Nguyen, Tat Dat Nguyen Duy, Thinh Hà, Minh Hoàng Do, Thuy Rousseau, Louis-Martin |
| Author_xml | – sequence: 1 givenname: Minh Hoàng surname: Hà fullname: Hà, Minh Hoàng email: hoang.haminh@phenikaa-uni.edu.vn organization: ORLab, Faculty of Computer Science, Phenikaa University, Hanoi, Viet Nam – sequence: 2 givenname: Tat Dat surname: Nguyen fullname: Nguyen, Tat Dat organization: ORLab, Faculty of Information Technology, VNU University of Engineering and Technology, Hanoi, Viet Nam – sequence: 3 givenname: Thinh surname: Nguyen Duy fullname: Nguyen Duy, Thinh organization: Department of Computer Science, FPT University, Hanoi, Viet Nam – sequence: 4 givenname: Hoang Giang surname: Pham fullname: Pham, Hoang Giang organization: Department of Computer Science, FPT University, Hanoi, Viet Nam – sequence: 5 givenname: Thuy surname: Do fullname: Do, Thuy organization: Department of Computer Science, FPT University, Hanoi, Viet Nam – sequence: 6 givenname: Louis-Martin surname: Rousseau fullname: Rousseau, Louis-Martin organization: École Polytechnique de Montréal and CIRRELT, Montréal, Canada |
| BookMark | eNp9kcFu1DAQhq2qSLSFB-BmiXO2thNvvOJUVUCRKnGBs-VMJhuvEns79m5V3of3xGE5rDjUF9ua-f6ZX_81uwwxIGMfpFhJIde3uxVEWimhlr8WRl-wK1ELXQndmMuz91t2ndJOlNMqecV-3_GAzxxiSJmcD5nvKW7JzbMPWz7HHifuQs8dn3xAR-flqnMJS6l3--yPyCdHWyxyfjt2kcYYe54KAiMfIvE8Ij_i6GFCTvGQF_0i1k0482efR55eAowUg__lso_hbKf0jr0Z3JTw_b_7hv388vnH_UP1-P3rt_u7xwpq3eaqM9qZtREtOmlks4Gu37gGHLTNRtdraYauQcDOSI2gOqkUNPXQY2tKvVnL-oZ9POmWxZ4OmLLdxQOFMtIqLXSrlBB16ZKnLqCYEuFg9-RnRy9WCrukYXe2pGGXNOwpjcK0_zHg81-fi8XpVfLTicRi_OiRbAKPAbD3hJBtH_0r9B8uf6rb |
| CitedBy_id | crossref_primary_10_1108_JHLSCM_10_2021_0103 crossref_primary_10_1016_j_ejor_2023_10_015 crossref_primary_10_1287_trsc_2024_0800 crossref_primary_10_1016_j_cie_2022_108128 crossref_primary_10_1016_j_cie_2023_109329 crossref_primary_10_1287_trsc_2022_1192 crossref_primary_10_1016_j_ejor_2023_04_007 crossref_primary_10_1111_itor_13256 crossref_primary_10_1002_net_22287 crossref_primary_10_1016_j_ejor_2024_10_009 crossref_primary_10_1016_j_cor_2022_105903 crossref_primary_10_1080_00207543_2021_2013566 crossref_primary_10_1016_j_swevo_2022_101109 crossref_primary_10_1109_TITS_2023_3235774 crossref_primary_10_1016_j_cor_2023_106454 crossref_primary_10_1080_23249935_2024_2338249 crossref_primary_10_1016_j_cor_2023_106433 crossref_primary_10_1080_01605682_2025_2535713 crossref_primary_10_1016_j_cor_2025_107223 crossref_primary_10_1080_0305215X_2021_1957101 |
| Cites_doi | 10.1016/j.cor.2017.11.011 10.1016/j.ejor.2014.09.048 10.1007/978-3-642-01929-6_12 10.1287/trsc.1110.0400 10.1002/net.20472 10.1007/s10100-018-0520-4 10.1287/trsc.32.1.12 10.1007/s11590-015-0878-3 10.3138/infor.51.2.76 10.1016/j.ejor.2011.10.048 10.1016/j.ejor.2007.07.033 10.1016/j.trc.2018.03.025 10.1016/j.ejor.2018.06.046 10.1002/net.21905 10.1016/j.cor.2018.08.002 10.1007/3-540-49481-2_30 10.5220/0004837502570263 10.1016/j.cor.2005.09.012 10.1287/opre.35.2.254 |
| ContentType | Journal Article |
| Copyright | 2020 Copyright Pergamon Press Inc. Dec 2020 |
| Copyright_xml | – notice: 2020 – notice: Copyright Pergamon Press Inc. Dec 2020 |
| DBID | AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D |
| DOI | 10.1016/j.cor.2020.105085 |
| DatabaseName | CrossRef Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Computer and Information Systems Abstracts |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science Business |
| EISSN | 0305-0548 |
| ExternalDocumentID | 10_1016_j_cor_2020_105085 S0305054820302021 |
| 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 ABXDB ACDAQ ACGFO ACGFS ACNCT ACNNM ACRLP ACZNC ADBBV ADEZE ADGUI ADJOM ADMUD AEBSH AEFWE AEHXG 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 ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO AEIPS AEUPX AFPUW AGQPQ AIGII AIIUN AKBMS AKYEP ANKPU APXCP CITATION EFKBS EFLBG ~HD 7SC 8FD AFXIZ AGCQF AGRNS BNPGV JQ2 L7M L~C L~D SSH |
| ID | FETCH-LOGICAL-c357t-b85a86807ea18149cbd9a4cac74953618fb4eceb815ec2b122c43fde784954613 |
| ISICitedReferencesCount | 22 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000571468600020&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 | Fri Jul 25 21:07:25 EDT 2025 Tue Nov 18 22:25:49 EST 2025 Sat Nov 29 07:19:26 EST 2025 Tue Dec 03 03:45:22 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Adaptive large neighborhood search Time window Vehicle routing problem Synchronization constraint Constraint programming |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c357t-b85a86807ea18149cbd9a4cac74953618fb4eceb815ec2b122c43fde784954613 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| PQID | 2505722003 |
| PQPubID | 45870 |
| ParticipantIDs | proquest_journals_2505722003 crossref_primary_10_1016_j_cor_2020_105085 crossref_citationtrail_10_1016_j_cor_2020_105085 elsevier_sciencedirect_doi_10_1016_j_cor_2020_105085 |
| PublicationCentury | 2000 |
| PublicationDate | 2020-12-01 |
| PublicationDateYYYYMMDD | 2020-12-01 |
| PublicationDate_xml | – month: 12 year: 2020 text: 2020-12-01 day: 01 |
| PublicationDecade | 2020 |
| PublicationPlace | New York |
| PublicationPlace_xml | – name: New York |
| PublicationTitle | Computers & operations research |
| PublicationYear | 2020 |
| Publisher | Elsevier Ltd Pergamon Press Inc |
| Publisher_xml | – name: Elsevier Ltd – name: Pergamon Press Inc |
| References | Afifi, Dang, Moukrim (b0005) 2016; 10 Ghedira (b0030) 2013 Liu, Tao, Xie (b0065) 2019; 101 Homberger, Gehring (b0045) 1999; 37 Vikas Goel, M. Slusky, W.-J. van Hoeve, Kevin C. Furman, Yufen Shao, 2015. Constraint programming for LNG ship scheduling and inventory management. European Journal of Operational Research 241 (3), 662–673. IBM Software, 2015. Ibm ilog cplex optimization studio v12.6.3. Paul Shaw, 1998. Using constraint programming and local search methods to solve vehicle routing problems. In: Michael J. Maher, Jean-Francois Puget (Eds.), Principles and Practice of Constraint Programming – CP98, 4th International Conference, Pisa, Italy, October 26–30, 1998, Proceedings, vol. 1520 of Lecture Notes in Computer Science, Springer, pp. 417–431. Nacima Labadie, Christian Prins, Yanyan Yang, 2004. Iterated local search for a vehicle routing problem with synchronization constraints. In: Begoña Vitoriano, Eric Pinson, Fernando Valente (Ed.), ICORES 2014 – Proceedings of the 3rd International Conference on Operations Research and Enterprise Systems, Angers, Loire Valley, France, March 6–8, 2014, pages 257–263. SciTePress. Bredström, Rönnqvist (b0010) 2008; 191 Pillac, Guéret, Medaglia (b0090) 2018 Fink, Desaulniers, Frey, Kiermaier, Kolisch, Soumis (b0025) 2019; 272 Parragh, Doerner (b0070) 2018; 26 Pisinger, Ropke (b0095) 2007; 34 Pesant, Gendreau, Potvin, Rousseau (b0080) 1998; 32 Philippe Laborie, 2009. IBM ILOG CP optimizer for detailed scheduling illustrated on three problems. In: Willem Jan van Hoeve, John N. Hooker (Ed.), Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 6th International Conference, CPAIOR 2009, Pittsburgh, PA, USA, May 27–31, 2009, Proceedings, vol. 5547 of Lecture Notes in Computer Science, Springer. pp. 148–162. Rousseau, Gendreau, Pesant (b0105) 2013; 51 Dohn, Rasmussen, Larsen (b0015) 2011; 58 Sarasola, Doerner (b0110) 2020; 75 Solomon (b0115) 1987; 35 Hojabri, Gendreau, Potvin, Rousseau (b0040) 2018; 92 Rasmussen, Justesen, Dohn, Larsen (b0100) 2012; 219 Kindervater, Savelsbergh (b0055) 1997 Drexl (b0020) 2012; 46 Ham (b0035) 2018; 91 Liu (10.1016/j.cor.2020.105085_b0065) 2019; 101 Fink (10.1016/j.cor.2020.105085_b0025) 2019; 272 10.1016/j.cor.2020.105085_b0050 10.1016/j.cor.2020.105085_b0060 Ham (10.1016/j.cor.2020.105085_b0035) 2018; 91 Pisinger (10.1016/j.cor.2020.105085_b0095) 2007; 34 Solomon (10.1016/j.cor.2020.105085_b0115) 1987; 35 Kindervater (10.1016/j.cor.2020.105085_b0055) 1997 Hojabri (10.1016/j.cor.2020.105085_b0040) 2018; 92 Homberger (10.1016/j.cor.2020.105085_b0045) 1999; 37 Afifi (10.1016/j.cor.2020.105085_b0005) 2016; 10 Pesant (10.1016/j.cor.2020.105085_b0080) 1998; 32 Sarasola (10.1016/j.cor.2020.105085_b0110) 2020; 75 Pillac (10.1016/j.cor.2020.105085_b0090) 2018 Dohn (10.1016/j.cor.2020.105085_b0015) 2011; 58 Bredström (10.1016/j.cor.2020.105085_b0010) 2008; 191 Parragh (10.1016/j.cor.2020.105085_b0070) 2018; 26 10.1016/j.cor.2020.105085_b0085 Rasmussen (10.1016/j.cor.2020.105085_b0100) 2012; 219 Rousseau (10.1016/j.cor.2020.105085_b0105) 2013; 51 Drexl (10.1016/j.cor.2020.105085_b0020) 2012; 46 10.1016/j.cor.2020.105085_b0120 Ghedira (10.1016/j.cor.2020.105085_b0030) 2013 10.1016/j.cor.2020.105085_b0075 |
| References_xml | – volume: 46 start-page: 297 year: 2012 end-page: 316 ident: b0020 article-title: Synchronization in vehicle routing – A survey of vrps with multiple synchronization constraints publication-title: Transportation Science – volume: 191 start-page: 19 year: 2008 end-page: 31 ident: b0010 article-title: Combined vehicle routing and scheduling with temporal precedence and synchronization constraints publication-title: European Journal of Operational Research – reference: IBM Software, 2015. Ibm ilog cplex optimization studio v12.6.3. – reference: Nacima Labadie, Christian Prins, Yanyan Yang, 2004. Iterated local search for a vehicle routing problem with synchronization constraints. In: Begoña Vitoriano, Eric Pinson, Fernando Valente (Ed.), ICORES 2014 – Proceedings of the 3rd International Conference on Operations Research and Enterprise Systems, Angers, Loire Valley, France, March 6–8, 2014, pages 257–263. SciTePress. – volume: 92 start-page: 87 year: 2018 end-page: 97 ident: b0040 article-title: Large neighborhood search with constraint programming for a vehicle routing problem with synchronization constraints publication-title: Computers & Operations Research – reference: Paul Shaw, 1998. Using constraint programming and local search methods to solve vehicle routing problems. In: Michael J. Maher, Jean-Francois Puget (Eds.), Principles and Practice of Constraint Programming – CP98, 4th International Conference, Pisa, Italy, October 26–30, 1998, Proceedings, vol. 1520 of Lecture Notes in Computer Science, Springer, pp. 417–431. – volume: 26 start-page: 443 year: 2018 end-page: 464 ident: b0070 article-title: Solving routing problems with pairwise synchronization constraints publication-title: Central European Journal of Operations Research – volume: 32 start-page: 12 year: 1998 end-page: 29 ident: b0080 article-title: An exact constraint logic programming algorithm for the traveling salesman problem with time windows publication-title: Transportation Science – volume: 10 start-page: 511 year: 2016 end-page: 525 ident: b0005 article-title: Heuristic solutions for the vehicle routing problem with time windows and synchronized visits publication-title: Optimization Letters – volume: 34 start-page: 2403 year: 2007 end-page: 2435 ident: b0095 article-title: A general heuristic for vehicle routing problems publication-title: Computer & Operations Research – volume: 51 start-page: 76 year: 2013 end-page: 83 ident: b0105 article-title: The synchronized dynamic vehicle dispatching problem publication-title: INFOR Information Systems and Operational Research. – volume: 37 start-page: 297 year: 1999 end-page: 318 ident: b0045 article-title: Two evolutionary metaheuristics for the vehicle routing problem with time windows publication-title: INFOR – reference: Philippe Laborie, 2009. IBM ILOG CP optimizer for detailed scheduling illustrated on three problems. In: Willem Jan van Hoeve, John N. Hooker (Ed.), Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 6th International Conference, CPAIOR 2009, Pittsburgh, PA, USA, May 27–31, 2009, Proceedings, vol. 5547 of Lecture Notes in Computer Science, Springer. pp. 148–162. – volume: 219 start-page: 598 year: 2012 end-page: 610 ident: b0100 article-title: The home care crew scheduling problem: Preference-based visit clustering and temporal dependencies publication-title: European Journal of Operational Research – start-page: 337 year: 1997 end-page: 360 ident: b0055 article-title: Vehicle Routing: Handling Edge Exchanges – volume: 91 start-page: 1 year: 2018 end-page: 14 ident: b0035 article-title: Integrated scheduling of m-truck, m-drone, and m-depot constrained by time-window, drop-pickup, and m-visit using constraint programming publication-title: Transportation Research Part C: Emerging Technologies – volume: 272 start-page: 699 year: 2019 end-page: 711 ident: b0025 article-title: Column generation for vehicle routing problems with multiple synchronization constraints publication-title: European Journal of Operational Research – volume: 101 start-page: 250 year: 2019 end-page: 262 ident: b0065 article-title: An adaptive large neighborhood search heuristic for the vehicle routing problem with time windows and synchronized visits publication-title: Computer & Operations Research – volume: 58 start-page: 273 year: 2011 end-page: 289 ident: b0015 article-title: The vehicle routing problem with time windows and temporal dependencies publication-title: Networks – start-page: 347 year: 2018 end-page: 367 ident: b0090 article-title: A Fast Reoptimization Approach for the Dynamic Technician Routing and Scheduling Problem – volume: 75 start-page: 64 year: 2020 end-page: 85 ident: b0110 article-title: Adaptive large neighborhood search for the vehicle routing problem with synchronization constraints at the delivery location publication-title: Networks – reference: Vikas Goel, M. Slusky, W.-J. van Hoeve, Kevin C. Furman, Yufen Shao, 2015. Constraint programming for LNG ship scheduling and inventory management. European Journal of Operational Research 241 (3), 662–673. – year: 2013 ident: b0030 article-title: Constraint Satisfaction Problems: CSP Formalisms and Techniques – volume: 35 start-page: 254 year: 1987 end-page: 265 ident: b0115 article-title: Algorithms for the vehicle routing and scheduling problems with time window constraints publication-title: Operations Research – volume: 92 start-page: 87 year: 2018 ident: 10.1016/j.cor.2020.105085_b0040 article-title: Large neighborhood search with constraint programming for a vehicle routing problem with synchronization constraints publication-title: Computers & Operations Research doi: 10.1016/j.cor.2017.11.011 – ident: 10.1016/j.cor.2020.105085_b0120 doi: 10.1016/j.ejor.2014.09.048 – ident: 10.1016/j.cor.2020.105085_b0085 doi: 10.1007/978-3-642-01929-6_12 – volume: 46 start-page: 297 issue: 3 year: 2012 ident: 10.1016/j.cor.2020.105085_b0020 article-title: Synchronization in vehicle routing – A survey of vrps with multiple synchronization constraints publication-title: Transportation Science doi: 10.1287/trsc.1110.0400 – volume: 58 start-page: 273 issue: 4 year: 2011 ident: 10.1016/j.cor.2020.105085_b0015 article-title: The vehicle routing problem with time windows and temporal dependencies publication-title: Networks doi: 10.1002/net.20472 – volume: 26 start-page: 443 issue: 2 year: 2018 ident: 10.1016/j.cor.2020.105085_b0070 article-title: Solving routing problems with pairwise synchronization constraints publication-title: Central European Journal of Operations Research doi: 10.1007/s10100-018-0520-4 – volume: 32 start-page: 12 issue: 1 year: 1998 ident: 10.1016/j.cor.2020.105085_b0080 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: 10 start-page: 511 issue: 3 year: 2016 ident: 10.1016/j.cor.2020.105085_b0005 article-title: Heuristic solutions for the vehicle routing problem with time windows and synchronized visits publication-title: Optimization Letters doi: 10.1007/s11590-015-0878-3 – ident: 10.1016/j.cor.2020.105085_b0050 – start-page: 337 year: 1997 ident: 10.1016/j.cor.2020.105085_b0055 – volume: 51 start-page: 76 issue: 2 year: 2013 ident: 10.1016/j.cor.2020.105085_b0105 article-title: The synchronized dynamic vehicle dispatching problem publication-title: INFOR Information Systems and Operational Research. doi: 10.3138/infor.51.2.76 – volume: 219 start-page: 598 issue: 3 year: 2012 ident: 10.1016/j.cor.2020.105085_b0100 article-title: The home care crew scheduling problem: Preference-based visit clustering and temporal dependencies publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2011.10.048 – volume: 37 start-page: 297 year: 1999 ident: 10.1016/j.cor.2020.105085_b0045 article-title: Two evolutionary metaheuristics for the vehicle routing problem with time windows publication-title: INFOR – volume: 191 start-page: 19 issue: 1 year: 2008 ident: 10.1016/j.cor.2020.105085_b0010 article-title: Combined vehicle routing and scheduling with temporal precedence and synchronization constraints publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2007.07.033 – volume: 91 start-page: 1 year: 2018 ident: 10.1016/j.cor.2020.105085_b0035 article-title: Integrated scheduling of m-truck, m-drone, and m-depot constrained by time-window, drop-pickup, and m-visit using constraint programming publication-title: Transportation Research Part C: Emerging Technologies doi: 10.1016/j.trc.2018.03.025 – start-page: 347 year: 2018 ident: 10.1016/j.cor.2020.105085_b0090 – volume: 272 start-page: 699 issue: 2 year: 2019 ident: 10.1016/j.cor.2020.105085_b0025 article-title: Column generation for vehicle routing problems with multiple synchronization constraints publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2018.06.046 – volume: 75 start-page: 64 issue: 1 year: 2020 ident: 10.1016/j.cor.2020.105085_b0110 article-title: Adaptive large neighborhood search for the vehicle routing problem with synchronization constraints at the delivery location publication-title: Networks doi: 10.1002/net.21905 – volume: 101 start-page: 250 year: 2019 ident: 10.1016/j.cor.2020.105085_b0065 article-title: An adaptive large neighborhood search heuristic for the vehicle routing problem with time windows and synchronized visits publication-title: Computer & Operations Research doi: 10.1016/j.cor.2018.08.002 – year: 2013 ident: 10.1016/j.cor.2020.105085_b0030 – ident: 10.1016/j.cor.2020.105085_b0075 doi: 10.1007/3-540-49481-2_30 – ident: 10.1016/j.cor.2020.105085_b0060 doi: 10.5220/0004837502570263 – volume: 34 start-page: 2403 issue: 8 year: 2007 ident: 10.1016/j.cor.2020.105085_b0095 article-title: A general heuristic for vehicle routing problems publication-title: Computer & Operations Research doi: 10.1016/j.cor.2005.09.012 – volume: 35 start-page: 254 issue: 2 year: 1987 ident: 10.1016/j.cor.2020.105085_b0115 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 |
| SSID | ssj0000721 |
| Score | 2.4622254 |
| Snippet | We consider a vehicle routing problem which seeks to minimize cost subject to time window and synchronization constraints. In this problem, the fleet of... |
| SourceID | proquest crossref elsevier |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 105085 |
| SubjectTerms | Adaptive large neighborhood search Algorithms Computing time Constraint modelling Constraint programming Customer services Customers Insertion Linear programming Operations research Route planning Run time (computers) Synchronization constraint Time synchronization Time window Vehicle routing Vehicle routing problem Vehicles Windows (intervals) |
| Title | A new constraint programming model and a linear programming-based adaptive large neighborhood search for the vehicle routing problem with synchronization constraints |
| URI | https://dx.doi.org/10.1016/j.cor.2020.105085 https://www.proquest.com/docview/2505722003 |
| Volume | 124 |
| WOSCitedRecordID | wos000571468600020&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: 0305-0548 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000721 issn: 0305-0548 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lj9MwELaqXYTgwKOAWFjQHDhRRUodN49jBYsKQiskCuotShzvSyWtmrTa_qD9I_vLmPEjCV2xAiQuUWTHjqX5bI_H38ww9kYWYc79PEfNbRh6IigSnHOCewnPhyKXPIy039r3z9HxcTybJV96vWvnC7OZR2UZX14my_8qaixDYZPr7F-Iu-kUC_AdhY5PFDs-_0jwY8oSTmzySqd_qB0F6wcZBXTiGxOgdUAKJgW6bqs92tOwqsiWmlE0J5o4docHeISKDoBsrSSOnLhRZ_T_wWqxro1fu85PY5nv21Lq2LvG1bMzpqqrE7vEEpWG4WKpVpaeZwMRNQbrib7V9w3bvzwbTBamwG6-ZNI-XW_NOjrNakR0_WvF4P16a1hR2Ly9DzFzYrLIyBaH0-W0awrhu7SSxkenJURpvzCiJ45MPM9mzTeO2zf2D2PKuEDxU6xYrtMg-yan0E5Y7q_UL3XL8QU_xRP4Po9GCa6s--OPR7NPrT4Qae-_Zhzubl2zDHd-9DvtaEdP0MrP9BF7YE8tMDZoe8x6quyzu85pos8eOhmC3Sv67H4n0uUTdjUGRCW0CIAO7ECjEhCVkIFBJdxAJThUgkYldFEJBieAqAREJVhUgkUlWFQCoRJ2UNkZU_WUfftwNH038WyGEE8Go6j28niUxWHsRypDTVUkMi-STMhMRkSbDofxSS6UVHk8HCmJqw_nUgQnhYpirBeoyT5je-WiVM8pdgEpz6FKgqAQscixJ2xXBJkKg1D58QHznWRSacPn0-DmqeNJXqQozJSEmRphHrC3TZOliR1z28fCiTu1yq9RalPE5m3NDh00UrsIVSkdayJOtNMX_9brS3avnV-HbK9erdUrdkdu6vNq9doC_CcGmuS- |
| 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=A+new+constraint+programming+model+and+a+linear+programming-based+adaptive+large+neighborhood+search+for+the+vehicle+routing+problem+with+synchronization+constraints&rft.jtitle=Computers+%26+operations+research&rft.au=H%C3%A0%2C+Minh+Ho%C3%A0ng&rft.au=Nguyen%2C+Tat+Dat&rft.au=Nguyen+Duy%2C+Thinh&rft.au=Pham%2C+Hoang+Giang&rft.date=2020-12-01&rft.pub=Elsevier+Ltd&rft.issn=0305-0548&rft.volume=124&rft_id=info:doi/10.1016%2Fj.cor.2020.105085&rft.externalDocID=S0305054820302021 |
| 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 |