Branch-and-Cut-and-Price for the Pickup and Delivery Problem with Time Windows

Stefan Røpke, Jean-Francois Cordeau

    Research output: Contribution to journalJournal articleResearchpeer-review

    2294 Downloads (Pure)


    In the pickup and delivery problem with time windows (PDPTW), vehicle routes must be designed to satisfy a set of transportation requests, each involving a pickup and a delivery location, under capacity, time window, and precedence constraints. This paper introduces a new branch-and-cut-and-price algorithm in which lower bounds are computed by solving through column generation the linear programming relaxation of a set partitioning formulation. Two pricing subproblems are considered in the column generation algorithm: an elementary and a non-elementary shortest path problem. Valid inequalities are added dynamically to strengthen the relaxations. Some of the previously proposed inequalities for the PDPTW are also shown to be implied by the set partitioning formulation. Computational experiments indicate that the proposed algorithm outperforms a recent branch-and-cut algorithm.
    Original languageEnglish
    JournalTransportation Science
    Issue number3
    Pages (from-to)267-286
    Publication statusPublished - 2009


    • pickup and delivery
    • column generation
    • branch-and-cut
    • branch-and-price
    • valid inequalities


    Dive into the research topics of 'Branch-and-Cut-and-Price for the Pickup and Delivery Problem with Time Windows'. Together they form a unique fingerprint.

    Cite this