| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 474733 | Computers & Operations Research | 2011 | 8 Pages |
Abstract
In this paper we introduce the balanced traveling salesman problem (BTSP), which can be used to model optimization problems where equitable distribution of resources are important. BTSP is obviously NP-hard. Efficient heuristic algorithms are presented to solve the problem along with extensive computational results using benchmark problems from TSPLIB and random instances. Our algorithms produced provably optimal solutions for several test instances. Application of the model in solving the nozzle guide vane assembly problem related to the maintenance of aircraft engines is also discussed.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
John Larusic, Abraham P. Punnen,