IDEAS home Printed from https://ideas.repec.org/a/taf/tjorxx/v69y2018i2p307-318.html
   My bibliography  Save this article

A branch-cut-and-price algorithm for the generalized vehicle routing problem

Author

Listed:
  • Mohammad Reihaneh
  • Ahmed Ghoniem

Abstract

We develop a branch-cut-and-price algorithm for the generalized vehicle routing problem (GVRP)—a variant of the vehicle routing problem where customers are partitioned into mutually exclusive clusters. The decision-maker seeks to determine minimum cost routes using a limited number of vehicles such that every cluster is visited by exactly one route, and within any cluster a single customer is visited, subject to vehicle capacity constraints. The pricing subproblem is solved using a specialized dynamic programming algorithm. Computational results show that the proposed algorithm compares favorably against a state-of-the-art branch-and-cut algorithm and solves to optimality eight previously open GVRP instances in the literature.

Suggested Citation

  • Mohammad Reihaneh & Ahmed Ghoniem, 2018. "A branch-cut-and-price algorithm for the generalized vehicle routing problem," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 69(2), pages 307-318, February.
    • Handle: RePEc:taf:tjorxx:v:69:y:2018:i:2:p:307-318
    DOI: 10.1057/s41274-017-0231-6
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1057/s41274-017-0231-6
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/s41274-017-0231-6?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. Yuan, Yuan & Cattaruzza, Diego & Ogier, Maxime & Semet, Frédéric & Vigo, Daniele, 2021. "A column generation based heuristic for the generalized vehicle routing problem with time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 152(C).
    2. Reihaneh, Mohammad & Ansari, Sina & Farhadi, Farbod, 2023. "Patient appointment scheduling at hemodialysis centers: An exact branch and price approach," European Journal of Operational Research, Elsevier, vol. 309(1), pages 35-52.

    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:tjorxx:v:69:y:2018:i:2:p:307-318. 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/tjor .

    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.