| Article ID: | iaor20072911 |
| Country: | South Korea |
| Volume: | 33 |
| Issue: | 1 |
| Start Page Number: | 33 |
| End Page Number: | 43 |
| Publication Date: | Jan 2007 |
| Journal: | Journal of the Korean Institute of Industrial Engineers |
| Authors: | Park Sungsoo, Kang Jangha, Kang Jayoung, Zang Hee Jeong |
| Keywords: | programming: branch and bound |
The pickup and delivery problem with time windows generally involves the construction of optimal routes which satisfy a set of transportation requests under pairing, precedence, time window, vehicle capacity and availability constraints. In this paper, we added some constraints to the problem and adopted an objective function based on number of used vehicles, total travel distance and total schedule duration to consider more realistic problems. A branch and price algorithm for the problem is proposed and an enumeration method is used for the subproblems. The algorithm was tested on randomly generated instances and computational results were reported.