IDEAS home Printed from https://ideas.repec.org/a/spr/comgts/v12y2015i3p397-415.html
   My bibliography  Save this article

A heuristic algorithm to solve the single-facility location routing problem on Riemannian surfaces

Author

Listed:
  • Emre Tokgöz
  • Samir Alwazzi
  • Theodore Trafalis

Abstract

Location routing problem (LRP) in supply chain management is integration of the vehicle routing (VRP) and facility location problems (FLP). To the best of our knowledge, the known solutions obtained for the LRP in the literature are only obtained for the Euclidean space. Solving LRP on Riemannian manifold surface (RMS) is a more realistic approach than using Euclidean surfaces because of the curved structure of the pathways on Earth with changing local RMS curvatures. The shortest path distances on Earth’s surface can be determined by calculating geodesic distances in local neighborhoods. The special case of the LRP on RMS is the traditional LRP in the Euclidean space when the curvature of the RMS is zero. In this work, we introduce a new LRP to be solved on (RMS) and find a heuristic algorithmic solution to this LRP. In particular, we formulate the LRP for a single facility on RMS; a generalization of the surface and distance assumptions for the traditional single facility LRP. In addition, a heuristic algorithm is formulated to solve the proposed LRP on RMS with the corresponding computational results displayed for a particular scenario. The numerical results corresponding to the theoretical results introduced in this work are incomparable with the ones known in the literature for the traditional LRP because of the change in the surface and distance assumptions. Copyright Springer-Verlag Berlin Heidelberg 2015

Suggested Citation

  • Emre Tokgöz & Samir Alwazzi & Theodore Trafalis, 2015. "A heuristic algorithm to solve the single-facility location routing problem on Riemannian surfaces," Computational Management Science, Springer, vol. 12(3), pages 397-415, July.
    • Handle: RePEc:spr:comgts:v:12:y:2015:i:3:p:397-415
    DOI: 10.1007/s10287-014-0226-6
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10287-014-0226-6
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10287-014-0226-6?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. Marshall L. Fisher, 1994. "Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees," Operations Research, INFORMS, vol. 42(4), pages 626-642, August.
    2. Perl, Jossef & Daskin, Mark S., 1985. "A warehouse location-routing problem," Transportation Research Part B: Methodological, Elsevier, vol. 19(5), pages 381-396, October.
    3. İ K Altınel & T Öncan, 2005. "A new enhancement of the Clarke and Wright savings heuristic for the capacitated vehicle routing problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(8), pages 954-961, August.
    4. Salhi, Said & Rand, Graham K., 1989. "The effect of ignoring routes when locating depots," European Journal of Operational Research, Elsevier, vol. 39(2), pages 150-156, March.
    5. M D H Gamal & S Salhi, 2001. "Constructive heuristics for the uncapacitated continuous location-allocation problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 52(7), pages 821-829, July.
    6. Gillett, Billy E & Johnson, Jerry G, 1976. "Multi-terminal vehicle-dispatch algorithm," Omega, Elsevier, vol. 4(6), pages 711-718.
    7. Barreto, Sergio & Ferreira, Carlos & Paixao, Jose & Santos, Beatriz Sousa, 2007. "Using clustering analysis in a capacitated location-routing problem," European Journal of Operational Research, Elsevier, vol. 179(3), pages 968-977, June.
    8. Laporte, Gilbert & Nobert, Yves, 1981. "An exact algorithm for minimizing routing and operating costs in depot location," European Journal of Operational Research, Elsevier, vol. 6(2), pages 224-226, February.
    9. Nagy, Gabor & Salhi, Said, 2007. "Location-routing: Issues, models and methods," European Journal of Operational Research, Elsevier, vol. 177(2), pages 649-672, March.
    10. Bookbinder, James H. & Reece, Kathleen E., 1988. "Vehicle routing considerations in distribution system design," European Journal of Operational Research, Elsevier, vol. 37(2), pages 204-213, November.
    11. Wasner, Michael & Zapfel, Gunther, 2004. "An integrated multi-depot hub-location vehicle routing model for network planning of parcel service," International Journal of Production Economics, Elsevier, vol. 90(3), pages 403-419, August.
    12. Christian Prins & Caroline Prodhon & Angel Ruiz & Patrick Soriano & Roberto Wolfler Calvo, 2007. "Solving the Capacitated Location-Routing Problem by a Cooperative Lagrangean Relaxation-Granular Tabu Search Heuristic," Transportation Science, INFORMS, vol. 41(4), pages 470-483, November.
    13. Imran, Arif & Salhi, Said & Wassan, Niaz A., 2009. "A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 197(2), pages 509-518, September.
    14. Saïd Salhi & Gábor Nagy, 2009. "Local improvement in planar facility location using vehicle routing," Annals of Operations Research, Springer, vol. 167(1), pages 287-296, March.
    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. Soumen Kumar Das & Sankar Kumar Roy & Gerhard Wilhelm Weber, 2020. "An exact and a heuristic approach for the transportation-p-facility location problem," Computational Management Science, Springer, vol. 17(3), pages 389-407, October.

    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. Drexl, Michael & Schneider, Michael, 2015. "A survey of variants and extensions of the location-routing problem," European Journal of Operational Research, Elsevier, vol. 241(2), pages 283-308.
    2. Stenger, Andreas & Schneider, Michael & Schwind, Michael & Vigo, Daniele, 2012. "Location routing for small package shippers with subcontracting options," International Journal of Production Economics, Elsevier, vol. 140(2), pages 702-712.
    3. Hunkar Toyoglu & Oya Karasan & Bahar Kara, 2012. "A New Formulation Approach for Location-Routing Problems," Networks and Spatial Economics, Springer, vol. 12(4), pages 635-659, December.
    4. Hunkar Toyoglu & Oya Ekin Karasan & Bahar Yetis Kara, 2011. "Distribution network design on the battlefield," Naval Research Logistics (NRL), John Wiley & Sons, vol. 58(3), pages 188-209, April.
    5. Jenn-Rong Lin & Hsien-Chung Lei, 2009. "Distribution systems design with two-level routing considerations," Annals of Operations Research, Springer, vol. 172(1), pages 329-347, November.
    6. Weijun Xie & Yanfeng Ouyang & Sze Chun Wong, 2016. "Reliable Location-Routing Design Under Probabilistic Facility Disruptions," Transportation Science, INFORMS, vol. 50(3), pages 1128-1138, August.
    7. Nagy, Gabor & Salhi, Said, 2007. "Location-routing: Issues, models and methods," European Journal of Operational Research, Elsevier, vol. 177(2), pages 649-672, March.
    8. Daniel Negrotto & Irene Loiseau, 2021. "A Branch & Cut algorithm for the prize-collecting capacitated location routing problem," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 29(1), pages 34-57, April.
    9. Menezes, Mozart B.C. & Ruiz-Hernández, Diego & Verter, Vedat, 2016. "A rough-cut approach for evaluating location-routing decisions via approximation algorithms," Transportation Research Part B: Methodological, Elsevier, vol. 87(C), pages 89-106.
    10. Prodhon, Caroline & Prins, Christian, 2014. "A survey of recent research on location-routing problems," European Journal of Operational Research, Elsevier, vol. 238(1), pages 1-17.
    11. Ting, Ching-Jung & Chen, Chia-Ho, 2013. "A multiple ant colony optimization algorithm for the capacitated location routing problem," International Journal of Production Economics, Elsevier, vol. 141(1), pages 34-44.
    12. Karaoglan, Ismail & Altiparmak, Fulya & Kara, Imdat & Dengiz, Berna, 2012. "The location-routing problem with simultaneous pickup and delivery: Formulations and a heuristic approach," Omega, Elsevier, vol. 40(4), pages 465-477.
    13. Mina, Hokey & Jayaraman, Vaidyanathan & Srivastava, Rajesh, 1998. "Combined location-routing problems: A synthesis and future research directions," European Journal of Operational Research, Elsevier, vol. 108(1), pages 1-15, July.
    14. Karaoglan, Ismail & Altiparmak, Fulya & Kara, Imdat & Dengiz, Berna, 2011. "A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery," European Journal of Operational Research, Elsevier, vol. 211(2), pages 318-332, June.
    15. Sahar Validi & Arijit Bhattacharya & P. J. Byrne, 2020. "Sustainable distribution system design: a two-phase DoE-guided meta-heuristic solution approach for a three-echelon bi-objective AHP-integrated location-routing model," Annals of Operations Research, Springer, vol. 290(1), pages 191-222, July.
    16. Kelley, Jason & Kuby, Michael & Sierra, Rodrigo, 2013. "Transportation network optimization for the movement of indigenous goods in Amazonian Ecuador," Journal of Transport Geography, Elsevier, vol. 28(C), pages 89-100.
    17. Nasrin Asgari & Mohsen Rajabi & Masoumeh Jamshidi & Maryam Khatami & Reza Zanjirani Farahani, 2017. "A memetic algorithm for a multi-objective obnoxious waste location-routing problem: a case study," Annals of Operations Research, Springer, vol. 250(2), pages 279-308, March.
    18. Zhang, Ying & Qi, Mingyao & Lin, Wei-Hua & Miao, Lixin, 2015. "A metaheuristic approach to the reliable location routing problem under disruptions," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 83(C), pages 90-110.
    19. Amin Aghalari & Darweesh Ehssan Salamah & Carlos Marino & Mohammad Marufuzzaman, 2023. "Electric vehicles fast charger location-routing problem under ambient temperature," Annals of Operations Research, Springer, vol. 324(1), pages 721-759, May.
    20. Walid Klibi & Francis Lasalle & Alain Martel & Soumia Ichoua, 2010. "The Stochastic Multiperiod Location Transportation Problem," Transportation Science, INFORMS, vol. 44(2), pages 221-237, May.

    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:comgts:v:12:y:2015:i:3:p:397-415. 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.