Research On Models And Algorithms Of Bin Packing Problem With Pattern Constraint In Automotive Outbound Logistics

Driven by the in-depth globalization and the rapid economic development in China,the resident's living standards have been greatly improved,and the demand for household cars is hence promoted.With the number of cars sold growing,the automotive logistics companies are trying to offer diversified services.Rapid response,agile manufacturing,intelligent loading and the optimum path have become important criterions to decide whether the logistics activities are good or not.What's more,they are also important means for companies to strengthen its core competitiveness and improve the market share.Among the means of transport,highway transportation is the most commonly used.As is known,there are about 11,000 vehicles registered,attached to hundreds of logistics companies,which makes each company has just a little transportation resources.Therefore,it is a significant problem for the logistics company to satisfy the customers' needs with the limited transportation resources.In order to solve the problem of carrier loading in logistics transportation.This paper analyzed the out-bound logistics activities in detail from two aspects including organization and entity,such as carriers,manufacturers,distributors,commercial vehicles,car carrier,warehouse and many other factors,and constructed a full set of out-logistics system.On this basis,a 0-1 mixed integer mathematical programming model is established for the practical problem.The representative constraints and targets are described by the key variables and functions,while the practical problem is completely transformed into a mathematical programing problem which can be optimized by computers.For the mathematical model,two algorithms are designed in the paper.One is heuristic algorithm based on basic business rules,and the other is improved branch and bound algorithm based on greedy strategy.For the heuristic algorithm,the concrete steps of the algorithm are discussed and the flow chart is given.For the improved branch and bound algorithm,the upper and lower bounds,are discussed,besides the branching strategy,the searching mode and the dominating rules.In addition,the advantages and disadvantages of the two algorithms are expounded in detail,more than that,some defects are improved to a certain extent,so the stability and applicability of the algorithm are guaranteed.In order to verify the validity of the model and the algorithm,experiments with test data in different scales are further carried on to evaluate the performance of algorithms according to the objective function value,the loading ratio and the time-consuming.Simultaneously,in order to confirm the practicability of the algorithm,a certain historical scheduling data is calculated,and the final calculation results are compared with those of the dispatcher scheduling scheme,which shows the applicability of the optimization algorithm designed in this paper to the real scene.