Finding optimal solutions for vehicle routing problem with pickup and delivery services with time windows: A dynamic programming approach based on state–space–time network representations

•Model vehicle routing with real-world transportation networks and time-dependent link travel time.•Develop an efficient dynamic programming algorithm based on state–space–time networks.•Model pickup and delivery time window constraints using multi-dimensional network flow program.•Synchronize vehic...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Transportation research. Part B: methodological Jg. 89; S. 19 - 42
Hauptverfasser:	Mahmoudi, Monirehalsadat, Zhou, Xuesong
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier Ltd 01.07.2016
Schlagworte:	Algorithms Forward dynamic programming Lagrangian relaxation Mathematical models Optimization Ride-sharing service optimization Route planning Route selection Time-dependent least-cost path problem Transportation networks Vehicle routing problem with pickup and delivery with time windows Vehicles Windows (intervals) USA, Illinois, Chicago Forward dynamic programming Time-dependent least-cost path problem Lagrangian relaxation Ride-sharing service optimization Vehicle routing problem with pickup and delivery with time windows
ISSN:	0191-2615, 1879-2367
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Abstract	•Model vehicle routing with real-world transportation networks and time-dependent link travel time.•Develop an efficient dynamic programming algorithm based on state–space–time networks.•Model pickup and delivery time window constraints using multi-dimensional network flow program.•Synchronize vehicle routing and determine request pricing within Lagrangian relaxation framework. Optimization of on-demand transportation systems and ride-sharing services involves solving a class of complex vehicle routing problems with pickup and delivery with time windows (VRPPDTW). This paper first proposes a new time-discretized multi-commodity network flow model for the VRPPDTW based on the integration of vehicles’ carrying states within space–time transportation networks, so as to allow a joint optimization of passenger-to-vehicle assignment and turn-by-turn routing in congested transportation networks. Our three-dimensional state–space–time network construct is able to comprehensively enumerate possible transportation states at any given time along vehicle space–time paths, and further allows a forward dynamic programming solution algorithm to solve the single vehicle VRPPDTW problem. By utilizing a Lagrangian relaxation approach, the primal multi-vehicle routing problem is decomposed to a sequence of single vehicle routing sub-problems, with Lagrangian multipliers for individual passengers’ requests being updated by sub-gradient-based algorithms. We further discuss a number of search space reduction strategies and test our algorithms, implemented through a specialized program in C++, on medium-scale and large-scale transportation networks, namely the Chicago sketch and Phoenix regional networks. [Display omitted]
AbstractList	Optimization of on-demand transportation systems and ride-sharing services involves solving a class of complex vehicle routing problems with pickup and delivery with time windows (VRPPDTW). This paper first proposes a new time-discretized multi-commodity network flow model for the VRPPDTW based on the integration of vehicles' carrying states within space-time transportation networks, so as to allow a joint optimization of passenger-to-vehicle assignment and turn-by-turn routing in congested transportation networks. Our three-dimensional state-space-time network construct is able to comprehensively enumerate possible transportation states at any given time along vehicle space-time paths, and further allows a forward dynamic programming solution algorithm to solve the single vehicle VRPPDTW problem. By utilizing a Lagrangian relaxation approach, the primal multi-vehicle routing problem is decomposed to a sequence of single vehicle routing sub-problems, with Lagrangian multipliers for individual passengers' requests being updated by sub-gradient-based algorithms. We further discuss a number of search space reduction strategies and test our algorithms, implemented through a specialized program in C++, on medium-scale and large-scale transportation networks, namely the Chicago sketch and Phoenix regional networks. •Model vehicle routing with real-world transportation networks and time-dependent link travel time.•Develop an efficient dynamic programming algorithm based on state–space–time networks.•Model pickup and delivery time window constraints using multi-dimensional network flow program.•Synchronize vehicle routing and determine request pricing within Lagrangian relaxation framework. Optimization of on-demand transportation systems and ride-sharing services involves solving a class of complex vehicle routing problems with pickup and delivery with time windows (VRPPDTW). This paper first proposes a new time-discretized multi-commodity network flow model for the VRPPDTW based on the integration of vehicles’ carrying states within space–time transportation networks, so as to allow a joint optimization of passenger-to-vehicle assignment and turn-by-turn routing in congested transportation networks. Our three-dimensional state–space–time network construct is able to comprehensively enumerate possible transportation states at any given time along vehicle space–time paths, and further allows a forward dynamic programming solution algorithm to solve the single vehicle VRPPDTW problem. By utilizing a Lagrangian relaxation approach, the primal multi-vehicle routing problem is decomposed to a sequence of single vehicle routing sub-problems, with Lagrangian multipliers for individual passengers’ requests being updated by sub-gradient-based algorithms. We further discuss a number of search space reduction strategies and test our algorithms, implemented through a specialized program in C++, on medium-scale and large-scale transportation networks, namely the Chicago sketch and Phoenix regional networks. [Display omitted]
Author	Mahmoudi, Monirehalsadat Zhou, Xuesong
Author_xml	– sequence: 1 givenname: Monirehalsadat surname: Mahmoudi fullname: Mahmoudi, Monirehalsadat email: mmahmoudi@asu.edu – sequence: 2 givenname: Xuesong surname: Zhou fullname: Zhou, Xuesong email: xzhou74@asu.edu
BookMark	eNqNkcFu1DAURS1UJKaFD2DnJZsEO04yMayqigJSJTbdW87zS8fTxA62Z0az6z_wQfwLX4JDWLGoWL1r69yrZ99LcuG8Q0LeclZyxtv3-zKFvqyyLJkoGZMvyIZ3W1lUot1ekA3jkhdVy5tX5DLGPWNM1IxvyM9b64x1D9TPyU56pNGPh2S9i3TwgR5xZ2FEGny-zNQcfD_iRE827ehs4fEwU-0MNTjaI4YzjRiOFjCuRI7ErJzxp_iBXlNzdnqysMQ8BD1NS6Se80nDjvY6oqHe0Zh0wl9PP-KsYZl_Uhymkw-PNOAcMKLLzLLla_Jy0GPEN3_nFbm__XR_86W4-_b56831XQFC8lR0TSMqI6CvjBwEDHyoRVsLDVvoWDVk0TfY14IzqKTQPYi-64Q0bQ2dNkxckXdrbN71-wFjUpONgOOoHfpDVLyrmqZijZD_gbKu5VK2bUa3KwrBxxhwUGDXd6Wg7ag4U0u5aq9yuWopVzGhcrnZyf9xziHXF87Pej6uHsz_dLQYVASLDtDYgJCU8fYZ928x0cdV
CitedBy_id	crossref_primary_10_1016_j_trc_2020_102961 crossref_primary_10_1016_j_tre_2021_102329 crossref_primary_10_1142_S0217595922500464 crossref_primary_10_1016_j_trc_2022_103819 crossref_primary_10_1287_trsc_2018_0832 crossref_primary_10_1016_j_tre_2023_103097 crossref_primary_10_1007_s40864_018_0100_x crossref_primary_10_1080_16258312_2020_1768435 crossref_primary_10_1080_24725854_2023_2291469 crossref_primary_10_1109_TASE_2025_3534143 crossref_primary_10_1155_2020_3271608 crossref_primary_10_1007_s11128_023_04170_3 crossref_primary_10_1016_j_trc_2016_05_020 crossref_primary_10_1016_j_knosys_2021_107412 crossref_primary_10_1016_j_cie_2022_108886 crossref_primary_10_1016_j_tre_2021_102556 crossref_primary_10_3390_math10213969 crossref_primary_10_1016_j_trc_2023_104055 crossref_primary_10_1016_j_tre_2020_102053 crossref_primary_10_1016_j_tre_2024_103936 crossref_primary_10_1080_24725854_2024_2404555 crossref_primary_10_1371_journal_pone_0227702 crossref_primary_10_1016_j_scs_2023_104558 crossref_primary_10_1016_j_trb_2017_11_003 crossref_primary_10_1016_j_trc_2020_102823 crossref_primary_10_1061__ASCE_CO_1943_7862_0001434 crossref_primary_10_1016_j_trb_2016_12_006 crossref_primary_10_1016_j_trb_2016_05_010 crossref_primary_10_1109_TITS_2022_3215926 crossref_primary_10_1016_j_cie_2022_108618 crossref_primary_10_1002_nav_21847 crossref_primary_10_1016_j_multra_2024_100174 crossref_primary_10_1371_journal_pone_0195927 crossref_primary_10_1016_j_trb_2016_05_009 crossref_primary_10_1016_j_cor_2022_105917 crossref_primary_10_1016_j_eswa_2018_03_040 crossref_primary_10_1002_net_22042 crossref_primary_10_1016_j_cie_2022_108749 crossref_primary_10_1109_ACCESS_2025_3556350 crossref_primary_10_1016_j_cie_2022_108509 crossref_primary_10_1016_j_eswa_2020_114242 crossref_primary_10_1016_j_trb_2018_09_015 crossref_primary_10_1016_j_trb_2020_11_006 crossref_primary_10_1016_j_trb_2022_10_011 crossref_primary_10_1016_j_trb_2018_09_014 crossref_primary_10_1287_trsc_2018_0847 crossref_primary_10_3390_math10214164 crossref_primary_10_1109_TAI_2025_3528381 crossref_primary_10_1080_17477778_2018_1515579 crossref_primary_10_1016_j_tre_2025_104032 crossref_primary_10_1080_23249935_2024_2355954 crossref_primary_10_1016_j_knosys_2021_107041 crossref_primary_10_1016_j_aei_2021_101344 crossref_primary_10_1016_j_cie_2022_108835 crossref_primary_10_1109_TITS_2020_3031060 crossref_primary_10_1049_itr2_12136 crossref_primary_10_1007_s40864_016_0038_9 crossref_primary_10_1109_TASE_2022_3175040 crossref_primary_10_1007_s12530_018_9230_3 crossref_primary_10_1155_2022_2917240 crossref_primary_10_1016_j_commtr_2025_100197 crossref_primary_10_1016_j_trb_2020_05_007 crossref_primary_10_1080_23249935_2024_2413655 crossref_primary_10_1016_j_cie_2022_108282 crossref_primary_10_1016_j_eswa_2023_121511 crossref_primary_10_3390_su14042211 crossref_primary_10_1016_j_trb_2019_09_009 crossref_primary_10_1016_j_trc_2017_09_006 crossref_primary_10_1088_1757_899X_1071_1_012025 crossref_primary_10_1016_j_physa_2023_128517 crossref_primary_10_1007_s10732_022_09491_7 crossref_primary_10_1016_j_cie_2023_109517 crossref_primary_10_1155_2020_7160681 crossref_primary_10_1016_j_ejor_2021_06_057 crossref_primary_10_3390_s22208020 crossref_primary_10_1016_j_trc_2017_09_015 crossref_primary_10_1080_00207543_2019_1617449 crossref_primary_10_1108_RIA_12_2024_0270 crossref_primary_10_3390_ijgi10060409 crossref_primary_10_1016_j_trb_2019_09_015 crossref_primary_10_1016_j_sasc_2024_200099 crossref_primary_10_1007_s12469_025_00397_8 crossref_primary_10_1016_j_trb_2018_07_002 crossref_primary_10_1007_s00500_023_09599_3 crossref_primary_10_1016_j_jocs_2017_04_003 crossref_primary_10_1016_j_scs_2024_105611 crossref_primary_10_1016_j_trb_2018_07_006 crossref_primary_10_1109_ACCESS_2020_2978180 crossref_primary_10_1109_TITS_2022_3221332 crossref_primary_10_1016_j_trc_2019_02_005 crossref_primary_10_1155_2021_6619539 crossref_primary_10_1016_j_tre_2020_101891 crossref_primary_10_1080_23249935_2023_2266041 crossref_primary_10_1109_ACCESS_2021_3095371 crossref_primary_10_1016_j_trb_2021_08_008 crossref_primary_10_1016_j_cie_2018_03_015 crossref_primary_10_1016_j_trc_2024_104645 crossref_primary_10_1016_j_trc_2017_09_022 crossref_primary_10_1109_ACCESS_2025_3583106 crossref_primary_10_1016_j_trb_2017_01_002 crossref_primary_10_1016_j_trb_2017_01_001 crossref_primary_10_1016_j_trc_2022_103994 crossref_primary_10_1016_j_trc_2025_105255 crossref_primary_10_1109_TITS_2020_3048520 crossref_primary_10_1109_ACCESS_2020_3023090 crossref_primary_10_1016_j_cie_2024_110029 crossref_primary_10_1177_0361198120974364 crossref_primary_10_1007_s00521_022_07659_7 crossref_primary_10_1016_j_aei_2023_101956 crossref_primary_10_1080_23249935_2023_2214631 crossref_primary_10_3390_jmse11020417 crossref_primary_10_1016_j_trb_2020_06_003 crossref_primary_10_1109_TCYB_2019_2950626 crossref_primary_10_1016_j_tre_2021_102372 crossref_primary_10_1155_2018_6430950 crossref_primary_10_1016_j_trc_2023_104237 crossref_primary_10_1016_j_tre_2018_01_010 crossref_primary_10_1371_journal_pone_0262499 crossref_primary_10_1016_j_trc_2021_103222 crossref_primary_10_1109_TITS_2020_3016387 crossref_primary_10_1080_23249935_2025_2530099 crossref_primary_10_1016_j_knosys_2022_108736 crossref_primary_10_1016_j_trc_2017_01_019 crossref_primary_10_1016_j_trc_2022_103658 crossref_primary_10_1007_s42524_021_0173_1 crossref_primary_10_1016_j_cor_2022_105724 crossref_primary_10_1016_j_trc_2019_01_019 crossref_primary_10_1016_j_trc_2023_104223 crossref_primary_10_1016_j_jmse_2020_09_003 crossref_primary_10_1002_net_21808 crossref_primary_10_1109_LRA_2017_2722541 crossref_primary_10_1016_j_cor_2025_107062 crossref_primary_10_1016_j_compenvurbsys_2018_10_002 crossref_primary_10_1080_23249935_2023_2241570 crossref_primary_10_1049_itr2_12600 crossref_primary_10_1016_j_trb_2016_11_012 crossref_primary_10_1016_j_eswa_2021_114561 crossref_primary_10_1111_mice_12366 crossref_primary_10_1016_j_energy_2017_01_008 crossref_primary_10_1109_ACCESS_2019_2933531 crossref_primary_10_1016_j_eswa_2023_119801 crossref_primary_10_1109_TITS_2020_3009289 crossref_primary_10_1016_j_trc_2016_11_006 crossref_primary_10_1016_j_trc_2018_03_020 crossref_primary_10_3141_2621_09 crossref_primary_10_1016_j_ejor_2023_07_002 crossref_primary_10_1287_trsc_2024_0513 crossref_primary_10_3390_app12094607 crossref_primary_10_1080_19427867_2022_2148368 crossref_primary_10_1109_TITS_2023_3271690 crossref_primary_10_1109_TITS_2024_3486789 crossref_primary_10_1016_j_trb_2017_08_025 crossref_primary_10_1016_j_trc_2021_102986 crossref_primary_10_1016_j_asoc_2021_107528 crossref_primary_10_1111_gean_12277 crossref_primary_10_1016_j_trc_2017_08_022 crossref_primary_10_1016_j_tre_2024_103883 crossref_primary_10_1016_j_trc_2021_103390 crossref_primary_10_1016_j_tre_2019_01_003 crossref_primary_10_3390_jtaer18040091 crossref_primary_10_1109_TITS_2021_3071512 crossref_primary_10_1109_TITS_2024_3416442 crossref_primary_10_1016_j_trb_2021_09_005 crossref_primary_10_1109_TPAMI_2025_3554669 crossref_primary_10_1016_j_trb_2023_03_012 crossref_primary_10_1111_mice_12461 crossref_primary_10_1016_j_trc_2020_102675 crossref_primary_10_1080_23248378_2022_2093280 crossref_primary_10_1016_j_tre_2024_103631 crossref_primary_10_1016_j_trc_2024_104733 crossref_primary_10_1016_j_cor_2020_105035 crossref_primary_10_1016_j_ejor_2020_07_049 crossref_primary_10_1287_trsc_2019_0915 crossref_primary_10_1016_j_rtbm_2025_101434 crossref_primary_10_1007_s40747_021_00272_6 crossref_primary_10_1016_j_asoc_2022_109922 crossref_primary_10_1016_j_rtbm_2025_101318 crossref_primary_10_1287_trsc_2019_0911 crossref_primary_10_1080_19427867_2024_2407184 crossref_primary_10_1002_net_22256 crossref_primary_10_1016_j_asoc_2024_112141 crossref_primary_10_1016_j_cja_2022_09_009 crossref_primary_10_1016_j_jclepro_2020_120590 crossref_primary_10_1016_j_trc_2022_103695 crossref_primary_10_1016_j_ejor_2022_09_023 crossref_primary_10_1016_j_clscn_2021_100022 crossref_primary_10_1016_j_eswa_2021_114804 crossref_primary_10_1016_j_jrtpm_2024_100495 crossref_primary_10_1016_j_tre_2022_102931 crossref_primary_10_1016_j_trb_2017_09_020 crossref_primary_10_1109_TASE_2022_3194082 crossref_primary_10_1016_j_cor_2022_105938 crossref_primary_10_1016_j_trb_2019_02_017 crossref_primary_10_1016_j_cie_2020_106916 crossref_primary_10_1016_j_trf_2020_09_017 crossref_primary_10_1080_00207543_2022_2063085 crossref_primary_10_1016_j_trb_2020_09_010 crossref_primary_10_1016_j_trb_2023_05_012 crossref_primary_10_1016_j_trpro_2017_05_046 crossref_primary_10_1155_2024_1203246 crossref_primary_10_1016_j_swevo_2022_101182 crossref_primary_10_1016_j_tre_2021_102546 crossref_primary_10_1016_j_procs_2017_11_208 crossref_primary_10_1007_s11750_019_00514_4 crossref_primary_10_1016_j_cie_2021_107728 crossref_primary_10_1016_j_tre_2021_102422 crossref_primary_10_1016_j_future_2018_07_020 crossref_primary_10_1016_j_trb_2016_07_015 crossref_primary_10_3390_math13081302 crossref_primary_10_1016_j_trc_2020_02_012 crossref_primary_10_1016_j_tre_2024_103605 crossref_primary_10_1016_j_tre_2024_103847 crossref_primary_10_1109_ACCESS_2020_3017132 crossref_primary_10_1016_j_trc_2023_104081 crossref_primary_10_1016_j_energy_2025_137310 crossref_primary_10_1007_s12008_024_02132_2 crossref_primary_10_3390_ijgi13080275 crossref_primary_10_1155_2022_5052897 crossref_primary_10_1007_s40864_018_0083_7 crossref_primary_10_1016_j_trb_2021_01_004 crossref_primary_10_1016_j_cie_2024_110544 crossref_primary_10_1109_ACCESS_2019_2948154 crossref_primary_10_1177_03611981221093323 crossref_primary_10_1016_j_tre_2020_102118 crossref_primary_10_1155_atr_6302741 crossref_primary_10_1016_j_trc_2020_02_020 crossref_primary_10_1109_ACCESS_2024_3368807 crossref_primary_10_1016_j_trc_2023_104191
Cites_doi	10.1002/1520-6750(198902)36:1<27::AID-NAV3220360103>3.0.CO;2-0 10.1287/inte.22.3.73 10.1287/inte.13.6.4 10.1287/inte.22.3.88 10.1016/j.trb.2013.02.007 10.1080/01966324.1986.10737198 10.1016/j.ejor.2008.05.009 10.1016/j.cor.2011.05.027 10.1007/BF02085656 10.1137/0110015 10.1287/opre.45.3.488 10.1016/j.trb.2003.09.001 10.1002/net.20177 10.1080/03081068608717342 10.1287/trsc.2013.0495 10.1016/j.ejor.2006.02.019 10.1016/0191-2615(86)90020-2 10.1287/trsc.14.2.130 10.1287/trsc.31.1.60 10.1287/opre.1060.0283 10.1016/S0898-1221(97)00090-4 10.1287/trsc.19.4.378 10.1287/inte.21.4.121 10.1080/23311916.2014.961345 10.1287/trsc.1090.0272 10.1007/BF02098288 10.1016/j.trb.2014.11.004 10.1016/S0965-8564(00)00037-9 10.1287/opre.1100.0881 10.1016/j.trb.2003.07.001 10.1016/j.trb.2013.08.012 10.1287/trsc.29.1.63 10.1016/j.trb.2014.09.011 10.1287/mnsc.30.7.844 10.1016/0377-2217(91)90319-Q 10.1016/j.trb.2013.10.012 10.1287/inte.12.4.42 10.1287/opre.43.4.649 10.1016/j.ejor.2010.08.021 10.1287/trsc.17.3.351 10.1287/trsc.33.1.3 10.1287/opre.46.4.474 10.1145/321105.321111 10.1016/j.cor.2011.07.002 10.1111/j.1435-5597.1970.tb01464.x 10.3141/1645-21 10.1002/net.3230110206 10.1287/trsc.1030.0040 10.1287/trsc.19.4.411
ContentType	Journal Article
Copyright	2016 Elsevier Ltd
Copyright_xml	– notice: 2016 Elsevier Ltd
DBID	AAYXX CITATION 7ST C1K SOI 8FD FR3 KR7
DOI	10.1016/j.trb.2016.03.009
DatabaseName	CrossRef Environment Abstracts Environmental Sciences and Pollution Management Environment Abstracts Technology Research Database Engineering Research Database Civil Engineering Abstracts
DatabaseTitle	CrossRef Environment Abstracts Environmental Sciences and Pollution Management Technology Research Database Civil Engineering Abstracts Engineering Research Database
DatabaseTitleList	Technology Research Database Environment Abstracts
DeliveryMethod	fulltext_linktorsrc
Discipline	Economics Engineering
EISSN	1879-2367
EndPage	42
ExternalDocumentID	10_1016_j_trb_2016_03_009 S0191261516301497
GeographicLocations	USA, Illinois, Chicago
GeographicLocations_xml	– name: USA, Illinois, Chicago
GroupedDBID	--K --M -~X .DC .~1 0R~ 123 1B1 1RT 1~. 1~5 29Q 4.4 457 4G. 5VS 7-5 71M 8P~ 9JO AAAKF AAAKG AACTN AAEDT AAEDW AAFJI AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AARIN AAXUO ABDEX ABDMP ABFNM ABLJU ABMAC ABMMH ABPPZ ABUCO ABXDB ABYKQ ACDAQ ACGFS ACNCT ACRLP ADBBV ADEZE ADMUD AEBSH AEKER AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHRSL AIEXJ AIKHN AITUG AJBFU AJOXV AKYCK ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOMHK APLSM ASPBG AVARZ AVWKF AXJTR AZFZN BKOJK BLXMC CS3 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 FDB FEDTE FGOYB FIRID FNPLU FYGXN G-2 G-Q GBLVA HAMUX HMY HVGLF HZ~ H~9 IHE J1W KOM LY1 LY7 M3Y M41 MO0 MS~ N9A O-L O9- OAUVE OHT OZT P-8 P-9 P2P PC. PRBVW Q38 R2- RIG ROL RPZ SDF SDG SDP SDS SES SET SEW SPCBC SSB SSD SSO SSS SSZ T5K WUQ XPP ~G- 9DU AATTM AAXKI AAYWO AAYXX ABWVN ACLOT ACRPL ADNMO AEIPS AFJKZ AGQPQ AIIUN ANKPU APXCP CITATION EFKBS ~HD 7ST C1K SOI 8FD FR3 KR7
ID	FETCH-LOGICAL-c391t-85532d3cb2d9f3cf1f43643ac7c802f3acb5eb4310c293abc3b8839d64c8ad03
ISICitedReferencesCount	256
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000379281900002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0191-2615
IngestDate	Sat Sep 27 21:16:17 EDT 2025 Tue Oct 07 07:51:17 EDT 2025 Tue Nov 18 21:25:19 EST 2025 Sat Nov 29 07:25:52 EST 2025 Fri Feb 23 02:33:21 EST 2024
IsPeerReviewed	true
IsScholarly	true
Keywords	Forward dynamic programming Time-dependent least-cost path problem Lagrangian relaxation Ride-sharing service optimization Vehicle routing problem with pickup and delivery with time windows
Language	English
LinkModel	OpenURL
MergedId	FETCHMERGED-LOGICAL-c391t-85532d3cb2d9f3cf1f43643ac7c802f3acb5eb4310c293abc3b8839d64c8ad03
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 23
PQID	1808619966
PQPubID	23462
PageCount	24
ParticipantIDs	proquest_miscellaneous_1825520539 proquest_miscellaneous_1808619966 crossref_citationtrail_10_1016_j_trb_2016_03_009 crossref_primary_10_1016_j_trb_2016_03_009 elsevier_sciencedirect_doi_10_1016_j_trb_2016_03_009
PublicationCentury	2000
PublicationDate	2016-07-01
PublicationDateYYYYMMDD	2016-07-01
PublicationDate_xml	– month: 07 year: 2016 text: 2016-07-01 day: 01
PublicationDecade	2010
PublicationTitle	Transportation research. Part B: methodological
PublicationYear	2016
Publisher	Elsevier Ltd
Publisher_xml	– name: Elsevier Ltd
References	Miller (bib0035) 1991; 5 Rappoport, Levy, Toussaint, Golden (bib0042) 1994; 50 Rappoport, Levy, Golden, Toussaint (bib0041) 1992; 22 Lu, Dessouky (bib0034) 2004; 38 Wang, Dessouky, Ordonez (bib0055) 2015 Paquette, Cordeau, Laporte, Pascoal (bib0037) 2013; 52 Swersey, Ballard (bib0053) 1983; 30 Azi, Gendreau, Potvin (bib0002) 2007; 178 Hägerstrand (bib0025) 1970; 24 Christiansen (bib0010) 1999; 33 Savelsbergh, Sol (bib0047) 1998; 46 Psaraftis (bib0039) 1983; 17 Solomon, Chalifour, Desrosiers, Boisvert (bib0052) 1992; 22 Wang, Regan (bib0056) 2002; 36 Alfa (bib0001) 1986; 11 Gromicho, van Hoorn, Kok, Schutten (bib0024) 2012; 39 Baldacci, Bartolini, Mingozzi (bib0003) 2011; 59 Ioachim, Desrosiers, Dumas, Solomon, Villeneuve (bib0031) 1995; 29 Jaw, Odoni, Psaraftis, Wilson (bib0032) 1986; 20 Cullen, Jarvis, Ratliff (bib0012) 1981; 11 Zachariadis, Tarantilis, Kiranoudis (bib0058) 2015; 71 Held, Karp (bib0028) 1962; 10 Desrosiers, J., Dumas, Y., Soumis, F., Taillefer, S., and Villeneuve, D. (1991). An algorithm for miniclustering in handicapped transport. Technical Report G-91-22, GERAD, HEC Montréal. Kok, Hans, Schutten (bib0033) 2012; 39 Ziliaskopoulos, Mahmassani (bib0060) 1993; 1408 Häme, Hakula (bib0027) 2015; 49 Sexton, Bodin (bib0049) 1985; 19 Zhou, Taylor (bib0059) 2014; 1 Psaraftis (bib0038) 1980; 14 Bell, Dalberto, Fisher, Greenfield, Jaikumar, Kedia, Mack, Prutzman (bib0004) 1983; 13 Fisher, Jӧrnsten, Madsen (bib0020) 1997; 45 Bodin, Sexton (bib0006) 1986; 22 Psaraftis, Orlin, Bienstock, Thompson (bib0040) 1985 Fisher, Rosenwein (bib0021) 1989; 35 Desrosiers, Dumas, Soumis (bib0014) 1986; 6 Chandra, Menon, Dagum, Kohr, Maydan, McDonald (bib0009) 2000 Hosni, Naoum-Sawaya, Artail (bib0030) 2014; 70 Solanki, Southworth (bib0051) 1991; 21 Mitrovic-Minic, Krishnamurti, Laporte (bib0036) 2004; 38 Bramel, Simchi-Levi (bib0007) 1995; 43 Ruland (bib0045) 1995 Desaulniers, Desrosiers, Erdmann, Solomon, Soumis (bib0013) 2002 Furuhata, Dessouky, Ordóñez, Brunet, Wang, Koenig (bib0022) 2013; 57 Bellman (bib0005) 1962; 9 Gendreau, Guertin, Potvin, Séguin (bib0023) 1998 Yang, Zhou (bib0057) 2014; 59 Chabini (bib0008) 1998; 1645 Häme (bib0026) 2011; 209 Dumas, Desrosiers, Soumis (bib0018) 1991; 54 Dumas, Desrosiers, Soumis (bib0017) 1989 Fisher, Greenfield, Jaikumar, Lester (bib0019) 1982; 12 Diana, Dessouky (bib0016) 2004; 38 Shen, Potvin, Rousseau, Roy (bib0050) 1995; 61 Ropke, Cordeau (bib0044) 2009; 43 Toth, Vigo (bib0054) 1997; 31 Cordeau (bib0011) 2006; 54 Ruland, Rodin (bib0046) 1997; 33 Hernández-Pérez, Salazar-González (bib0029) 2009; 196 Ropke, Cordeau, Laporte (bib0043) 2007; 49 Sexton, Bodin (bib0048) 1985; 19 Psaraftis (10.1016/j.trb.2016.03.009_bib0038) 1980; 14 Chabini (10.1016/j.trb.2016.03.009_bib0008) 1998; 1645 Miller (10.1016/j.trb.2016.03.009_bib0035) 1991; 5 Fisher (10.1016/j.trb.2016.03.009_bib0020) 1997; 45 Lu (10.1016/j.trb.2016.03.009_bib0034) 2004; 38 Desaulniers (10.1016/j.trb.2016.03.009_bib0013) 2002 Paquette (10.1016/j.trb.2016.03.009_bib0037) 2013; 52 Cordeau (10.1016/j.trb.2016.03.009_bib0011) 2006; 54 Zachariadis (10.1016/j.trb.2016.03.009_bib0058) 2015; 71 Wang (10.1016/j.trb.2016.03.009_bib0055) 2015 Rappoport (10.1016/j.trb.2016.03.009_bib0042) 1994; 50 Sexton (10.1016/j.trb.2016.03.009_bib0048) 1985; 19 Diana (10.1016/j.trb.2016.03.009_bib0016) 2004; 38 Hernández-Pérez (10.1016/j.trb.2016.03.009_bib0029) 2009; 196 Solomon (10.1016/j.trb.2016.03.009_bib0052) 1992; 22 Solanki (10.1016/j.trb.2016.03.009_bib0051) 1991; 21 Hägerstrand (10.1016/j.trb.2016.03.009_bib0025) 1970; 24 Bodin (10.1016/j.trb.2016.03.009_bib0006) 1986; 22 Psaraftis (10.1016/j.trb.2016.03.009_bib0040) 1985 Ruland (10.1016/j.trb.2016.03.009_bib0045) 1995 Bellman (10.1016/j.trb.2016.03.009_bib0005) 1962; 9 Ioachim (10.1016/j.trb.2016.03.009_bib0031) 1995; 29 Dumas (10.1016/j.trb.2016.03.009_bib0017) 1989 Christiansen (10.1016/j.trb.2016.03.009_bib0010) 1999; 33 Alfa (10.1016/j.trb.2016.03.009_bib0001) 1986; 11 Jaw (10.1016/j.trb.2016.03.009_bib0032) 1986; 20 Toth (10.1016/j.trb.2016.03.009_bib0054) 1997; 31 Azi (10.1016/j.trb.2016.03.009_bib0002) 2007; 178 Furuhata (10.1016/j.trb.2016.03.009_bib0022) 2013; 57 Desrosiers (10.1016/j.trb.2016.03.009_bib0014) 1986; 6 Bell (10.1016/j.trb.2016.03.009_bib0004) 1983; 13 Ropke (10.1016/j.trb.2016.03.009_bib0043) 2007; 49 Chandra (10.1016/j.trb.2016.03.009_bib0009) 2000 Held (10.1016/j.trb.2016.03.009_bib0028) 1962; 10 Sexton (10.1016/j.trb.2016.03.009_bib0049) 1985; 19 Shen (10.1016/j.trb.2016.03.009_bib0050) 1995; 61 Wang (10.1016/j.trb.2016.03.009_bib0056) 2002; 36 Kok (10.1016/j.trb.2016.03.009_bib0033) 2012; 39 Häme (10.1016/j.trb.2016.03.009_bib0026) 2011; 209 Fisher (10.1016/j.trb.2016.03.009_bib0021) 1989; 35 Savelsbergh (10.1016/j.trb.2016.03.009_bib0047) 1998; 46 Baldacci (10.1016/j.trb.2016.03.009_bib0003) 2011; 59 Dumas (10.1016/j.trb.2016.03.009_bib0018) 1991; 54 Psaraftis (10.1016/j.trb.2016.03.009_bib0039) 1983; 17 Ziliaskopoulos (10.1016/j.trb.2016.03.009_bib0060) 1993; 1408 Häme (10.1016/j.trb.2016.03.009_bib0027) 2015; 49 Cullen (10.1016/j.trb.2016.03.009_bib0012) 1981; 11 Bramel (10.1016/j.trb.2016.03.009_bib0007) 1995; 43 Gendreau (10.1016/j.trb.2016.03.009_bib0023) 1998 Yang (10.1016/j.trb.2016.03.009_bib0057) 2014; 59 Hosni (10.1016/j.trb.2016.03.009_bib0030) 2014; 70 Ruland (10.1016/j.trb.2016.03.009_bib0046) 1997; 33 Swersey (10.1016/j.trb.2016.03.009_bib0053) 1983; 30 Gromicho (10.1016/j.trb.2016.03.009_bib0024) 2012; 39 Ropke (10.1016/j.trb.2016.03.009_bib0044) 2009; 43 Rappoport (10.1016/j.trb.2016.03.009_bib0041) 1992; 22 10.1016/j.trb.2016.03.009_bib0015 Mitrovic-Minic (10.1016/j.trb.2016.03.009_bib0036) 2004; 38 Zhou (10.1016/j.trb.2016.03.009_bib0059) 2014; 1 Fisher (10.1016/j.trb.2016.03.009_bib0019) 1982; 12
References_xml	– volume: 29 start-page: 63 year: 1995 end-page: 78 ident: bib0031 article-title: A request clustering algorithm for door-to-door handicapped transportation publication-title: Transportation Science – volume: 36 start-page: 97 year: 2002 end-page: 112 ident: bib0056 article-title: Local truckload pickup and delivery with hard time window constraints publication-title: Transportation Research Part B: Methodological – volume: 57 start-page: 28 year: 2013 end-page: 46 ident: bib0022 article-title: Ridesharing: The state-of-the-art and future directions publication-title: Transportation Research Part B: Methodological – volume: 50 start-page: 505 year: 1994 end-page: 523 ident: bib0042 article-title: A transportation problem formulation for the MAC airlift planning problem publication-title: Annals of Operations Research – volume: 13 start-page: 4 year: 1983 end-page: 23 ident: bib0004 article-title: Improving the distribution of industrial gases with an on-line computerized routing and scheduling optimizer publication-title: Interfaces – volume: 71 start-page: 158 year: 2015 end-page: 181 ident: bib0058 article-title: The load-dependent vehicle routing problem and its pick-up and delivery extension publication-title: Transportation Research Part B: Methodological – volume: 10 start-page: 196 year: 1962 end-page: 210 ident: bib0028 article-title: A dynamic-programming approach to sequencing problems publication-title: Journal of the Society for Industrial and Applied Mathematics – volume: 35 start-page: 27 year: 1989 end-page: 42 ident: bib0021 article-title: An interactive optimization system for bulk-cargo ship scheduling publication-title: Naval Research Logistic Quarterly – volume: 54 start-page: 7 year: 1991 end-page: 22 ident: bib0018 article-title: The pickup and delivery problem with time windows publication-title: European Journal of Operations Research – volume: 46 start-page: 474 year: 1998 end-page: 490 ident: bib0047 article-title: Drive: Dynamic routing of independent vehicles publication-title: Operations Research – volume: 39 start-page: 910 year: 2012 end-page: 918 ident: bib0033 article-title: Vehicle routing under time-dependent travel times: the impact of congestion avoidance publication-title: Computers and Operations Research – volume: 19 start-page: 378 year: 1985 end-page: 410 ident: bib0048 article-title: Optimizing single vehicle many-to-many operation with desired delivery times: I publication-title: Scheduling. – volume: 22 start-page: 73 year: 1992 end-page: 87 ident: bib0041 article-title: A planning heuristic for military airlift publication-title: Interfaces – year: 2015 ident: bib0055 article-title: A Pickup and delivery problem for ridesharing considering congestion publication-title: Transportation Letters The International Journal of Transportation Research – volume: 45 start-page: 488 year: 1997 end-page: 492 ident: bib0020 article-title: Vehicle routing with time windows: Two optimization algorithms publication-title: Operations Research – year: 1998 ident: bib0023 article-title: Neighborhood search heuristics for a dynamic vehicle dispatching problem with pick-ups and deliveries. Technical Report CRT–98–10, Centre de recherche sur les transports – reference: Desrosiers, J., Dumas, Y., Soumis, F., Taillefer, S., and Villeneuve, D. (1991). An algorithm for miniclustering in handicapped transport. Technical Report G-91-22, GERAD, HEC Montréal. – volume: 20 start-page: 243 year: 1986 end-page: 257 ident: bib0032 article-title: A heuristic algorithm for the multi-vehicle advance-request dial-a-ride problem with time windows publication-title: Transportation Research Part B: Methodological – volume: 43 start-page: 649 year: 1995 end-page: 660 ident: bib0007 article-title: A location based heuristic for general routing problems publication-title: Operations Research – volume: 24 start-page: 7 year: 1970 end-page: 21 ident: bib0025 article-title: What about people in regional science? publication-title: Regional Science Association Papers – volume: 17 start-page: 351 year: 1983 end-page: 357 ident: bib0039 article-title: An exact algorithm for the single-vehicle many-to-many dial-a-ride problem with time windows publication-title: Transportation Science – volume: 31 start-page: 60 year: 1997 end-page: 71 ident: bib0054 article-title: Heuristic algorithms for the handicapped persons transportation problem publication-title: Transportation Science – volume: 209 start-page: 11 year: 2011 end-page: 22 ident: bib0026 article-title: An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows publication-title: European Journal of Operational Research – year: 2000 ident: bib0009 article-title: Parallel Programming in OpenMP – volume: 9 start-page: 61 year: 1962 end-page: 63 ident: bib0005 article-title: Dynamic programming treatment of the traveling salesman problem publication-title: Journal of the Association for Computing Machinery – volume: 22 start-page: 88 year: 1992 end-page: 99 ident: bib0052 article-title: An application of vehicle routing methodology to large-scale larvicide control programs publication-title: Interfaces – volume: 22 start-page: 73 year: 1986 end-page: 86 ident: bib0006 article-title: The multi-vehicle subscriber dial-a-ride problem publication-title: TIMS Studies in the Management Sciences – year: 1995 ident: bib0045 article-title: Polyhedral solution to the pickup and delivery problem – volume: 21 start-page: 121 year: 1991 end-page: 131 ident: bib0051 article-title: An execution planning algorithm for military airlift publication-title: Interfaces – volume: 59 start-page: 414 year: 2011 end-page: 426 ident: bib0003 article-title: An exact algorithm for the pickup and delivery problem with time windows publication-title: Operations Research – volume: 12 start-page: 42 year: 1982 end-page: 52 ident: bib0019 article-title: A computerized vehicle routing application publication-title: Interfaces – volume: 61 start-page: 189 year: 1995 end-page: 211 ident: bib0050 article-title: A computer assistant for vehicle dispatching with learning capabilities publication-title: Annals of Operations Research – volume: 33 start-page: 1 year: 1997 end-page: 13 ident: bib0046 article-title: The pickup and delivery problem: Faces and branch and-cut algorithm publication-title: Computers and Mathematics with Applications – volume: 38 start-page: 539 year: 2004 end-page: 557 ident: bib0016 article-title: A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows publication-title: Transportation Research Part B: Methodological – volume: 70 start-page: 303 year: 2014 end-page: 318 ident: bib0030 article-title: The shared-taxi problem: formulation and solution methods publication-title: Transportation Research Part B: Methodological – volume: 52 start-page: 1 year: 2013 end-page: 16 ident: bib0037 article-title: Combining multicriteria analysis and tabu search for dial-a-ride problems publication-title: Transportation Research Part B: Methodological – volume: 11 start-page: 203 year: 1986 end-page: 212 ident: bib0001 article-title: Scheduling of vehicles for transportation of elderly publication-title: Transportation Planning and Technology – volume: 38 start-page: 503 year: 2004 end-page: 514 ident: bib0034 article-title: An exact algorithm for the multiple vehicle pickup and delivery problem publication-title: Transportation Science – year: 1985 ident: bib0040 article-title: Analysis and solution algorithms of sealift routing and scheduling problems – volume: 11 start-page: 125 year: 1981 end-page: 144 ident: bib0012 article-title: Set partitioning based heuristics for interactive routing publication-title: Networks – volume: 39 start-page: 902 year: 2012 end-page: 909 ident: bib0024 article-title: Restricted dynamic programming: A flexible framework for solving realistic VRPs publication-title: Computers and Operations Research – volume: 19 start-page: 411 year: 1985 end-page: 435 ident: bib0049 article-title: Optimizing single vehicle many-to-many operation with desired delivery times: II publication-title: Routing – volume: 49 start-page: 258 year: 2007 end-page: 272 ident: bib0043 article-title: Models and branch-and-cut algorithms for pickup and delivery problems with time windows publication-title: Networks – volume: 6 start-page: 301 year: 1986 end-page: 325 ident: bib0014 article-title: A dynamic programming solution of the large-scale single-vehicle dial-a-ride problem with time windows publication-title: American Journal of Mathematical and Management Sciences – volume: 38 start-page: 669 year: 2004 end-page: 685 ident: bib0036 article-title: Double-horizon based heuristics for the dynamic pickup and delivery problem with time windows publication-title: Transportation Research Part B: Methodological – volume: 14 start-page: 130 year: 1980 end-page: 154 ident: bib0038 article-title: A dynamic programming approach to the single-vehicle, many-to-many immediate request dial-a-ride problem publication-title: Transportation Science – volume: 33 start-page: 3 year: 1999 end-page: 16 ident: bib0010 article-title: Decomposition of a combined inventory routing and time constrained ship routing problem publication-title: Transportation Science – volume: 30 start-page: 844 year: 1983 end-page: 853 ident: bib0053 article-title: Scheduling school buses publication-title: Management Science – volume: 196 start-page: 987 year: 2009 end-page: 995 ident: bib0029 article-title: The multi-commodity one-to-one pickup-and-delivery traveling salesman problem publication-title: European Journal of Operational Research – volume: 54 start-page: 573 year: 2006 end-page: 586 ident: bib0011 article-title: A branch-and-cut algorithm for the dial-a-ride problem publication-title: Operations Research – start-page: 225 year: 2002 end-page: 242 ident: bib0013 article-title: The VRP with pickup and delivery publication-title: The Vehicle Routing Problem, – volume: 1408 start-page: 94 year: 1993 end-page: 100 ident: bib0060 article-title: Time-dependent, shortest-path algorithm for real-time intelligent vehicle highway system application publication-title: Transportation Research Record – volume: 43 start-page: 267 year: 2009 end-page: 286 ident: bib0044 article-title: Branch and cut and price for the pickup and delivery problem with time windows publication-title: Transportation Science – volume: 178 start-page: 755 year: 2007 end-page: 766 ident: bib0002 article-title: An exact algorithm for a single vehicle routing problem with time windows and multiple routes publication-title: European Journal of Operational Research – volume: 49 start-page: 295 year: 2015 end-page: 310 ident: bib0027 article-title: A maximum cluster algorithm for checking the feasibility of dial-d-ride instances publication-title: Transportation Science – volume: 5 start-page: 287 year: 1991 end-page: 301 ident: bib0035 article-title: Modelling accessibility using space–time prism concepts within geographical information systems publication-title: International Journal of Geographical Systems – volume: 1 year: 2014 ident: bib0059 article-title: DTALite: a queue-based mesoscopic traffic simulator for fast model evaluation and calibration publication-title: Cogent Engineering – volume: 1645 start-page: 170 year: 1998 end-page: 175 ident: bib0008 article-title: Discrete dynamic shortest path problems in transportation applications: Complexity and algorithms with optimal run time publication-title: Transportation Research Record: Journal of the Transportation Research Board – volume: 59 start-page: 22 year: 2014 end-page: 44 ident: bib0057 article-title: Constraint reformulation and a Lagrangian relaxation-based solution algorithm for a least expected time path problem publication-title: Transportation Research Part B: Methodological – year: 1989 ident: bib0017 article-title: Large scale multi-vehicle dial-a-ride problems. Technical Report Cahiers du GERAD G–89–30 – volume: 35 start-page: 27 year: 1989 ident: 10.1016/j.trb.2016.03.009_bib0021 article-title: An interactive optimization system for bulk-cargo ship scheduling publication-title: Naval Research Logistic Quarterly doi: 10.1002/1520-6750(198902)36:1<27::AID-NAV3220360103>3.0.CO;2-0 – volume: 22 start-page: 73 year: 1992 ident: 10.1016/j.trb.2016.03.009_bib0041 article-title: A planning heuristic for military airlift publication-title: Interfaces doi: 10.1287/inte.22.3.73 – volume: 13 start-page: 4 year: 1983 ident: 10.1016/j.trb.2016.03.009_bib0004 article-title: Improving the distribution of industrial gases with an on-line computerized routing and scheduling optimizer publication-title: Interfaces doi: 10.1287/inte.13.6.4 – year: 1989 ident: 10.1016/j.trb.2016.03.009_bib0017 – volume: 22 start-page: 88 year: 1992 ident: 10.1016/j.trb.2016.03.009_bib0052 article-title: An application of vehicle routing methodology to large-scale larvicide control programs publication-title: Interfaces doi: 10.1287/inte.22.3.88 – volume: 1408 start-page: 94 year: 1993 ident: 10.1016/j.trb.2016.03.009_bib0060 article-title: Time-dependent, shortest-path algorithm for real-time intelligent vehicle highway system application publication-title: Transportation Research Record – volume: 52 start-page: 1 year: 2013 ident: 10.1016/j.trb.2016.03.009_bib0037 article-title: Combining multicriteria analysis and tabu search for dial-a-ride problems publication-title: Transportation Research Part B: Methodological doi: 10.1016/j.trb.2013.02.007 – volume: 6 start-page: 301 year: 1986 ident: 10.1016/j.trb.2016.03.009_bib0014 article-title: A dynamic programming solution of the large-scale single-vehicle dial-a-ride problem with time windows publication-title: American Journal of Mathematical and Management Sciences doi: 10.1080/01966324.1986.10737198 – volume: 196 start-page: 987 issue: 3 year: 2009 ident: 10.1016/j.trb.2016.03.009_bib0029 article-title: The multi-commodity one-to-one pickup-and-delivery traveling salesman problem publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2008.05.009 – volume: 39 start-page: 910 issue: 5 year: 2012 ident: 10.1016/j.trb.2016.03.009_bib0033 article-title: Vehicle routing under time-dependent travel times: the impact of congestion avoidance publication-title: Computers and Operations Research doi: 10.1016/j.cor.2011.05.027 – year: 1995 ident: 10.1016/j.trb.2016.03.009_bib0045 – start-page: 225 year: 2002 ident: 10.1016/j.trb.2016.03.009_bib0013 article-title: The VRP with pickup and delivery – volume: 50 start-page: 505 year: 1994 ident: 10.1016/j.trb.2016.03.009_bib0042 article-title: A transportation problem formulation for the MAC airlift planning problem publication-title: Annals of Operations Research doi: 10.1007/BF02085656 – volume: 10 start-page: 196 issue: 1 year: 1962 ident: 10.1016/j.trb.2016.03.009_bib0028 article-title: A dynamic-programming approach to sequencing problems publication-title: Journal of the Society for Industrial and Applied Mathematics doi: 10.1137/0110015 – volume: 45 start-page: 488 year: 1997 ident: 10.1016/j.trb.2016.03.009_bib0020 article-title: Vehicle routing with time windows: Two optimization algorithms publication-title: Operations Research doi: 10.1287/opre.45.3.488 – year: 2000 ident: 10.1016/j.trb.2016.03.009_bib0009 – volume: 38 start-page: 669 year: 2004 ident: 10.1016/j.trb.2016.03.009_bib0036 article-title: Double-horizon based heuristics for the dynamic pickup and delivery problem with time windows publication-title: Transportation Research Part B: Methodological doi: 10.1016/j.trb.2003.09.001 – ident: 10.1016/j.trb.2016.03.009_bib0015 – volume: 49 start-page: 258 issue: 4 year: 2007 ident: 10.1016/j.trb.2016.03.009_bib0043 article-title: Models and branch-and-cut algorithms for pickup and delivery problems with time windows publication-title: Networks doi: 10.1002/net.20177 – volume: 11 start-page: 203 year: 1986 ident: 10.1016/j.trb.2016.03.009_bib0001 article-title: Scheduling of vehicles for transportation of elderly publication-title: Transportation Planning and Technology doi: 10.1080/03081068608717342 – volume: 49 start-page: 295 issue: 2 year: 2015 ident: 10.1016/j.trb.2016.03.009_bib0027 article-title: A maximum cluster algorithm for checking the feasibility of dial-d-ride instances publication-title: Transportation Science doi: 10.1287/trsc.2013.0495 – volume: 178 start-page: 755 issue: 3 year: 2007 ident: 10.1016/j.trb.2016.03.009_bib0002 article-title: An exact algorithm for a single vehicle routing problem with time windows and multiple routes publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2006.02.019 – volume: 20 start-page: 243 year: 1986 ident: 10.1016/j.trb.2016.03.009_bib0032 article-title: A heuristic algorithm for the multi-vehicle advance-request dial-a-ride problem with time windows publication-title: Transportation Research Part B: Methodological doi: 10.1016/0191-2615(86)90020-2 – volume: 22 start-page: 73 year: 1986 ident: 10.1016/j.trb.2016.03.009_bib0006 article-title: The multi-vehicle subscriber dial-a-ride problem publication-title: TIMS Studies in the Management Sciences – volume: 14 start-page: 130 issue: 2 year: 1980 ident: 10.1016/j.trb.2016.03.009_bib0038 article-title: A dynamic programming approach to the single-vehicle, many-to-many immediate request dial-a-ride problem publication-title: Transportation Science doi: 10.1287/trsc.14.2.130 – volume: 31 start-page: 60 year: 1997 ident: 10.1016/j.trb.2016.03.009_bib0054 article-title: Heuristic algorithms for the handicapped persons transportation problem publication-title: Transportation Science doi: 10.1287/trsc.31.1.60 – volume: 54 start-page: 573 issue: 3 year: 2006 ident: 10.1016/j.trb.2016.03.009_bib0011 article-title: A branch-and-cut algorithm for the dial-a-ride problem publication-title: Operations Research doi: 10.1287/opre.1060.0283 – year: 1998 ident: 10.1016/j.trb.2016.03.009_bib0023 – year: 1985 ident: 10.1016/j.trb.2016.03.009_bib0040 – volume: 33 start-page: 1 year: 1997 ident: 10.1016/j.trb.2016.03.009_bib0046 article-title: The pickup and delivery problem: Faces and branch and-cut algorithm publication-title: Computers and Mathematics with Applications doi: 10.1016/S0898-1221(97)00090-4 – volume: 19 start-page: 378 issue: 4 year: 1985 ident: 10.1016/j.trb.2016.03.009_bib0048 article-title: Optimizing single vehicle many-to-many operation with desired delivery times: I publication-title: Scheduling. Transportation Science doi: 10.1287/trsc.19.4.378 – volume: 21 start-page: 121 year: 1991 ident: 10.1016/j.trb.2016.03.009_bib0051 article-title: An execution planning algorithm for military airlift publication-title: Interfaces doi: 10.1287/inte.21.4.121 – volume: 1 issue: 1 year: 2014 ident: 10.1016/j.trb.2016.03.009_bib0059 article-title: DTALite: a queue-based mesoscopic traffic simulator for fast model evaluation and calibration publication-title: Cogent Engineering doi: 10.1080/23311916.2014.961345 – volume: 43 start-page: 267 issue: 3 year: 2009 ident: 10.1016/j.trb.2016.03.009_bib0044 article-title: Branch and cut and price for the pickup and delivery problem with time windows publication-title: Transportation Science doi: 10.1287/trsc.1090.0272 – volume: 61 start-page: 189 year: 1995 ident: 10.1016/j.trb.2016.03.009_bib0050 article-title: A computer assistant for vehicle dispatching with learning capabilities publication-title: Annals of Operations Research doi: 10.1007/BF02098288 – volume: 71 start-page: 158 year: 2015 ident: 10.1016/j.trb.2016.03.009_bib0058 article-title: The load-dependent vehicle routing problem and its pick-up and delivery extension publication-title: Transportation Research Part B: Methodological doi: 10.1016/j.trb.2014.11.004 – volume: 36 start-page: 97 year: 2002 ident: 10.1016/j.trb.2016.03.009_bib0056 article-title: Local truckload pickup and delivery with hard time window constraints publication-title: Transportation Research Part B: Methodological doi: 10.1016/S0965-8564(00)00037-9 – volume: 59 start-page: 414 issue: 2 year: 2011 ident: 10.1016/j.trb.2016.03.009_bib0003 article-title: An exact algorithm for the pickup and delivery problem with time windows publication-title: Operations Research doi: 10.1287/opre.1100.0881 – volume: 38 start-page: 539 year: 2004 ident: 10.1016/j.trb.2016.03.009_bib0016 article-title: A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows publication-title: Transportation Research Part B: Methodological doi: 10.1016/j.trb.2003.07.001 – volume: 57 start-page: 28 year: 2013 ident: 10.1016/j.trb.2016.03.009_bib0022 article-title: Ridesharing: The state-of-the-art and future directions publication-title: Transportation Research Part B: Methodological doi: 10.1016/j.trb.2013.08.012 – volume: 29 start-page: 63 year: 1995 ident: 10.1016/j.trb.2016.03.009_bib0031 article-title: A request clustering algorithm for door-to-door handicapped transportation publication-title: Transportation Science doi: 10.1287/trsc.29.1.63 – volume: 70 start-page: 303 year: 2014 ident: 10.1016/j.trb.2016.03.009_bib0030 article-title: The shared-taxi problem: formulation and solution methods publication-title: Transportation Research Part B: Methodological doi: 10.1016/j.trb.2014.09.011 – volume: 30 start-page: 844 year: 1983 ident: 10.1016/j.trb.2016.03.009_bib0053 article-title: Scheduling school buses publication-title: Management Science doi: 10.1287/mnsc.30.7.844 – volume: 54 start-page: 7 year: 1991 ident: 10.1016/j.trb.2016.03.009_bib0018 article-title: The pickup and delivery problem with time windows publication-title: European Journal of Operations Research doi: 10.1016/0377-2217(91)90319-Q – volume: 5 start-page: 287 issue: 3 year: 1991 ident: 10.1016/j.trb.2016.03.009_bib0035 article-title: Modelling accessibility using space–time prism concepts within geographical information systems publication-title: International Journal of Geographical Systems – year: 2015 ident: 10.1016/j.trb.2016.03.009_bib0055 article-title: A Pickup and delivery problem for ridesharing considering congestion publication-title: Transportation Letters The International Journal of Transportation Research – volume: 59 start-page: 22 year: 2014 ident: 10.1016/j.trb.2016.03.009_bib0057 article-title: Constraint reformulation and a Lagrangian relaxation-based solution algorithm for a least expected time path problem publication-title: Transportation Research Part B: Methodological doi: 10.1016/j.trb.2013.10.012 – volume: 12 start-page: 42 year: 1982 ident: 10.1016/j.trb.2016.03.009_bib0019 article-title: A computerized vehicle routing application publication-title: Interfaces doi: 10.1287/inte.12.4.42 – volume: 43 start-page: 649 year: 1995 ident: 10.1016/j.trb.2016.03.009_bib0007 article-title: A location based heuristic for general routing problems publication-title: Operations Research doi: 10.1287/opre.43.4.649 – volume: 209 start-page: 11 issue: 1 year: 2011 ident: 10.1016/j.trb.2016.03.009_bib0026 article-title: An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2010.08.021 – volume: 17 start-page: 351 issue: 3 year: 1983 ident: 10.1016/j.trb.2016.03.009_bib0039 article-title: An exact algorithm for the single-vehicle many-to-many dial-a-ride problem with time windows publication-title: Transportation Science doi: 10.1287/trsc.17.3.351 – volume: 33 start-page: 3 year: 1999 ident: 10.1016/j.trb.2016.03.009_bib0010 article-title: Decomposition of a combined inventory routing and time constrained ship routing problem publication-title: Transportation Science doi: 10.1287/trsc.33.1.3 – volume: 46 start-page: 474 issue: 4 year: 1998 ident: 10.1016/j.trb.2016.03.009_bib0047 article-title: Drive: Dynamic routing of independent vehicles publication-title: Operations Research doi: 10.1287/opre.46.4.474 – volume: 9 start-page: 61 year: 1962 ident: 10.1016/j.trb.2016.03.009_bib0005 article-title: Dynamic programming treatment of the traveling salesman problem publication-title: Journal of the Association for Computing Machinery doi: 10.1145/321105.321111 – volume: 39 start-page: 902 issue: 5 year: 2012 ident: 10.1016/j.trb.2016.03.009_bib0024 article-title: Restricted dynamic programming: A flexible framework for solving realistic VRPs publication-title: Computers and Operations Research doi: 10.1016/j.cor.2011.07.002 – volume: 24 start-page: 7 year: 1970 ident: 10.1016/j.trb.2016.03.009_bib0025 article-title: What about people in regional science? publication-title: Regional Science Association Papers doi: 10.1111/j.1435-5597.1970.tb01464.x – volume: 1645 start-page: 170 year: 1998 ident: 10.1016/j.trb.2016.03.009_bib0008 article-title: Discrete dynamic shortest path problems in transportation applications: Complexity and algorithms with optimal run time publication-title: Transportation Research Record: Journal of the Transportation Research Board doi: 10.3141/1645-21 – volume: 11 start-page: 125 year: 1981 ident: 10.1016/j.trb.2016.03.009_bib0012 article-title: Set partitioning based heuristics for interactive routing publication-title: Networks doi: 10.1002/net.3230110206 – volume: 38 start-page: 503 issue: 4 year: 2004 ident: 10.1016/j.trb.2016.03.009_bib0034 article-title: An exact algorithm for the multiple vehicle pickup and delivery problem publication-title: Transportation Science doi: 10.1287/trsc.1030.0040 – volume: 19 start-page: 411 issue: 4 year: 1985 ident: 10.1016/j.trb.2016.03.009_bib0049 article-title: Optimizing single vehicle many-to-many operation with desired delivery times: II publication-title: Routing Transportation Science doi: 10.1287/trsc.19.4.411
SSID	ssj0003401
Score	2.6048083
Snippet	•Model vehicle routing with real-world transportation networks and time-dependent link travel time.•Develop an efficient dynamic programming algorithm based on... Optimization of on-demand transportation systems and ride-sharing services involves solving a class of complex vehicle routing problems with pickup and...
SourceID	proquest crossref elsevier
SourceType	Aggregation Database Enrichment Source Index Database Publisher
StartPage	19
SubjectTerms	Algorithms Forward dynamic programming Lagrangian relaxation Mathematical models Optimization Ride-sharing service optimization Route planning Route selection Time-dependent least-cost path problem Transportation networks Vehicle routing problem with pickup and delivery with time windows Vehicles Windows (intervals)
Title	Finding optimal solutions for vehicle routing problem with pickup and delivery services with time windows: A dynamic programming approach based on state–space–time network representations
URI	https://dx.doi.org/10.1016/j.trb.2016.03.009 https://www.proquest.com/docview/1808619966 https://www.proquest.com/docview/1825520539
Volume	89
WOSCitedRecordID	wos000379281900002&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-2367 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0003401 issn: 0191-2615 databaseCode: AIEXJ dateStart: 19950201 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3NjtMwELaqXSTggGABsfzJSJyoskri_HIraFeA0IrDHiouUWwnakubVGlSlhvvwAPxLki8B2N7nFZFW7EHLmmaJq6l-TIzHn8zQ8hLJsEHZ4lwwJ5yJ5CcOzx0C4eVMajGIAcXQJfM_xifnyfjcfppMPhtc2HW87iqksvLdPlfRQ3XQNgqdfYa4u4HhQtwDkKHI4gdjv8k-LOpSVSpQRksVDaI_TfNKFwXE_XAsKm71iSi64YyJh67nIov3VLvJ8hirhgb34YrVCYYsZ0uCjirZP11ZZLapWlpb4leC530iIXKh8pGSrUfYSpkILGCgRYTm296zMrQ0Ye6yKZNiMJI4mzLrOrlgsYslimanIAX3LTDN2o6ph-21eebaPtkUXdS8xaUDmuKCUghl3lP-fk8qTv16xiMZI22HEMhXtTTZvvoaOo5sCQMt9W76VCE-hnVs7H0pqzXXzbEhDNmJ23DFfUvMkVw043BtCSBHTvasxstcW6WwRCZGiJzWabTTA_9OExB-R6O3p-OP_QuAwtcbJxp5m-33zURcWceVzlQO66E9o8u7pI7uLChIwPIe2RQVEfkps17Xx2R21ulL--TnwhTijClPUwpwJQiTCnClCJMqQIhNTClAFNqYUotTM0dClIUYfqajiiClG6BlFqQUg1SWldUg_TX9x8anvCpR0Fg0h1gPiAXZ6cXb9852EzEESz1WicJQ-ZLJrgv05KJ0isDBloqF7FIXL-EEx4WHNxpV4AHnHPBeAKLBxkFIsmlyx6Sg6quikeqykFaRopMFpdpIBOep0UoYdnNE8Fd4ZXHxLUCygQW2lf9XubZlcA4Jq_6R5amysy-mwMr9QzdZOP-ZoDgfY-9sAjJwISofcG8KupulXmJm0QqGyHad48fhj5Y7PTxdeb6hNzavKhPyUHbdMUzckOs2-mqeY6vwR-t2gRs
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=Finding+optimal+solutions+for+vehicle+routing+problem+with+pickup+and+delivery+services+with+time+windows%3A+A+dynamic+programming+approach+based+on+state%E2%80%93space%E2%80%93time+network+representations&rft.jtitle=Transportation+research.+Part+B%3A+methodological&rft.au=Mahmoudi%2C+Monirehalsadat&rft.au=Zhou%2C+Xuesong&rft.date=2016-07-01&rft.issn=0191-2615&rft.volume=89&rft.spage=19&rft.epage=42&rft_id=info:doi/10.1016%2Fj.trb.2016.03.009&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_trb_2016_03_009
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0191-2615&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0191-2615&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0191-2615&client=summon