Study On The Optimization Of Workshop Vehicle Routing Problem Considering Distribution Congestion

Modern manufacturing industry is constantly getting close to the concept of ‘just in time' and ‘lean manufacturing',which lead a higher requirement for company's production efficiency and business efficiency.In the field of automobile manufacturing,many plants have set up cost reduction departments to implement lean production for improving projects.Based on the current data statistics at manufacturing field,the data shows there are only 15%-20% time of total manufacturing process used to production,while,for the logistics,almost 80%-85%.There are some problems like wasting time on material distribution or unreasonable logistic process lead to the high logistics cost.Therefore,based on the actual workshop production status,plan the people-station matching and material distribution route to make sure a higher production efficiency and a lower cost is very important.The character of workshop material distribution: large number of stations,plenty types of material,inconsistent frequency of replenish material.The results numerical results show that these three elements have good accuracy and convergence,and most important one is very limited area in workshop,especially around the line side,which could lead to an issue for material distribution: towtrain jam.Even there are plenty of research about vehicle routing problem,some of studies are about material distribution in plant workshop.While considering the congestion factors in VRP studies is very small.In this paper,a people-station matching model based on max balance is established,which mainly considered two factors: production efficiency and number of scrap.Then raised a vehicle routing problem model with time window and congestion constant to make sure material could be distributed on time and with the lowest time cost,which could make a higher efficient.To solve the raised model,this study used lingo and hungary to solve the people-station matching problem.And then use ant colony algorithm with tabu search to solve VRPTW with distribution jam.At the last part of this paper,company A workshop is used as an example to verify the model effectiveness.