The use of dynamic programming in genetic algorithms for permutation problems

European Journal of Operational Research

Volumn 92, Issue 2, 1996, Pages 387-401

  Yagiura, Mutsunori ^a   Ibaraki, Toshihide ^a  

^a KYOTO UNIVERSITY   (Japan)

Author keywords

Combinatorial optimization; Dynamic programming; Genetic algorithm; Heuristics; Single machine scheduling problem

Indexed keywords

APPROXIMATION THEORY; CALCULATIONS; COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; DYNAMIC PROGRAMMING; GENETIC ALGORITHMS; HEURISTIC METHODS; OPTIMIZATION; SCHEDULING;

COMBINATORIAL OPTIMIZATION; OPTIMAL LINEAR ARRANGEMENT PROBLEM; PERMUTATION PROBLEMS; SINGLE MACHINE SCHEDULING; TRAVELING SALESMAN PROBLEM;

OPERATIONS RESEARCH;

EID: 0030190733     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/0377-2217(94)00301-7     Document Type: Article

References (30)

1. Adolphson, D., and Hu, T.C., "Optimal linear ordering", SIAM Journal on Applied Mathematics 25 (1973) 403-423.
2. Bhasker, J., and Sahni, S., "Optimal linear arrangement of circuit components", in: Proceedings of the 20th Annual Hawaii International Conference on System Sciences, 1987, 99-111.
3. Davis, L., Handbook of Genetic Algorithms, Van Nostrand Reinhold, New York, 1991.
4. Feo, T.A., Venkatraman, K., and Bard, J.F., "A GRASP for single machine scheduling with due dates and earliness penalties", Operations Research Group, Department of Mechanical Engineering, University of Texas at Austin, Austin, TX 78712-1063, 1989.
5. Garey, M.R., and Johnson, D.S., Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, New York, 1979.
6. Garey, M.R., Johnson, D.S., and Stockmeyer, L., "Some simplified NP-complete graph problems", Theoretical Computer Science 1 (1976) 237-267.
7. Goldberg, D.E., Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley, Reading, MA, 1989.
8. Grötschel, M., and Holland, O., "Solution of large-scale symmetric traveling salesman problems", Mathematical Programming 51 (1991) 141-202.
9. Held, M., and Karp, R.M., "A dynamic programming approach to sequencing problems", SIAM Journal on Applied Mathematics 10 (1962) 196-210.
10. Holland, J., Adaptation in Natural and Artificial Systems, MIT Press, Cambridge, MA, 1992.
11. Ibaraki, T., and Nakamura, Y., "A dynamic programming method for single machine scheduling", European Journal of Operational Research 76 (1994) 72-82.
12. Jog, P., Suh, J.Y., and Van Gucht, D., "The effects of population size, heuristic crossover and local improvement on a genetic algorithm for the traveling salesman problems", in: Proceedings of the 3rd International Conference on Genetic Algorithms, 1989, 110-115.
13. Kang, S., "Linear ordering and application to placement", in: Proceedings of the 20th Design Automation Conference, 1983, 457-464.
14. Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., and Shmoys, D.B., The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, Wiley, New York, 1985.
15. Lin, S., and Kernighan, B.W., "An effective heuristic algorithm for the traveling salesman problem", Operations Research 21 (1973) 498-516.
16. Miller, D.L., and Pekny, J.F., "Exact solution of large asymmetric traveling salesman problem", Science 251 (1991) 754-761.
17. Mühlenbein, H., Gorges-Schleuter, M., and Krämer, O., "Evolution algorithms in combinatorial optimization", Parallel Computing 1 (1988) 65-85.
18. Oliver, I.M., Smith, D.J., and Holland, J.R.C., "A study of permutation crossover operators on the traveling salesman problem", in: Proceedings of the 2nd International Conference on Genetic Algorithms, 1987, 224-230.
19. Padberg, M., and Rinaldi, G., "A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems", SIAM Review 33 (1991) 60-100.
20. Potts, C.N., and Van Wassenhove, L.N., "A decomposition algorithm for the single machine total tardiness problem", Operations Research Letters 1 (1982) 177-181.
21. Potts, C.N., and Van Wassenhove, L.N., "A branch and bound algorithm for the total weighted tardiness problem", Operations Research 33 (1985) 363-377.
22. Rosenkrantz, D.J., Stearns, R.E., and Lewis II, P.M., "An analysis of several heuristics for the traveling salesman problem", SIAM Journal on Computing 6 (1977) 563-581.
23. Schrage, M., and Baker, K.R., "Dynamic programming solution of sequencing problems with precedence constraints", Operations Research 26 (1978) 444-449.
24. Schuler, D.M., and Ulrich, E.G., "Clustering and linear placement", in: Proceedings of the 9th Design Automation Conferences, 1972, 50-56.
25. Starkweather, T., McDaniel, S., Mathias, K., Whitley, D., and Whitley, C., "A Comparison of genetic sequencing operators", in: Proceedings of the 4th International Conference on Genetic Algorithms, 1991, 69-76.
26. Steiner, G., "Single machine scheduling with precedence constraints of dimension 2", Mathematics of Operations Research 9 (1984) 248-259.
27. Steiner, G., "On estimating the number of order ideals in partial orders, with some applications", Journal of Statistical Planning and Inference 34 (1993) 281-290.
28. Ulder, N.L.J., Pesch, E., Van Laarhouven, P.J.M., Bandelt, H.-J., and Aarts, E.H.L., "Genetic local search algorithms for the traveling salesman problem", in: Proceedings of the 1st International Workshop on Parallel Problem Solving from Nature, 1990, 109-116.
29. Yagiura, M., "Genetic algorithms for solving some combinatorial optimization problems", Master's Thesis, Department of Applied Mathematics and Physics, Faculty of Engineering, Kyoto University, 1993.
30. Yagiura, M., and Ibaraki, T., "A genetic algorithm for solving the single machine scheduling problem" (in Japanese), IEICE Technical Report COMP91-17, 1991, 43-52.