Abstract
Conventional solution methods for logistics optimization problems often have to be adapted when objectives or restrictions of organizations in logistics environments are changing. In this paper, a new, generic solution approach called optimization network (ON) is developed and applied to a logistics optimization problem, the Location Routing Problem (LRP). With this approach, required flexibility in terms of fast changing data within the advancement of industry 4.0 is addressed. In an ON, existing solution methods are applied to the basic problems of the LRP. A meta solver optimizes the overall result of the network with black box optimization. Based on this, an orchestrator is responsible for the introduction of new optimization runs. The developed approach guarantees that changing external influences only involve the adaption of affected optimization nodes within the ON and not of the whole solution approach. Results are compared with an already existing generic solver and show the potential of the new solution method.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Beham, A., Fechter, J., Kommenda, M., Wagner, S., Winkler, S.M., Affenzeller, M.: Optimization strategies for integrated knapsack and traveling salesman problems. In: Moreno-Díaz, R., Pichler, F., Quesada-Arencibia, A. (eds.) EUROCAST 2015. LNCS, vol. 9520, pp. 359–366. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-27340-2_45
Drexl, M., Schneider, M.: A survey of variants and extensions of the location-routing problem. Eur. J. Oper. Res. 241(2), 283–308 (2015)
Hansen, N.: The CMA evolution strategy: a comparing review. In: Lozano, J.A., Larrañaga, P., Inza, I., Bengoetxea, E. (eds.) Towards a New Evolutionary Computation, vol. 192, pp. 75–102. Springer, Heidelberg (2006). https://doi.org/10.1007/3-540-32494-1_4
Lu, J., Han, J., Hu, Y., Zhang, G.: Multilevel decision-making: a survey. Inf. Sci. 346, 463–487 (2016)
MacDougall, W.: Industrie 4.0: Smart Manufacturing for the Future. Germany Trade & Invest, Berlin (2014)
Prins, C., Prodhon, C., Calvo, R.W.: Solving the capacitated location-routing problem by a grasp complemented by a learning process and a path relinking. 4OR: Q. J. Oper. Res. 4(3), 221–238 (2006)
Prodhon, C., Prins, C.: A survey of recent research on location-routing problems. Eur. J. Oper. Res. 238(1), 1–17 (2014)
Toth, P., Vigo, D.: Vehicle Routing: Problems, Methods, and Applications. SIAM (2014)
Von Stackelberg, H.: The Theory of the Market Economy. Oxford University Press, Oxford (1952)
Xu, X., Meng, Z., Shen, R.: A tri-level programming model based on conditional value-at-risk for three-stage supply chain management. Comput. Ind. Eng. 66(2), 470–475 (2013)
Acknowledgments
The work described in this paper was done within the COMET Project Heuristic Optimization in Production and Logistics (HOPL), #843532 funded by the Austrian Research Promotion Agency (FFG) and the Government of Upper Austria.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG
About this paper
Cite this paper
Hauder, V.A., Karder, J., Beham, A., Wagner, S., Affenzeller, M. (2018). A General Solution Approach for the Location Routing Problem. In: Moreno-Díaz, R., Pichler, F., Quesada-Arencibia, A. (eds) Computer Aided Systems Theory – EUROCAST 2017. EUROCAST 2017. Lecture Notes in Computer Science(), vol 10671. Springer, Cham. https://doi.org/10.1007/978-3-319-74718-7_31
Download citation
DOI: https://doi.org/10.1007/978-3-319-74718-7_31
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-74717-0
Online ISBN: 978-3-319-74718-7
eBook Packages: Computer ScienceComputer Science (R0)