Abstract
In this paper, two different lower bound models are proposed for the bottleneck process and logistics distribution in production logistics. The objective is to minimize the cost, which is a typical NP hard combinatorial optimization problem. Firstly, the optimal distribution quantity is determined for the bottleneck process in production. Secondly, the distribution problem is modeled as vehicle routing problem with time window (VRPTW), and some variables and constraints are relaxed. Thirdly, in order to improve the lower bound of the model, a Lagrangian relaxation model for VRPTW is designed, and an improved subgradient algorithm is proposed. Simulation results show that the algorithm proposed in this paper is effective for the problem and can calculate a tight lower bound.
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
Similar content being viewed by others
References
Zhenyun, P., Yi, G., Zhaolin, T.: Fundamentals and Applications of MES, 7. China Machine Press, Beijing (2021)
Zhihong, L., Hongchao, W., Chenhao, Z.: A distributed intelligent control system solution for discrete manufacturing industry. Ordnance Autom. (1), 7–10 ( 2017)
Dejun, Z., Xiucai, Z., Pengfei, C., et al.: Research on networked testing technology of electronic equipment production and testing line. Electron. Test. 435(06), 66–68 (2020)
Chunting, X., Chunlin, Z., Chong, Z., et al.: Research and implementation of MES in discrete manufacturing workshop. Aviat. Manuf. Technol. 11, 86–89 (2012)
Watson, K.J., Blackstone, J.H., Gardiner, S.C.: The evolution of a management philosophy: the theory of constraints. J. Oper. Manag. 25(2), 387–402 (2007)
Simatupang, T.M., Wright, A.C., Sridharan, R.: Applying the theory of constraints to supply chain collaboration (2004)
Reimer, G.: Material requirements planning and theory of constraints: can they coexist? a case study. Prod. Invent. Manag. J. 32(4), 48–52 (1991)
Cook, D.P.: Simulation comparison of traditional, JIT, and TOC manufacturing systems in a flow shop with bottlenecks (1994)
Dantzig, G.B., Ramser, J.H.: The truck dispatching problem. Manag. Sci. 6(1), 80-91 (1959)
Savelsbergh, M.: Local search for routing problems with time windows. Ann. Oper. Res. 4, 285–305 (1985)
Wang, Y., Wang, L., Chen, G., et al.: An improved ant colony optimization algorithm to the periodic vehicle routing problem with time window and service choice. Swarm Evol. Comput. 55, 100675 (2020)
Ursani, Z., Essam, D., Cornforth, D., et al.: Localized genetic algorithm for vehicle routing problem with time windows. Appl. Soft Comput. 11(8), 5375–5390 (2011)
Errico, F., Desaulniers, G., Gendreau, M., Rei, W., Rousseau, L.-M.: The vehicle routing problem with hard time windows and stochastic service times. EURO J. Transp. Logist. 7(3), 223–251 (2016). https://doi.org/10.1007/s13676-016-0101-4
Kallehauge, B., Larsen, J., Madsen, O.: Lagrangian duality applied to the vehicle routing problem with tim windows. Comput. Oper. Res. 33(5), 1464–1487 (2006)
Hongbo, W.: Research on Production Logistics Optimization of Structural Parts Manufacturing Workshop of North Communications Heavy Industry Group. Shenyang University of technology, Shenyang (2013)
Acknowledgments
This research is partially supported by the National Science Foundation of China (61963022), and National Science Foundation of China (51665025).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Yu, NK., Hu, R., Qian, B., Wang, L. (2021). An Improved Lagrangian Relaxation Algorithm for Solving the Lower Bound of Production Logistics. In: Huang, DS., Jo, KH., Li, J., Gribova, V., Bevilacqua, V. (eds) Intelligent Computing Theories and Application. ICIC 2021. Lecture Notes in Computer Science(), vol 12836. Springer, Cham. https://doi.org/10.1007/978-3-030-84522-3_53
Download citation
DOI: https://doi.org/10.1007/978-3-030-84522-3_53
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-84521-6
Online ISBN: 978-3-030-84522-3
eBook Packages: Computer ScienceComputer Science (R0)