Disjunctive cuts in a branch-and-price algorithm for the capacitated vehicle routing problem

    Research output: Contribution to conferenceConference abstract for conferenceResearch

    97 Downloads (Pure)

    Abstract

    This talk presents computational results that show the usefulness of the general-purpose valid inequalities disjunctive cuts when applied to the CVRP. Results indicate that the disjunctive cuts are able to reduce the gap between lower bound and upper bound more than state-of-the-art problem specific inequalities. Results also indicate that introducing the cuts leads to a smaller branch and bound tree and faster solution times overall.
    Original languageEnglish
    Publication date2009
    Publication statusPublished - 2009
    EventOdysseus : International Workshop on Freight Transportation and Logistics - Cesme, Turkey
    Duration: 1 Jan 2009 → …

    Conference

    ConferenceOdysseus : International Workshop on Freight Transportation and Logistics
    CityCesme, Turkey
    Period01/01/2009 → …

    Fingerprint

    Dive into the research topics of 'Disjunctive cuts in a branch-and-price algorithm for the capacitated vehicle routing problem'. Together they form a unique fingerprint.

    Cite this