Skip to main content
Log in

Incorporating Waiting Time in Competitive Location Models

  • Published:
Networks and Spatial Economics Aims and scope Submit manuscript

Abstract

In this paper we propose a metaheuristic to solve a new version of the Maximum Capture Problem. In the original MCP, market capture is obtained by lower traveling distances or lower traveling time, in this new version not only the traveling time but also the waiting time will affect the market share. This problem is hard to solve using standard optimization techniques. Metaheuristics are shown to offer accurate results within acceptable computing times.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Carreras M, Daniel S (1998) On optimal location with threshold requirements. Socio-Econ Plann Sci 33:91–103

    Article  Google Scholar 

  • Colorni A, Dorigo M, Maniezzo V (1991) Distributed optimization by ant colonies. Proceedings of ECAL91—European Conference on Artificial Life. Elsevier, Amsterdam, The Netherlands, pp 134–142

    Google Scholar 

  • Cordeau JF, Gendreau M, Laporte G (1997) A tabu search algorithm for periodic and multi-depot vehicle routing problems. Networks 30:105–119

    Article  Google Scholar 

  • Dorigo M, Thomas S (2003) The ant colony optimization metaheuristics: algorithms, applications and advances. In: Glover F, Kochenberger G (eds) Handbook of metaheuristics. Kluwer, Boston, MA

    Google Scholar 

  • Drezner T (1994) Locating a single new facility among existing, unequally attractive facilities. J Reg Sci 34(2):237–252

    Article  Google Scholar 

  • Drezner T, Drezner Z (1996) Competitive facilities: market share and location with random utility. J Reg Sci 36(1):1–15

    Article  Google Scholar 

  • Drezner T, Eiselt HA (2002) Consumers in competitive location models. In: Drezner Z, Hemacher HW (eds) Facility location: applications and theory. Springer, Berlin Heidelberg New York

    Google Scholar 

  • Eiselt HA, Gilbert L (1989) The maximum capture problem in a weighted network. J Reg Sci 29(3):433–439

    Article  Google Scholar 

  • Hakimi SL (1983) On locating new facilities in a competitive environment. Eur J Oper Res 12:29–35

    Article  Google Scholar 

  • Kariv O, Hakimi SL (1979) An algorithm approach to network location problems, part II: the P-median. SIAM J Appl Math 37:539–569

    Article  Google Scholar 

  • Kohlberg E (1983) Equilibrium store locations when consumers minimize travel time plus waiting time. Econ Lett 11:211–216

    Article  Google Scholar 

  • Lourenço H, Daniel S (1998) Adaptive approach heuristics for the generalized assignment problem. Econ Work Pap 288. Universitat Pompeu Fabra

  • Maniezzo V, Alberto C (1999) The ant system applied to the quadratic assignment problem. IEEE Trans Knowl Data Eng 11(5)

  • Marianov V, Serra D (1998) Probabilistic, maximal covering location-allocation models for ciongested systems. J Reg Sci 38:401–424

    Article  Google Scholar 

  • Plastria F (2001) Static competitive facility location: an overview of optimization approaches. Eur J Oper Res 129:461–470

    Article  Google Scholar 

  • ReVelle C (1986) The maximum capture or sphere of influence location problem: hotelling revised on a network. J Reg Sci 26(2)

  • Rosing KE, ReVelle C (1997) Heuristic concentration: two stage solution construction. Eur J Oper Res 97:75–86

    Article  Google Scholar 

  • Serra D, ReVelle C (1993) The pq-median problem: location and districting of hierarchical facilities. Location Sci 1(4):299–312

    Google Scholar 

  • Serra D, ReVelle C (1994) Market capture by two competitors: the preemptive location problem. J Reg Sci 34(4):549–561

    Article  Google Scholar 

  • Serra D, ReVelle C (1995) Competitive location in discrete space. In: Zvi Drezner (ed) Facility location: applications and methods. Springer, Berlin Heidelberg New York

    Google Scholar 

  • Serra D, Ratick S, ReVelle C (1996) The maximum capture problem with uncertainty. Environ & Plann B 23(4):49–59

    Article  Google Scholar 

  • Serra D, ReVelle C, Rosing K (1999a) Surviving in a competitive spatial market: the threshold capture model. J Reg Sci 39(4):637–652

    Article  Google Scholar 

  • Serra D, Eiselt HA, Laporte G, ReVelle C (1999b) Market capture models under various customer choice rules. Environ & Plann B 26(5):741–750

    Article  Google Scholar 

  • Stützle T, Hoos H (1997) MAX–MIN ant system for quadratic assignment problems. TH Darmstadt, FB. Informatik Darmstadt, Germany

    Google Scholar 

  • Stützle T, Hoos H (1998) Improvements on the ant system: introducing MAX–MIN ant system. In: Smith GD, Steele NC, Albrecht R (eds) Artificial neural networks and genetic algorithms. p 245–249

  • Stützle T (1998) An ant approach for the flow shop problem. TH Darmstadt, FB. Informatik Darmstadt, Germany

    Google Scholar 

  • Swain R (1974) A parametric decomposition algorithm for the solution of uncapacitated location problem. Manage Sci 21:189–198

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Daniel Serra.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Silva, F., Serra, D. Incorporating Waiting Time in Competitive Location Models. Netw Spat Econ 7, 63–76 (2007). https://doi.org/10.1007/s11067-006-9006-3

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11067-006-9006-3

Keywords

Navigation