The pickup and delivery crude oil transportation scheduling problem is to find an optimal assignment of requests to a fleet of tankers, sequence of visiting places, and loading and unloading volume of demand simultaneously in order to minimize the total cost with the capacity of the tankers. The problem can be formulated as a split pickup and delivery vehicle routing problem. We apply a column generation algorithm to solve the problem efficiently. In order to obtain a feasible solution by column generation, we propose an effective algorithm to generate a feasible solution satisfying the set partitioning constraints. Computational results demonstrate the effectiveness of the proposed method.

This content is only available via PDF.
You do not currently have access to this content.