|
|||||
|
|
The pickup and delivery problem: Faces and branch-and-cut algorithm |
|
| Authors: | K.S. Ruland E.Y. Rodin |
| Affiliation: | Systems & Electronics, Inc. 201 Evans Lane, St. Louis, MO 63121-1126, U.S.A. Department of Systems Science and Mathematics Washington University in St. Louis One Brookings Drive, St. Louis, MO 63130, U.S.A. |
| Abstract: | This paper formulates the pickup and delivery problem, also known as the dial-a-ride problem, as an integer program. Its polyhedral structure is explored and four classes of valid inequalities developed. The results of a branch-and-cut algorithm based on these constraints are presented. |
| Keywords: | Integer programming Branch-and-cut algorithm Pickup and delivery problem |
| 本文献已被 ScienceDirect 等数据库收录！ | |