IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v334y2026i1p40-50.html

A generalized set partitioning model for MinMax vehicle routing

Author

Listed:
  • Lysgaard, Jens
  • Gadegaard, Sune Lauth

Abstract

This paper proposes a new approach to modeling of vehicle routing problems with a MinMax objective. At the core of the approach, we formulate a Generalized Set Partitioning Problem (GSPP) which is used for minimizing infeasibility of the considered vehicle routing problem for a given upper bound on the objective value. Generally, the optimal value of the MinMax objective is obtained as the smallest upper bound for which the formulated GSPP obtains a total infeasibility of zero. We propose to solve the new formulation using branch-and-price and demonstrate the effectiveness of the approach through computational results.

Suggested Citation

  • Lysgaard, Jens & Gadegaard, Sune Lauth, 2026. "A generalized set partitioning model for MinMax vehicle routing," European Journal of Operational Research, Elsevier, vol. 334(1), pages 40-50.
    • Handle: RePEc:eee:ejores:v:334:y:2026:i:1:p:40-50
    DOI: 10.1016/j.ejor.2026.04.026
    as

    Download full text from publisher

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

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;

    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:eee:ejores:v:334:y:2026:i:1:p:40-50. 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.