The Minisum Multipurpose Trip Location Problem on Networks

References

• Al-Sultan K. S., Al-Fawzan M. A. A tabu search approach to the uncapacitated facility location problem. Ann. Oper. Res. (1999) 86:91–103Crossref, Google Scholar
• Barros A. I.Discrete and Fractional Programming Techniques for Location Models, Vol. 3. Combinatorial Optimization (1998) (Kluwer Academic Publishers, Boston, MA) Google Scholar
• Beasley J. E. Lagrangean heuristics for location problems. Eur. J. Oper. Res. (1993) 65:383–399Crossref, Google Scholar
• Berman O., Huang R. The minisum collection depots location problem with multiple facilities on a network. J. Oper. Res. Soc. (2004) 55:769–779Crossref, Google Scholar
• Berman O., Drezner Z., Wesolowsky G. O. The collection depots location problem on networks. Naval Res. Logist. (2002) 49:15–24Crossref, Google Scholar
• Church R., ReVelle C. The maximal covering location problem. Papers Regional Sci. Association (1974) 32:101–118Crossref, Google Scholar
• Crowder H. Computational improvements for subgradient optimization. Symposia Mathematica (1976) 19:357–372Google Scholar
• Daskin M. S.Network and Discrete Location: Models, Algorithms and Applications (1995) (John Wiley & Sons, New York) Crossref, Google Scholar
• Erlenkoter D. A dual-based procedure for uncapacitated facility location. Oper. Res. (1978) 26:992–1009Link, Google Scholar
• Gao L. L., Robinson E. P. A dual-based optimization procedure for the two-echelon uncapacitated facility location problem. Naval Res. Logist. (1992) 39:191–212Crossref, Google Scholar
• Gao L. L., Robinson E. P. Uncapacitated facility location: General solution procedure and computational experience. Eur. J. Oper. Res. (1994) 76:410–427Crossref, Google Scholar
• Glover F., Laguna M.Tabu Search (1997) (Kluwer Academic Publishers, Norwell, MA) Crossref, Google Scholar
• Goldman A. J. Optimal locations for centers in a network. Transportation Sci. (1969) 3:352–360Link, Google Scholar
• Goldman A. J. Optimal center location in simple networks. Transportation Sci. (1971) 5:212–221Link, Google Scholar
• Hakimi S. L., Maheshwari S. N. Optimum locations of centers in networks. Oper. Res. (1972) 20:967–973Link, Google Scholar
• Hansen P., Mladenovic N. Variable neighborhood search for the p-median. Location Sci. (1997) 5:207–226Crossref, Google Scholar
• Huang R. Network location problems with multiple types of facilities. (2005) . Doctoral thesis, Joseph L. Rotman School of Management, University of Toronto, Toronto, CanadaGoogle Scholar
• Kariv O., Hakimi S. L. An algorithm approach to network location problems: Part 2, the p-medians. SIAM J. Appl. Math. (1979) 37:539–560Crossref, Google Scholar
• McLafferty S. L., Ghosh A. Multi-purpose shopping and the location of retail firms. Geographical Anal. (1986) 18(3):215–226Crossref, Google Scholar
• Michel L., Van Hentenryck P. A simple tabu search for warehouse location. Eur. J. Oper. Res. (2004) 157:576–591Crossref, Google Scholar
• Mirchandani P. B., Francis R. L.Discrete Location Theory (1990) (Wiley, New York) Google Scholar
• Mladenovic N., Hansen P. Variable neighborhood search. Comput. Oper. Res. (1997) 24:1097–1100Crossref, Google Scholar
• Mulligan G. F. Consumer travel behavior: Extensions of a multi-purpose shopping model. Geographical Anal. (1987) 19(4):364–375Crossref, Google Scholar
• Narula S. C., Ogbu U. I., Samuelsson H. M. An algorithm for the p-median problem. Oper. Res. (1977) 25:709–713Link, Google Scholar
• Resende M. G. C., Werneck R. F. A GRASP with path-relinking for the p-median problem. (2002) . Tech. Report TD-5E53XL, AT&T Labs ResearchGoogle Scholar
• ReVelle C. S., Williams J. C., Boland J. J. Counterpart models in facility location science and reserve selection science. Environ. Model. Assessment (2002) 7:71–80Crossref, Google Scholar
• Rolland E., Schilling D. A., Current J. R. An efficient tabu search procedure for the p-median problem. Eur. J. Oper. Res. (1996) 96:329–342Crossref, Google Scholar
• Rosing K. E., ReVelle C. S. Heuristic concentration: Two stage solution construction. Eur. J. Oper. Res. (1997) 97:75–86Crossref, Google Scholar
• Rosing K. E., ReVelle C. S., Schilling D. A. A gamma heuristic for the p-median problem. Eur. J. Oper. Res. (1999) 117:522–532Crossref, Google Scholar
• Sun M. Solving the uncapacitated facility location problem using tabu search. Comput. Oper. Res. (2006) 33:2563–2589Crossref, Google Scholar
• Suzuki T., Hodgson M. J. Optimal facility location with multi-purpose trip making. IIE Trans. (2005) 37:481–491Crossref, Google Scholar
• Teitz M. B., Bart P. Heuristic methods for estimating the generalized vertex median of a weighted graph. Oper. Res. (1968) 16:955–961Link, Google Scholar
• Thill J. C. Spatial duopolistic competition with multi-purpose and multi-shop shopping. Ann. Regional Sci. (1992) 26:287–304Crossref, Google Scholar
• Voss S. A reverse elimination approach for the p-median problem. Stud. Locational Anal. (1996) 8:49–58Google Scholar
• Wendell R. E., Hurter A. P. Optimal location on a network. Transportation Sci. (1973) 7:18–33Link, Google Scholar
• Zhang J. Approximating the two-level facility location problem via a quasi-greedy approach. Math. Programming (2006) 108(1):159–176Crossref, Google Scholar