| Citation: | CHEN Kejia, FANG Yunfei, LUO Jiayi. A Programming Model for the Flexible Multi-depot Heterogeneous Dial-a-ride Problems[J]. Journal of Transport Information and Safety, 2021, 39(3): 103-110. doi: 10.3963/j.jssn.1674-4861.2021.03.013
|
| [1] |
DAGANZO C F, OUYANG Y. A general model of demand-responsive transportation services: From taxi to ridesharing to dial-a-ride[J]. Transportation Research Part B: Methodological, 2019(126): 213-224. http://ideas.repec.org/a/eee/transb/v126y2019icp213-224.html
|
| [2] |
CÉLIA P, CRAMA Y, PIRONET T. Recovery management for a dial-a-ride system with real-time disruptions[J]. European Journal of Operational Research, 2020, 280(3): 953-969. doi: 10.1016/j.ejor.2019.08.006
|
| [3] |
HO S C, SZETO W Y, KUO Y H, et al. A survey of dial-a-ride problems: Literature review and recent developments[J]. Transportation Research Part B: Methodological, 2018(111): 395-421. http://www.sciencedirect.com/science/article/pii/S0191261517304484
|
| [4] |
孙博, 杨春风, 魏明, 等. 基于集对分析的随机需求接驳公交调度模型[J]. 交通信息与安全, 2018, 36(6): 130-134. doi: 10.3963/j.issn.1674-4861.2018.06.017
SUN Bo, YANG Chunfeng, WEI Ming, et al. A scheduling model of shuttle buses for stochastic demand passengers based on set pair analysis[J]. Journal of Transport Information and Safety, 2018, 36(6): 130-134. (in Chinese). doi: 10.3963/j.issn.1674-4861.2018.06.017
|
| [5] |
孙继洋, 黄建玲, 陈艳艳, 等. 响应动态需求的灵活型公交路径优化调度模型[J]. 北京工业大学学报, 2021, 47(3): 269-279. https://www.cnki.com.cn/Article/CJFDTOTAL-BJGD202103009.htm
SUN Jiyang, HUANG Jianling, CHEN Yanyan, et al. Flexible bus route optimal scheduling model in response to dynamic demand[J]. Journal of Beijing University of Technology, 2021, 47(3): 269-279. (in Chinese). https://www.cnki.com.cn/Article/CJFDTOTAL-BJGD202103009.htm
|
| [6] |
PARRAGH S N, DOERNER K F, HARTL R F. Variable neighborhood search for the dial-a-ride problem[J]. Computers & Operations Research, 2010, 37(6): 1129-1138. http://www.sciencedirect.com/science/article/pii/S030505480900241X
|
| [7] |
HÄME L. An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows[J]. European Journal of Operational Research, 2011, 209(1): 11-22. doi: 10.1016/j.ejor.2010.08.021
|
| [8] |
PARRAGH S N, SCHMID V. Hybrid column generation and large neighborhood search for the dial-a-ride problem[J]. Computers & Operations Research, 2013, 40(1): 490-497. http://www.sciencedirect.com/science/article/pii/S0305054812001694
|
| [9] |
MUELAS S, LATORRE A, PEÑA J M. A distributed VNS algorithm for optimizing dial-a-ride problems in large-scale scenarios[J]. Transportation Research Part C: Emerging Technologies, 2015(54): 110-130. http://www.sciencedirect.com/science/article/pii/S0968090X15000790
|
| [10] |
RITZINGER U, PUCHINGER J, HARTL R F. Dynamic programming based metaheuristics for the dial-a-ride problem[J]. Annals of Operations Research, 2016, 236(2): 341-358. doi: 10.1007/s10479-014-1605-7
|
| [11] |
TRIPATHY T, NAGAVARAPU S C, AZIZIAN K, et al. Solving dial-a-ride problems using multiple ant colony system with fleet size minimisation[C]. 17th Annual UK Workshop on Computational Intelligence: Advances in Computational Intelligence Systems, Cardiff, UK: UKCI, 2017.
|
| [12] |
MASMOUDI M A, BRAEKERS K, MASMOUDI M, et al. A hybrid genetic algorithm for the heterogeneous dial-a-ride problem[J]. Computers & Operations Research, 2017, 81(C): 1-13. doi: 10.1016/j.cor.2016.12.008
|
| [13] |
CORDEAU J F. A branch-and-cut algorithm for the dial-a-ride problem[J]. Operations Research, 2006, 54(3): 573-586. doi: 10.1287/opre.1060.0283
|
| [14] |
ROPKES, LAPORTEG, CORDEAUJ F. Models andbranch-andcut algorithms for pickup and delivery problems with time windows[J]. Networks: An International Journal, 2007, 49(4): 258-272. doi: 10.5555/1276833.1276836
|
| [15] |
LIU M, LUO Z, LIM A. A branch-and-cut algorithm for a realistic dial-a-ride problem[J]. Transportation Research Part B: Methodological, 2015, 81(1): 267-288.
|
| [16] |
WONG K I, BELL M G H. Solution of the dial-a-ride problem with multi-dimensional capacity constraints[J]. International Transactions in Operational Research, 2006, 13(3): 195-208. doi: 10.1111/j.1475-3995.2006.00544.x
|
| [17] |
PARRAGH S N. Introducing heterogeneous users and vehicles into models and algorithms for the dial-a-ride problem[J]. Transportation Research Part C: Emerging Technologies, 2011, 19(5): 912-930. doi: 10.1016/j.trc.2010.06.002
|
| [18] |
PARRAGH S N, CORDEAU J F, DOERNER K F, et al. Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints[J]. OR Spectrum, 2012, 34(3): 593-633. doi: 10.1007/s00291-010-0229-9
|
| [19] |
BRAEKERS K, CARIS A, JANSSENS G K. Exact and meta-heuristic approach for a general heterogeneous dial-a-ride problem with multiple depots[J]. Transportation Research Part B: Methodological, 2014(67): 166-186. http://www.sciencedirect.com/science/article/pii/S0191261514000800
|
| [20] |
BRAEKERS K, KOVACS A A. A multi-period dial-a-ride problem with driver consistency[J]. Transportation Research Part B: Methodological, 2016(94): 355-377. http://www.sciencedirect.com/science/article/pii/s0191261515301570
|
| [21] |
MOLENBRUCH Y, BRAEKERS K, AN C, et al. Multi-directional local search for a bi-objective dial-a-ride problem in patient transportation[J]. Computers & Operations Research, 2017, 77(C): 58-71. http://www.sciencedirect.com/science/article/pii/S0305054816301861
|
| [22] |
KEK A G H, CHEU R L, MENG Q, Distance-constrained capacitated vehicle routing problems with flexible assignment of start and end depots[J]. Mathematical and Computer Modelling, 2008(47): 140-152.
|
| [23] |
MARKOV I, VARONE S, BIERLAIRE M. Integrating a heterogeneous fixed fleet and a flexible assignment of destination depots in the waste collection VRP with intermediate facilities[J]. Transportation Research Part B: Methodological, 2016(84): 256-273.
|
Figures(1) / Tables(4)
DownLoad: