Journal article
The Product Matrix Traveling Salesman Problem: An Application and Solution Heuristic
Operations research, Vol.35(5), pp.772-783
09/01/1987
DOI: 10.1287/opre.35.5.772
Abstract
In this paper we analyze an optimization problem that arises in the overhaul of a gas turbine engine. This problem involves the placement of nozzle guide vanes in the nozzle of the engine. The objective of the vane placement is to attain “uniform” flow (equalized distribution of hot fuel gases) about the circumference of the engine nozzle. We show that this placement problem is equivalent to a traveling salesman problem (TSP) whose cost matrix is a product matrix. Exploiting properties of the special form of the cost matrix, we give a heuristic algorithm for solving the problem, and derive a posteriori lower bounds for the heuristic. We show that the heuristic performs extremely well on both real and simulated data. Finally, we present and develop the theoretical results that are the foundation of the proposed heuristic.
Details
- Title: Subtitle
- The Product Matrix Traveling Salesman Problem: An Application and Solution Heuristic
- Creators
- Robert D. Plante - Purdue University West LafayetteTimothy J. Lowe - Purdue University West LafayetteR. Chandrasekaran - The University of Texas at Dallas
- Resource Type
- Journal article
- Publication Details
- Operations research, Vol.35(5), pp.772-783
- DOI
- 10.1287/opre.35.5.772
- ISSN
- 0030-364X
- eISSN
- 1526-5463
- Number of pages
- 12
- Language
- English
- Date published
- 09/01/1987
- Academic Unit
- Business Analytics
- Record Identifier
- 9984963212302771
Metrics
1 Record Views