An algorithmic framework for improving heuristic solutions: Part I. A deterministic discount coupon traveling salesman problem

Computers and Chemical Engineering

Volumn 28, Issue 8, 2004, Pages 1285-1296

  Choi, Jaein ^a   Realff, Matthew J ^a   Lee, Jay H ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

Combinatorial optimization; Conditional tasks; Dynamic programming; Heuristics; Scheduling and planning; Traveling salesman problem

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; COMPUTATIONAL METHODS; HEURISTIC METHODS; SCHEDULING; SET THEORY;

COMPUTATIONAL LOAD; HEURISTIC SOLUTIONS;

CHEMICAL ENGINEERING;

COMPUTER;

ALGORITHM; ARTICLE; COMPUTER PROGRAM; MATHEMATICAL ANALYSIS; MATHEMATICAL COMPUTING; PROBLEM SOLVING; TRAVEL; WORKER;

EID: 2342638345     PISSN: 00981354     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.compchemeng.2003.09.001     Document Type: Article

References (10)

1. Aarts, E., & Korst, J. (1989). Simulated annealing and Boltzmann machines: a stochastic approach to combinatorial optimization and neural computing (1st ed.). Wiley Press.
2. Bellman, R. (1957). Dynamic programming (1st ed.). New Jersey: Princeton University.
3. Bertsekas, D. (1995). Dynamic programming and optimal control, (Vol. 1-2, 2nd ed.). Athena Scientific.
4. Brooke, A, Kendrick, D., Meeraus, A., & Raman, R. (1998). GAMS: A User's Guide (1st ed.). GAMS Development Corporation.
5. Garey, M., & Johnson, D. (1979). Computers and interactability: a guide to the theroy of NP-completeness (1st ed.). New York: Freeman.
6. Gooding W., Pekny J., Mccroskey P. Eunymerative approaches to parallel flowshop scheduling via problem transformation. Computers and Chemical Engineering. 18(10):1994;909-927
7. Lawler, E., & Eugene, L. (1985). The Traveling Salesman Problem: A guided Tour of Combinatorial Optimization (2nd ed.). New York: Wiley.
8. Pekny J., Miller D., Kudva G. An exact algorithm for resource constrained sequencing with application to production scheduling under an aggregate deadline. Computers and Chemical Engineering. 17(7):1993;671-682
9. Penky J., Miller D. Exact solution of the no-wait flowshop scheduling problem with a comparison to heuristisc methods. Computers and Chemical Engineering. 15(11):1991;741-748
10. Winston, W. (1993). Operations Research: Applications and Algorithms (3rd ed.). Duxbury Press.