An exact parallel algorithm for the resource constrained traveling salesman problem with application to scheduling with an aggregate deadline

Authors:
J. F. Pekny;D. L. Miller
Affiliations:
Engineering Design Research Center, Carnegie Mellon University, Pittsburgh, PA;Central Research and Development Department, E. I. du Pont de Nemours & Company Inc., Wilmington, DE
Venue:
CSC '90 Proceedings of the 1990 ACM annual conference on Cooperation
Year:
1990

Citing 2
Cited 2

Contention is no obstacle to shared-memory multiprocessing

Communications of the ACM - Special issue on parallelism
Anomalies in parallel branch-and-bound algorithms

Communications of the ACM

Iterated local search for the team orienteering problem with time windows

Computers and Operations Research
A comparison of problem decomposition techniques for the FAP

Journal of Heuristics

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Resource Constrained Traveling Salesman Problem (RCTSP) is introduced and an optimal algorithm for its solution is presented. The RCTSP is shown to subsume the Prize Collecting TSP and Orienteering Problem. Computational results are presented for sequential and parallel computations for problems containing up to 200 cities. The RCTSP algorithm is used to optimally schedule a processing facility involving sequence dependent transition costs and an aggregate due date on all job completion times. A penalty is incurred for each job not completed by the aggregate due date.