메뉴 건너뛰기




Volumn 176, Issue 19, 2006, Pages 2869-2885

A variable-grouping based genetic algorithm for large-scale integer programming

Author keywords

Genetic algorithms; Large scale integer programming; Search space; Variable grouping

Indexed keywords

COMPUTATION THEORY; DECISION THEORY; GENETIC ALGORITHMS; NUMERICAL METHODS; PROBLEM SOLVING; QUADRATIC PROGRAMMING;

EID: 33745595849     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2005.04.009     Document Type: Article
Times cited : (30)

References (29)
  • 1
    • 0036541179 scopus 로고    scopus 로고
    • An approximate dynamic programming approach to multidimensional knapsack problems
    • Bertsimas D., and Demir R. An approximate dynamic programming approach to multidimensional knapsack problems. Management Science 48 (2002) 550-565
    • (2002) Management Science , vol.48 , pp. 550-565
    • Bertsimas, D.1    Demir, R.2
  • 3
    • 33745623894 scopus 로고    scopus 로고
    • D.E. Goldenberg, K. Deb, D. Korb, An investigation of messy genetic algorithms, Technical Report TCGA 90005, TCGA, University of Alabama, 1990.
  • 4
    • 33745631432 scopus 로고    scopus 로고
    • K.A. DeJong, An analysis of the behavior of a class of genetic adaptive systems, Ph.D. Thesis, Department of Computer Science, University of Michigan, 1975.
  • 7
    • 33745601043 scopus 로고    scopus 로고
    • Z.S. Hua, B. Zhang, L. Liang, An approximate dynamic programming approach to convex quadratic knapsack problems, Computers and Operations Research (in press). Available from: .
  • 8
    • 0034230027 scopus 로고    scopus 로고
    • Multi-product planning and scheduling using genetic algorithm approach
    • Ip W.H., Li Y., Man K.F., and Tang K.S. Multi-product planning and scheduling using genetic algorithm approach. Computers and Industrial Engineering 38 (2000) 283-296
    • (2000) Computers and Industrial Engineering , vol.38 , pp. 283-296
    • Ip, W.H.1    Li, Y.2    Man, K.F.3    Tang, K.S.4
  • 9
    • 0034701847 scopus 로고    scopus 로고
    • The efficiency of hybrid mutation genetic algorithm for the traveling salesman problem
    • Katayama K., Sakamoto H., and Narihisa H. The efficiency of hybrid mutation genetic algorithm for the traveling salesman problem. Mathematical and Computer Modeling 31 (2000) 197-203
    • (2000) Mathematical and Computer Modeling , vol.31 , pp. 197-203
    • Katayama, K.1    Sakamoto, H.2    Narihisa, H.3
  • 10
    • 0001644591 scopus 로고
    • Bimatrix equilibrium points and mathematical programming
    • Lemke C.E. Bimatrix equilibrium points and mathematical programming. Management Science 11 (1965) 681-689
    • (1965) Management Science , vol.11 , pp. 681-689
    • Lemke, C.E.1
  • 12
    • 0033102403 scopus 로고    scopus 로고
    • Scheduling of design projects with uncertain number of iterations
    • Luh P.B., Liu F., and Moser B. Scheduling of design projects with uncertain number of iterations. European Journal of Operational Research 113 (1999) 575-592
    • (1999) European Journal of Operational Research , vol.113 , pp. 575-592
    • Luh, P.B.1    Liu, F.2    Moser, B.3
  • 13
    • 33745616043 scopus 로고    scopus 로고
    • P. Merz, B. Freisleben, Genetic algorithms for binary quadratic programming, in: Proceedings of the Genetic and Evolutionary Computation Conference, 1999.
  • 14
    • 0031248383 scopus 로고    scopus 로고
    • Application of a heuristic procedure to solve mixed-integer programming problems
    • Nazario D.R.B., and Karina A.R. Application of a heuristic procedure to solve mixed-integer programming problems. Computers and Industrial Engineering 33 (1997) 43-46
    • (1997) Computers and Industrial Engineering , vol.33 , pp. 43-46
    • Nazario, D.R.B.1    Karina, A.R.2
  • 17
    • 0031335946 scopus 로고    scopus 로고
    • A combination of the genetic algorithm and Lagrangian relaxation decomposition techniques for the generation unit commitment problem
    • Orero S.O., and Irving M.R. A combination of the genetic algorithm and Lagrangian relaxation decomposition techniques for the generation unit commitment problem. Electric Power Systems Research 43 (1997) 149-156
    • (1997) Electric Power Systems Research , vol.43 , pp. 149-156
    • Orero, S.O.1    Irving, M.R.2
  • 19
    • 0034772806 scopus 로고    scopus 로고
    • An adaptive penalty function in genetic algorithms for structural design optimization
    • Pruettha N., and Konlakarn M. An adaptive penalty function in genetic algorithms for structural design optimization. Computers and Structures 79 (2001) 2527-2539
    • (2001) Computers and Structures , vol.79 , pp. 2527-2539
    • Pruettha, N.1    Konlakarn, M.2
  • 20
    • 0036466757 scopus 로고    scopus 로고
    • An interactive fuzzy satisficing method for general multiobjective 0-1 programming problems through genetic algorithms with double strings based on a reference solution
    • Sakawa M., and Kato K. An interactive fuzzy satisficing method for general multiobjective 0-1 programming problems through genetic algorithms with double strings based on a reference solution. Fuzzy Sets and Systems 125 (2002) 289-300
    • (2002) Fuzzy Sets and Systems , vol.125 , pp. 289-300
    • Sakawa, M.1    Kato, K.2
  • 21
    • 0037290083 scopus 로고    scopus 로고
    • Genetic algorithms with double strings for 0-1 programming problems
    • Sakawa M., and Kato K. Genetic algorithms with double strings for 0-1 programming problems. European Journal of Operational Research 144 (2003) 581-597
    • (2003) European Journal of Operational Research , vol.144 , pp. 581-597
    • Sakawa, M.1    Kato, K.2
  • 24
    • 0041304628 scopus 로고    scopus 로고
    • Genetic algorithm development for multi-objective optimization of batch free-radical polymerization reactors
    • Silva C.M., and Biscaia Jr. E.C. Genetic algorithm development for multi-objective optimization of batch free-radical polymerization reactors. Computers and Chemical Engineering 27 (2003) 1329-1344
    • (2003) Computers and Chemical Engineering , vol.27 , pp. 1329-1344
    • Silva, C.M.1    Biscaia Jr., E.C.2
  • 25
    • 4043079775 scopus 로고    scopus 로고
    • Modelling the slab stack shuffling problem in developing steel rolling schedules and its solution using improved parallel genetic algorithms
    • Singh K.A., Srinivas, and Tiwari M.K. Modelling the slab stack shuffling problem in developing steel rolling schedules and its solution using improved parallel genetic algorithms. International Journal of Production Economics 91 (2004) 135-147
    • (2004) International Journal of Production Economics , vol.91 , pp. 135-147
    • Singh, K.A.1    Srinivas2    Tiwari, M.K.3
  • 26
    • 0032137445 scopus 로고    scopus 로고
    • Search space division in GAs using phenotypic properties
    • Tsutsui S., and Ghosh A. Search space division in GAs using phenotypic properties. Information Sciences 109 (1998) 119-133
    • (1998) Information Sciences , vol.109 , pp. 119-133
    • Tsutsui, S.1    Ghosh, A.2
  • 27
    • 0032592171 scopus 로고    scopus 로고
    • Scheduling grouped jobs on single machine with genetic algorithm
    • Wang D.W., Gen M., and Cheng R.W. Scheduling grouped jobs on single machine with genetic algorithm. Computers and Industrial Engineering 36 (1999) 309-324
    • (1999) Computers and Industrial Engineering , vol.36 , pp. 309-324
    • Wang, D.W.1    Gen, M.2    Cheng, R.W.3
  • 28
    • 0030241843 scopus 로고    scopus 로고
    • Genetic algorithm for non-linear mixed integer programming problems and its applications
    • Yokota T., Gen M., and Li Y.X. Genetic algorithm for non-linear mixed integer programming problems and its applications. Computers and Industrial Engineering 30 (1996) 905-917
    • (1996) Computers and Industrial Engineering , vol.30 , pp. 905-917
    • Yokota, T.1    Gen, M.2    Li, Y.X.3
  • 29
    • 0031282082 scopus 로고    scopus 로고
    • A note on reducing the number of variables in integer programming problems
    • Zhu N., and Broughan K. A note on reducing the number of variables in integer programming problems. Computational Optimization and Applications 8 (1997) 263-272
    • (1997) Computational Optimization and Applications , vol.8 , pp. 263-272
    • Zhu, N.1    Broughan, K.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.