Skip to main content

A Single-Facility Manifold Location Routing Problem with an Application to Supply Chain Management and Robotics

  • Conference paper
  • First Online:
Machine Learning, Optimization, and Big Data (MOD 2015)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 9432))

Included in the following conference series:

  • 2213 Accesses

Abstract

The location routing problem (LRP), a problem formulated for determining locations of facilities and the vehicle routes operating between these facilities, is the combination of the vehicle routing (VRP) and the facility location problems (FLP) in Euclidean space. The manifold location routing problem (MLRP) is an LRP in a Riemannian manifold setting as introduced in [14]. In seeking further advancements in the solution of LRP, MLRP improves the accuracy of the distance calculations by using geodesic distances. The shortest path distances on Earth’s surface can be determined by calculating geodesic distances in local neighborhoods by using Riemannian geometry. In this work, we advance the theoretical results obtained for MLRP in [14] by incorporating support vector machines (SVM), dynamic programming, parallel programming, data mining, and Geographic Information Systems (GIS). The theory will be explained on a supply chain problem with a robotics paradigm.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Aly, A., Kay, D., Litwhiler, J.: Location dominance on spherical surfaces. Oper. Res. 27, 972–981 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  2. Do Carmo, M.P.: Differential geometry of curves and surfaces. Prentice Hall Inc., Englewood Cliffs (1976)

    MATH  Google Scholar 

  3. Aras, N., Yumusak, S.: Altınel, IK: solving the capacitated multi-facility Weber problem by simulated annealing, threshold accepting and genetic algorithms. In: Doerner, K.F., Gendreau, M., Greistorfer, P., Gutjahr, W.J., Hartl, R.F., Reimann, M. (eds.) Metaheuristics: Progress in Complex Systems Optimization, pp. 91–112. Springer, USA (2007)

    Chapter  Google Scholar 

  4. Cheeger, J., Ebin, D.G.: Comparison Theorems in Riemannian Geometry. North Holland Publishing Company, American Elsevier Publishing Company Inc., Amsterdam, New York (1975)

    MATH  Google Scholar 

  5. Daskin, M.S.: What you should know about location modeling. Naval Res. Logis. 55, 283–294 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  6. Drezner, Z., Wesolowsky, G.O.: Facility location on a sphere. J. Oper. Res. Soc. 29, 997–1004 (1978)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  Google Scholar 

  8. Jost, J.: Riemannian Geometry and Geometric Analysis, 6th edn. Springer, New York (2011)

    Book  MATH  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  10. Prodhon, C., Prins, C.: A survey of recent research on location-routing problems. Euro. J. Oper. Res. 238(1), 1–17 (2014)

    Article  MathSciNet  Google Scholar 

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

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  14. Tokgöz, E., Alwazzi, S., Theodore, T.B.: A heuristic algorithm to solve the single-facility location routing problem on Riemannian surfaces. Comput. Manage. Sci. 12, 397–415 (2014). doi:10.1007/s10287-014-0226-6. Springer

    Article  Google Scholar 

  15. Yang, X., Song, Q., Wang, Y.: A weighted support vector machine for data classification. Int. J. Pattern. Recog. Artif. Intell. WSPC 21(5), 961–976 (2007)

    Article  Google Scholar 

Download references

Acknowledgement

Dr. Theodore Trafalis was supported by RSF grant 14-41-00039 and he conducted research at National Research University Higher School of Economics.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Emre Tokgöz .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Tokgöz, E., Awudu, I., Trafalis, T.B. (2015). A Single-Facility Manifold Location Routing Problem with an Application to Supply Chain Management and Robotics. In: Pardalos, P., Pavone, M., Farinella, G., Cutello, V. (eds) Machine Learning, Optimization, and Big Data. MOD 2015. Lecture Notes in Computer Science(), vol 9432. Springer, Cham. https://doi.org/10.1007/978-3-319-27926-8_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-27926-8_12

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-27925-1

  • Online ISBN: 978-3-319-27926-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics