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

Mohammad Reihaneh and Ahmed Ghoniem

Journal of the Operational Research Society, 2018, vol. 69, issue 2, 307-318

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.

Date: 2018
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://hdl.handle.net/10.1057/s41274-017-0231-6 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:taf:tjorxx:v:69:y:2018:i:2:p:307-318

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/tjor20

DOI: 10.1057/s41274-017-0231-6

Access Statistics for this article

Journal of the Operational Research Society is currently edited by Tom Archibald

More articles in Journal of the Operational Research Society from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().