메뉴 건너뛰기




Volumn 328, Issue 2, 2007, Pages 1178-1187

Solving the unconstrained optimization problem by a variable neighborhood search

Author keywords

Global optimization; Meta heuristics; Variable neighborhood search

Indexed keywords


EID: 33845871194     PISSN: 0022247X     EISSN: 10960813     Source Type: Journal    
DOI: 10.1016/j.jmaa.2006.06.025     Document Type: Article
Times cited : (27)

References (27)
  • 1
    • 0031277168 scopus 로고    scopus 로고
    • A tabu search Hooke and Jeeves algorithm for unconstrained optimization
    • Al-Sultan K.S., and Al-Fawzan M.A. A tabu search Hooke and Jeeves algorithm for unconstrained optimization. European J. Oper. Res. 1003 (1997) 198-208
    • (1997) European J. Oper. Res. , vol.1003 , pp. 198-208
    • Al-Sultan, K.S.1    Al-Fawzan, M.A.2
  • 2
    • 0023416976 scopus 로고
    • Minimizing multimodal functions of continuous variables with the Simulated Annealing algorithm
    • Corana A., Marchesi M., Martini C., and Ridella S. Minimizing multimodal functions of continuous variables with the Simulated Annealing algorithm. ACM Trans. Math. Software 3/3 (1987) 262-280
    • (1987) ACM Trans. Math. Software , vol.3-3 , pp. 262-280
    • Corana, A.1    Marchesi, M.2    Martini, C.3    Ridella, S.4
  • 4
    • 33645856653 scopus 로고
    • Global optimization by simulated annealing
    • Dekkers A., and Aarts E. Global optimization by simulated annealing. Math. Programming 50 (1991) 367-393
    • (1991) Math. Programming , vol.50 , pp. 367-393
    • Dekkers, A.1    Aarts, E.2
  • 5
    • 0027186731 scopus 로고
    • Optimization of multi-modal discrete functions using genetic algorithms
    • Pham D.T., and Yang Y. Optimization of multi-modal discrete functions using genetic algorithms. Proc. Inst. Mechanical Engineers 207 (1993) 53-59
    • (1993) Proc. Inst. Mechanical Engineers , vol.207 , pp. 53-59
    • Pham, D.T.1    Yang, Y.2
  • 6
    • 5644257221 scopus 로고    scopus 로고
    • Global optimizations and tabu search based on memory
    • Ji M., and Tang H. Global optimizations and tabu search based on memory. Appl. Math. Comput. 159 (2004) 449-457
    • (2004) Appl. Math. Comput. , vol.159 , pp. 449-457
    • Ji, M.1    Tang, H.2
  • 7
    • 0031281221 scopus 로고    scopus 로고
    • Variable neighborhood search
    • Mladenovic N., and Hansen P. Variable neighborhood search. Comput. Oper. Res. 24 11 (1997) 1097-1100
    • (1997) Comput. Oper. Res. , vol.24 , Issue.11 , pp. 1097-1100
    • Mladenovic, N.1    Hansen, P.2
  • 8
    • 0034818087 scopus 로고    scopus 로고
    • Variable neighborhood search: Principles and applications
    • Hansen P., and Mladenovic N. Variable neighborhood search: Principles and applications. European J. Oper. Res. 130 (2001) 449-467
    • (2001) European J. Oper. Res. , vol.130 , pp. 449-467
    • Hansen, P.1    Mladenovic, N.2
  • 9
    • 26844532930 scopus 로고    scopus 로고
    • Solving the p-median problem with pos/neg weights by variable neighborhood search and some results for special cases
    • Fathali J., and Kakhki H.T. Solving the p-median problem with pos/neg weights by variable neighborhood search and some results for special cases. European J. Oper. Res. 170 2 (2006) 440-462
    • (2006) European J. Oper. Res. , vol.170 , Issue.2 , pp. 440-462
    • Fathali, J.1    Kakhki, H.T.2
  • 10
    • 1642436954 scopus 로고    scopus 로고
    • Solving the resource-constrained project scheduling problem by a variable neighborhood search
    • Fleszar K., and Hindi K.S. Solving the resource-constrained project scheduling problem by a variable neighborhood search. European J. Oper. Res. 155 (2004) 402-413
    • (2004) European J. Oper. Res. , vol.155 , pp. 402-413
    • Fleszar, K.1    Hindi, K.S.2
  • 11
    • 29144447717 scopus 로고    scopus 로고
    • Sequential search and its application to vehicle-routing problems
    • Irnich S., Funke B., and Grünert T. Sequential search and its application to vehicle-routing problems. Comput. Oper. Res. 33 8 (2006) 2405-2429
    • (2006) Comput. Oper. Res. , vol.33 , Issue.8 , pp. 2405-2429
    • Irnich, S.1    Funke, B.2    Grünert, T.3
  • 12
    • 33845906799 scopus 로고    scopus 로고
    • J. Kytöjoki, T. Nuortio, O. Bräysy, M. Gendreau, An efficient variable neighborhood search heuristic for very large scale vehicle routing problems, Comput. Oper. Res., 2005, in press
  • 13
    • 33845879803 scopus 로고    scopus 로고
    • J. Blazewicz, E. Pesch, M. Sterna, F. Werner, Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date, Comput. Oper. Res., 2006, in press
  • 14
    • 34047181001 scopus 로고    scopus 로고
    • D. Anghinolfi, M. Paolucci, Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach, Comput. Oper. Res., 2006, in press
  • 15
    • 33845883969 scopus 로고    scopus 로고
    • M.F. Tasgetiren, Y.-C. Liang, M. Sevkli, G. Gencyilmaz, A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem, European J. Oper. Res., 2006, in press
  • 16
    • 0042021863 scopus 로고    scopus 로고
    • A variable neighborhood search for graph coloring
    • Avanthay C., Hertz A., and Zufferey N. A variable neighborhood search for graph coloring. European J. Oper. Res. 151 2 (2003) 379-388
    • (2003) European J. Oper. Res. , vol.151 , Issue.2 , pp. 379-388
    • Avanthay, C.1    Hertz, A.2    Zufferey, N.3
  • 17
    • 4944245585 scopus 로고    scopus 로고
    • Variable neighborhood search for the maximum clique
    • Hansen P., Mladenoviç N., and Uroseviç D. Variable neighborhood search for the maximum clique. Discrete Appl. Math. 145 1 (2004) 117-125
    • (2004) Discrete Appl. Math. , vol.145 , Issue.1 , pp. 117-125
    • Hansen, P.1    Mladenoviç, N.2    Uroseviç, D.3
  • 18
    • 33646130159 scopus 로고    scopus 로고
    • Ant colony optimization for finding the global minimum
    • Toksari M.D. Ant colony optimization for finding the global minimum. Appl. Math. Comput. 176 1 (2006) 308-316
    • (2006) Appl. Math. Comput. , vol.176 , Issue.1 , pp. 308-316
    • Toksari, M.D.1
  • 19
    • 33645142276 scopus 로고    scopus 로고
    • Variable neighborhood search for the linear ordering problem
    • Garcia G.C., Perez-Brito D., Campos V., and Marti R. Variable neighborhood search for the linear ordering problem. Comput. Oper. Res. 33 (2006) 3549-3565
    • (2006) Comput. Oper. Res. , vol.33 , pp. 3549-3565
    • Garcia, G.C.1    Perez-Brito, D.2    Campos, V.3    Marti, R.4
  • 20
    • 0012936468 scopus 로고
    • The global optimization problem: an introduction
    • Dixon L.C.W., and Szegö G.P. (Eds), North-Holland, Amsterdam
    • Dixon L.C.W., and Szegö G.P. The global optimization problem: an introduction. In: Dixon L.C.W., and Szegö G.P. (Eds). Towards Global Optimization 2 (1978), North-Holland, Amsterdam 1-15
    • (1978) Towards Global Optimization 2 , pp. 1-15
    • Dixon, L.C.W.1    Szegö, G.P.2
  • 22
    • 0003241007 scopus 로고
    • A controlled random search procedure for global optimization
    • Dixon L.C.W., and Szegö G.P. (Eds), North-Holland, Amsterdam
    • Price W.L. A controlled random search procedure for global optimization. In: Dixon L.C.W., and Szegö G.P. (Eds). Towards Global Optimization 2 (1978), North-Holland, Amsterdam 71-84
    • (1978) Towards Global Optimization 2 , pp. 71-84
    • Price, W.L.1
  • 23
    • 0003271565 scopus 로고
    • A search-clustering approach to global optimization
    • Dixon L.C.W., and Szegö G.P. (Eds), North-Holland, Amsterdam
    • Törn A. A search-clustering approach to global optimization. In: Dixon L.C.W., and Szegö G.P. (Eds). Towards Global Optimization 2 (1978), North-Holland, Amsterdam 49-62
    • (1978) Towards Global Optimization 2 , pp. 49-62
    • Törn, A.1
  • 24
    • 1842798446 scopus 로고
    • Dixon L.C.W., and Szegö G.P. (Eds), North-Holland, Amsterdam
    • De Biase L. In: Dixon L.C.W., and Szegö G.P. (Eds). Towards Global Optimization 2 (1978), North-Holland, Amsterdam 85-102
    • (1978) Towards Global Optimization 2 , pp. 85-102
    • De Biase, L.1
  • 25
    • 0023419959 scopus 로고
    • Stochastic global optimization methods part II: Multi level methods
    • Rinnooy Kan A.H.G., and Timmer G.T. Stochastic global optimization methods part II: Multi level methods. Math. Programming 39 (1987) 57-78
    • (1987) Math. Programming , vol.39 , pp. 57-78
    • Rinnooy Kan, A.H.G.1    Timmer, G.T.2
  • 26
    • 0000238336 scopus 로고
    • A simplex method for function minimization
    • Nelder J.A., and Mead R. A simplex method for function minimization. Computer J. 7 (1964) 308-313
    • (1964) Computer J. , vol.7 , pp. 308-313
    • Nelder, J.A.1    Mead, R.2
  • 27
    • 0000350550 scopus 로고
    • A global optimization algorithm using adaptive random search
    • Masri S.E., Bekcy G.A., and Safford E.B. A global optimization algorithm using adaptive random search. Appl. Math. Comput. 7 (1980) 353-375
    • (1980) Appl. Math. Comput. , vol.7 , pp. 353-375
    • Masri, S.E.1    Bekcy, G.A.2    Safford, E.B.3


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