IDEAS home Printed from https://ideas.repec.org/a/taf/uiiexx/v48y2016i10p975-992.html
   My bibliography  Save this article

An improved multi-directional local search algorithm for the multi-objective consistent vehicle routing problem

Author

Listed:
  • Kunlei Lian
  • Ashlea Bennett Milburn
  • Ronald L. Rardin

Abstract

This article presents a multi-objective variant of the Consistent Vehicle Routing Problem (MoConVRP). Instead of modeling consistency considerations such as driver consistency and time consistency as constraints as in the majority of the ConVRP literature, they are included as objectives. Furthermore, instead of formulating a single weighted objective that relies on specifying relative priorities among objectives, an approach to approximate the Pareto frontier is developed. Specifically, an improved version of multi-directional local search (MDLS) is developed. The updated algorithm, IMDLS, makes use of large neighborhood search to find solutions that are improved according to at least one objective to add to the set of nondominated solutions at each iteration. The performance of IMDLS is compared with MDLS and five other multi-objective algorithms on a set of ConVRP test instances from the literature. The computational study validates the competitive performance of IMDLS. Furthermore, results of the computational study suggest that pursuing the best compromise solution among all three objectives may increase travel costs by about 5% while improving driver and time consistency by approximately 60% and over 75% on average, when compared with a compromise solution having lowest overall travel distance. Supplementary materials are available for this article. Go to the publishe's online edition of IIE Transactions for datasets, additional tables, detailed proofs, etc.

Suggested Citation

  • Kunlei Lian & Ashlea Bennett Milburn & Ronald L. Rardin, 2016. "An improved multi-directional local search algorithm for the multi-objective consistent vehicle routing problem," IISE Transactions, Taylor & Francis Journals, vol. 48(10), pages 975-992, October.
    • Handle: RePEc:taf:uiiexx:v:48:y:2016:i:10:p:975-992
    DOI: 10.1080/0740817X.2016.1167288
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/0740817X.2016.1167288
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/0740817X.2016.1167288?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.

    Citations

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


    Cited by:

    1. Mohsen Emadikhiav & David Bergman & Robert Day, 2020. "Consistent Routing and Scheduling with Simultaneous Pickups and Deliveries," Production and Operations Management, Production and Operations Management Society, vol. 29(8), pages 1937-1955, August.
    2. Braekers, Kris & Kovacs, Attila A., 2016. "A multi-period dial-a-ride problem with driver consistency," Transportation Research Part B: Methodological, Elsevier, vol. 94(C), pages 355-377.
    3. Guozhen Xiong & Chi Zhang & Fei Zhou, 2017. "A robust reliability redundancy allocation problem under abnormal external failures guided by a new importance measure," Journal of Risk and Reliability, , vol. 231(2), pages 180-199, April.
    4. Cui, Weiwei & Yang, Yiran & Di, Lei, 2023. "Modeling and optimization for static-dynamic routing of a vehicle with additive manufacturing equipment," International Journal of Production Economics, Elsevier, vol. 257(C).
    5. Martins, Sara & Ostermeier, Manuel & Amorim, Pedro & Hübner, Alexander & Almada-Lobo, Bernardo, 2019. "Product-oriented time window assignment for a multi-compartment vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 276(3), pages 893-909.
    6. Eskandarpour, Majid & Ouelhadj, Djamila & Hatami, Sara & Juan, Angel A. & Khosravi, Banafsheh, 2019. "Enhanced multi-directional local search for the bi-objective heterogeneous vehicle routing problem with multiple driving ranges," European Journal of Operational Research, Elsevier, vol. 277(2), pages 479-491.
    7. Stavropoulou, F. & Repoussis, P.P. & Tarantilis, C.D., 2019. "The Vehicle Routing Problem with Profits and consistency constraints," European Journal of Operational Research, Elsevier, vol. 274(1), pages 340-356.
    8. Daniel Y. Mo & H. Y. Lam & Weikun Xu & G. T. S. Ho, 2020. "Design of Flexible Vehicle Scheduling Systems for Sustainable Paratransit Services," Sustainability, MDPI, vol. 12(14), pages 1-18, July.
    9. Zajac, Sandra & Huber, Sandra, 2021. "Objectives and methods in multi-objective routing problems: a survey and classification scheme," European Journal of Operational Research, Elsevier, vol. 290(1), pages 1-25.
    10. Ulmer, Marlin & Nowak, Maciek & Mattfeld, Dirk & Kaminski, Bogumił, 2020. "Binary driver-customer familiarity in service routing," European Journal of Operational Research, Elsevier, vol. 286(2), pages 477-493.
    11. Yang, Meng & Ni, Yaodong & Song, Qinyu, 2022. "Optimizing driver consistency in the vehicle routing problem under uncertain environment," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 164(C).
    12. Majid Eskandarpour & Pierre Dejax & Olivier Péton, 2019. "Multi-Directional Local Search for Sustainable Supply Chain Network Design," Post-Print hal-02407741, HAL.
    13. Dominik Goeke & Roberto Roberti & Michael Schneider, 2019. "Exact and Heuristic Solution of the Consistent Vehicle-Routing Problem," Transportation Science, INFORMS, vol. 53(4), pages 1023-1042, July.
    14. Kilinc, Mehmet Serdar & Milburn, Ashlea Bennett & Heier Stamm, Jessica L., 2017. "Measuring potential spatial accessibility of home healthcare services," Socio-Economic Planning Sciences, Elsevier, vol. 59(C), pages 13-25.

    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:uiiexx:v:48:y:2016:i:10:p:975-992. 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.

    We have no bibliographic references for this item. You can help adding them by using 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/uiie .

    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.