메뉴 건너뛰기




Volumn 8, Issue 2, 2010, Pages 181-194

Attraction probabilities in variable neighborhood search

Author keywords

Attraction probabilities; Continuous location; Convergence; Metaheuristics; Variable neighborhood search

Indexed keywords


EID: 77952822571     PISSN: 16194500     EISSN: 16142411     Source Type: Journal    
DOI: 10.1007/s10288-009-0108-x     Document Type: Article
Times cited : (39)

References (19)
  • 1
    • 0000692965 scopus 로고
    • A new adaptive multi-start technique for combinatorial global optimizations
    • Boese KD, Kahng AB, Muddu S (1994) A new adaptive multi-start technique for combinatorial global optimizations. Oper Res Lett 16: 101-113.
    • (1994) Oper Res Lett , vol.16 , pp. 101-113
    • Boese, K.D.1    Kahng, A.B.2    Muddu, S.3
  • 2
    • 0034179704 scopus 로고    scopus 로고
    • Improvements and comparison of heuristics for solving the multisource Weber problem
    • Brimberg J, Hansen P, Mladenović N, Taillard É (2000) Improvements and comparison of heuristics for solving the multisource Weber problem. Oper Res 48(3): 444-460.
    • (2000) Oper Res , vol.48 , Issue.3 , pp. 444-460
    • Brimberg, J.1    Hansen, P.2    Mladenović, N.3    Taillard, É.4
  • 3
    • 0001138339 scopus 로고
    • Heuristic methods for location-allocation problems
    • Cooper L (1964) Heuristic methods for location-allocation problems. SIAM Rev 6: 37-53.
    • (1964) SIAM Rev , vol.6 , pp. 37-53
    • Cooper, L.1
  • 5
    • 10844231176 scopus 로고    scopus 로고
    • Efficiency of local search with multiple local optima
    • Garnier J, Kallel L (2000) Efficiency of local search with multiple local optima. SIAM J Discr Math 15: 122-141.
    • (2000) SIAM J Discr Math , vol.15 , pp. 122-141
    • Garnier, J.1    Kallel, L.2
  • 6
    • 84867962123 scopus 로고    scopus 로고
    • Tabu search and finite convergence
    • Glover F, Hanafi S (2002) Tabu search and finite convergence. Discrete Appl Math 119: 3-36.
    • (2002) Discrete Appl Math , vol.119 , pp. 3-36
    • Glover, F.1    Hanafi, S.2
  • 7
    • 0035124278 scopus 로고    scopus 로고
    • On the convergence of Tabu search
    • Hanafi S (2001) On the convergence of Tabu search. J Heuristics 7: 47-58.
    • (2001) J Heuristics , vol.7 , pp. 47-58
    • Hanafi, S.1
  • 8
    • 0031390388 scopus 로고    scopus 로고
    • Variable neighborhood search for the p-median
    • Hansen P, Mladenović N (1997) Variable neighborhood search for the p-median. Locat Sci 5: 207-226.
    • (1997) Locat Sci , vol.5 , pp. 207-226
    • Hansen, P.1    Mladenović, N.2
  • 9
    • 0034818087 scopus 로고    scopus 로고
    • Variable neihborhood search: Principles and applications
    • Hansen P, Mladenović N (2001a) Variable neihborhood search: principles and applications. Eur J Oper Res 130: 449-467.
    • (2001) Eur J Oper Res , vol.130 , pp. 449-467
    • Hansen, P.1    Mladenović, N.2
  • 10
    • 0012350818 scopus 로고    scopus 로고
    • Developments of variable neighborhood search
    • C. Ribeiro and P. Hansen (Eds.), Boston: Kluwer
    • Hansen P, Mladenović N (2001b) Developments of variable neighborhood search. In: Ribeiro C, Hansen P (eds) Essays and surveys in metaheuristics. Kluwer, Boston, pp 415-440.
    • (2001) Essays and Surveys in Metaheuristics , pp. 415-440
    • Hansen, P.1    Mladenović, N.2
  • 11
    • 57049126157 scopus 로고    scopus 로고
    • Variable neighborhood search: Methods and applications
    • Hansen P, Mladenović N, Moreno-Perez JA (2008) Variable neighborhood search: methods and applications. 4OR 6: 319-360.
    • (2008) 4or , vol.6 , pp. 319-360
    • Hansen, P.1    Mladenović, N.2    Moreno-Perez, J.A.3
  • 12
    • 0032010284 scopus 로고    scopus 로고
    • Heuristic solution of the multisource Weber problem as a p-median problem
    • Hansen P, Mladenović N, Taillard É (1998) Heuristic solution of the multisource Weber problem as a p-median problem. Oper Res Lett 22: 55-62.
    • (1998) Oper Res Lett , vol.22 , pp. 55-62
    • Hansen, P.1    Mladenović, N.2    Taillard, É.3
  • 13
    • 1042269053 scopus 로고    scopus 로고
    • Analyzing the performance of local search algorithms using generalized hill climbing algorithms
    • C. Ribeiro and P. Hansen (Eds.), Boston: Kluwer
    • Jacobson S (2001) Analyzing the performance of local search algorithms using generalized hill climbing algorithms. In: Ribeiro C, Hansen P (eds) Essays and surveys in metaheuristics. Kluwer, Boston, pp 441-467.
    • (2001) Essays and Surveys in Metaheuristics , pp. 441-467
    • Jacobson, S.1
  • 14
    • 84867959651 scopus 로고    scopus 로고
    • On the convergence of generalized hill climbing algorithms
    • Jonson AW, Jacobsen SH (2002) On the convergence of generalized hill climbing algorithms. Discrete Appl Math 119: 37-57.
    • (2002) Discrete Appl Math , vol.119 , pp. 37-57
    • Jonson, A.W.1    Jacobsen, S.H.2
  • 15
    • 0001260750 scopus 로고
    • Exact and approximate solutions to the multisource Weber problem
    • Kuenne RE, Soland RM (1972) Exact and approximate solutions to the multisource Weber problem. Math Program 3: 193-209.
    • (1972) Math Program , vol.3 , pp. 193-209
    • Kuenne, R.E.1    Soland, R.M.2
  • 16
    • 0031281221 scopus 로고    scopus 로고
    • Variable neighborhood search
    • Mladenović N, Hansen P (1997) Variable neighborhood search. Comput Oper Res 24: 1097-1100.
    • (1997) Comput Oper Res , vol.24 , pp. 1097-1100
    • Mladenović, N.1    Hansen, P.2
  • 18
    • 0026225350 scopus 로고
    • TSLIB-A traveling salesman library
    • Reinelt G (1991) TSLIB-A traveling salesman library. ORSA J Comput 3: 376-384.
    • (1991) ORSA J Comput , vol.3 , pp. 376-384
    • Reinelt, G.1
  • 19
    • 0020747698 scopus 로고
    • A fast algorithm for the greedy interchange for large-scale clustering and median location problems
    • Whitaker R (1983) A fast algorithm for the greedy interchange for large-scale clustering and median location problems. INFOR 21: 95-108.
    • (1983) Infor , vol.21 , pp. 95-108
    • Whitaker, R.1


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