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

The family capacitated vehicle routing problem

Author

Listed:
  • Bernardino, Raquel
  • Paias, Ana

Abstract

In this article, we address the family capacitated vehicle routing problem (F-CVRP), an NP-hard problem that generalizes both the FTSP and the capacitated vehicle routing problem. The F-CVRP has practical application in warehouse management in warehouses with scattered storage. We present several mixed integer linear programming formulations for this problem and establish a theoretical and empirical comparison. We also propose valid inequalities adapted from known routing problems from the literature. Some formulations are solved using a branch-and-cut algorithm, which is tested with a newly generated data set. The computational experiment allows us to identify the instances’ most challenging characteristics and the exact methods’ limitations. Finally, we develop an iterated local search (ILS) algorithm to efficiently obtain feasible solutions for the instances that could not be solved to proven optimality. The ILS algorithm is very efficient and can improve the upper bounds obtained by the exact methods within the set time limit.

Suggested Citation

  • Bernardino, Raquel & Paias, Ana, 2024. "The family capacitated vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 314(3), pages 836-853.
    • Handle: RePEc:eee:ejores:v:314:y:2024:i:3:p:836-853
    DOI: 10.1016/j.ejor.2023.10.042
    as

    Download full text from publisher

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