Heuristics for multiple facility location in a network using the variance criterion

Journal of the Operational Research Society

Volumn 51, Issue 8, 2000, Pages 971-981

  de Los Mozos, M C López ^a   Mesa, J A ^a  

^a UNIVERSITY OF SEVILLE   (Spain)

Author keywords

Facility location; Heuristics; Networks; Variance

Indexed keywords

APPROXIMATION THEORY; COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; FACILITIES; HEURISTIC METHODS; PROBLEM SOLVING; SET THEORY; SITE SELECTION;

MULTIPLE FACILITY LOCATION; VERTEX SETS;

OPERATIONS RESEARCH;

EID: 0342906627     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2600990     Document Type: Article

References (13)

1. Halpem J and Maimon O (1983). Accord and conflict among several objectives in locational decisions on tree networks. In: Thisse JF and Holler HG (eds). Locational Analysis of Public Facilities 1983. Series of Studies in Mathematical and Managerial Economics. North-Holland, Amsterdam, pp 301-314.
2. Maimon O (1986). The variance equity measure in locational decision theory. Annals Opns Res 6: 147-160.
3. Hansen P and Zheng M (1991). An algorithm for the minimum variance point of a network. RAIRO Recherche opérationnelle/ Opns Res 25: 119-126.
4. Kincaid RK and Maimon O (1989). Locating a point of minimum variance on triangular graphs. Transport Sci 23: 216-219.
5. Kincaid RK and Maimon O (1990). A note on locating a central vertex of a 3-cactus graph. Comput and Opns Res 17: 315-320.
6. Lopez de los Mozos MC and Mesa JA (1997). The 2-variance location problem in a tree network. Studies in Locational Analysis 11: 73-87.
7. Lopez de los Mozos MC (1997). Location in networks with the variance criterion (in Spanish). PhD thesis, Universidad de Sevilla.
8. Hooker JN, Garfinkel RS and Chen CK (1991). Finite dominating sets for network location problems. Opns Res 39: 100-118.
9. Labbé M, Peeters D and Thisse J-F (1995). Location on networks. In: Ball MO, Magnanti TL, Monma CL and Nem- hauser GL (eds). Network Routing. Handbooks in Operations Research and Management Science Vol 8. Elsevier, Amsterdam, pp 551-624.
10. Glover F (1989). Tabu Search. Part I. ORSA J on Comput 1: 190-206.
11. Glover F (1990). Tabu Search. Part II. ORSA J on Comput 2: 4-32.
12. Kincaid RK (1992). Good solutions to discrete noxious location problems via metaheuristics. Annals Opns Res 40: 265-281.
13. Mladenovic N and Hansen P (1997). Variable neighbourhood search. Comput and Opns Res 24: 1097-1100.