An algorithm for the traveling salesman problem with pickup and delivery customers |
| |
| Authors: | Bahman Kalantari Arthur V Hill Sant R Arora |
| |
| Institution: | Department of Computer Science, Rutgers University, Brunswick, NJ, U.S.A.;School of Management, University of Minnesota, Minneapolis, MN 55455, U.S.A.;Institute of Technology, University of Minnesota, Minneapolis, MN 55455, U.S.A. |
| |
| Abstract: | The paper extends the branch and bound algorithm of Little, Murty, Sweeney, and Karel to the traveling salesman problem with pickup and delivery customers, where each pickup customer is required to be visited before its associated delivery customer. The problems considered include single and multiple vehicle cases as well as infinite and finite capacity cases. Computational results are reported. |
| |
| Keywords: | Scheduling transportation combinatorial analysis |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
