IDEAS home Printed from https://ideas.repec.org/a/eee/jomega/v108y2022ics0305048321001961.html
   My bibliography  Save this article

A multi-objective open vehicle routing problem with overbooking: Exact and heuristic solution approaches for an employee transportation problem

Author

Listed:
  • Dasdemir, Erdi
  • Testik, Murat Caner
  • Öztürk, Diclehan Tezcaner
  • Şakar, Ceren Tuncer
  • Güleryüz, Güldal
  • Testik, Özlem Müge

Abstract

We address a bus routing problem, where individuals need to be gathered from spatially distributed pickup points and transported to a workplace. The problem is modeled as an open vehicle routing problem. Overbooking is allowed because the total seat capacity of the buses is limited. The problem is treated as a multi-objective optimization problem, where the total distance traveled by the buses and the total number of straphangers in the buses are minimized. We develop a mixed integer programming (MIP) model and employ the ε-constraint method to generate the Pareto-optimal frontier. Due to the high computational requirements of the exact model, two heuristic approaches are developed: a heuristic algorithm that is based on a cluster-first and route-second algorithm and a multi-objective evolutionary algorithm. We also develop another MIP model that provides an alternative bound to evaluate the quality of the heuristics’ solutions. Experiments on a small and a moderate-sized problem show that the heuristics are fast and approximate the optimal solutions well. The heuristic approaches are then used to solve the actual problem having 103 pickup points, 50 buses and 1986 individuals. A set of approximate solutions whose total transportation distances are at most 14% worse than the best lower bounds are obtained.

Suggested Citation

  • Dasdemir, Erdi & Testik, Murat Caner & Öztürk, Diclehan Tezcaner & Şakar, Ceren Tuncer & Güleryüz, Güldal & Testik, Özlem Müge, 2022. "A multi-objective open vehicle routing problem with overbooking: Exact and heuristic solution approaches for an employee transportation problem," Omega, Elsevier, vol. 108(C).
    • Handle: RePEc:eee:jomega:v:108:y:2022:i:c:s0305048321001961
    DOI: 10.1016/j.omega.2021.102587
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0305048321001961
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.omega.2021.102587?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Park, Junhyuk & Tae, Hyunchul & Kim, Byung-In, 2012. "A post-improvement procedure for the mixed load school bus routing problem," European Journal of Operational Research, Elsevier, vol. 217(1), pages 204-213.
    2. D Sariklis & S Powell, 2000. "A heuristic method for the open vehicle routing problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 51(5), pages 564-573, May.
    3. R. D. Angel & W. L. Caudle & R. Noonan & A. Whinston, 1972. "Computer-Assisted School Bus Scheduling," Management Science, INFORMS, vol. 18(6), pages 279-288, February.
    4. N. Norouzi & R. Tavakkoli-Moghaddam & M. Ghazanfari & M. Alinaghian & A. Salamatbakhsh, 2012. "A New Multi-objective Competitive Open Vehicle Routing Problem Solved by Particle Swarm Optimization," Networks and Spatial Economics, Springer, vol. 12(4), pages 609-633, December.
    5. Xiaopan Chen & Yunfeng Kong & Lanxue Dang & Yane Hou & Xinyue Ye, 2015. "Exact and Metaheuristic Approaches for a Bi-Objective School Bus Scheduling Problem," PLOS ONE, Public Library of Science, vol. 10(7), pages 1-20, July.
    6. T Bektaş & Seda Elmastaş, 2007. "Solving school bus routing problems through integer programming," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(12), pages 1599-1604, December.
    7. Gilbert Laporte, 2009. "Fifty Years of Vehicle Routing," Transportation Science, INFORMS, vol. 43(4), pages 408-416, November.
    8. López-Sánchez, A.D. & Hernández-Díaz, A.G. & Vigo, D. & Caballero, R. & Molina, J., 2014. "A multi-start algorithm for a balanced real-world Open Vehicle Routing Problem," European Journal of Operational Research, Elsevier, vol. 238(1), pages 104-113.
    9. Arthur J. Swersey & Wilson Ballard, 1984. "Scheduling School Buses," Management Science, INFORMS, vol. 30(7), pages 844-853, July.
    10. A N Letchford & J Lysgaard & R W Eglese, 2007. "A branch-and-cut algorithm for the capacitated open vehicle routing problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(12), pages 1642-1651, December.
    11. Laporte, Gilbert, 1992. "The vehicle routing problem: An overview of exact and approximate algorithms," European Journal of Operational Research, Elsevier, vol. 59(3), pages 345-358, June.
    12. Hernan Caceres & Rajan Batta & Qing He, 2017. "School Bus Routing with Stochastic Demand and Duration Constraints," Transportation Science, INFORMS, vol. 51(4), pages 1349-1364, November.
    13. Ezquerro Eguizábal, Sara & Moura Berodia, José Luis & Ibeas Portilla, Ángel & Benavente Ponce, Juan, 2018. "Optimization model for school transportation design based on economic and social efficiency," Transport Policy, Elsevier, vol. 67(C), pages 93-101.
    14. Schittekat, Patrick & Kinable, Joris & Sörensen, Kenneth & Sevaux, Marc & Spieksma, Frits & Springael, Johan, 2013. "A metaheuristic for the school bus routing problem with bus stop selection," European Journal of Operational Research, Elsevier, vol. 229(2), pages 518-528.
    15. Z Fu & R Eglese & L Y O Li, 2005. "A new tabu search heuristic for the open vehicle routing problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(3), pages 267-274, March.
    16. Joaquín Pacheco & Rafael Caballero & Manuel Laguna & Julián Molina, 2013. "Bi-Objective Bus Routing: An Application to School Buses in Rural Areas," Transportation Science, INFORMS, vol. 47(3), pages 397-411, August.
    17. Park, Junhyuk & Kim, Byung-In, 2010. "The school bus routing problem: A review," European Journal of Operational Research, Elsevier, vol. 202(2), pages 311-319, April.
    18. Bowerman, Robert & Hall, Brent & Calamai, Paul, 1995. "A multi-objective optimization approach to urban school bus routing: Formulation and solution method," Transportation Research Part A: Policy and Practice, Elsevier, vol. 29(2), pages 107-123, March.
    19. Fleszar, Krzysztof & Osman, Ibrahim H. & Hindi, Khalil S., 2009. "A variable neighbourhood search algorithm for the open vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 195(3), pages 803-809, June.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Herminia I. Calvete & Carmen Galé & José A. Iranzo, 2022. "Approaching the Pareto Front in a Biobjective Bus Route Design Problem Dealing with Routing Cost and Individuals’ Walking Distance by Using a Novel Evolutionary Algorithm," Mathematics, MDPI, vol. 10(9), pages 1-17, April.
    2. Qiuping Ni & Yuanxiang Tang, 2023. "A Bibliometric Visualized Analysis and Classification of Vehicle Routing Problem Research," Sustainability, MDPI, vol. 15(9), pages 1-37, April.
    3. Zandieh, Fatemeh & Ghannadpour, Seyed Farid, 2023. "A comprehensive risk assessment view on interval type-2 fuzzy controller for a time-dependent HazMat routing problem," European Journal of Operational Research, Elsevier, vol. 305(2), pages 685-707.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Ellegood, William A. & Solomon, Stanislaus & North, Jeremy & Campbell, James F., 2020. "School bus routing problem: Contemporary trends and research directions," Omega, Elsevier, vol. 95(C).
    2. Shafahi, Ali & Wang, Zhongxiang & Haghani, Ali, 2018. "SpeedRoute: Fast, efficient solutions for school bus routing problems," Transportation Research Part B: Methodological, Elsevier, vol. 117(PA), pages 473-493.
    3. Kuo, Yong-Hong & Leung, Janny M.Y. & Yan, Yimo, 2023. "Public transport for smart cities: Recent innovations and future challenges," European Journal of Operational Research, Elsevier, vol. 306(3), pages 1001-1026.
    4. Hernan Caceres & Rajan Batta & Qing He, 2017. "School Bus Routing with Stochastic Demand and Duration Constraints," Transportation Science, INFORMS, vol. 51(4), pages 1349-1364, November.
    5. Wang, Zhongxiang & Haghani, Ali, 2020. "Column generation-based stochastic school bell time and bus scheduling optimization," European Journal of Operational Research, Elsevier, vol. 286(3), pages 1087-1102.
    6. Park, Junhyuk & Kim, Byung-In, 2010. "The school bus routing problem: A review," European Journal of Operational Research, Elsevier, vol. 202(2), pages 311-319, April.
    7. Ansari, Azadeh & Farrokhvar, Leily & Kamali, Behrooz, 2021. "Integrated student to school assignment and school bus routing problem for special needs students," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 152(C).
    8. Xiaopan Chen & Yunfeng Kong & Lanxue Dang & Yane Hou & Xinyue Ye, 2015. "Exact and Metaheuristic Approaches for a Bi-Objective School Bus Scheduling Problem," PLOS ONE, Public Library of Science, vol. 10(7), pages 1-20, July.
    9. Atefi, Reza & Salari, Majid & C. Coelho, Leandro & Renaud, Jacques, 2018. "The open vehicle routing problem with decoupling points," European Journal of Operational Research, Elsevier, vol. 265(1), pages 316-327.
    10. Shichao Sun & Zhengyu Duan & Qi Xu, 2018. "School bus routing problem in the stochastic and time-dependent transportation network," PLOS ONE, Public Library of Science, vol. 13(8), pages 1-17, August.
    11. Brandão, José, 2020. "A memory-based iterated local search algorithm for the multi-depot open vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 284(2), pages 559-571.
    12. Ezquerro Eguizábal, Sara & Moura Berodia, José Luis & Ibeas Portilla, Ángel & Benavente Ponce, Juan, 2018. "Optimization model for school transportation design based on economic and social efficiency," Transport Policy, Elsevier, vol. 67(C), pages 93-101.
    13. Banerjee, Dipayan & Smilowitz, Karen, 2019. "Incorporating equity into the school bus scheduling problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 131(C), pages 228-246.
    14. Liwei Zeng & Sunil Chopra & Karen Smilowitz, 2019. "The Covering Path Problem on a Grid," Transportation Science, INFORMS, vol. 53(6), pages 1656-1672, November.
    15. Fátima M. Souza Lima & Davi S. D. Pereira & Samuel V. Conceição & Ricardo S. Camargo, 2017. "A multi-objective capacitated rural school bus routing problem with heterogeneous fleet and mixed loads," 4OR, Springer, vol. 15(4), pages 359-386, December.
    16. Huasheng Liu & Yuqi Zhao & Jin Li & Yu Li & Xiaowen Li & Sha Yang, 2022. "A Two-Phase, Joint-Commuting Model for Primary and Secondary Schools Considering Parking Sharing," IJERPH, MDPI, vol. 19(11), pages 1-25, May.
    17. Agyeman, Stephen & Cheng, Lin, 2020. "Analysis of barriers to perceived service quality in Ghana: Students’ perspectives on bus mobility attributes," Transport Policy, Elsevier, vol. 99(C), pages 63-85.
    18. Liu, Ran & Jiang, Zhibin, 2012. "The close–open mixed vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 220(2), pages 349-360.
    19. Herminia I. Calvete & Carmen Galé & José A. Iranzo, 2022. "Approaching the Pareto Front in a Biobjective Bus Route Design Problem Dealing with Routing Cost and Individuals’ Walking Distance by Using a Novel Evolutionary Algorithm," Mathematics, MDPI, vol. 10(9), pages 1-17, April.
    20. Herminia I. Calvete & Carmen Galé & José A. Iranzo & Paolo Toth, 2020. "A Partial Allocation Local Search Matheuristic for Solving the School Bus Routing Problem with Bus Stop Selection," Mathematics, MDPI, vol. 8(8), pages 1-20, July.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:jomega:v:108:y:2022:i:c:s0305048321001961. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/375/description#description .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.