350
Views
1
CrossRef citations to date
0
Altmetric
Articles

Multi-objective optimization for multi-depot heterogeneous first-mile transportation system considering requests’ preference ranks for pick-up stops

ORCID Icon, &
Article: 2103205 | Received 02 Jul 2020, Accepted 13 Jul 2022, Published online: 27 Jul 2022

References

  • Aarts, Emile, and Jan Karel Lenstra, eds. 1997. Local Search in Combinatorial Optimization. John Wiley & Sons, Ltd. doi:10.2307/j.ctv346t9c.
  • Baidu. “Baidu LBS Open Platform.” http://lbsyun.baidu.com/.
  • Bian, Zheyong, and Xiang Liu. 2017. “Planning the Ridesharing Route for the First-Mile Service Linking to Railway Passenger Transportation.” In Proceedings of the 2017 Joint Rail Conference, 11 pages. Philadelphia, PA, USA: American Society of Mechanical Engineers. doi:10.1115/JRC2017-2251.
  • Bian, Zheyong, and Xiang Liu. 2018. “A Detour-Based Pricing Mechanism for First-Mile Ridesharing in Connection With Rail Public Transit.” In Proceedings of the 2018 Joint Rail Conference, 9 pages. Pittsburgh, PA, USA: American Society of Mechanical Engineers. doi:10.1115/JRC2018-6148.
  • Bian, Zheyong, and Xiang Liu. 2019a. “Mechanism Design for First-Mile Ridesharing Based on Personalized Requirements Part I: Theoretical Analysis in Generalized Scenarios.” Transportation Research Part B: Methodological 120: 147–171. doi:10.1016/j.trb.2018.12.009.
  • Bian, Zheyong, and Xiang Liu. 2019b. “Mechanism Design for First-Mile Ridesharing Based on Personalized Requirements Part II: Solution Algorithm for Large-Scale Problems.” Transportation Research Part B: Methodological 120: 172–192. doi:10.1016/j.trb.2018.12.014.
  • Bian, Zheyong, Xiang Liu, and Yun Bai. 2020. “Mechanism Design for On-Demand First-Mile Ridesharing.” Transportation Research Part B: Methodological 138: 77–117. doi:10.1016/j.trb.2020.03.011.
  • Chen, Yiwei, and Hai Wang. 2018. “Pricing for a Last-Mile Transportation System.” Transportation Research Part B: Methodological 107: 57–69. doi:10.1016/j.trb.2017.11.008.
  • Chen, Shukai, Hua Wang, and Qiang Meng. 2020. “Solving the First-mile Ridesharing Problem Using Autonomous Vehicles.” Computer-Aided Civil and Infrastructure Engineering 35 (1): 45–60. doi:10.1111/mice.12461.
  • Cheng, Shih Fen, Duc Thien Nguyen, and Hoong Chuin Lau. 2014. “Mechanisms for Arranging Ride Sharing and Fare Splitting for Last-Mile Travel Demands.” In AAMAS ‘14: Proceedings of the 2014 International Conference on Autonomous Agents and Multi-Agent Systems, 1505–1506. doi:10.5555/2615731.2616034.
  • Chidambara, Chidambara. 2016. “NMT as Green Mobility Solution for First/Last Mile Connectivity to Mass Transit Stations for Delhi.” International Journal of Built Environment and Sustainability 3 (3): 176–183. doi:10.11113/ijbes.v3.n3.141.
  • Cordeau, Jean-François, and Gilbert Laporte. 2003. “The Dial-a-Ride Problem (DARP): Variants, Modeling Issues and Algorithms.” 4OR 1: 89–101. doi:10.1007/s10288-002-0009-8.
  • Cordeau, Jean-François, and Gilbert Laporte. 2007. “The Dial-a-Ride Problem: Models and Algorithms.” Annals of Operations Research 153 (June): 29–46. doi:10.1007/s10479-007-0170-8.
  • Deb, Kalyanmoy, Amrit Pratap, Sameer Agarwal, and T. Meyarivan. 2002. “A Fast and Elitist Multiobjective Genetic Algorithm: NSGA-II.” IEEE Transactions on Evolutionary Computation 6 (2): 182–197. doi:10.1109/4235.996017.
  • Dou, Xueping, Qiang Meng, and Kai Liu. 2021. “Customized Bus Service Design for Uncertain Commuting Travel Demand.” Transportmetrica A: Transport Science 17 (4): 1405–1430. doi:10.1080/23249935.2020.1864509.
  • Errico, Fausto, Teodor Gabriel Crainic, Federico Malucelli, and Maddalena Nonato. 2013. “A Survey on Planning Semi-Flexible Transit Systems: Methodological Issues and a Unifying Framework.” Transportation Research Part C: Emerging Technologies 36: 324–338. doi:10.1016/j.trc.2013.08.010.
  • Fonseca, Carlos M., and Peter J. Fleming. 1995. “Multiobjective Genetic Algorithms Made Easy: Selection Sharing and Mating Restriction.” In 1st International Conference on Genetic Algorithms in Engineering Systems: Innovations and Applications (GALESIA), 1995:45–52. Sheffield, UK: IET. doi:10.1049/cp:19951023.
  • Fonseca, C. M., and P. J. Fleming. 1998. “Multiobjective Optimization and Multiple Constraint Handling with Evolutionary Algorithms-Part II: Application Example.” IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans 28 (1): 26–37. doi:10.1109/3468.650319.
  • Gharib, Mehrdad, Seyyed Mohammad Taghi Fatemi Ghomi, and Fariborz Jolai. 2021. “A Multi-Objective Stochastic Programming Model for Post-Disaster Management.” Transportmetrica A: Transport Science. doi:10.1080/23249935.2021.1928790.
  • Guangzhou Statistics Bureau. 2020. Guangzhou Statistical Yearbook 2020 (in Chinese). Guangzhou: China Statistics Press.
  • Guo, Rongge, Wei Guan, Wenyi Zhang, Fanting Meng, and Zixian Zhang. 2019. “Customized Bus Routing Problem with Time Window Restrictions: Model and Case Study.” Transportmetrica A: Transport Science 15 (2): 1804–1824. doi:10.1080/23249935.2019.1644566.
  • Haas, Inbal, and Shlomo Bekhor. 2017. “Network Design Problem Considering System Time Minimization and Road Safety Maximization: Formulation and Solution Approaches.” Transportmetrica A: Transport Science 13 (9): 829–851. doi:10.1080/23249935.2017.1345998.
  • Hansen, P., and N. Mladenović. 1997. “Variable Neighbourhood Search for the P-Median.” Location Science 5 (4): 207–226. doi:10.1016/S0966-8349(98)00030-8.
  • Hansen, Pierre, and Nenad Mladenović. 2001. “Variable Neighbourhood Search: Principles and Applications.” European Journal of Operational Research 130 (3): 449–467. doi:10.1016/S0377-2217(00)00100-4.
  • Ho, Sin C., W. Y. Szeto, Yong-Hong Kuo, Janny M.Y. Leung, Matthew Petering, and Terence W.H. Tou. 2018. “A Survey of Dial-a-Ride Problems: Literature Review and Recent Developments.” Transportation Research Part B: Methodological 111: 395–421. doi:10.1016/j.trb.2018.02.001.
  • Jabir, E., Vinay V. Panicker, and R. Sridharan. 2017. “Design and Development of a Hybrid Ant Colony-Variable Neighbourhood Search Algorithm for a Multi-Depot Green Vehicle Routing Problem.” Transportation Research Part D: Transport and Environment 57: 422–457. doi:10.1016/j.trd.2017.09.003.
  • Jiang, Guiyuan, Siew-Kei Lam, Fangxin Ning, Peilan He, and Jidong Xie. 2020. “Peak-Hour Vehicle Routing for First-Mile Transportation: Problem Formulation and Algorithms.” IEEE Transactions on Intelligent Transportation Systems 21 (8): 3308–3321. doi:10.1109/TITS.2019.2926065.
  • Jin, Wenzhou, Peng Li, and Weitiao Wu. 2019. “Time-of-Day Interval Partition Method for Bus Schedule Based on Multi-Source Data and Fleet-Time Cost Optimization.” China Journal of Highway and Transport 32 (2): 143–154.
  • Liu, Tao, and Avishai (Avi) Ceder. 2015. “Analysis of a New Public-Transport-Service Concept: Customized Bus in China.” Transport Policy 39: 63–76. doi:10.1016/j.tranpol.2015.02.004.
  • Liu, Zhili, Xudong Jia, and Wen Cheng. 2012. “Solving the Last Mile Problem: Ensure the Success of Public Bicycle System in Beijing.” Procedia - Social and Behavioral Sciences 43: 73–78. doi:10.1016/j.sbspro.2012.04.079.
  • Lyu, Guodong, Wang Chi Cheung, Chung-Piaw Teo, and Hai Wang. 2019. “Multi-Objective Online Ride-Matching.” Available at SSRN. doi:10.2139/ssrn.3356823.
  • Ma, Ziyi, Matthew Urbanek, Maria Alejandra Pardo, Joseph Y.J. Chow, and Xuebo Lai. 2017. “Spatial Welfare Effects of Shared Taxi Operating Policies for First Mile Airport Access.” International Journal of Transportation Science and Technology 6 (4): 301–315. doi:10.1016/j.ijtst.2017.07.001.
  • Mallus, Matteo, Giuseppe Colistra, Luigi Atzori, Maurizio Murroni, and Virginia Pilloni. 2017. “Dynamic Carpooling in Urban Areas: Design and Experimentation with a Multi-Objective Route Matching Algorithm.” Sustainability 9 (2): 254. doi:10.3390/su9020254.
  • Masri, Hela, Saoussen Krichen, and Adel Guitouni. 2019. “Metaheuristics for Solving the Biobjective Single-Path Multicommodity Communication Flow Problem.” International Transactions in Operational Research 26 (2): 589–614. doi:10.1111/itor.12378.
  • Mavrotas, George. 2009. “Effective Implementation of the ε-Constraint Method in Multi-Objective Mathematical Programming Problems.” Applied Mathematics and Computation 213 (2): 455–465. doi:10.1016/j.amc.2009.03.037.
  • National Academies of Sciences, Engineering, and Medicine. 2004. Operational Experiences with Flexible Transit Services. Washington, D.C.: The National Academies Press. doi:10.17226/23364.
  • National Academies of Sciences, Engineering, and Medicine. 2013. Transit Capacity and Quality of Service Manual, Third Edition. Edited by Parsons Brinckerhoff. Washington, D.C.: Transportation Research Board. doi:10.17226/24766.
  • National Academies of Sciences, Engineering, and Medicine. 2019. Microtransit or General Public Demand Response Transit Services: State of the Practice. Edited by Boca Raton. Microtransit or General Public Demand Response Transit Services: State of the Practice. Washington, D.C.: The National Academies Press. doi:10.17226/25414.
  • Psychas, Iraklis Dimitrios, Eleni Delimpasi, and Yannis Marinakis. 2015. “Hybrid Evolutionary Algorithms for the Multiobjective Traveling Salesman Problem.” Expert Systems with Applications 42 (22): 8956–8970. doi:10.1016/j.eswa.2015.07.051.
  • Psychas, Iraklis-Dimitrios, Magdalene Marinaki, and Yannis Marinakis. 2015. “A Parallel Multi-Start NSGA II Algorithm for Multiobjective Energy Reduction Vehicle Routing Problem.” In Evolutionary Multi-Criterion Optimization. EMO 2015. Lecture Notes in Computer Science, edited by A. Gaspar-Cunha, C. Henggeler Antunes, and C. Coello, 336–350. Guimarães, Portugal: Springer, Cham. doi:10.1007/978-3-319-15934-8_23.
  • Psychas, Iraklis-Dimitrios, Magdalene Marinaki, Yannis Marinakis, and Athanasios Migdalas. 2014. “Minimizing the Fuel Consumption of a Multiobjective Vehicle Routing Problem Using the Parallel Multi-Start NSGA II Algorithm.” In NET 2014: Models, Algorithms and Technologies for Network Analysis, edited by Valery A. Kalyagin, Petr A. Koldanov, and Panos M. Pardalos, 69–88. Nizhny Novgorod, Russia: Springer International Publishing. doi:10.1007/978-3-319-29608-1_5.
  • Psychas, Iraklis-Dimitrios, Magdalene Marinaki, Yannis Marinakis, and Athanasios Migdalas. 2017. “Non-Dominated Sorting Differential Evolution Algorithm for the Minimization of Route Based Fuel Consumption Multiobjective Vehicle Routing Problems.” Energy Systems 8: 785–814. doi:10.1007/s12667-016-0209-5.
  • Shao, Saijun, Su Xiu Xu, and George Q. Huang. 2020. “Variable Neighborhood Search and Tabu Search for Auction-Based Waste Collection Synchronization.” Transportation Research Part B: Methodological 133: 1–20. doi:10.1016/j.trb.2019.12.004.
  • Shen, Yu, Hongmou Zhang, and Jinhua Zhao. 2018. “Integrating Shared Autonomous Vehicle in Public Transportation System: A Supply-Side Simulation of the First-Mile Service in Singapore.” Transportation Research Part A: Policy and Practice 113: 125–136. doi:10.1016/j.tra.2018.04.004.
  • Stein, David M. 1978. “Scheduling Dial-a-Ride Transportation Systems.” Transportation Science 12 (3): 232–249.
  • Toth, Paolo, and Daniele Vigo. 2002. The Vehicle Routing Problem. Edited by Paolo Toth and Daniele Vigo. Society for Industrial and Applied Mathematics. doi:10.1137/1.9780898718515.
  • Vanneschi, Leonardo, Roberto Henriques, and Mauro Castelli. 2017. “Multi-Objective Genetic Algorithm with Variable Neighbourhood Search for the Electoral Redistricting Problem.” Swarm and Evolutionary Computation 36: 37–51. doi:10.1016/j.swevo.2017.04.003.
  • Vansteenwegen, Pieter, Lissa Melis, Dilay Aktaş, Bryan David Galarza Montenegro, Fábio Sartori Vieira, and Kenneth Sörensen. 2022. “A Survey on Demand-Responsive Public Bus Systems.” Transportation Research Part C: Emerging Technologies 137: 103573. doi:10.1016/j.trc.2022.103573.
  • Veldhuizen, David A. van. 1999. “Multiobjective Evolutionary Algorithms: Classifications, Analyses, and New Innovations.” Air Force Institute of Technology. doi:10.5555/929368.
  • Wang, Hai. 2019. “Routing and Scheduling for a Last-Mile Transportation System.” Transportation Science 53 (1): 131–147. doi:10.1287/trsc.2017.0753.
  • Wang, Chao, Changxi Ma, and Xuecai(Daniel) Xu. 2020. “Multi-Objective Optimization of Real-Time Customized Bus Routes Based on Two-Stage Method.” Physica A: Statistical Mechanics and Its Applications 537: 122774. doi:10.1016/j.physa.2019.122774.
  • Wang, Hai, and Amedeo Odoni. 2016. “Approximating the Performance of a ‘Last Mile’ Transportation System.” Transportation Science 50 (2): 659–675. doi:10.1287/trsc.2014.0553.
  • Wu, Weitiao, Ronghui Liu, and Wenzhou Jin. 2017. “Modelling Bus Bunching and Holding Control with Vehicle Overtaking and Distributed Passenger Boarding Behaviour.” Transportation Research Part B: Methodological 104: 175–197. doi:10.1016/j.trb.2017.06.019.
  • Wu, Weitiao, Ronghui Liu, Wenzhou Jin, and Changxi Ma. 2019a. “Simulation-based Robust Optimization of Limited-stop Bus Service with Vehicle Overtaking and Dynamics: A Response Surface Methodology.” Transportation Research Part E: Logistics and Transportation Review 130: 61–81. doi: 10.1016/j.tre.2019.08.012.
  • Wu, Weitiao, Ronghui Liu, Wenzhou Jin, and Changxi Ma. 2019b. “Stochastic Bus Schedule Coordination Considering Demand Assignment and Rerouting of Passengers.” Transportation Research Part B: Methodological 121: 275–303. doi:10.1016/j.trb.2019.01.010.
  • Zitzler, Eckart. 1999. “Evolutionary Algorithms for Multiobjective Optimization: Methods and Applications.” Swiss Federal Institute of Technology (ETH).
  • Zitzler, Eckart, Kalyanmoy Deb, and Lothar Thiele. 2000. “Comparison of Multiobjective Evolutionary Algorithms: Empirical Results.” Evolutionary Computation 8 (2): 173–195. doi:10.1162/106365600568202.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.