IDEAS home Printed from https://ideas.repec.org/a/wly/transj/v56y2017i2p140-166.html

Evaluating the Impact of Spatio‐Temporal Factors on Construction Heuristics for Transportation Services

Author

Listed:
  • Adnan Noor Mian
  • Amina Fahim
  • Abdul Hameed

Abstract

In the dial‐a‐ride services, customers specify pickup and drop‐off locations and their times for transport. The operator aims at constructing cheap itineraries while minimizing customer inconvenience. This problem has been studied as the Dial‐a‐Ride Problem (DARP), which consists of both spatial and temporal factors. This article studies the impact of spatial and temporal variation on multivehicle DARP using route construction heuristics. Our work highlights the impact of these variations on the customer disutility and transportation cost. The study will help the service operators in selecting an appropriate construction heuristic while expanding the DARP service in terms of service area, service duration, or planning for a sudden growth in the number of customers. The results show that if the operator is planning to expand the area of service, the Saving Heuristic is more appropriate for larger operators while Insertion Heuristic with spatial sorting scheme is better for smaller operators with limited number of vehicles. If the operator is expanding the service in terms of service duration, from 8 to 24 hours daily, for instance, or preparing for a growth in the number of customers, the Saving Heuristic is better for both smaller and larger service operators.

Suggested Citation

  • Adnan Noor Mian & Amina Fahim & Abdul Hameed, 2017. "Evaluating the Impact of Spatio‐Temporal Factors on Construction Heuristics for Transportation Services," Transportation Journal, John Wiley & Sons, vol. 56(2), pages 140-166, April.
  • Handle: RePEc:wly:transj:v:56:y:2017:i:2:p:140-166
    DOI: 10.5325/transportationj.56.2.0140
    as

    Download full text from publisher

    File URL: https://doi.org/10.5325/transportationj.56.2.0140
    Download Restriction: no

    File URL: https://libkey.io/10.5325/transportationj.56.2.0140?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
    ---><---

    References listed on IDEAS

    as
    1. Coslovich, Luca & Pesenti, Raffaele & Ukovich, Walter, 2006. "A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem," European Journal of Operational Research, Elsevier, vol. 175(3), pages 1605-1615, December.
    2. Marius M. Solomon, 1987. "Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints," Operations Research, INFORMS, vol. 35(2), pages 254-265, April.
    Full references (including those not matched with items on IDEAS)

    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. Mohammad Torkjazi & Nathan Huynh, 2019. "Effectiveness of Dynamic Insertion Scheduling Strategy for Demand-Responsive Paratransit Vehicles Using Agent-Based Simulation," Sustainability, MDPI, vol. 11(19), pages 1-12, September.
    2. Zhang, Jian & Woensel, Tom Van, 2023. "Dynamic vehicle routing with random requests: A literature review," International Journal of Production Economics, Elsevier, vol. 256(C).
    3. Stefan Vonolfen & Michael Affenzeller, 2016. "Distribution of waiting time for dynamic pickup and delivery problems," Annals of Operations Research, Springer, vol. 236(2), pages 359-382, January.
    4. van Lon, Rinde R.S. & Ferrante, Eliseo & Turgut, Ali E. & Wenseleers, Tom & Vanden Berghe, Greet & Holvoet, Tom, 2016. "Measures of dynamism and urgency in logistics," European Journal of Operational Research, Elsevier, vol. 253(3), pages 614-624.
    5. Stefan Vonolfen & Michael Affenzeller, 2016. "Distribution of waiting time for dynamic pickup and delivery problems," Annals of Operations Research, Springer, vol. 236(2), pages 359-382, January.
    6. Hua, Shijia & Zeng, Wenjia & Liu, Xinglu & Qi, Mingyao, 2022. "Optimality-guaranteed algorithms on the dynamic shared-taxi problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 164(C).
    7. Débora P. Ronconi & João L. V. Manguino, 2025. "GRASP and VNS approaches for a vehicle routing problem with step cost functions," Annals of Operations Research, Springer, vol. 350(1), pages 37-62, July.
    8. Yi-Kuei Lin & Cheng-Fu Huang & Yi-Chieh Liao, 2019. "Reliability of a stochastic intermodal logistics network under spoilage and time considerations," Annals of Operations Research, Springer, vol. 277(1), pages 95-118, June.
    9. Filippo Focacci & Andrea Lodi & Michela Milano, 2002. "A Hybrid Exact Algorithm for the TSPTW," INFORMS Journal on Computing, INFORMS, vol. 14(4), pages 403-417, November.
    10. Zhang, Ying & Qi, Mingyao & Miao, Lixin & Liu, Erchao, 2014. "Hybrid metaheuristic solutions to inventory location routing problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 70(C), pages 305-323.
    11. Nicolas Rincon-Garcia & Ben J. Waterson & Tom J. Cherrett, 2018. "Requirements from vehicle routing software: perspectives from literature, developers and the freight industry," Transport Reviews, Taylor & Francis Journals, vol. 38(1), pages 117-138, January.
    12. Lu, Quan & Dessouky, Maged M., 2006. "A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows," European Journal of Operational Research, Elsevier, vol. 175(2), pages 672-687, December.
    13. Babagolzadeh, Mahla & Zhang, Yahua & Abbasi, Babak & Shrestha, Anup & Zhang, Anming, 2022. "Promoting Australian regional airports with subsidy schemes: Optimised downstream logistics using vehicle routing problem," Transport Policy, Elsevier, vol. 128(C), pages 38-51.
    14. Yiling Li & Zhiwen Yang & Si Zhang & Wenting Liu, 2024. "A Study of the Capacitated Vehicle Routing Problem with Time-Window and Three-Dimensional Loading Constraints in Land–Sea Transport," Sustainability, MDPI, vol. 16(23), pages 1-26, November.
    15. Sébastien Mouthuy & Florence Massen & Yves Deville & Pascal Van Hentenryck, 2015. "A Multistage Very Large-Scale Neighborhood Search for the Vehicle Routing Problem with Soft Time Windows," Transportation Science, INFORMS, vol. 49(2), pages 223-238, May.
    16. Tingxin Wen & Haoting Meng, 2025. "Time-Dependent Multi-Center Semi-Open Heterogeneous Fleet Path Optimization and Charging Strategy," Mathematics, MDPI, vol. 13(7), pages 1-27, March.
    17. Shangyao Yan & Chun-Ying Chen & Chuan-Che Wu, 2012. "Solution methods for the taxi pooling problem," Transportation, Springer, vol. 39(3), pages 723-748, May.
    18. Long Wang & Jiongzhi Zheng & Zhengda Xiong & Kun He, 2026. "Multi-armed Bandit and Backbone boost Lin-Kernighan-Helsgaun Algorithm for the Traveling Salesman Problem and its Variants," Journal of Heuristics, Springer, vol. 32(1), pages 1-32, March.
    19. Chen, Shijie & Rahman, Md Hishamur & Marković, Nikola & Siddiqui, Muhammad Imran Younus & Mohebbi, Matthew & Sun, Yanshuo, 2024. "Schedule negotiation with ADA paratransit riders under value of time uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 184(C).
    20. Wu, Yuehui & Fang, Hui & Qureshi, Ali Gul & Yamada, Tadashi, 2025. "Capacitated hub location routing problem with time windows and stochastic demands for the design of intra-city express systems," European Journal of Operational Research, Elsevier, vol. 326(2), pages 255-269.

    More about this item

    Statistics

    Access and download statistics

    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:wly:transj:v:56:y:2017:i:2:p:140-166. 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: Wiley Content Delivery (email available below). General contact details of provider: .

    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.