메뉴 건너뛰기




Volumn , Issue , 2005, Pages 141-145

A genetic algorithm for solving the p-median problem

Author keywords

Christensen grammar; Grammar evolution; Location allocation problem; P median model

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; MODAL ANALYSIS;

EID: 84898403867     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (2)

References (19)
  • 2
    • 84873446636 scopus 로고    scopus 로고
    • Acceleration of a procedure to generate fractal curves of a given dimension through the probabilistic analysis of execution time
    • ed. C.H.Dagli, A.L.Buczak, D.L.Enke, M.J.Embrechts, O.Ersoy, ASME Press, New York, 2004
    • Cebrián, M., Ortega, A., Alfonseca, M. 2004: Acceleration of a procedure to generate fractal curves of a given dimension through the probabilistic analysis of execution time, in Intelligent Engineering Systems Through Artificial Neural Networks, Vol. 14, ed. C.H.Dagli, A.L.Buczak, D.L.Enke, M.J.Embrechts, O.Ersoy, pp. 265-270, ASME Press, New York, 2004.
    • (2004) Intelligent Engineering Systems Through Artificial Neural Networks , vol.14 , pp. 265-270
    • Cebrián, M.1    Ortega, A.2    Alfonseca, M.3
  • 3
    • 84976787686 scopus 로고
    • A survey of adaptable grammars
    • November 1990
    • Christiansen, H. 1990: A Survey of Adaptable Grammars, ACMSIGPLAN Notices, vol. 25, no 11. November 1990, pp. 35-44.
    • (1990) ACMSIGPLAN Notices , vol.25 , Issue.11 , pp. 35-44
    • Christiansen, H.1
  • 6
    • 0002982230 scopus 로고
    • A more efficient heuristic for solving large p-median problems
    • Densham, P., Rushton, G. 1992: A More Efficient Heuristic for Solving Large P-Median Problems, Papers in Regional Science 71, pp. 307-329.
    • (1992) Papers in Regional Science , vol.71 , pp. 307-329
    • Densham, P.1    Rushton, G.2
  • 9
    • 0021334667 scopus 로고
    • The p-median structure as a unified linear model for location allocation analysis
    • Hilsman, E. 1984: The P-Median Structure as a Unified Linear Model for Location Allocation Analysis, Environment and Planning A, Vol. 16, pp. 305-318.
    • (1984) Environment and Planning A , vol.16 , pp. 305-318
    • Hilsman, E.1
  • 10
    • 0011425993 scopus 로고
    • Toward more realistic allocation in locati on-allocation models: An interaction approach
    • Hodgson, M. 1978: Toward More Realistic Allocation in Locati on-allocation Models: An Interaction Approach, Environment and Planning A, 10, pp. 1273-85.
    • (1978) Environment and Planning A , vol.10 , pp. 1273-1285
    • Hodgson, M.1
  • 12
    • 22944485380 scopus 로고    scopus 로고
    • Computational experiments with genetic algorithms applied to set covering problems
    • Lorena, L., Lopes,.L.S. 1996: Computational experiments with genetic algorithms applied to set covering problems, Pesquisa Operacional, 16:41-53.
    • (1996) Pesquisa Operacional , vol.16 , pp. 41-53
    • Lorena, L.1    Lopes, L.S.2
  • 13
    • 0021373110 scopus 로고
    • On the complexity of some common geometric location problems
    • Megiddo, N., Supowit, J. 1984: On the Complexity of Some Common Geometric Location Problems, SIAM J. Computing 13, pp. 182-196.
    • (1984) SIAM J. Computing , vol.13 , pp. 182-196
    • Megiddo, N.1    Supowit, J.2
  • 17
    • 1442264360 scopus 로고
    • A thesis submitted to the Faculty of the Worcester Polytechnic Institute in partial fulfillment of the requirements for the degree of Master of Science in Computer Science, August 10 (amended December 16, 2003
    • Shutt, J. N. 1993 : Recursive Adaptable Grammars. A thesis submitted to the Faculty of the Worcester Polytechnic Institute in partial fulfillment of the requirements for the degree of Master of Science in Computer Science, August 10 (amended December 16, 2003)
    • (1993) Recursive Adaptable Grammars
    • Shutt, J.N.1
  • 18
    • 0000191523 scopus 로고
    • Heuristic methods for estimating the generalized vertex median of a weighted graph
    • Teitz, M., Bart, P. 1968: Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph, Operations Research, Vol. 16, 1968, pp. 955-961.
    • (1968) Operations Research , vol.16 , Issue.1968 , pp. 955-961
    • Teitz, M.1    Bart, P.2
  • 19
    • 0020747698 scopus 로고
    • A fast algorithm for the greedy interchange of large-scale clustering and median location problems
    • Whitaker, R. 1983: A Fast Algorithm for the Greedy Interchange of Large-Scale Clustering and Median Location Problems, INFOR, Vol. 21, pp. 95-108.
    • (1983) INFOR , vol.21 , pp. 95-108
    • Whitaker, R.1


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