skip to main content
10.1145/3264746.3264782acmconferencesArticle/Chapter ViewAbstractPublication PagesracsConference Proceedingsconference-collections
research-article

Optimization of vehicle routing problem with fatigue driving based on genetic algorithm

Published: 09 October 2018 Publication History

Abstract

In order to better solve the logistics distribution problems and improve customer satisfaction, aiming at minimizing total cost, the author adds a variable that restricts drivers' fatigue driving in the model, and builds a model of route optimization based on heterogeneous vehicles, so as to design a single-parent genetic algorithm for this model, and validates the algorithm by the delivery case of Japan Takkyubin Corporation. The numerical results of the example show that the logistics distribution route optimization scheme based on the single-parent genetic algorithm can meet the customer's cargo and time requirements, and can reduce vehicle use costs, save early or late penalty costs, and improve the company's economic interests. This study provides new solution ideas for improving delivery issues.

References

[1]
Baker E K. Technical note-an exact algorithm for the time-constrained traveling salesman problem {J}, Operations Research, 1983, 31(5): 938--945.
[2]
Solomon M M. Algorithms for the vehicle routing and scheduling problems with time window constraints {J}, Operations research, 1987, 35(2): 254--265.
[3]
AWJ Kolen, Kan AHG Rinnooy and HWIM Trienekens. Vehicle Routing with Time Windows {J}, Operations Research, 1987(35): 266--273.
[4]
Desrochers M, Desrosiers J, Solomon M. A new optimization algorithm for the vehicle routing problem with time windows {J}, Operations research, 1992, 40(2):342--354.
[5]
Kohl N, Madsen O B G. An optimization algorithm for the vehicle routing problem with time windows based on lagrangian relaxation {J}, Operations Research, 1997, 45(31): 395--406.
[6]
Hong SC, Park YB. A heuristic for bi-objective vehicle routing with time window constraints {J}, International Journal of Production Economics. 1999, 62(3):249--58.
[7]
Favarett D, Moretti E, Pellegrini P. Ant colony system for a VRP with multiple time window and multiple visitors {J}, Journal of Interdisciplinary Mathematics, 2007, 10(2):263--284.
[8]
Ceschina S, Di Gaspero L, Schaerf A. Tabu search techniques for the heterogeneous vehicle routing problem with time windows and carrier-dependent costs {J}, Journal of Scheduling, 2011, 14(6):601--615.
[9]
Lei HT, Laporte G. Guo B. The capacitated vehicle routing problem with stochastic demands and time windows {J}, Computers & Operations Research. 2011, 38(12):1775--83.
[10]
Belhaiza S, Hansen P; Laporte G A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows {J}, Computers & Operations Research. 2014, 52: 269--81.

Cited By

View all
  • (2022)Interactive planning of revisiting-free itinerary for signed-for deliveryInternational Journal of Data Science and Analytics10.1007/s41060-022-00333-014:4(439-456)Online publication date: 26-May-2022
  • (2019)Optimal Delivery Routing in Road Network With Occupancy Detection2019 20th IEEE International Conference on Mobile Data Management (MDM)10.1109/MDM.2019.00122(575-580)Online publication date: Jun-2019

Index Terms

  1. Optimization of vehicle routing problem with fatigue driving based on genetic algorithm

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    RACS '18: Proceedings of the 2018 Conference on Research in Adaptive and Convergent Systems
    October 2018
    355 pages
    ISBN:9781450358859
    DOI:10.1145/3264746
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Sponsors

    In-Cooperation

    • KISM: Korean Institute of Smart Media

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 09 October 2018

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. distribution routing
    2. fatigue driving
    3. heterogeneous vehicle
    4. single parent genetic algorithm
    5. time window

    Qualifiers

    • Research-article

    Conference

    RACS '18
    Sponsor:

    Acceptance Rates

    Overall Acceptance Rate 393 of 1,581 submissions, 25%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)9
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 07 Mar 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2022)Interactive planning of revisiting-free itinerary for signed-for deliveryInternational Journal of Data Science and Analytics10.1007/s41060-022-00333-014:4(439-456)Online publication date: 26-May-2022
    • (2019)Optimal Delivery Routing in Road Network With Occupancy Detection2019 20th IEEE International Conference on Mobile Data Management (MDM)10.1109/MDM.2019.00122(575-580)Online publication date: Jun-2019

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media