View - Universidad de Almería

158 Fuh-Hwa Franklin Liu, Chi-Wei ShihThe procedure allows one to set the bound tolerance in advance to obtain a narrow solutionbound to have shorter CPU time is another advantage of bisecting search method. For the realworldlarge scale problem, the mathematical optimal solution may be not desired. Instead,an acceptable narrow bound would be acceptable as a shorter CPU time that is achieved bysetting a bound tolerance. The proposed formulation (PC-SC2) and procedure are efficient inthe reasonable time limit and exact with good quality of the solution bounds.References[1] Beasley, J.E . (1990). " OR-Library: distributing test problems by electronic mail". Journal of the OperationalResearch Society 41, 1069-1072.[2] Daskin, M. (1995). Network and Discrete Location: Models, Algorithms and Applications. John Wiley and Sons, Inc.,New York.[3] Daskin, M. (2000). "A new approach to solving the vertex p-center problem to optimality: Algorithm andcomputational results". Communications of the Operations Research Society of Japan 45, 428-436.[4] Drezner, Z. (1984). "Thep-center problem: Heuristic and optimal algorithms". Journal of the Operational ResearchSociety 35, 741-748.[5] Elloumi, S., Labbe, M., Pochet, Y. (2004). " A New Formulation and Resolution Method for the p-center Problem".INFORMS Journal on Computing 16, 89-94.[6] Handler, G. Y. (1990). "p-center Problems, in Discrete Location Theory". John Wiley Inc., New York, 305-347.[7] Kariv, O., Hakimi, S. L. (1979). "An algorithmic approach to network location problems, Part 1: The p-centers".SIAM Journal on Applied Mathematics 37, 513-538.[8] Masuyama, S., Ibaraki, T., Hasegawa, T. (1981). "The computational complexity of the m-center problems onthe plane". Transactions IECE Japan E64, 57-64.[9] Owen, S. H., Daskin, M. S. (1998). "Strategic facility location: A review". Europe Journal of Operational Research111, 423-447.[10] Reinelt, G. (1991). "TSPLIB-a travelling salesman problem library". ORSA Journal on Computing 3, 376-384.