A new efficient encoding mode of genetic algorithms for the generalized plant allocation problem

Journal of Information Science and Engineering

Volumn 20, Issue 5, 2004, Pages 1019-1034

  Hou, Young Chang ^a   Chang, Ying Hua ^a  

^a NATIONAL CENTRAL UNIVERSITY   (Taiwan)

Author keywords

Combinatorial optimization problems; Efficient encoding scheme; Genetic algorithms; Penalty encoding; Plant allocation

Indexed keywords

COSTS; DYNAMIC PROGRAMMING; INTEGER PROGRAMMING; OPTIMIZATION; PERFORMANCE; PROBABILISTIC LOGICS; PROBLEM SOLVING; RESOURCE ALLOCATION; STRATEGIC PLANNING;

COMBINATORIAL OPTIMIZATION PROBLEMS; EFFICIENT ENCODING SCHEME; PENALTY ENCODING; PLANT ALLOCATION;

GENETIC ALGORITHMS;

EID: 4744345905     PISSN: 10162364     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (44)

1. R. K. Ahuja, J. B. Orlin, and A. Tiwari, "A greedy genetic algorithm for the quadratic assignment problem," Computers and Operations Research, Vol. 27, 2000, pp. 917-934.
2. H. Al-Tabtabai and A. P. Alex, "An evolutionary approach to the capital budgeting of construction projects," Cost Engineering, Vol. 40, 1998, pp. 28-34.
3. R. E. Bellman and S. A. Dreyfus, Applied Dynamic Programming, Princeton University Press, Princeton, 1962.
4. G. H. Bitran and A. C. Hax, "Dissagregation and resource allocation using convex knapsack problems with bounded variables," Management Science, Vol. 27, 1981, pp. 431-441.
5. E. K. Burk and J. P. Newall, "A multistage evolutionary algorithm for the timetable problem," IEEE Transactions on Evolutionary Computation, Vol. 3, 1999, pp. 64-74.
6. A. Charnes and W. W. Cooper, "The theory of search: optimal distribution of effort," Management Science, Vol. 5, 1958, pp. 44-49.
7. S. Chatterjee, C. Carrera, and L. A. Lynch, "Genetic algorithms and traveling salesman problems," European Journal of Operational Research, Vol. 93, 1996, pp. 490-510.
8. R. Cheng, M. Gen, and Y. Tsujimura, "A tutorial survey of job-shop scheduling problems using genetic algorithms - I. representation," Computers and Industrial Engineering, Vol. 30, 1996, pp. 983-997.
9. R. Cheng, M. Gen, and Y. Tsujimura, "A tutorial survey of job-shop scheduling problems using genetic algorithms, part II: hybrid genetic search strategies," Computers and Industrial Engineering, Vol. 36, 1999, pp. 343-364.
10. T. Chockalingam and S. Arunkumar, "Genetic algorithm based heuristics for the mapping problem," Computers and Operations Research, Vol. 22, 1995, pp. 55-64.
11. T. Chockalingam and S. Arunkumar, "Genetic algorithm based heuristics for the mapping problem," Location Science, Vol. 4, 1996, pp. 282-283.
12. P. C. Chu and J. E. Beasley, "A genetic algorithm for the generalized assignment problem," Computers Operations Research, Vol. 24, 1997, pp. 17-23.
13. K. Deb, "An efficient constraint handling method for genetic algorithms," Computer Methods in Applied Mechanics and Engineering, Vol. 186, 2000, pp. 311-338.
14. C. Della, R. Tadei, and G. Volta, "A genetic algorithm for the job shop problem," Computers and Operations Research, Vol. 22, 1995, pp. 15-24.
15. S. A. Dreyfus and M. L. Averill, The An and Theory of Dynamic Programming, Academic Press, New York, 1997.
16. J. M. Einbu, "Extension of Luss-Gupta resource allocation algorithm by means of first order approximation," Techniques, Vol. 29, 1981, pp. 621-626.
17. E. Elton, M. Gruber, and M. Padberg, "Simple criteria for optimal portfolio selection," Journal of Finance, Vol. 31, 1976, pp. 1341-1357.
18. A. Federgruen and P. Zipkin, "Solution techniques for some allocation problems," Mathematical Programming, Vol. 25, 1983, pp. 13-24.
19. M. Gen and R. Cheng, "A survey of penalty techniques in genetic algorithms," in Proceedings of IEEE International Conference on Evolutionary Computation, 1996, pp. 804-809.
20. D. E. Goldberg, Genetic Algorithm in Search, Optimization and Machine Learning, AddisonWesley, 1989.
21. J. Holland, Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Arbor, Michigan, 1975.
22. M. L. Hussein and M. A. Abo-Sinna, "A fuzzy dynamic approach to the multicriterion resource allocation problem," Fuzzy Sets and Systems, Vol. 69, 1995, pp. 115-124.
23. T. Ibaraki, "Solving mathematical programming problems with fractional objective functions," in S. Schaible and W. T. Ziemba, eds., Generalized Concavity in Optimization and Economics, Academic Press, New York, 1981, pp. 441-472.
24. T. Ibaraki and N. Katoh, Resource Allocation Problems - Algorithmic Approaches, The MIT Press, 1988.
25. K. Katayama, H. Sakamoto, and H. Narihisa, "The efficiency of hybrid mutation genetic algorithm for the travelling salesman problem," Mathematical and Computer Modelling, Vol. 31, 2000, pp. 197-203.
26. B. O. Koopman, "The theory of search: part III, the optimum distribution of searching effort," Operations Research, Vol. 5, 1957, pp. 613-626.
27. P. Kotler, Marketing Decision Making: A Model Building Approach, Holt, Rinehart and Winston, New York, 1976.
28. K. K. Lai and L. Li, "A dynamic approach to multiple-objective resource allocation problem," European Journal of Operational Research, Vol. 117, 1999, pp. 293-309.
29. S. M. Lee, L. J. Moore, and B. W. Taylor, Management Science, W. C. Brown, Dubuque, IA, 2nd ed., 1985.
30. H. Luss and S. K. Gupta, "Allocation of effort resource among competing activities," Operations Research, Vol. 23, 1975, pp. 260-366.
31. G. Magyar, M. Johnsson, and O. Nevalainen, "An adaptive hybrid genetic algorithm for the three-matching problem," IEEE Transactions on Evolutionary Computation, Vol. 4, 2000, pp. 135-146.
32. Z. Michalewicz, D. Dasgupta, R. G. Le Riche, and M. Schoenauer, "Evolutionary algorithms for constrained engineering problems," Computers and Industrial Engineering, Vol. 30, 1996, pp. 851-870.
33. J. Neyman, "On two different aspects of the representative method: the method of stratified sampling and the method of selection," Journal of the Royal Statistical Society, Vol. 97, 1934, pp. 558-606.
34. V. Nissen, "Solving the quadratic assignment problem with clues from native," IEEE Transactions on Neural Networks, Vol. 5, 1994, pp. 66-72.
35. G. L. Numhauser, Introduction to Dynamic Programming, Wiley, New York, 1966.
36. H. T. Ozdemir and C. K. Mohan, "Flight graph based genetic algorithm for crew scheduling in airlines," Information Sciences, Vol. 133, 2001, pp. 165-173.
37. C. H. Papadimitriou, Computational Complexity, Addison Wesley, 1994.
38. V. Schnecke and O. Vornberger, "Hybrid genetic algorithms for constrained placement problems," IEEE Transactions on Evolutionary Computation, Vol. 1, 1997, pp. 266-277.
39. W. F. Sharpe, "A simplified model for portfolio analysis," Management Science, Vol. 9, 1963, pp. 277-293.
40. K. S. Srikantan, "A problem in optimum allocation," Operations Research, Vol. 18, 1963, pp. 265-273.
41. D. M. Tate and A. E. Smith, "A genetic approach to the quadratic assignment problem," Computers and Operations Research, Vol. 22, 1995, pp. 73-83.
42. L. Wang and D. Z. Zheng, "An effective hybrid optimization strategy for job-shop scheduling problems," Computers and Operations Research, Vol. 28, 2001, pp. 585-596.
43. H. Zhou, Y. Feng, and L. Han, "The hybrid heuristic genetic algorithm for job shop scheduling," Computers and Industrial Engineering, Vol. 40, 2001, pp. 191-200.
44. H. Ziegler, "Solving certain singly constrained convex optimization problems in production planning," Operations Research Letters, Vol. 1, 1982, pp. 246-252.