IDEAS home Printed from https://ideas.repec.org/a/taf/transp/v39y2016i6p574-585.html
   My bibliography  Save this article

Optimal solution to the vehicle routing problem by adopting a meta-heuristic algorithm

Author

Listed:
  • Seung Hyun Kim
  • Sang Hoon Bae

Abstract

The delivery service provided by large-scale retailers continues to grow as online sales occupy an increasingly large share of the market. This study aims to tease out efficient vehicle scheduling times as well as optimal delivery routes by applying meta-heuristic algorithms. Monthly data on existing routes were obtained from a branch of Korea’s leading large-scale online retailer. The first task was to examine the status of existing routes by comparing delivery routes created using Dijkstra’s algorithm with existing delivery routes and their vehicle scheduling. The second task was to identify optimal delivery routes through a comparative analysis of the genetic algorithm and Tabu search algorithm, known for its superior applicability amongst other meta-heuristic algorithms. These findings demonstrate that the optimal vehicle routing problem not only has the potential to reduce distribution costs for operators and expedite delivery for consumers, but also the added social benefit of reduced carbon emissions.

Suggested Citation

  • Seung Hyun Kim & Sang Hoon Bae, 2016. "Optimal solution to the vehicle routing problem by adopting a meta-heuristic algorithm," Transportation Planning and Technology, Taylor & Francis Journals, vol. 39(6), pages 574-585, August.
    • Handle: RePEc:taf:transp:v:39:y:2016:i:6:p:574-585
    DOI: 10.1080/03081060.2016.1187808
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/03081060.2016.1187808
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/03081060.2016.1187808?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. Yu, Mingzhu & Qi, Xiangtong, 2014. "A vehicle routing problem with multiple overlapped batches," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 61(C), pages 40-55.
    2. Wei Yu & Zhaohui Liu, 2014. "Vehicle routing problems with regular objective functions on a path," Naval Research Logistics (NRL), John Wiley & Sons, vol. 61(1), pages 34-43, February.
    3. G. B. Dantzig & J. H. Ramser, 1959. "The Truck Dispatching Problem," Management Science, INFORMS, vol. 6(1), pages 80-91, October.
    4. Zachariadis, Emmanouil E. & Tarantilis, Christos D. & Kiranoudis, Christos T., 2009. "A Guided Tabu Search for the Vehicle Routing Problem with two-dimensional loading constraints," European Journal of Operational Research, Elsevier, vol. 195(3), pages 729-743, June.
    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. Majsa Ammouriova & Massimo Bertolini & Juliana Castaneda & Angel A. Juan & Mattia Neroni, 2022. "A Heuristic-Based Simulation for an Education Process to Learn about Optimization Applications in Logistics and Transportation," Mathematics, MDPI, vol. 10(5), pages 1-18, March.
    2. Marques, Alexandra & Soares, Ricardo & Santos, Maria João & Amorim, Pedro, 2020. "Integrated planning of inbound and outbound logistics with a Rich Vehicle Routing Problem with backhauls," Omega, Elsevier, vol. 92(C).
    3. Dingding Qi & Yingjun Zhao & Zhengjun Wang & Wei Wang & Li Pi & Longyue Li, 2024. "Joint Approach for Vehicle Routing Problems Based on Genetic Algorithm and Graph Convolutional Network," Mathematics, MDPI, vol. 12(19), pages 1-18, October.
    4. Wei, Lijun & Zhang, Zhenzhen & Zhang, Defu & Leung, Stephen C.H., 2018. "A simulated annealing algorithm for the capacitated vehicle routing problem with two-dimensional loading constraints," European Journal of Operational Research, Elsevier, vol. 265(3), pages 843-859.
    5. Lai, David S.W. & Caliskan Demirag, Ozgun & Leung, Janny M.Y., 2016. "A tabu search heuristic for the heterogeneous vehicle routing problem on a multigraph," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 86(C), pages 32-52.
    6. Leung, Stephen C.H. & Zhang, Zhenzhen & Zhang, Defu & Hua, Xian & Lim, Ming K., 2013. "A meta-heuristic algorithm for heterogeneous fleet vehicle routing problems with two-dimensional loading constraints," European Journal of Operational Research, Elsevier, vol. 225(2), pages 199-210.
    7. Manuel Iori & Silvano Martello, 2010. "Routing problems with loading constraints," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 18(1), pages 4-27, July.
    8. Curtin, Kevin M. & Biba, Steve, 2011. "The Transit Route Arc-Node Service Maximization problem," European Journal of Operational Research, Elsevier, vol. 208(1), pages 46-56, January.
    9. Koç, Çağrı & Bektaş, Tolga & Jabali, Ola & Laporte, Gilbert, 2016. "Thirty years of heterogeneous vehicle routing," European Journal of Operational Research, Elsevier, vol. 249(1), pages 1-21.
    10. Jumbo, Olga & Moghaddass, Ramin, 2022. "Resource optimization and image processing for vegetation management programs in power distribution networks," Applied Energy, Elsevier, vol. 319(C).
    11. 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.
    12. Schmid, Verena & Doerner, Karl F. & Laporte, Gilbert, 2013. "Rich routing problems arising in supply chain management," European Journal of Operational Research, Elsevier, vol. 224(3), pages 435-448.
    13. Tianlu Zhao & Yongjian Yang & En Wang, 2020. "Minimizing the average arriving distance in carpooling," International Journal of Distributed Sensor Networks, , vol. 16(1), pages 15501477198, January.
    14. A. Mor & M. G. Speranza, 2020. "Vehicle routing problems over time: a survey," 4OR, Springer, vol. 18(2), pages 129-149, June.
    15. Chou, Chang-Chi & Chiang, Wen-Chu & Chen, Albert Y., 2022. "Emergency medical response in mass casualty incidents considering the traffic congestions in proximity on-site and hospital delays," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 158(C).
    16. Pradhananga, Rojee & Taniguchi, Eiichi & Yamada, Tadashi & Qureshi, Ali Gul, 2014. "Bi-objective decision support system for routing and scheduling of hazardous materials," Socio-Economic Planning Sciences, Elsevier, vol. 48(2), pages 135-148.
    17. Qi, Mingyao & Lin, Wei-Hua & Li, Nan & Miao, Lixin, 2012. "A spatiotemporal partitioning approach for large-scale vehicle routing problems with time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(1), pages 248-257.
    18. Srinivas, Sharan & Ramachandiran, Surya & Rajendran, Suchithra, 2022. "Autonomous robot-driven deliveries: A review of recent developments and future directions," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 165(C).
    19. Tibor Holczinger & Olivér Ősz & Máté Hegyháti, 2020. "Scheduling approach for on-site jobs of service providers," Flexible Services and Manufacturing Journal, Springer, vol. 32(4), pages 913-948, December.
    20. Zhiping Zuo & Yanhui Li & Jing Fu & Jianlin Wu, 2019. "Human Resource Scheduling Model and Algorithm with Time Windows and Multi-Skill Constraints," Mathematics, MDPI, vol. 7(7), pages 1-18, July.

    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:taf:transp:v:39:y:2016:i:6:p:574-585. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/GTPT20 .

    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.