The Time Window Assignment Vehicle Routing Problem with Time-Dependent Travel Times
In this paper, we introduce the time window assignment vehicle routing problem (TWAVRP) with time-dependent travel times. It is the problem of assigning time windows to customers before their demand is known and creating vehicle routes adhering to these time windows after demand becomes known. The g...
Saved in:
Published in | Transportation science Vol. 52; no. 2; pp. 261 - 276 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | English |
Published |
Baltimore
INFORMS
01.03.2018
Institute for Operations Research and the Management Sciences |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Abstract | In this paper, we introduce the time window assignment vehicle routing problem (TWAVRP) with time-dependent travel times. It is the problem of assigning time windows to customers before their demand is known and creating vehicle routes adhering to these time windows after demand becomes known. The goal is to assign the time windows in such a way that the expected transportation costs are minimized. We develop a branch-price-and-cut algorithm to solve this problem to optimality. The pricing problem that has to be solved is a new variant of the shortest path problem, which includes a capacity constraint, time-dependent travel times, time window constraints on both the nodes and on the arcs, and linear node costs. For solving the pricing problem, we develop an exact labeling algorithm and a tabu search heuristic. Furthermore, we present new valid inequalities, which are specifically designed for the TWAVRP with time-dependent travel times. Finally, we present results of numerical experiments to illustrate the performance of the algorithm. |
---|---|
AbstractList | In this paper, we introduce the time window assignment vehicle routing problem (TWAVRP) with time-dependent travel times. It is the problem of assigning time windows to customers before their demand is known and creating vehicle routes adhering to these time windows after demand becomes known. The goal is to assign the time windows in such a way that the expected transportation costs are minimized. We develop a branch-price-and-cut algorithm to solve this problem to optimality. The pricing problem that has to be solved is a new variant of the shortest path problem, which includes a capacity constraint, time-dependent travel times, time window constraints on both the nodes and on the arcs, and linear node costs. For solving the pricing problem, we develop an exact labeling algorithm and a tabu search heuristic. Furthermore, we present new valid inequalities, which are specifically designed for the TWAVRP with time-dependent travel times. Finally, we present results of numerical experiments to illustrate the performance of the algorithm. |
Audience | Academic |
Author | Spliet, Remy Van Woensel, Tom Dabia, Said |
Author_xml | – sequence: 1 fullname: Spliet, Remy – sequence: 2 fullname: Dabia, Said – sequence: 3 fullname: Van Woensel, Tom |
BookMark | eNqFkt9LwzAQx4MouE1ffS4IPtmZpE1SH8f8CYKiUx9D2l67SJvOJHX639s6YQ4Gcg8Hx-d7d8l9h2jXNAYQOiJ4TGgizrx12ZhiwsdYYLaDBoRRHrI4FrtogHFMQsIZ20dD594wJkwQNkBPszkEM11D8KpN3iyDiXO6NDUYH7zAXGcVBI9N67UpgwfbpBXUwVL7-Y8mvIAFmLxnZ1Z9QPVTdQdor1CVg8PfPELPV5ez6U14d399O53chRlj2Ie5oJxGiYhTgQsOKiZREYuoSAkXRCUUaM4LlgNlgpKcRkzxmIk0wZACO6dJNELHq74L27y34Lx8a1prupGSkohSzug5WVOlqkBqUzTeqqzWLpMTFnERc0x7KtxClWDAqqr750J35Q1-vIXvIodaZ1sFJxuCjvHw6UvVOic3wdM_YNo6baC7ienOMvduxW9bJLONcxYKubC6VvZLEix7X8jeF7L3hex9sX5pv7St3X_8N42Pt7o |
CitedBy_id | crossref_primary_10_3233_IDA_205693 crossref_primary_10_1155_2018_2453185 crossref_primary_10_1155_2019_5364201 crossref_primary_10_1016_j_ejor_2019_07_014 crossref_primary_10_1007_s10288_023_00556_2 crossref_primary_10_1016_j_tre_2023_103131 crossref_primary_10_1016_j_tre_2023_103095 crossref_primary_10_1051_ro_2021098 crossref_primary_10_1016_j_trb_2018_09_008 crossref_primary_10_1287_trsc_2019_0927 crossref_primary_10_1016_j_asoc_2021_107875 crossref_primary_10_1287_trsc_2020_1029 crossref_primary_10_1287_trsc_2022_0099 crossref_primary_10_1016_j_multra_2023_100093 crossref_primary_10_1016_j_eswa_2019_112910 crossref_primary_10_1016_j_jclepro_2021_127462 crossref_primary_10_1007_s00291_020_00607_8 crossref_primary_10_3390_info11010036 crossref_primary_10_1002_net_21937 crossref_primary_10_2139_ssrn_4060911 crossref_primary_10_1016_j_ejor_2019_01_053 crossref_primary_10_1155_2021_2150293 crossref_primary_10_1016_j_cie_2021_107560 crossref_primary_10_1088_1757_899X_650_1_012043 crossref_primary_10_1007_s11356_021_12992_w crossref_primary_10_1287_trsc_2019_0938 crossref_primary_10_1016_j_ejor_2024_01_021 crossref_primary_10_1016_j_cor_2019_02_014 crossref_primary_10_1155_2018_5075916 crossref_primary_10_1155_2022_6713617 crossref_primary_10_1016_j_tre_2018_03_004 crossref_primary_10_1016_j_tre_2022_102785 crossref_primary_10_1007_s00291_024_00766_y crossref_primary_10_1007_s11831_021_09574_x crossref_primary_10_1080_01605682_2019_1590134 crossref_primary_10_1088_1742_6596_1811_1_012007 crossref_primary_10_1016_j_trb_2021_09_005 crossref_primary_10_1080_01605682_2023_2253852 crossref_primary_10_1016_j_eswa_2020_113877 crossref_primary_10_1109_ACCESS_2019_2948154 crossref_primary_10_3390_systems12040121 crossref_primary_10_1016_j_ejor_2024_06_011 crossref_primary_10_1287_trsc_2020_1013 crossref_primary_10_1016_j_cor_2022_106045 crossref_primary_10_1287_trsc_2023_0004 crossref_primary_10_1016_j_trb_2022_10_011 crossref_primary_10_1007_s00291_023_00735_x crossref_primary_10_1016_j_ejor_2023_01_056 crossref_primary_10_1287_trsc_2021_1109 |
Cites_doi | 10.1007/s10107-003-0481-8 10.1016/j.cor.2004.08.003 10.1016/j.cor.2012.04.010 10.1287/trsc.1120.0449 10.1002/net.20033 10.1016/j.trb.2013.08.008 10.1287/trsc.33.1.101 10.1287/trsc.1120.0445 10.1002/net.21565 10.1016/j.cor.2015.06.001 10.1287/trsc.24.2.145 10.1287/msom.1080.0243 10.1016/S0377-2217(02)00147-9 10.1016/j.ejor.2015.01.020 10.1016/j.endm.2010.05.088 10.1287/opre.1110.0975 10.1287/trsc.2013.0510 10.1287/opre.1070.0449 10.1016/j.dam.2008.06.021 10.1002/(SICI)1097-0037(199805)31:3<193::AID-NET6>3.0.CO;2-A |
ContentType | Journal Article |
Copyright | COPYRIGHT 2018 Institute for Operations Research and the Management Sciences Copyright Institute for Operations Research and the Management Sciences Mar/Apr 2018 |
Copyright_xml | – notice: COPYRIGHT 2018 Institute for Operations Research and the Management Sciences – notice: Copyright Institute for Operations Research and the Management Sciences Mar/Apr 2018 |
DBID | AAYXX CITATION N95 XI7 8BJ FQK JBE |
DOI | 10.1287/trsc.2016.0705 |
DatabaseName | CrossRef Gale Business Insights Business Insights: Essentials International Bibliography of the Social Sciences (IBSS) International Bibliography of the Social Sciences International Bibliography of the Social Sciences |
DatabaseTitle | CrossRef International Bibliography of the Social Sciences (IBSS) |
DatabaseTitleList | CrossRef |
DeliveryMethod | fulltext_linktorsrc |
Discipline | Economics Engineering |
EISSN | 1526-5447 |
EndPage | 276 |
ExternalDocumentID | A536746021 10_1287_trsc_2016_0705 trsc.2016.0705 |
Genre | Research Article |
GroupedDBID | 08R 123 1AW 29Q 3V. 4 4.4 4S 7WY 88I 8FE 8FG 8FL 8V8 AAPBV ABBHK ABDBF ABFLS ABJCF ABPTK ABUWG ACFWO ACGOD ACHQT ACIWK ACNCT ADULT AENEX AEUPB AFFNX AFKRA AKVCP ALMA_UNASSIGNED_HOLDINGS ARCSS AZQEC BENPR BEZIV BGLVJ BIPZW BPHCQ BXSLM CS3 DU5 DWQXO EAD EAP EBA EBR EBS EBU EDO EJD EMK EPL EST ESX FRNLG GNUQQ GROUPED_ABI_INFORM_COMPLETE GROUPED_ABI_INFORM_RESEARCH HCIFZ HVGLF H~9 I-F IAO IEA IOF ITC JPL JSODD JST K6 K60 L6V M0C M2P M7S MV1 N95 NB9 NIEAY P2P PQEST PQQKQ PQUKI PRINS PROAC PTHSS REX RPU SA0 TAE TH9 TN5 TUS WH7 X XI7 Y99 ZY4 -~X .-4 .4S .DC 18M 2AX 2XV AAYXX ABTAH ABXSQ ACDEK ACGFO ADAAO ADACV AEGXH AEMOZ AHIZY AIAGR BAAKF CCPQU CITATION IPSME JAAYA JBMMH JENOY JHFFW JKQEH JLEZI JLXEF K1G K6~ LPU PQBIZ PQBZA 8BJ FQK JBE |
ID | FETCH-LOGICAL-c550t-d72623874b70f6ea413f473fb1671a82e2d6f5de25721d235a6457b80ebe59283 |
ISSN | 0041-1655 |
IngestDate | Thu Oct 10 19:27:29 EDT 2024 Wed May 29 17:41:48 EDT 2024 Tue Oct 22 20:29:30 EDT 2024 Tue May 28 06:10:44 EDT 2024 Sat Sep 28 20:55:01 EDT 2024 Tue Oct 08 15:54:51 EDT 2024 Fri Aug 23 01:02:12 EDT 2024 Wed Jan 06 02:48:13 EST 2021 |
IsDoiOpenAccess | false |
IsOpenAccess | true |
IsPeerReviewed | true |
IsScholarly | true |
Issue | 2 |
Language | English |
LinkModel | OpenURL |
MergedId | FETCHMERGED-LOGICAL-c550t-d72623874b70f6ea413f473fb1671a82e2d6f5de25721d235a6457b80ebe59283 |
OpenAccessLink | https://research.vu.nl/files/105377586/The_Time_Window_Assignment_Vehicle_Routing_Problem_with_TimeDependent_Travel_Times.pdf |
PQID | 2132265291 |
PQPubID | 37963 |
PageCount | 16 |
ParticipantIDs | informs_primary_10_1287_trsc_2016_0705 proquest_journals_2132265291 gale_incontextgauss__A536746021 gale_businessinsightsgauss_A536746021 gale_infotracacademiconefile_A536746021 gale_infotracmisc_A536746021 gale_infotracgeneralonefile_A536746021 crossref_primary_10_1287_trsc_2016_0705 |
ProviderPackageCode | Y99 RPU NIEAY |
PublicationCentury | 2000 |
PublicationDate | 2018-03-01 |
PublicationDateYYYYMMDD | 2018-03-01 |
PublicationDate_xml | – month: 03 year: 2018 text: 2018-03-01 day: 01 |
PublicationDecade | 2010 |
PublicationPlace | Baltimore |
PublicationPlace_xml | – name: Baltimore |
PublicationTitle | Transportation science |
PublicationYear | 2018 |
Publisher | INFORMS Institute for Operations Research and the Management Sciences |
Publisher_xml | – name: INFORMS – name: Institute for Operations Research and the Management Sciences |
References | B20 B10 B21 B11 B12 B13 B14 B15 B16 B17 B18 B19 B1 B2 B3 B4 B5 B6 B7 B8 B9 |
References_xml | – ident: B8 – ident: B12 – ident: B9 – ident: B11 – ident: B13 – ident: B14 – ident: B10 – ident: B3 – ident: B2 – ident: B20 – ident: B1 – ident: B4 – ident: B7 – ident: B5 – ident: B6 – ident: B21 – ident: B17 – ident: B18 – ident: B16 – ident: B15 – ident: B19 – ident: B18 doi: 10.1007/s10107-003-0481-8 – ident: B2 doi: 10.1016/j.cor.2004.08.003 – ident: B19 doi: 10.1016/j.cor.2012.04.010 – ident: B4 doi: 10.1287/trsc.1120.0449 – ident: B7 doi: 10.1002/net.20033 – ident: B8 doi: 10.1016/j.trb.2013.08.008 – ident: B15 doi: 10.1287/trsc.33.1.101 – ident: B5 doi: 10.1287/trsc.1120.0445 – ident: B16 doi: 10.1002/net.21565 – ident: B9 doi: 10.1016/j.cor.2015.06.001 – ident: B6 doi: 10.1287/trsc.24.2.145 – ident: B10 doi: 10.1287/msom.1080.0243 – ident: B11 doi: 10.1016/S0377-2217(02)00147-9 – ident: B20 doi: 10.1016/j.ejor.2015.01.020 – ident: B14 doi: 10.1016/j.endm.2010.05.088 – ident: B1 doi: 10.1287/opre.1110.0975 – ident: B21 doi: 10.1287/trsc.2013.0510 – ident: B13 doi: 10.1287/opre.1070.0449 – ident: B3 doi: 10.1016/j.dam.2008.06.021 – ident: B12 doi: 10.1002/(SICI)1097-0037(199805)31:3<193::AID-NET6>3.0.CO;2-A |
SSID | ssj0015715 |
Score | 2.499163 |
Snippet | In this paper, we introduce the time window assignment vehicle routing problem (TWAVRP) with time-dependent travel times. It is the problem of assigning time... |
SourceID | proquest gale crossref informs |
SourceType | Aggregation Database Publisher |
StartPage | 261 |
SubjectTerms | Algorithms branch-price-and-cut column generation Delivery of goods Integer programming Mathematical research Network flow problem Route planning Routing Scheduling Time Time dependence Time management Transportation Travel time Vehicle routing Windows (intervals) |
Title | The Time Window Assignment Vehicle Routing Problem with Time-Dependent Travel Times |
URI | https://www.proquest.com/docview/2132265291 |
Volume | 52 |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3db9MwELdQJwQ8IBggCmX4AdjDFEic2E4eu5VqQuJD2gZ7i-zE6YZQOjUZSPz13MXOlzZpgFRFVXRNk7tf7PP5d3eEvNKhyopcFp5RSehFcSK9RCS5FyuWqyACH0Thju7HT-LwJPpwyk972liTXVLrt9nva_NK_seqcA7silmy_2DZ7qJwAr6DfeEIFobjX9sYczjg3S7z9S_U9fnKbu9_NWcovYeMH4wGfLGNY2zcFX_jLVz72xoLnP80PwbZIN8H81jjnzcgcZNlv98O7mttTdSnRSyUtvTbI9Vy5ZtuXnvf1gaT3xt8WFW0wYYg7tlWdgHaERiQA_n5wmwcX6-lCXa0z5680w5Sw9ijH2F3aluftx2GORvAjQ3HVFut_cpYzzBasqw3FVaiDLAGq8_7Wa3jGs55KGQkfKw2sMVkwvmEbM33F_vLbreJS9fpwt2WK-4Jf_BufPmR8-Km8Nu2wm11ZTJvPJTjB-S-W1rQucXJQ3LLlNvkTpt5Xm2Te4Pik4_IEaCHos2pRQ_t0UMdeqhDD3XooYgeOkYPtehpzlaPycny_fHBoedabHgZLE1rL5cM_N9YRlr6hTAKXJoikmGhAyEDFTPDclHw3MDAzoKchVyJiEsd-_Du8wRc0ydkUq5L85TQINQhM6GGD7YxN4nKmMpDZDawQPhqSnZb3aUXtpJKiitQ0HKKWk5RyylqeUpeo2pT14YVDhUGqqqVuqyqtLfnlLxs5LCMSYk8KSswkth1EsW63qhMuZwTuGMsezaSfDOSXNmi79cJzkaCMBpn4-s4PNz4kLMWLqkbUqqUYWxIcJYEz258tufkbv-Gzsik3lyaF-Ag13rH4fsPWH28xg |
link.rule.ids | 315,786,790,27955,27956 |
linkProvider | EBSCOhost |
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=The+Time+Window+Assignment+Vehicle+Routing+Problem+with+Time-Dependent+Travel+Times&rft.jtitle=Transportation+science&rft.au=Spliet%2C+Remy&rft.au=Dabia%2C+Said&rft.au=Van+Woensel%2C+Tom&rft.date=2018-03-01&rft.pub=Institute+for+Operations+Research+and+the+Management+Sciences&rft.issn=0041-1655&rft.volume=52&rft.issue=2&rft.spage=261&rft_id=info:doi/10.1287%2Ftrsc.2016.0705&rft.externalDocID=A536746021 |
thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0041-1655&client=summon |
thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0041-1655&client=summon |
thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0041-1655&client=summon |