Incorporating waiting time in competitive location models
From MaRDI portal
Publication:883196
Recommendations
- Facility location for market capture when users rank facilities by shorter travel and waiting times
- The maximum capture problem with random utilities: problem formulation and algorithms
- A new chance-constrained maximum capture location problem
- Customer allocation in maximum capture problems
- The maximum capture problem with heterogeneous customers
Cites work
- scientific article; zbMATH DE number 1803758 (Why is no real title available?)
- scientific article; zbMATH DE number 1253053 (Why is no real title available?)
- scientific article; zbMATH DE number 1488089 (Why is no real title available?)
- A Parametric Decomposition Approach for the Solution of Uncapacitated Location Problems
- A tabu search heuristic for periodic and multi-depot vehicle routing problems
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- Equilibrium store locations when consumers minimize travel time plus waiting time
- Equity models in planar location
- Heuristic concentration: Two stage solution construction
- On locating new facilities in a competitive environment
- Static competitive facility location: an overview of optimisation approaches.
- The Ant Colony Optimization Metaheuristic: Algorithms, Applications, and Advances
Cited in
(4)
This page was built for publication: Incorporating waiting time in competitive location models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q883196)