Department of Economics and Business Economics

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

Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearchpeer-review

The paper considers the Cumulative Capacitated Vehicle Routing Problem (CCVRP), which is a variation of the well-known Capacitated Vehicle Routing Problem (CVRP). In this problem, the traditional objective of minimizing total distance or time traveled by the vehicles is replaced by minimizing the sum of arrival times at the customers. A branch-and-cut-and-price algorithm for obtaining optimal solutions to the problem is proposed. Computational results based on a set of standard CVRP benchmarks are presented.
Original languageEnglish
JournalEuropean Journal of Operational Research
Pages (from-to)800-810
Publication statusPublished - Aug 2014

    Research areas

  • Minimum latency, Routing, CCVRP, Branch-and-cut-and-price

See relations at Aarhus University Citationformats

ID: 55973629