[go: up one dir, main page]
IDEAS home Printed from https://ideas.repec.org/a/spr/topjnl/v22y2014i1p227-253.html
   My bibliography  Save this article

A maximum trip covering location problem with an alternative mode of transportation on tree networks and segments

Author

Listed:
  • Mark-Christoph Körner
  • Juan Mesa
  • Federico Perea
  • Anita Schöbel
  • Daniel Scholz
Abstract
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. Copyright Sociedad de Estadística e Investigación Operativa 2014

Suggested Citation

  • Mark-Christoph Körner & Juan Mesa & Federico Perea & Anita Schöbel & Daniel Scholz, 2014. "A maximum trip covering location problem with an alternative mode of transportation on tree networks and segments," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 22(1), pages 227-253, April.
    • Handle: RePEc:spr:topjnl:v:22:y:2014:i:1:p:227-253
    DOI: 10.1007/s11750-012-0251-y
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s11750-012-0251-y
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s11750-012-0251-y?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. R. Horst & N. V. Thoai, 1999. "DC Programming: Overview," Journal of Optimization Theory and Applications, Springer, vol. 103(1), pages 1-43, October.
    2. Berman, Oded & Krass, Dmitry & Drezner, Zvi, 2003. "The gradual covering decay location problem on a network," European Journal of Operational Research, Elsevier, vol. 151(3), pages 474-480, December.
    3. Pierre Hansen & Dominique Peeters & Denis Richard & Jacques-Francois Thisse, 1985. "The Minisum and Minimax Location Problems Revisited," Operations Research, INFORMS, vol. 33(6), pages 1251-1265, December.
    4. Plastria, Frank, 1992. "GBSSS: The generalized big square small square method for planar single-facility location," European Journal of Operational Research, Elsevier, vol. 62(2), pages 163-174, October.
    5. Laporte, Gilbert & Mesa, Juan A. & Perea, Federico, 2010. "A game theoretic framework for the robust railway transit network design problem," Transportation Research Part B: Methodological, Elsevier, vol. 44(4), pages 447-459, May.
    6. Carrizosa, Emilio & Rodriguez-Chia, Antonio M., 1997. "Weber problems with alternative transportation systems," European Journal of Operational Research, Elsevier, vol. 97(1), pages 87-93, February.
    7. P. M. Dearing & R. L. Francis & T. J. Lowe, 1976. "Convex Location Problems on Tree Networks," Operations Research, INFORMS, vol. 24(4), pages 628-642, August.
    8. Gilbert Laporte & Juan Mesa & Francisco Ortega & Ignacio Sevillano, 2005. "Maximizing Trip Coverage in the Location of a Single Rapid Transit Alignment," Annals of Operations Research, Springer, vol. 136(1), pages 49-63, April.
    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. Emilio Carrizosa & Jonas Harbering & Anita Schöbel, 2016. "Minimizing the passengers’ traveling time in the stop location problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 67(10), pages 1325-1337, October.
    2. López-de-los-Mozos, M.C. & Mesa, Juan A. & Schöbel, Anita, 2017. "A general approach for the location of transfer points on a network with a trip covering criterion and mixed distances," European Journal of Operational Research, Elsevier, vol. 260(1), pages 108-121.
    3. M. C. López-de-los-Mozos & Juan A. Mesa, 2022. "To stop or not to stop: a time-constrained trip covering location problem on a tree network," Annals of Operations Research, Springer, vol. 316(2), pages 1039-1061, September.
    4. Tanaka, Ken-ichi & Furuta, Takehiro & Toriumi, Shigeki, 2019. "Railway flow interception location model: Model development and case study of Tokyo metropolitan railway network," Operations Research Perspectives, Elsevier, vol. 6(C).
    5. Schwerdfeger, Stefan & Boysen, Nils & Briskorn, Dirk & Stephan, Konrad, 2024. "Keep on moving: Optimized placement of moving walkways in airport terminals," Transportation Research Part B: Methodological, Elsevier, vol. 183(C).
    6. Perea, Federico & Mesa, Juan A. & Laporte, Gilbert, 2014. "Adding a new station and a road link to a road–rail network in the presence of modal competition," Transportation Research Part B: Methodological, Elsevier, vol. 68(C), pages 1-16.

    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. Rafael Blanquero & Emilio Carrizosa & Amaya Nogales-Gómez & Frank Plastria, 2014. "Single-facility huff location problems on networks," Annals of Operations Research, Springer, vol. 222(1), pages 175-195, November.
    2. Avella, P. & Benati, S. & Canovas Martinez, L. & Dalby, K. & Di Girolamo, D. & Dimitrijevic, B. & Ghiani, G. & Giannikos, I. & Guttmann, N. & Hultberg, T. H. & Fliege, J. & Marin, A. & Munoz Marquez, , 1998. "Some personal views on the current state and the future of locational analysis," European Journal of Operational Research, Elsevier, vol. 104(2), pages 269-287, January.
    3. Marianov, Vladimir & Eiselt, H.A., 2024. "Fifty Years of Location Theory - A Selective Review," European Journal of Operational Research, Elsevier, vol. 318(3), pages 701-718.
    4. J. Redondo & J. Fernández & I. García & P. Ortigosa, 2009. "A robust and efficient algorithm for planar competitive location problems," Annals of Operations Research, Springer, vol. 167(1), pages 87-105, March.
    5. Romero-Morales, Dolores & Carrizosa, Emilio & Conde, Eduardo, 1997. "Semi-obnoxious location models: A global optimization approach," European Journal of Operational Research, Elsevier, vol. 102(2), pages 295-301, October.
    6. Rafael Suárez-Vega & Dolores Santos-Peñate & Pablo Dorta-González, 2014. "Location and quality selection for new facilities on a network market," The Annals of Regional Science, Springer;Western Regional Science Association, vol. 52(2), pages 537-560, March.
    7. Laporte, G. & Mesa, J.A. & Ortega, F.A. & Perea, F., 2011. "Planning rapid transit networks," Socio-Economic Planning Sciences, Elsevier, vol. 45(3), pages 95-104, September.
    8. Carrizosa, E. & Frenk, J.B.G., 1996. "Dominating Sets for Convex Functions with some Applications," Econometric Institute Research Papers EI 9657-/A, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    9. M. C. López-de-los-Mozos & Juan A. Mesa, 2022. "To stop or not to stop: a time-constrained trip covering location problem on a tree network," Annals of Operations Research, Springer, vol. 316(2), pages 1039-1061, September.
    10. Klamroth, K., 2004. "Algebraic properties of location problems with one circular barrier," European Journal of Operational Research, Elsevier, vol. 154(1), pages 20-35, April.
    11. Skriver, Anders J. V. & Andersen, Kim Allan, 2003. "The bicriterion semi-obnoxious location (BSL) problem solved by an [epsilon]-approximation," European Journal of Operational Research, Elsevier, vol. 146(3), pages 517-528, May.
    12. M. Hakan Akyüz & Temel Öncan & İ. Kuban Altınel, 2019. "Branch and bound algorithms for solving the multi-commodity capacitated multi-facility Weber problem," Annals of Operations Research, Springer, vol. 279(1), pages 1-42, August.
    13. Canca, David & De-Los-Santos, Alicia & Laporte, Gilbert & Mesa, Juan A., 2019. "Integrated Railway Rapid Transit Network Design and Line Planning problem with maximum profit," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 127(C), pages 1-30.
    14. Seyed Sina Mohri & Meisam Akbarzadeh, 2019. "Locating key stations of a metro network using bi-objective programming: discrete and continuous demand mode," Public Transport, Springer, vol. 11(2), pages 321-340, August.
    15. Fernandez, J. & Fernandez, P. & Pelegrin, B., 2000. "A continuous location model for siting a non-noxious undesirable facility within a geographical region," European Journal of Operational Research, Elsevier, vol. 121(2), pages 259-274, March.
    16. Zvi Drezner & George Wesolowsky, 2014. "Covering Part of a Planar Network," Networks and Spatial Economics, Springer, vol. 14(3), pages 629-646, December.
    17. Bischoff, M. & Klamroth, K., 2007. "An efficient solution method for Weber problems with barriers based on genetic algorithms," European Journal of Operational Research, Elsevier, vol. 177(1), pages 22-41, February.
    18. An, Kun & Lo, Hong K., 2016. "Two-phase stochastic program for transit network design under demand uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 84(C), pages 157-181.
    19. Fernandez, Jose & Pelegri'n, Blas & Plastria, Frank & Toth, Boglarka, 2007. "Solving a Huff-like competitive location and design model for profit maximization in the plane," European Journal of Operational Research, Elsevier, vol. 179(3), pages 1274-1287, June.
    20. Frank Plastria, 2009. "Asymmetric distances, semidirected networks and majority in Fermat–Weber problems," Annals of Operations Research, Springer, vol. 167(1), pages 121-155, March.

    More about this item

    Keywords

    Location; Covering problem; Transportation; 90B85; 90B80;
    All these keywords.

    JEL classification:

    Statistics

    Access and download statistics

    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:spr:topjnl:v:22:y:2014:i:1:p:227-253. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.