메뉴 건너뛰기




Volumn 183, Issue 2, 2006, Pages 1071-1083

A genetic algorithm for the p-median problem with pos/neg weights

Author keywords

Genetic algorithm; Location theory; Obnoxious facilities; p Median problem

Indexed keywords

FUNCTIONS; GENETIC ALGORITHMS; GRAPH THEORY; OPTIMIZATION;

EID: 33845727619     PISSN: 00963003     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.amc.2006.05.143     Document Type: Article
Times cited : (21)

References (24)
  • 1
    • 0347126420 scopus 로고    scopus 로고
    • An efficient genetic algorithm for the p-median problem
    • Alp O., Erkut E., and Drezner Z. An efficient genetic algorithm for the p-median problem. Ann. Oper. Res. 122 (2003) 21-42
    • (2003) Ann. Oper. Res. , vol.122 , pp. 21-42
    • Alp, O.1    Erkut, E.2    Drezner, Z.3
  • 2
    • 56449107505 scopus 로고
    • OR-Library: distributing test problems by electronic mail
    • Beasley J.E. OR-Library: distributing test problems by electronic mail. J. Oper. Res. Soc. 41 11 (1990) 1069-1072
    • (1990) J. Oper. Res. Soc. , vol.41 , Issue.11 , pp. 1069-1072
    • Beasley, J.E.1
  • 3
    • 12344318797 scopus 로고    scopus 로고
    • A genetic algorithm for the p-median problem
    • Drezner Z., and Hamacher H. (Eds), Springer, Berlin
    • Bozkaya, Zhang J., and Erkut E. A genetic algorithm for the p-median problem. In: Drezner Z., and Hamacher H. (Eds). Facility Location: Applications and Theory (2002), Springer, Berlin
    • (2002) Facility Location: Applications and Theory
    • Bozkaya1    Zhang, J.2    Erkut, E.3
  • 4
    • 0031652975 scopus 로고    scopus 로고
    • A linear algorithm for the pos/neg-weighted 1-median problem on a cactus
    • Burkard R.E., and Krarup J. A linear algorithm for the pos/neg-weighted 1-median problem on a cactus. Computing 60 (1998) 193-215
    • (1998) Computing , vol.60 , pp. 193-215
    • Burkard, R.E.1    Krarup, J.2
  • 6
    • 33845733659 scopus 로고    scopus 로고
    • R.E. Burkard, J. Fathali, H.T. Kakhki, An ant colony algorithm for the pos/neg weighted p-median problem, SFB Report 322, Institute of Mathematics B, Graz University of Technology, 2004.
  • 7
    • 33845750138 scopus 로고    scopus 로고
    • R.E. Burkard, J. Fathali, A polynomial time method for the pos/neg weighted 3-median problem on a tree, SFB Report 333, Institute of Mathematics B, Graz University of Technology, 2004.
  • 8
    • 33845793952 scopus 로고    scopus 로고
    • P. Cappanera, A survey on obnoxious facility location problems, Technical Report: TR-99-11, Dipartimento di Informatica, Universita di Pisa, 1999.
  • 10
    • 0003229117 scopus 로고
    • Generating interesting alternatives in GIS and SDSS using genetic algorithms
    • University of Nebraska, Lincoln
    • Dibble C., and Densham P.J. Generating interesting alternatives in GIS and SDSS using genetic algorithms. GIS/LIS Symposium (1993), University of Nebraska, Lincoln
    • (1993) GIS/LIS Symposium
    • Dibble, C.1    Densham, P.J.2
  • 12
    • 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. Eur. J. Oper. Res. 170 (2006) 440-462
    • (2006) Eur. J. Oper. Res. , vol.170 , pp. 440-462
    • Fathali, J.1    Kakhki, H.T.2
  • 14
    • 0031390388 scopus 로고    scopus 로고
    • Variable neighborhood search for the p-median
    • Hansen P., and Mladenovic N. Variable neighborhood search for the p-median. Location Sci. 5 (1997) 207-226
    • (1997) Location Sci. , vol.5 , pp. 207-226
    • Hansen, P.1    Mladenovic, N.2
  • 15
    • 0041777620 scopus 로고
    • Discrete space location-allocation solutions from genetic algorithms
    • Hosage M., and Goodchild M.F. Discrete space location-allocation solutions from genetic algorithms. Ann. Oper. Res. 6 (1986) 35-46
    • (1986) Ann. Oper. Res. , vol.6 , pp. 35-46
    • Hosage, M.1    Goodchild, M.F.2
  • 16
    • 0018678438 scopus 로고
    • An algorithmic approach to network location problems. Part II: p-medians
    • Kariv O., and Hakimi S.L. An algorithmic approach to network location problems. Part II: p-medians. SIAM J. Appl. Math. 37 (1979) 539-560
    • (1979) SIAM J. Appl. Math. , vol.37 , pp. 539-560
    • Kariv, O.1    Hakimi, S.L.2
  • 17
    • 0000369468 scopus 로고
    • A heuristic program for locating warehouses
    • Kuehn A.A., and Hamburger M.J. A heuristic program for locating warehouses. Manage. Sci. 9 (1963) 643-666
    • (1963) Manage. Sci. , vol.9 , pp. 643-666
    • Kuehn, A.A.1    Hamburger, M.J.2
  • 18
    • 33845794413 scopus 로고    scopus 로고
    • J.A. Moreno-Perez, J.M. Moreno-Vega, N. Mladenovic, Tabu search and simulated annealing in p-median problems, in: Talk at the Canadian Operational Research Society Conference, Montral, 1994.
  • 19
    • 0002669593 scopus 로고    scopus 로고
    • Optimal location of undesirable facilities: an overview
    • Plastria F. Optimal location of undesirable facilities: an overview. Belg. J. Oper. Res. Statist. Comput. Sci. 36 (1996) 109-127
    • (1996) Belg. J. Oper. Res. Statist. Comput. Sci. , vol.36 , pp. 109-127
    • Plastria, F.1
  • 20
    • 2142808199 scopus 로고    scopus 로고
    • A hybrid heuristic for the p-median problem
    • Resende M.G.C., and Werneck R. A hybrid heuristic for the p-median problem. J. Heuristics 10 (2004) 59-88
    • (2004) J. Heuristics , vol.10 , pp. 59-88
    • Resende, M.G.C.1    Werneck, R.2
  • 21
    • 0002839560 scopus 로고
    • Genetic algorithms
    • Reeves C.R. (Ed), Blackwell Scientific Press, Oxford Chapter 4
    • Reeves C.R. Genetic algorithms. In: Reeves C.R. (Ed). Modern Heuristic Techniques for Combinatorial Problems (1993), Blackwell Scientific Press, Oxford 151-196 Chapter 4
    • (1993) Modern Heuristic Techniques for Combinatorial Problems , pp. 151-196
    • Reeves, C.R.1
  • 22
    • 0030736572 scopus 로고    scopus 로고
    • An efficient tabu search heuristic for the p-median problem
    • Rolland E., Schilling D.A., and Current J.R. An efficient tabu search heuristic for the p-median problem. Eur. J. Oper. Res. 96 (1996) 329-342
    • (1996) Eur. J. Oper. Res. , vol.96 , pp. 329-342
    • Rolland, E.1    Schilling, D.A.2    Current, J.R.3
  • 23
    • 0000191523 scopus 로고
    • Heuristic methods for estimating generalized vertex median of a weighted graph
    • Teitz M.B., and Bart P. Heuristic methods for estimating generalized vertex median of a weighted graph. Oper. Res. 16 (1968) 955-961
    • (1968) Oper. Res. , vol.16 , pp. 955-961
    • Teitz, M.B.1    Bart, P.2
  • 24
    • 0020747698 scopus 로고
    • A fast algorithm for the greedy interchange for large-scale clustering and median location problems
    • Whitaker R. A fast algorithm for the greedy interchange for large-scale clustering and median location problems. INFOR 21 (1983) 95-108
    • (1983) INFOR , vol.21 , pp. 95-108
    • Whitaker, R.1


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