New formulation for the high multiplicity asymmetric traveling salesman problem with application to the Chesapeake problem
- 196 Downloads
This paper presents a new model for a special type of traveling salesman problem called the High Multiplicity Asymmetric Traveling Salesman Problem (HMATSP). The formulation adopts a flow-based subtour elimination structure and establishes its validity for this problem. Also, we present computational results to demonstrate the efficacy of our modeling approach. The model is then incorporated as a substructure in a formulation for the lot-sizing problem involving parallel machines and sequence-dependent setup costs, also known as the Chesapeake Problem, and related test problems are solved to optimality for the first time in the literature.
KeywordsHigh multiplicity asymmetric traveling salesman problem Polynomial-length formulation Chesapeake problem Parallel machine scheduling Lot-sizing
Unable to display preview. Download preview PDF.
- 1.Baker, T., Muckstadt, J.A.: The CHES problems. Technical Paper, Chesapeake Decision Sciences, Inc., Providence (1989)Google Scholar
- 14.Wong, R.T.: Integer programming formulations of the traveling salesman problem. In: Proceedings of the IEEE International Conference on Circuits and Computers, Part I, pp. 149–152, New York (1980)Google Scholar