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

M C López de los Mozos and J A Mesa
Additional contact information
M C López de los Mozos: Universidad de Sevilla
J A Mesa: Universidad de Sevilla

Journal of the Operational Research Society, 2000, vol. 51, issue 8, 971-981

Abstract: Abstract In cyclic networks the p-variance location problem is NP-hard, and therefore it is suitable to use heuristic methods to find approximate solutions to the problem. To this end, two strategies are explored, the first using combinatorial search procedures over the vertex set, whereas the second searches for the solution over the entire network. The initial vertex set solutions are generated by using tabu search, variable neighbourhood search and interchange procedures. The heuristics have been tested on instances of up to 30 vertices and 70 edges, and their performances compared.

Keywords: networks; heuristics; variance; facility location (search for similar items in EconPapers)
Date: 2000
References: Add references at CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1057/palgrave.jors.2600990 Abstract (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:pal:jorsoc:v:51:y:2000:i:8:d:10.1057_palgrave.jors.2600990

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/41274

DOI: 10.1057/palgrave.jors.2600990

Access Statistics for this article

Journal of the Operational Research Society is currently edited by Tom Archibald and Jonathan Crook

More articles in Journal of the Operational Research Society from Palgrave Macmillan, The OR Society
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().