A general variable neighborhood search for solving the uncapacitated single allocation p-hub median problem

European Journal of Operational Research

Volumn 206, Issue 2, 2010, Pages 289-300

  Ilić, Aleksandar ^a   Urošević, Dragan ^b   Brimberg, Jack ^c   Mladenović, Nenad ^d  

^a UNIVERSITY OF NI   (Serbia)

^b MATHEMATICAL INSTITUTE   (Serbia)

^c ROYAL MILITARY COLLEGE OF CANADA   (Canada)

^d BRUNEL UNIVERSITY   (United Kingdom)

Author keywords

Discrete location; Nested variable neighborhood descent; p Hub median; Variable neighborhood search

Indexed keywords

AUSTRALIA; COMPUTATIONAL EFFORT; DISCRETE LOCATION; IN-NETWORK; LOCAL SEARCH; NP-HARD PROBLEM; ORIGIN-DESTINATION PAIRS; P - HUB MEDIAN PROBLEMS; PLANETLAB; SOLUTION QUALITY; TEST INSTANCES; VARIABLE NEIGHBORHOOD SEARCH;

DATA STRUCTURES;

LOCATION;

EID: 77950459586     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2010.02.022     Document Type: Article

References (22)

1. Alumur S., and Kara B.Y. Network hub location problems: The state of the art. European Journal of Operational Research 190 (2008) 1-21
2. Banerjee, S., Griffin, T.G., Pias, M., 2004. The interdomain connectivity of PlanetLab nodes. In: Barakat, C., Pratt, I. (Eds.), Proceedings of the 5th International Workshop on Passive and Active Network Measurement.
3. Campbell, J.F., 1991. Hub location problems and the p-hub median problem, Center for Business and Industrial Studies Working Paper 91-06-21, University of Missouri-St. Louis, St. Louis.
4. Ernst A.T., and Krishnamoorthy M. Efficient algorithms for the uncapacitated single allocation p-hub median problem. Location Science 4 (1996) 130-154
5. Ernst A.T., and Krishnamoorthy M. An exact solution approach based on shortest-paths for p-hub median problems. Informs Journal on Computing 10 (1998) 149-162
6. Hansen P., and Mladenović N. Developments of variable neighborhood search. In: Ribeiro C., and Hansen P. (Eds). Essays and Surveys in Metaheuristics (2001), Kluwer 415-440
7. Hansen P., and Mladenović N. Variable neighborhood search: Principles and applications. European Journal of Operational Research 130 (2001) 449-467
8. Hansen P., and Mladenović N. Variable neighborhood search. In: Glover F., and Kochenberger G. (Eds). Handbook of Metaheuristics (2003), Kluwer Academic Publisher, New York 145-184
9. Hansen P., Mladenović N., and Pérez J.A.M. Variable neighborhood search. European Journal of Operational Research 191 (2008) 593-595
10. Hansen P., Mladenović N., and Moreno-Perez J.A. Variable neighborhood search: Methods and applications. 4OR 6 (2008) 319-360
11. Klincewicz J.G. Heuristics for the p-hub location problem. European Journal of Operational Research 53 (1991) 25-37
12. Klincewicz J.G. Avoiding local optima in the p-hub location problem using tabu search and GRASP. Annals of Operations Research 40 (1992) 283-302
13. Kratica J., Stanimirović Z., Tošić D., and Filipović V. Two genetic algorithms for solving the uncapaciated single allocation p-hub problem. European Journal of Operational Research 182 (2007) 15-28
14. Kratica, J., Kojić, J., Tošić, D., Filipović, V., Dugošija, Dj., 2009. Two hybrid genetic algorithms for solving the super-peer selection problem, WSC2008 Conference, Advances in Soft Computing, Springer Verlag.
15. Love, R.F., Morris, J.G., Wesolowsky, G. 1996. Facility Location: Models and Methods, vol. 7. Publications in Operations Research, New York.
16. Meyer T., Ernst A.T., and Krishnamoorthy M. A 2-phase algorithm for solving the single allocation p-hub center problem. Computers and Operations Research 36 (2009) 3143-3151
17. Mladenović N., and Hansen P. Variable neighborhood search. Computers and Operations Research 24 (1997) 1097-1100
18. O'Kelly M. A quadratic integer program for the location of interacting hub facilities. European Journal of Operational Research 32 (1987) 393-404
19. Pérez-Pérez M., Almeida-Rodríguez F., and Moreno-Vega J.M. On the use of the path relinking for the p-hub median problem. Lecture Notes in Computer Science 3004 (2004) 155-164
20. Pérez-Pérez M., Almeida-Rodríguez F., and Moreno-Vega J.M. A hybrid VNS-path relinking for the p-hub median problem. IMA Journal of Management Mathematics 18 (2007) 157-171
21. Skorin-Kapov D., and Skorin-Kapov J. On tabu search for the location of interacting hub facilities. European Journal of Operational Research 73 (1994) 502-509
22. Wolf, S., Merz, P., 2007. Evolutionary local search for the super-peer selection problem and the p-hub median problem. In: Bartz-Beielstein et al. (Eds.), Proceedings of the 4th International Workshop on Hybrid Metaheuristcs - HM2007, Lecture Notes in Computer Science, Springer, p. 1-15.