Collaboration Model And Algorithm Research On Automotive Inbound Logistics

With the development of economy,market demand for automotive is rapidly increasing,and competition is becoming more and more fierce.As an important part of automotive logistics,inbound logistics of automotive parts plays an important role in achieving just-in-time production,reducing costs,and improving system efficiency.However,there are still many aspects that need to be improved urgently.The collaboration research based on automobile logistics system can provide some ideas and suggestions to improve current situation,help to improve operational efficiency,reduce system costs,and improve the competitiveness of automotive enterprises and third-party logistics companies.Inbound logistics of automotive parts covers manufacturers,suppliers and third-party logistics.This paper studies the collaboration of the three participants,so that manufacturers,suppliers and third-party logistics enterprises can share relevant information,rationally allocate resources,achieve benefit-sharing and risk-sharing,ultimately maximize system benefits and reduce system costs.Firstly,this paper systematically studies the inbound logistics of automotive parts.This paper introduces the constituent elements of inbound logistics system.It also introduces three subsystems of inbound logistics system: production planning system,transportation management system and warehouse management system.Secondly,the problem of consolidation collaboration and order quantity collaboration is put forward.These two problems are introduced and analyzed in detail in Chapter 3 and Chapter 4.Mixed integer programming models are established respectively,which can be solved by mathematical solver.Based on characteristics of the problems,heuristic algorithm and branch and bound method are designed respectively.Branch and bound method is a commonly used precise algorithm in integer programming.Its basic idea is to decompose the original problem into smaller sub-problems based on branching strategy.It mainly includes three parts: branching strategy,upper and lower bounds design,search pattern,and domination rules.Finally,heuristic algorithms,branch and bound methods for consolidation collaboration and order quantity collaboration are carried out using codes.In order to validate the effectiveness of the models and algorithms,and compare the results of the two algorithms and CPLEX solver,numerical experiments are designed to simulate the logistics process of parts in different situations.By comparing calculation time and solution result of CPLEX,heuristic algorithm,branch and bound method,the feasibility and optimization effect of the model and algorithm are verified.