论文信息 - A branch-and-price algorithm for the pickup and delivery problem with time windows

A branch-and-price algorithm for the pickup and delivery problem with time windows

In pickup and delivery problems vehicles have to transport loads from origins to destinations without transshipment at intermediate locations. In this paper, we describe an algorithm to solve such problems. The algorithm is based on a set partitioning formulation of the problem and uses new column generation and branching schemes.

Mwp Martin Savelsbergh | M Marc Sol

[1] P. Toth,et al. Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem , 1980 .

[2] Ellis L. Johnson,et al. A Global Approach to Crew-Pairing Optimization , 1992, IBM Syst. J..

[3] Martin W. P. Savelsbergh,et al. MINTO, a mixed INTeger optimizer , 1994, Oper. Res. Lett..

[4] Mwp Martin Savelsbergh,et al. Local search in physical distribution management , 1992 .

[5] George L. Nemhauser,et al. Solving binary cutting stock problems by column generation and branch-and-bound , 1994, Comput. Optim. Appl..

[6] Martin Desrochers,et al. A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows , 1990, Oper. Res..