IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v279y2019i1p26-37.html
   My bibliography  Save this article

Computing optimal shortcuts for networks

Author

Listed:
  • Garijo, Delia
  • Márquez, Alberto
  • Rodríguez, Natalia
  • Silveira, Rodrigo I.

Abstract

We study augmenting a plane Euclidean network with a segment, called a shortcut, to minimize the largest distance between any two points along the edges of the resulting network. Problems of this type have received considerable attention recently, mostly for discrete variants of the problem. We consider a fully continuous setting, where the problem of computing distances and placing a shortcut is much harder as all points on the network, instead of only the vertices, must be taken into account. We present the first results on the computation of optimal shortcuts for general networks in this model: a polynomial time algorithm and a discretization of the problem that leads to an approximation algorithm. We also improve the general method for networks that are paths, restricted to two types of shortcuts: those with a fixed orientation and simple shortcuts.

Suggested Citation

  • Garijo, Delia & Márquez, Alberto & Rodríguez, Natalia & Silveira, Rodrigo I., 2019. "Computing optimal shortcuts for networks," European Journal of Operational Research, Elsevier, vol. 279(1), pages 26-37.
    • Handle: RePEc:eee:ejores:v:279:y:2019:i:1:p:26-37
    DOI: 10.1016/j.ejor.2019.05.018
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221719304229
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2019.05.018?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. Cáceres, José & Garijo, Delia & González, Antonio & Márquez, Alberto & Puertas, María Luz & Ribeiro, Paula, 2018. "Shortcut sets for the locus of plane Euclidean networks," Applied Mathematics and Computation, Elsevier, vol. 334(C), pages 192-205.
    2. Elnaz Miandoabchi & Farzaneh Daneshzand & Reza Zanjirani Farahani & Wai Yuen Szeto, 2015. "Time-dependent discrete road network design with both tactical and strategic decisions," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 66(6), pages 894-913, June.
    3. Farahani, Reza Zanjirani & Miandoabchi, Elnaz & Szeto, W.Y. & Rashidi, Hannaneh, 2013. "A review of urban transportation network design problems," European Journal of Operational Research, Elsevier, vol. 229(2), pages 281-302.
    4. Long, Jiancheng & Szeto, W.Y. & Huang, Hai-Jun, 2014. "A bi-objective turning restriction design problem in urban road networks," European Journal of Operational Research, Elsevier, vol. 237(2), pages 426-439.
    5. W. Szeto & Y. Jiang & D. Wang & A. Sumalee, 2015. "A Sustainable Road Network Design Problem with Land Use Transportation Interaction over Time," Networks and Spatial Economics, Springer, vol. 15(3), pages 791-822, September.
    6. Tong, Lu & Zhou, Xuesong & Miller, Harvey J., 2015. "Transportation network design for maximizing space–time accessibility," Transportation Research Part B: Methodological, Elsevier, vol. 81(P2), pages 555-576.
    7. Feremans, Corinne & Labbe, Martine & Laporte, Gilbert, 2003. "Generalized network design problems," European Journal of Operational Research, Elsevier, vol. 148(1), pages 1-13, July.
    Full references (including those not matched with items on IDEAS)

    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. Khooban, Zohreh & Farahani, Reza Zanjirani & Miandoabchi, Elnaz & Szeto, W.Y., 2015. "Mixed network design using hybrid scatter search," European Journal of Operational Research, Elsevier, vol. 247(3), pages 699-710.
    2. Hosseininasab, Seyyed-Mohammadreza & Shetab-Boushehri, Seyyed-Nader & Hejazi, Seyed Reza & Karimi, Hadi, 2018. "A multi-objective integrated model for selecting, scheduling, and budgeting road construction projects," European Journal of Operational Research, Elsevier, vol. 271(1), pages 262-277.
    3. Mahmoudi, Reza & Shetab-Boushehri, Seyyed-Nader & Hejazi, Seyed Reza & Emrouznejad, Ali & Rajabi, Parisa, 2019. "A hybrid egalitarian bargaining game-DEA and sustainable network design approach for evaluating, selecting and scheduling urban road construction projects," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 130(C), pages 161-183.
    4. Wang, Jian & He, Xiaozheng & Peeta, Srinivas & Wang, Wei, 2022. "Globally convergent line search algorithm with Euler-based step size-determination method for continuous network design problem," Transportation Research Part B: Methodological, Elsevier, vol. 163(C), pages 119-144.
    5. Chen-Yang Yan & Mao-Bin Hu & Rui Jiang & Jiancheng Long & Jin-Yong Chen & Hao-Xiang Liu, 2019. "Stochastic Ridesharing User Equilibrium in Transport Networks," Networks and Spatial Economics, Springer, vol. 19(4), pages 1007-1030, December.
    6. Ye, Jiao & Jiang, Yu & Chen, Jun & Liu, Zhiyuan & Guo, Renzhong, 2021. "Joint optimisation of transfer location and capacity for a capacitated multimodal transport network with elastic demand: a bi-level programming model and paradoxes," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 156(C).
    7. Liu, Jiangtao & Zhou, Xuesong, 2016. "Capacitated transit service network design with boundedly rational agents," Transportation Research Part B: Methodological, Elsevier, vol. 93(PA), pages 225-250.
    8. Shen, Chan & Sun, Yao & Bai, Zijian & Cui, Hongjun, 2021. "Real-time customized bus routes design with optimal passenger and vehicle matching based on column generation algorithm," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 571(C).
    9. Zhou, Yu & Wang, Yun & Yang, Hai & Yan, Xuedong, 2019. "Last train scheduling for maximizing passenger destination reachability in urban rail transit networks," Transportation Research Part B: Methodological, Elsevier, vol. 129(C), pages 79-95.
    10. Hosseininasab, Seyyed-Mohammadreza & Shetab-Boushehri, Seyyed-Nader, 2015. "Integration of selecting and scheduling urban road construction projects as a time-dependent discrete network design problem," European Journal of Operational Research, Elsevier, vol. 246(3), pages 762-771.
    11. Di, Zhen & Yang, Lixing & Qi, Jianguo & Gao, Ziyou, 2018. "Transportation network design for maximizing flow-based accessibility," Transportation Research Part B: Methodological, Elsevier, vol. 110(C), pages 209-238.
    12. Liu, Haoxiang & Szeto, W.Y. & Long, Jiancheng, 2019. "Bike network design problem with a path-size logit-based equilibrium constraint: Formulation, global optimization, and matheuristic," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 127(C), pages 284-307.
    13. Miralinaghi, Mohammad & Seilabi, Sania E. & Chen, Sikai & Hsu, Yu-Ting & Labi, Samuel, 2020. "Optimizing the selection and scheduling of multi-class projects using a Stackelberg framework," European Journal of Operational Research, Elsevier, vol. 286(2), pages 508-522.
    14. Yi Tao & Ek Peng Chew & Loo Hay Lee & Yuran Shi, 2017. "A column generation approach for the route planning problem in fourth party logistics," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(2), pages 165-181, February.
    15. Qiu, Rui & Xu, Jiuping & Ke, Ruimin & Zeng, Ziqiang & Wang, Yinhai, 2020. "Carbon pricing initiatives-based bi-level pollution routing problem," European Journal of Operational Research, Elsevier, vol. 286(1), pages 203-217.
    16. Wei Huang & Guangming Xu & Hong K. Lo, 2020. "Pareto-Optimal Sustainable Transportation Network Design under Spatial Queuing," Networks and Spatial Economics, Springer, vol. 20(3), pages 637-673, September.
    17. Liang, Jinpeng & Wu, Jianjun & Gao, Ziyou & Sun, Huijun & Yang, Xin & Lo, Hong K., 2019. "Bus transit network design with uncertainties on the basis of a metro network: A two-step model framework," Transportation Research Part B: Methodological, Elsevier, vol. 126(C), pages 115-138.
    18. Nayan, Ashish & Wang, David Z.W., 2017. "Optimal bus transit route packaging in a privatized contracting regime," Transportation Research Part A: Policy and Practice, Elsevier, vol. 97(C), pages 146-157.
    19. Ospina, Juan P. & Duque, Juan C. & Botero-Fernández, Verónica & Montoya, Alejandro, 2022. "The maximal covering bicycle network design problem," Transportation Research Part A: Policy and Practice, Elsevier, vol. 159(C), pages 222-236.
    20. David Canca & Belén Navarro-Carmona & Gabriel Villa & Alejandro Zarzo, 2023. "A Multilayer Network Approach for the Bimodal Bus–Pedestrian Line Planning Problem," Mathematics, MDPI, vol. 11(19), pages 1-36, October.

    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:eee:ejores:v:279:y:2019:i:1:p:26-37. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.