Dynamic programming decision path encoding of genetic algorithms for production allocation problems

Computers and Industrial Engineering

Volumn 54, Issue 1, 2008, Pages 53-65

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

^a TATUNG UNIVERSITY   (Taiwan)

^b TAMKANG UNIVERSITY   (Taiwan)

Author keywords

Constraints satisfaction; Dynamic programming decision path encoding; Genetic Algorithms; Optimization problems; Production allocation

Indexed keywords

CHROMOSOMES; DYNAMIC PROGRAMMING; MUTAGENESIS; NUMERICAL METHODS; OPTIMIZATION; PROBLEM SOLVING;

CONSTRAINTS SATISFACTION; DYNAMIC PROGRAMMING DECISION PATH ENCODING; OPTIMIZATION PROBLEMS; PRODUCTION ALLOCATION;

GENETIC ALGORITHMS;

EID: 36049031128     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cie.2007.06.034     Document Type: Article

References (23)

1. Ahuja R.K., Orlin J.B., and Tiwari A. A greedy genetic algorithm for the quadratic assignment problem. Computers and Operations Research 27 (2000) 917-934
2. Bhatnagar R., Chandra P., and Goyal S.K. Models for multi-plant coordination. European Journal of Operational Research 67 (1993) 141-160
3. Burk E.K., and Newall J.P. A multistage evolutionary algorithm for the timetable problem. IEEE Transactions on Evolutionary Computation 3 (1999) 64-74
4. Chatterjee S., Carrera C., and Lynch L.A. Genetic algorithms and traveling salesman problems. European Journal of Operational Research 93 (1996) 490-510
5. Chau K.W. A two-stage dynamic model on allocation of construction facilities with genetic algorithm. Automation in Construction 13 (2004) 481-490
6. Cheng R., Gen M., and Tsujimura Y. A tutorial survey of job-shop scheduling problems using genetic algorithms-I. Representation. Computers and Industrial Engineering 30 (1996) 983-997
7. Cheng R., Gen M., and Tsujimura Y. A tutorial survey of job-shop scheduling problems using genetic algorithms, part II: Hybrid genetic search strategies. Computers and Industrial Engineering 36 (1999) 343-364
8. Contreras A.R., Valero C.V., and Pinninghoff J.M.A. Applying genetic algorithms for production scheduling and resource allocation. Special case: A small size manufactusing company. Lecture Notes in Computer Science 3533 (2005) 547-550
9. Deb K. An efficient constraint handling method for genetic algorithms. Computer Methods in Applied Mechanics and Engineering 186 (2000) 311-338
10. Della C., Tadei R., and Volta G. A genetic algorithm for the job shop problem. Computers and Operations Research 22 (1995) 15-24
11. Garavelli A.C., Okogbaa O.G., and Violante N. Global manufacturing systems: A model supported by genetic algorithms to optimize production planning. Computers and Industrial Engineering 31 (1996) 193-196
12. Gen M., and Cheng R. A survey of penalty techniques in genetic algorithms. Proceedings of IEEE International Conference on Evolutionary Computation (1996) 804-809
13. Hou Y.C., and Chang Y.H. A new efficient encoding mode of genetic algorithms for the generalized plant allocation Problem. Journal of Information Science and Engineering 20 5 (2004) 1019-1034
14. Ji X.L. Order allocation model in supply chain and hybrid genetic algorithm. Journal of Southwest Jiaotong University 40 (2005) 811-815
15. Katayama K., Sakamoto H., and Narihisa H. The efficiency of hybrid mutation genetic algorithm for the travelling salesman problem. Mathematical and Computer Modelling 31 (2000) 197-203
16. Lootsma F.A. Alternative optimization strategies for large-scale production-allocation problems. European Journal of Operational Research 75 (1994) 13-40
17. Michalewicz Z., Dasgupta D., Le Riche R.G., and Schoenauer M. Evolutionary algorithms for constrained engineering problems. Computers and Industrial Engineering 30 (1996) 851-870
18. Nissen V. Solving the quadratic assignment problem with clues from native. IEEE Transactions on Neural Networks 5 (1994) 66-72
19. Ozdemir H.T., and Mohan C.K. Flight graph based genetic algorithm for crew scheduling in airlines. Information Sciences 133 (2001) 165-173
20. Schnecke V., and Vornberger O. Hybrid genetic algorithms for constrained placement problems. IEEE Transactions on Evolutionary Computation 1 (1997) 266-277
21. Tate D.M., and Smith A.E. A genetic approach to the quadratic assignment problem. Computers and Operations Research 22 (1995) 73-83
22. Wang L., and Zheng D.Z. An effective hybrid optimization strategy for job-shop scheduling problems. Computers and Operations Research 28 (2001) 585-596
23. Zhou H., Feng Y., and Han L. The hybrid heuristic genetic algorithm for job shop scheduling. Computers and Industrial Engineering 40 (2001) 191-200