Solving the conditional and unconditional p-center problem with modified harmony search: A real case study

Scientia Iranica

Volumn 18, Issue 4 A, 2011, Pages 867-877

  Kaveh, A ^a   Nasr, H ^a  

^a IRAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Iran)

Author keywords

Bicycle stations; Conditional; Harmony search; P center problem; Unconditional

Indexed keywords

ENGINEERING; NATURAL SCIENCES; TABU SEARCH;

BICYCLE STATIONS; CONDITIONAL; HARMONY SEARCH; P-CENTER PROBLEMS; UNCONDITIONAL;

TABU SEARCH; HEURISTIC ALGORITHMS;

ALGORITHM; HARMONIC ANALYSIS; HEURISTICS; HISTORICAL GEOGRAPHY; HISTORICAL PERSPECTIVE; OPTIMIZATION;

ESFAHAN [ESFAHAN (PRV)]; ESFAHAN [IRAN]; IRAN;

EID: 80054801293     PISSN: 10263098     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.scient.2011.07.010     Document Type: Article

References (36)

1. Hakimi, S.L. "Optimum locations of switching centers and the absolute centers and medians of a graph", Journal of the Operational Research, 12, pp. 450-459 (1964).
2. (2] Hakimi, S.L. "Optimum distribution of switching centers in a communications network and some related graph theoretic problems", Journal of the Operational Research, 13, pp. 462-475 (1965).
3. Geem, Z.W., Kim, J.H. and Loganathan, G.V. "A new heuristic optimization algorithm: harmony search", Simulation, 76(2), pp. 60-68 (2001).
4. Geem, Z., Music-Inspired Harmony Search Algorithm, Springer (2009).
5. Kaveh, A. and Talatahari, S. "An efficient hybrid algorithm based on harmony search, particle swarm and ant colony strategies for optimal design of structures", In Harmony Search Algorithms for Structural Design, Z.W. Geem, Ed., Springer-Verlag (Chapter 5 of a Book Entitled) (2009).
6. Nadi, F., Tajudin Khader, A. and Azmi Al-Betar, M. "Adaptive genetic algorithm using harmony search", In Proceedings of the 12th Annual Conference on Genetic and Evolutionary Computation, GECCO'10, pp. 819-820, ACM, New York, NY, USA (2010).
7. Minieka, E."The m-centerproblem", SIAM Review, 12, pp. 139-140 (1970).
8. Zanjirani Farahani, R. and Hekmatfar, M. "Facility location concepts, models, algorithms and case studies", In Contributions to Management Science, In Physica, Springer, Heidelberg, London (2009).
9. Kariv, O. and Hakimi, S.L "An algorithmic approach to network location problems. Part 1: the p-centers problem", SIAM Journal of Applied Mathematics, 37, pp. 513-538 (1979).
10. Ilhan, T., Özsoy, F.A. and Pinar, M.C. "An efficient exact algorithm for the vertex p-center problem and computational experiments for different set covering subproblems", Bilkent University, Department of Industrial Engineering. Technical Report, 2002. Available at URL: http://www.optimization-online.org/DB-HTML/2002/12/588.html.
11. Elloumi, S., Labbe, M. and Pochet, Y. "A new formulation and resolution method for the p-center problem", INFORMS Journal of Computing, 16, pp. 84-94 (2004).
12. Handler, G.Y. and Mirchandani, P.B., Location on Networks: Theory and Algorithms, MIT Press, MA Cambridge (1979).
13. Daskin, M.S. "A new approach to solving the vertex p-center problem to optimality: algorithm and computational results", Communications of the Operations Research Society of Japan, 45(9), pp. 428-436 (2000).
14. Watson-Gandy, C.D.T. "The multi-facility min-max Weber problem", European Journal of Operational Research, 18, pp. 44-50 (1984).
15. Chen, D. and Chen, R. "New relaxation-based algorithms for the optimal solution of the continuous and discrete p-center problems", Computers & Operations Research, 36, pp. 1646-1655 (2009).
16. Chen, R. "Solution of minisum and minimax location-allocation problems with Euclidean distances", Naval Research Logistics Quarterly, 30, pp. 449-459 (1983).
17. Drezner, Z. "The p-center problem -heuristic and optimal algorithms". Journal of the Operational Research, 8, pp. 741-748 (1984).
18. Drezner, Z. "The planar two center and two median problems". Transportation Science, 18, pp. 351-361 (1984).
19. Toregas, C., Swain, R., ReVelle, C. and Bergmann, L. "The location of emergency service facilities", Journal of the Operational Research, 19, pp. 1363-1373 (1971).
20. Hwang, R.Z., Lee, R.C.T. and Cheng, R.C. "The slab dividing approach to solve the Euclidean p-center problem", Algorithmica, 9, pp. 1-22 (1993).
21. Suzuki, A. and Drezner, Z. "The p-center location problem in the area", Location Science, 4, pp. 69-82 (1996).
22. Caruso, C., Colorni, A. and Aloi, L. "Dominant, an algorithm for the p-center problem", European Journal of Operational Research, 149, pp. 53-64 (2003).
23. Mladenovic, N., Labbe, M. and Hansen, P. "Solving the p-center problem with Tabu search and variable neighborhood search", Networks, 42, pp. 48-64 (2003).
24. Pacheco, J.A. and Casado, S. "Solving two location models with few facilities by using a hybrid heuristic: a real health resources case", Computers & Operations Research, 32, pp. 3075-3091 (2005).
25. Kaveh, A. and Nasr, H. Greedy harmony search for solving p-median problems, Applied Soft Computing (2011) (submitted for publication).
26. Mahdavi, M., Fesanghary, M. and Damangir, E. "An improved harmony search algorithm for solving optimization problems", Applied Mathematics and Computation, 188, pp. 1567-1579 (2007).
27. Dijkstra, E.W. "A note on two problems in connexion with graphs". Numerische Mathematik, 1, pp. 269-271 (1959).
28. Beasley, J.E. "A note on solving large p-median problems", European Journal of Operational Research, 21, pp. 270-273 (1985).
29. Reinelt, G. "TSPLIB - a traveling salesman problem library", ORSA Journal on Computing, 3(4), pp. 376-384 (1991).
30. Handler, Y.G. and Mirchandani, P.B., Location on Networks Theory and Algorithms, MIT Press, Cambridge, MA (1979).
31. Lin, C.C. "A note about the new emergency facility insertion in an undirected connected graph", In The Sixth Annual Pittsburgh Conference on Modelling Simulation, Penn, Pittsburgh (1975).
32. Beramn, O. and Simchi-Levi, D. "The conditional location problem on networks", Transportation Science, 24, pp. 77-78 (1990).
33. Beramn, O. and Drezner, Z. "A new formulation for the conditional p-median and p-center problems", Operations Research Letters, 36, pp. 481-483 (2008).
34. Chen, D. and Chen, R. "A relaxation-based algorithm for solving the conditional p-center problem", Operations Research Letters, 38, pp. 215-217 (2010).
35. Kaveh, A., Shahrouzi, M. and Naserifar, Y. "Tuned genetic algorithms for finding p-median of a weighted graph", Scientia Iranica. Transaction A: Civil Engineering, 17(5), pp. 350-362 (2010).
36. Kaveh, A. and Shojaee, S. "Optimal domain decomposition via p-median methodology using ACO and hybrid ACGA", Finite Elements in Analysis and Design, 44(8), pp. 505-512 (2008).