Skip to main content
Springer Nature Link
Log in

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

  • Original Paper
  • Published:
Computational Management Science Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12

Similar content being viewed by others

References

  • Altinel IK, Oncan T (2005) A new enhancement of the Clarke and Wright savings heuristic for the capacitated vehicle routing problem. J Oper Res Soc 56:954–961

    Article  Google Scholar 

  • Ambrosino D, Sciomachen A (2009) A heuristic based on multi-exchange techniques for a regional fleet assignment location-routing problem. Comput Oper Res 36:442–460

    Article  Google Scholar 

  • Barreto S, Ferreira C, Paixao J (2007) Using clustering analysis in a capacitated location-routing problem. Euro J Oper Res 179:968–977

    Article  Google Scholar 

  • Bookbinder JH, Reece KE (1988) Vehicle routing considerations in distribution system design. Euro J Oper Res 37:204–213

    Article  Google Scholar 

  • Brimberg J, Hansen P, Mladenovic’ N, Salhi S (2008) A survey of solution methods for the continuous location-allocation problem. Int J Oper Res 5:1–12

    Google Scholar 

  • Bruns A, Klose A, Stahly P (2000) Restructuring of Swiss parcel delivery services. OR Spec 22:285–302

    Article  Google Scholar 

  • Cheeger J, Ebin DG (1975) Comparison theorems in Riemannian geometry. North Holland Publishing Company, Amsterdam

    Google Scholar 

  • Christofides N, Eilon S (1969) An algorithm for the vehicle-dispatching problem. Oper Res Quart 20:309–18

    Article  Google Scholar 

  • Christofides N, Mingozzi A, Toth P (1979) The vehicle routing problem. In: Mingozzi A, Toth P, Sandi C, Christofides N (eds) Combinatorial optimization. Wiley, Chichester, pp 315–338

  • Clarke G, Wright JW (1964) Scheduling of vehicle from central depot to a number of delivery points. Oper Res 12:568–581

    Article  Google Scholar 

  • Cooper L (1964) Heuristic methods for location-allocation problems. Siam Rev 6:37–53

    Article  Google Scholar 

  • do Carmo MP (1976) Differential geometry of curves and surfaces. Prentice Hall Inc, Englewood Cliffs

    Google Scholar 

  • Daskin MS (2008) What you should know about location modeling. Naval Res Logis 55:283–294

    Article  Google Scholar 

  • Fisher ML (1994) Optimal solution of vehicle routing problems using minimum K-trees. Oper Res 42:626–642

    Article  Google Scholar 

  • Funtanilla LA (2004) GIS pattern recognition and rejection analysis using MATLAB. In: Proceedings of ESRI

  • Gamal MDH, Salhi S (2001) Constructive heuristics for the uncapacitated continuous location-allocation problem. J Oper Res Soc 52:821–829

    Article  Google Scholar 

  • Gillet B, Johnson J (1976) Multi-terminal vehicle-dispatching algorithm. Omega 4:711–718

    Article  Google Scholar 

  • Imran A, Salhi S, Wassan NA (2009) A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem. Euro J Oper Res 197:509–519

    Article  Google Scholar 

  • Jost J (2011) Riemannian geometry and geometric analysis, 6th edn. Springer, New York

    Book  Google Scholar 

  • Laporte G, Nobert Y (1981) An exact algorithm for minimizing routing and operating costs in depot location. Euro J Oper Res 6:224–226

    Article  Google Scholar 

  • Laporte G (2007) What you should know about the vehicle routing problem. Naval Res Logis 54:811–819

    Article  Google Scholar 

  • Luc-Normand Tellier (1972) The Weber problem: solution and interpretation. Geo Anal 4(3):215–233

    Google Scholar 

  • Luis M, Salhi S, Nagy G (2009) Region-rejection based heuristics for the capacitated multi-source Weber problem. Comput Oper Res 36:2007–2017

    Article  Google Scholar 

  • Manzour-al-Ajdad SMH, Torabi SA, Salhi S (2012a) A hierarchical algorithm for the planar single-facility location routing problem. Comput Oper Res 39:461–470

  • Manzour-al-Ajdad SMH, Torabi SA, Eshghi K (2012b) Single-source capacitated multi-facility Weber problem: an iterative two phase heuristic algorithm. Comput Oper Res 39:1465–1476

  • Mladenovic’ N, Hansen P (1997) Variable neighborhood search. Comput Oper Res 24:1097–1100

    Article  Google Scholar 

  • Nagy G, Salhi S (2007) Location-routing: issues, models, and methods. Euro J Oper Res 177:649–672

    Article  Google Scholar 

  • Perl J, Daskin MS (1985) A warehouse location-routing problem. Trans Res B 19:381–396

    Article  Google Scholar 

  • Prins C, Prodhon C, Soriano P, Ruiz A, Wolfler-Calvo R (2007) Solving the capacitated location-routing problem by a cooperative Lagrangean relaxation-granular tabu search heuristic. Transp Sci 41:470–483

    Article  Google Scholar 

  • Riemann B (1851) Grundlagen für eine allgemeine Theorie der Functionen einer veränderlichen complexen Grösse. Inauguraldissertation, Göttingen

  • Salhi S (1987) The integration of routing into the location-allocation and vehicle fleet composition problems. PhD thesis, School of Management, Lancaster, UK

  • Salhi S, Rand GK (1989) The effect of ignoring routes when locating depots. Euro J Oper Res 39:150–156

    Article  Google Scholar 

  • Salhi S, Nagy G (1999) Consistency and robustness in location routing. Stud Locat Anal 13:3–19

    Google Scholar 

  • Salhi S, Nagy G (2009) Local improvement in planar facility location using vehicle routing. Ann Oper Res 167:287–296

    Article  Google Scholar 

  • Schwardt M, Dethloff J (2005) Solving a continuous location routing problem by use of a self-organizing map. Int J Phys Dist Logis Manag 35:390–408

    Article  Google Scholar 

  • Schwardt M, Fischer K (2009) Combined location-routing problems: a neural network approach. Ann Oper Res 167:253–269

    Article  Google Scholar 

  • Semet F, Taillard E (1993) Solving real-life vehicle routing problems efficiently using tabu search. Ann Oper Res 41:469–488

    Article  Google Scholar 

  • Sherali HD, Noradi FL (1988) NP-hard, capacitated, balanced p-median problems on a chain graph with a continuum of link demands. Math Oper Res 13:32–49

    Article  Google Scholar 

  • Wasner M, Zapfel G (2004) An integrated multi-depot hub location vehicle routing model for network planning of parcel service. Int J Prod Econ 90:403–419

    Article  Google Scholar 

  • Weiszfeld E (1937) Sur le point pour lequel la somme des distances de n points donnes est minimum. Tohoku Math J 43:355–386

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Engineering, Quinnipiac University, Hamden, CT, 06518, USA

    Emre Tokgöz

  2. School of Industrial and Systems Engineering, University of Oklahoma, Norman, OK, 73071, USA

    Samir Alwazzi  & Theodore B. Trafalis

Authors
  1. Emre Tokgöz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Samir Alwazzi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Theodore B. Trafalis
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Emre Tokgöz.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Tokgöz, E., Alwazzi , S. & Trafalis, T.B. A heuristic algorithm to solve the single-facility location routing problem on Riemannian surfaces. Comput Manag Sci 12, 397–415 (2015). https://doi.org/10.1007/s10287-014-0226-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10287-014-0226-6

Keywords

Mathematics Subject Classification

Search

Navigation