IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v314y2024i3p1215-1219.html
   My bibliography  Save this article

A note on “A unified solution framework for multi-attribute vehicle routing problems”

Author

Listed:
  • Garaix, Thierry
  • Skiredj, Mohammed

Abstract

In this note, the authors propose correcting one erroneous formula from [Vidal, T., Crainic, T. G., Gendreau, M., & Prins, C. (2014). A unified solution framework for multi-attribute vehicle routing problems. European Journal of Operational Research, 234(3), 658–673] in charge of lunch breaks. In the original paper, the authors propose to compute several attribute values from the solution of a vehicle routing problem; like the earliest and latest starting time for sequences of customers to visit. The computed values allow us to quickly evaluate the feasibility and the marginal cost of some neighbor solutions. Several variants of the class of vehicle routing problems can be addressed using this approach. In the case of drivers’ lunch break scheduling, the proposed formula combines optimistic values for the earliest and the latest completion times of the sequence of customers to visit. Using these values to evaluate neighbor solutions, may conclude that unfeasible solutions are feasible, or underestimate the completion time of a driver’s route. In this note, we describe a counter-example to identify the error in the formula. We also adapt the formula to the correct result.

Suggested Citation

  • Garaix, Thierry & Skiredj, Mohammed, 2024. "A note on “A unified solution framework for multi-attribute vehicle routing problems”," European Journal of Operational Research, Elsevier, vol. 314(3), pages 1215-1219.
    • Handle: RePEc:eee:ejores:v:314:y:2024:i:3:p:1215-1219
    DOI: 10.1016/j.ejor.2023.11.037
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221723008780
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2023.11.037?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.

    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:ejores:v:314:y:2024:i:3:p:1215-1219. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.