메뉴 건너뛰기




Volumn 7, Issue 1, 2001, Pages 23-36

Simulated N-body: New particle physics-based heuristics for a Euclidean location-allocation problem

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GRAPH THEORY; HIGH ENERGY PHYSICS; SIMULATED ANNEALING;

EID: 0035128031     PISSN: 13811231     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1026561511574     Document Type: Article
Times cited : (5)

References (27)
  • 2
    • 0002439750 scopus 로고
    • An Efficient Program for Many-Body Simulation
    • Appel, A.W. (1985). "An Efficient Program for Many-Body Simulation." SIAM J. Sci. Stat. Comput. 6, 85-103.
    • (1985) SIAM J. Sci. Stat. Comput. , vol.6 , pp. 85-103
    • Appel, A.W.1
  • 3
    • 84986927413 scopus 로고
    • A Location Model for a Facility Operating as an M/G/k Queue
    • Batta, R. and O. Berman. (1989). "A Location Model for a Facility Operating as an M/G/k Queue." Networks 19, 717-728.
    • (1989) Networks , vol.19 , pp. 717-728
    • Batta, R.1    Berman, O.2
  • 4
    • 0342629304 scopus 로고
    • Optimal 2-facility Network Districting in the Presence of Queueing
    • Berman, O. and R.C. Larson. (1982). "Optimal 2-facility Network Districting in the Presence of Queueing." Transportation Science 19(3), 207-216.
    • (1982) Transportation Science , vol.19 , Issue.3 , pp. 207-216
    • Berman, O.1    Larson, R.C.2
  • 5
    • 0022766304 scopus 로고
    • Location-Allocation on Congested Networks
    • Berman, O. and R.R. Mandowsky (1986). "Location-Allocation on Congested Networks." Euro. J. Oper. Res. 26(2), 238-250.
    • (1986) Euro. J. Oper. Res. , vol.26 , Issue.2 , pp. 238-250
    • Berman, O.1    Mandowsky, R.R.2
  • 6
    • 0021481361 scopus 로고
    • A Thermodynamically Motivated Simulation Procedure for Combinatorial Optimization Problems
    • Burkard, R.E. and R. Rendl. (1984). "A Thermodynamically Motivated Simulation Procedure for Combinatorial Optimization Problems." Euro. J. Oper. Res. 17, 169-174.
    • (1984) Euro. J. Oper. Res. , vol.17 , pp. 169-174
    • Burkard, R.E.1    Rendl, R.2
  • 7
    • 0343499494 scopus 로고    scopus 로고
    • Algorithms for Mapping Task Graphs to a Network of Hetergeneous Workstations
    • Choi, H.-A., B. Narahari, and R. Simha. (1997). "Algorithms for Mapping Task Graphs to a Network of Hetergeneous Workstations." In Proc. ADCOMP 97, 1997.
    • (1997) In Proc. ADCOMP , vol.97 , pp. 1997
    • Choi, H.-A.1    Narahari, B.2    Simha, R.3
  • 8
    • 0001138339 scopus 로고
    • Heuristic Methods for Location-Allocation Problems
    • Cooper, L. (1964). "Heuristic Methods for Location-Allocation Problems." SIAM Review 6, 37-53.
    • (1964) SIAM Review , vol.6 , pp. 37-53
    • Cooper, L.1
  • 10
    • 0343935376 scopus 로고
    • Location Theory: A Selective Bibliography
    • Francis, R.L. and J.M. Goldstein. (1974). "Location Theory: A Selective Bibliography." Operations Research 22, 400-410.
    • (1974) Operations Research , vol.22 , pp. 400-410
    • Francis, R.L.1    Goldstein, J.M.2
  • 12
    • 0030168535 scopus 로고    scopus 로고
    • Comparison of Genetic Algorithms, Random Restart and Two-Opt Switching for Solving Large Location-Allocation Problems
    • Houck, C.R., J.A. Joines, and M.G. Kay. (1996). "Comparison of Genetic Algorithms, Random Restart and Two-Opt Switching for Solving Large Location-Allocation Problems." Computers & Operations Research 23(6), 587.
    • (1996) Computers & Operations Research , vol.23 , Issue.6 , pp. 587
    • Houck, C.R.1    Joines, J.A.2    Kay, M.G.3
  • 13
    • 49049125381 scopus 로고
    • Heuristics for the Capacitated Plant Location Model
    • Jacobsen, S.K. (1982). "Heuristics for the Capacitated Plant Location Model." European Journal of Operational Research 12, 253-261.
    • (1982) European Journal of Operational Research , vol.12 , pp. 253-261
    • Jacobsen, S.K.1
  • 14
    • 0343063571 scopus 로고
    • A Method of Districting among Facilities
    • Keeney, R.L. (1972). "A Method of Districting Among Facilities." Operations Research 20(3), 613-618.
    • (1972) Operations Research , vol.20 , Issue.3 , pp. 613-618
    • Keeney, R.L.1
  • 15
    • 84990479742 scopus 로고
    • An Efficient Heuristic Procedure for Partitioning Graphs
    • Kernighan, B.W. and S. Lin. (1970). "An Efficient Heuristic Procedure for Partitioning Graphs." Bell Sys. Tech. J. 49, 291-307.
    • (1970) Bell Sys. Tech. J. , vol.49 , pp. 291-307
    • Kernighan, B.W.1    Lin, S.2
  • 16
    • 84958039556 scopus 로고    scopus 로고
    • The Capacitated k-Center Problem
    • Berlin: Springer-Verlag
    • Khuller, S. and Y. Sussman. (1996). "The Capacitated k-Center Problem." Berlin: Springer-Verlag. Lecture Notes in Computer Science, Vol. 1136.
    • (1996) Lecture Notes in Computer Science , vol.1136
    • Khuller, S.1    Sussman, Y.2
  • 18
    • 0342629301 scopus 로고
    • An Annealing Approach to Multi-Facility Location Problems in Euclidean Space
    • Maffioli, F. and G. Righini. (1994). "An Annealing Approach to Multi-Facility Location Problems in Euclidean Space." Location Science 2(4), 205-222.
    • (1994) Location Science , vol.2 , Issue.4 , pp. 205-222
    • Maffioli, F.1    Righini, G.2
  • 20
    • 0030736572 scopus 로고    scopus 로고
    • An Efficient Tabu Search Procedure for the p-Median Problem
    • Rolland, E., D.A. Schilling, and J.R. Current. (1996). "An Efficient Tabu Search Procedure for the p-Median Problem." Euro. J. Op. Res. 96, 329-342.
    • (1996) Euro. J. Op. Res. , vol.96 , pp. 329-342
    • Rolland, E.1    Schilling, D.A.2    Current, J.R.3
  • 21
    • 0026281722 scopus 로고
    • Towards the Solution of the (Generalized) Multi-Weber Problem
    • Rosing, K.E. (1991). "Towards the Solution of the (Generalized) Multi-Weber Problem." Environment and Planning, Series B 18, 347-360.
    • (1991) Environment and Planning, Series b , vol.18 , pp. 347-360
    • Rosing, K.E.1
  • 22
    • 0022180578 scopus 로고
    • Facility Layout Optimization Using the Metropolis Algorithm
    • Sharpe, R. and B.S. Marksjo (1985). "Facility Layout Optimization Using the Metropolis Algorithm." Environment and Planning B 12, 443-453.
    • (1985) Environment and Planning b , vol.12 , pp. 443-453
    • Sharpe, R.1    Marksjo, B.S.2
  • 25
    • 0002554224 scopus 로고
    • Astrophysical N-body Simulation Using Hierarchical Tree Data Structures
    • 1992
    • Warren, M.S. and J.K. Salmon. (1992). "Astrophysical N-body Simulation Using Hierarchical Tree Data Structures." In Proc. Supercomputing 92, 1992, pp. 570-576.
    • (1992) Proc. Supercomputing , vol.92 , pp. 570-576
    • Warren, M.S.1    Salmon, J.K.2
  • 27
    • 0343063568 scopus 로고
    • Location and Network Design
    • O'Eigeartaigh et al. (eds), New York: John Wiley and Sons
    • Wong, R.T. (1985). "Location and Network Design." In O'Eigeartaigh et al. (eds), Combinatorial Optimization: Annotated Bibliographies. New York: John Wiley and Sons.
    • (1985) Combinatorial Optimization: Annotated Bibliographies
    • Wong, R.T.1


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