A maximum trip covering location problem with an alternative mode of transportation on tree networks and segments
- 243 Downloads
In this paper the following facility location problem in a mixed planar-network space is considered: We assume that traveling along a given network is faster than traveling within the plane according to the Euclidean distance. A pair of points (A i ,A j ) is called covered if the time to access the network from A i plus the time for traveling along the network plus the time for reaching A j is lower than, or equal to, a given acceptance level related to the travel time without using the network. The objective is to find facilities (i.e. entry and exit points) on the network that maximize the number of covered pairs. We present a reformulation of the problem using convex covering sets and use this formulation to derive a finite dominating set and an algorithm for locating two facilities on a tree network. Moreover, we adapt a geometric branch and bound approach to the discrete nature of the problem and suggest a procedure for locating more than two facilities on a single line, which is evaluated numerically.
KeywordsLocation Covering problem Transportation
Mathematics Subject Classification90B85 90B80
This work was partially supported by the Future and Emerging Technologies Unit of EC (IST priority—6th FP), under contract no. FP6-021235-2 (project ARRIVAL), by Ministerio de Educación, Ciencia e Innovación (Spain)/FEDER under project MTM2009-14243 and by Junta de Andalucía (Spain)/FEDER under excellence projects P09-TEP-5022 and FQM-5849.
- Koolen A, Tamir A (1990) Covering problems. In: Mirchandani P, Francis R (eds) Discrete location theory. Wiley-Interscience, New York Google Scholar
- Márquez-Diez-Canedo J (1987) Fundamentos de Teoría de Optimización. Limusa, México Google Scholar
- Ortúzar JD, Willumsen LG (2001) Modelling transport. Wiley, New York Google Scholar
- Plastria F (2002) Continuous covering location problems. In: Drezner Z, Hamacher H (eds) Facility location: applications and theory. Springer, Berlin Google Scholar
- Scholz D (2010) Geometric branch & bound methods in global optimization: theory and applications to facility location problems. Ph.D. thesis, Universität Göttingen. To appear at Springer Google Scholar