IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v41y2007i4p500-515.html
   My bibliography  Save this article

The Minisum Multipurpose Trip Location Problem on Networks

Author

Listed:
  • Oded Berman

    (Joseph L. Rotman School of Management, University of Toronto, 105 Saint George Street, Toronto, Ontario, Canada M5S 3E6)

  • Rongbing Huang

    (School of Administrative Studies, York University, Atkinson Building, 4700 Keele Street, Toronto, Ontario, Canada M3J 1P3)

Abstract

We investigate multipurpose trip location problems on networks with two different types of facilities and three groups of customers, two of which need only one type of service, while the third group needs both types of service in a single trip. The objective is to minimize the total weighted travel distance of all trips. We prove that there exists a dominating location set for the problem on a general network, propose a general binary programming model, and analyze the properties of optimal solutions on networks with simple topologies and one facility per type. We also investigate several heuristic approaches to the problem on general networks and present extensive computational experiments.

Suggested Citation

  • Oded Berman & Rongbing Huang, 2007. "The Minisum Multipurpose Trip Location Problem on Networks," Transportation Science, INFORMS, vol. 41(4), pages 500-515, November.
    • Handle: RePEc:inm:ortrsc:v:41:y:2007:i:4:p:500-515
    DOI: 10.1287/trsc.1060.0186
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.1060.0186
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.1060.0186?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Rosing, K. E. & ReVelle, C. S. & Schilling, D. A., 1999. "A gamma heuristic for the p-median problem," European Journal of Operational Research, Elsevier, vol. 117(3), pages 522-532, September.
    2. Rosing, K. E. & ReVelle, C. S., 1997. "Heuristic concentration: Two stage solution construction," European Journal of Operational Research, Elsevier, vol. 97(1), pages 75-86, February.
    3. Oded Berman & Zvi Drezner & George O. Wesolowsky, 2002. "The collection depots location problem on networks," Naval Research Logistics (NRL), John Wiley & Sons, vol. 49(1), pages 15-24, February.
    4. Michael B. Teitz & Polly Bart, 1968. "Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph," Operations Research, INFORMS, vol. 16(5), pages 955-961, October.
    5. O Berman & R Huang, 2004. "Minisum collection depots location problem with multiple facilities on a network," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(7), pages 769-779, July.
    6. Gao, Li-Lian & Robinson, E. Powell, 1994. "Uncapacitated facility location: General solution procedure and computational experience," European Journal of Operational Research, Elsevier, vol. 76(3), pages 410-427, August.
    7. A. J. Goldman, 1969. "Optimal Locations for Centers in a Network," Transportation Science, INFORMS, vol. 3(4), pages 352-360, November.
    8. Michel, Laurent & Van Hentenryck, Pascal, 2004. "A simple tabu search for warehouse location," European Journal of Operational Research, Elsevier, vol. 157(3), pages 576-591, September.
    9. S. L. Hakimi & S. N. Maheshwari, 1972. "Optimum Locations of Centers in Networks," Operations Research, INFORMS, vol. 20(5), pages 967-973, October.
    10. A. J. Goldman, 1971. "Optimal Center Location in Simple Networks," Transportation Science, INFORMS, vol. 5(2), pages 212-221, May.
    11. Beasley, J. E., 1993. "Lagrangean heuristics for location problems," European Journal of Operational Research, Elsevier, vol. 65(3), pages 383-399, March.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Marianov, Vladimir & Eiselt, H.A. & Lüer-Villagra, Armin, 2018. "Effects of multipurpose shopping trips on retail store location in a duopoly," European Journal of Operational Research, Elsevier, vol. 269(2), pages 782-792.
    2. Lüer-Villagra, Armin & Marianov, Vladimir & Eiselt, H.A. & Méndez-Vogel, Gonzalo, 2022. "The leader multipurpose shopping location problem," European Journal of Operational Research, Elsevier, vol. 302(2), pages 470-481.
    3. Li, Ran & Tong, Daoqin, 2017. "Incorporating activity space and trip chaining into facility siting for accessibility maximization," Socio-Economic Planning Sciences, Elsevier, vol. 60(C), pages 1-14.
    4. Tong, Daoqin & Ren, Fang & Mack, James, 2012. "Locating farmers’ markets with an incorporation of spatio-temporal variation," Socio-Economic Planning Sciences, Elsevier, vol. 46(2), pages 149-156.
    5. Méndez-Vogel, Gonzalo & Marianov, Vladimir & Lüer-Villagra, Armin & Eiselt, H.A., 2023. "Store location with multipurpose shopping trips and a new random utility customers’ choice model," European Journal of Operational Research, Elsevier, vol. 305(2), pages 708-721.
    6. Malgorzata Miklas-Kalczynska, 2024. "Extensions to Competitive Facility Location with Multi-purpose Trips," Networks and Spatial Economics, Springer, vol. 24(3), pages 565-588, September.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Mladenovic, Nenad & Brimberg, Jack & Hansen, Pierre & Moreno-Perez, Jose A., 2007. "The p-median problem: A survey of metaheuristic approaches," European Journal of Operational Research, Elsevier, vol. 179(3), pages 927-939, June.
    2. ReVelle, C. S. & Eiselt, H. A., 2005. "Location analysis: A synthesis and survey," European Journal of Operational Research, Elsevier, vol. 165(1), pages 1-19, August.
    3. Vladimir Marianov & Daniel Serra, 2009. "Median problems in networks," Economics Working Papers 1151, Department of Economics and Business, Universitat Pompeu Fabra.
    4. Loree, Nick & Aros-Vera, Felipe, 2018. "Points of distribution location and inventory management model for Post-Disaster Humanitarian Logistics," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 116(C), pages 1-24.
    5. Mark S. Daskin, 2008. "What you should know about location modeling," Naval Research Logistics (NRL), John Wiley & Sons, vol. 55(4), pages 283-294, June.
    6. Pierre Hansen & Jack Brimberg & Dragan Urošević & Nenad Mladenović, 2007. "Primal-Dual Variable Neighborhood Search for the Simple Plant-Location Problem," INFORMS Journal on Computing, INFORMS, vol. 19(4), pages 552-564, November.
    7. H K Smith & G Laporte & P R Harper, 2009. "Locational analysis: highlights of growth to maturity," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 140-148, May.
    8. Zhizhu Lai & Qun Yue & Zheng Wang & Dongmei Ge & Yulong Chen & Zhihong Zhou, 2022. "The min-p robust optimization approach for facility location problem under uncertainty," Journal of Combinatorial Optimization, Springer, vol. 44(2), pages 1134-1160, September.
    9. Hakimi, S.Louis, 1983. "Network location theory and contingency planning," Energy, Elsevier, vol. 8(8), pages 697-702.
    10. Fathali Firoozi, 2008. "Boundary Distributions in Testing Inequality Hypotheses," Working Papers 0046, College of Business, University of Texas at San Antonio.
    11. Drexl, Andreas & Klose, Andreas, 2001. "Facility location models for distribution system design," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 546, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    12. Jackson, Laura E. & Rouskas, George N. & Stallmann, Matthias F.M., 2007. "The directional p-median problem: Definition, complexity, and algorithms," European Journal of Operational Research, Elsevier, vol. 179(3), pages 1097-1108, June.
    13. van der Gaast, J.P. & Rietveld, C.A. & Gabor, A.F. & Zhang, Y., 2011. "A Local Search Algorithm for Clustering in Software as a Service Networks," ERIM Report Series Research in Management ERS-2011-004-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    14. Michael Brusco & Hans-Friedrich Köhn, 2009. "Exemplar-Based Clustering via Simulated Annealing," Psychometrika, Springer;The Psychometric Society, vol. 74(3), pages 457-475, September.
    15. Lei, Ting L. & Church, Richard L., 2015. "On the unified dispersion problem: Efficient formulations and exact algorithms," European Journal of Operational Research, Elsevier, vol. 241(3), pages 622-630.
    16. Branas, Charles C. & Revelle, Charles S., 2001. "An iterative switching heuristic to locate hospitals and helicopters," Socio-Economic Planning Sciences, Elsevier, vol. 35(1), pages 11-30, March.
    17. Minghe Sun & Zhen-Yu Chen & Zhi-Ping Fan, 2014. "A Multi-task Multi-kernel Transfer Learning Method for Customer Response Modeling in Social Media," Working Papers 0161mss, College of Business, University of Texas at San Antonio.
    18. K.E. Rosing & C.S. ReVelle, 1997. "Heuristic Concentration and Tabu Search: A Nose to Nose Comparison," Tinbergen Institute Discussion Papers 97-058/3, Tinbergen Institute.
    19. B. Jayalakshmi & Alok Singh, 2017. "A hybrid artificial bee colony algorithm for the p-median problem with positive/negative weights," OPSEARCH, Springer;Operational Research Society of India, vol. 54(1), pages 67-93, March.
    20. Colmenar, J. Manuel & Greistorfer, Peter & Martí, Rafael & Duarte, Abraham, 2016. "Advanced Greedy Randomized Adaptive Search Procedure for the Obnoxious p-Median problem," European Journal of Operational Research, Elsevier, vol. 252(2), pages 432-442.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ortrsc:v:41:y:2007:i:4:p:500-515. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.