메뉴 건너뛰기




Volumn 199, Issue 1, 2009, Pages 89-97

Improving benders decomposition using a genetic algorithm

Author keywords

Benders decomposition; Genetic algorithm; Mixed integer linear programs

Indexed keywords

BENDERS DECOMPOSITION; CUTTING PLANES; FEASIBLE SOLUTIONS; HYBRID SOLUTIONS; LINEAR PROGRAMMING SOLVERS; MIXED-INTEGER LINEAR PROGRAMMING; MIXED-INTEGER LINEAR PROGRAMS; OPTIMALITY; STAND -ALONE; SUCCESSIVE ITERATIONS; TEST PROBLEMS;

EID: 67349116412     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2008.10.033     Document Type: Article
Times cited : (69)

References (21)
  • 2
    • 0141509927 scopus 로고    scopus 로고
    • A new adaptive penalty scheme for genetic algorithms
    • Barbosa H.J.C., and Lemonge A.C.C. A new adaptive penalty scheme for genetic algorithms. Information Sciences 156 3-4 (2003) 215-251
    • (2003) Information Sciences , vol.156 , Issue.3-4 , pp. 215-251
    • Barbosa, H.J.C.1    Lemonge, A.C.C.2
  • 3
    • 0344666795 scopus 로고    scopus 로고
    • Population heuristics
    • Pardalos P.M., and Resende M.G.C. (Eds), Oxford University Press
    • Beasley J.E. Population heuristics. In: Pardalos P.M., and Resende M.G.C. (Eds). Handbook of Applied Optimization (2002), Oxford University Press 138-157
    • (2002) Handbook of Applied Optimization , pp. 138-157
    • Beasley, J.E.1
  • 4
    • 9644308639 scopus 로고
    • Partitioning procedures for solving mixed-variables programming problems
    • Benders J.F. Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik 4 (1962) 238-252
    • (1962) Numerische Mathematik , vol.4 , pp. 238-252
    • Benders, J.F.1
  • 5
    • 33846586040 scopus 로고    scopus 로고
    • A feasibility pump heuristic for general mixed-integer problems
    • Bertacco L., Fischetti M., and Lodi A. A feasibility pump heuristic for general mixed-integer problems. Discrete Optimization 4 (2007) 63-76
    • (2007) Discrete Optimization , vol.4 , pp. 63-76
    • Bertacco, L.1    Fischetti, M.2    Lodi, A.3
  • 6
    • 0032289750 scopus 로고    scopus 로고
    • Constraint handling in genetic algorithms: the set partitioning problem
    • Chu P.C., and Beasley J.E. Constraint handling in genetic algorithms: the set partitioning problem. Journal of Heuristics 4 (1998) 323-357
    • (1998) Journal of Heuristics , vol.4 , pp. 323-357
    • Chu, P.C.1    Beasley, J.E.2
  • 7
    • 0035868814 scopus 로고    scopus 로고
    • Evolutionary algorithms approach to the solution of mixed-integer non-linear programming problems
    • Costa L., and Oliveira P. Evolutionary algorithms approach to the solution of mixed-integer non-linear programming problems. Computers & Chemical Engineering 25 2-3 (2001) 257-266
    • (2001) Computers & Chemical Engineering , vol.25 , Issue.2-3 , pp. 257-266
    • Costa, L.1    Oliveira, P.2
  • 8
    • 0021444704 scopus 로고
    • Large-scale mixed integer programming: Benders-type heuristics
    • Cote G., and Laughton M.A. Large-scale mixed integer programming: Benders-type heuristics. European Journal of Operational Research 16 3 (1984) 327-333
    • (1984) European Journal of Operational Research , vol.16 , Issue.3 , pp. 327-333
    • Cote, G.1    Laughton, M.A.2
  • 9
    • 0033729054 scopus 로고    scopus 로고
    • An efficient constraint handling method for genetic algorithms
    • Deb K. An efficient constraint handling method for genetic algorithms. Computer Methods in Applied Mechanics and Engineering 186 2-4 (2000) 311-338
    • (2000) Computer Methods in Applied Mechanics and Engineering , vol.186 , Issue.2-4 , pp. 311-338
    • Deb, K.1
  • 11
    • 67349182996 scopus 로고    scopus 로고
    • Fischetti, M., Salvagnin, D., Zanette, A. Minimal Infeasible Subsystems and Benders Cuts. DEI, University of Padova (submitted to Mathematical Programming). (accessed 25.10.08.).
    • Fischetti, M., Salvagnin, D., Zanette, A. Minimal Infeasible Subsystems and Benders Cuts. DEI, University of Padova (submitted to Mathematical Programming). (accessed 25.10.08.).
  • 12
    • 0028413196 scopus 로고
    • Constrained optimization via genetic algorithm
    • Homaifar A., Qi C.X., and Lai S.H. Constrained optimization via genetic algorithm. Simulation 62 4 (1994) 242-253
    • (1994) Simulation , vol.62 , Issue.4 , pp. 242-253
    • Homaifar, A.1    Qi, C.X.2    Lai, S.H.3
  • 13
    • 67349138293 scopus 로고    scopus 로고
    • ILOG
    • ILOG, 2006. .
    • (2006)
  • 14
    • 0002437158 scopus 로고
    • Evolutionary optimisation of constrained problems
    • Sebald, A.V, Fogel, L.J, Eds, World Scientific Publishing, River Edge, NJ, USA, pp
    • Michalewicz, Z., Attia, N., 1994. Evolutionary optimisation of constrained problems. In: Sebald, A.V., Fogel, L.J. (Eds.), Proceedings of the 3rd Annual Conference on Evolutionary Programming, World Scientific Publishing, River Edge, NJ, USA, pp. 98-108.
    • (1994) Proceedings of the 3rd Annual Conference on Evolutionary Programming , pp. 98-108
    • Michalewicz, Z.1    Attia, N.2
  • 15
    • 67349209634 scopus 로고    scopus 로고
    • Nieminen, K., Ruuth, S., Maros, I., 2003, Genetic algorithm for finding a good first integer solution for MILP. Department of Computing, Imperial College, Departmental Technical Reports 2003/4. , (accessed 25.10.08.).
    • Nieminen, K., Ruuth, S., Maros, I., 2003, Genetic algorithm for finding a good first integer solution for MILP. Department of Computing, Imperial College, Departmental Technical Reports 2003/4. , (accessed 25.10.08.).
  • 16
    • 34848836096 scopus 로고    scopus 로고
    • Genetic algorithm based technique for solving chance constrained problems
    • Poojari C.A., and Varghese B. Genetic algorithm based technique for solving chance constrained problems. European Journal of Operational Research 185 3 (2008) 1128-1154
    • (2008) European Journal of Operational Research , vol.185 , Issue.3 , pp. 1128-1154
    • Poojari, C.A.1    Varghese, B.2
  • 17
    • 26444552169 scopus 로고    scopus 로고
    • Combining metaheuristics and exact algorithms in combinatorial optimization: A survey and classification
    • First International Work-Conference on the Interplay Between Natural and Artificial Computation, Springer, pp
    • Puchinger, J., Raidl, G.R., 2005. Combining metaheuristics and exact algorithms in combinatorial optimization: a survey and classification. In: First International Work-Conference on the Interplay Between Natural and Artificial Computation. Lecture Notes in Computer Science, vol. 3562. Springer, pp. 41-53.
    • (2005) Lecture Notes in Computer Science , vol.3562 , pp. 41-53
    • Puchinger, J.1    Raidl, G.R.2
  • 18
    • 46949084856 scopus 로고    scopus 로고
    • Raidl, G.R., Puchinger, J., 2008. Combining (integer) linear programming techniques and metaheuristics for combinatorial optimization. In: Blum, C., Blesa Aguilera, M.J., Roli, A., Sampels, M. (Eds.), Hybrid Metaheuristics, An Emerging Approach to Optimization. Series: Studies in Computational Intelligence, 114, pp. 31-62.
    • Raidl, G.R., Puchinger, J., 2008. Combining (integer) linear programming techniques and metaheuristics for combinatorial optimization. In: Blum, C., Blesa Aguilera, M.J., Roli, A., Sampels, M. (Eds.), Hybrid Metaheuristics, An Emerging Approach to Optimization. Series: Studies in Computational Intelligence, vol. 114, pp. 31-62.
  • 19
    • 0001017536 scopus 로고    scopus 로고
    • Genetic algorithms for the operations researcher
    • Reeves C.R. Genetic algorithms for the operations researcher. INFORMS Journal on Computing 9 (1997) 231-250
    • (1997) INFORMS Journal on Computing , vol.9 , pp. 231-250
    • Reeves, C.R.1
  • 20
    • 67649933845 scopus 로고    scopus 로고
    • Accelerating Benders decomposition by local branching
    • in press. doi:10.1287/ijoc.1080.0296
    • Rei, W., Gendreau, M., Cordeau, J.-F., Soriano, P., 2006. Accelerating Benders decomposition by local branching. INFORMS Journal on Computing, in press. doi:10.1287/ijoc.1080.0296.
    • (2006) INFORMS Journal on Computing
    • Rei, W.1    Gendreau, M.2    Cordeau, J.-F.3    Soriano, P.4


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