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.
All Science Journal Classification (ASJC) codes
- Computer Science(all)
- Modeling and Simulation
- Management Science and Operations Research
- Information Systems and Management
- combinatorial analysis