Researche On Scheduling OptimizationProblems In Automobile Loading-Field-Path Logistics Based On Graph Coloring Model

The core of this research paper is the vehicle logistics and warehousing center in the loading field path optimization scheduling problem,the so-called loading field path optimization scheduling problem is to consider how under certain constraint conditions for the arrival and departure of vehicles assigned to the storage center for the loading field path operations carried out to ensure the normal operation of vehicles and must meet a comprehensive management optimization objectives.Solution to this problem will improve our automobile logistics center management in the case of manual loading field path optimize management of scheduling,location assignment optimization computer implemented to adapt the rapid development of information technology,which helps companies improve the efficiency of device resources reduce expenses related logistics enterprises,but also can save manpower and other resources,so it has important research value and application value.This paper summarizes the relevant references and research at home and abroad on the basis of further logistics center loading field path optimization scheduling problem studied,mainly to do the work in three areas:First,the stocktaking study on the issue of domestic and foreign experts and scholars to analyze the existing problems.To clarify the presentation graph coloring model and the advantages of its presence in the scheduling optimization.Second,the conflict relationship with loading field path allocation model and algorithm.In order to minimize the number of occupied loading field paths and minimal scheduling field walking distance of the objective function by quantifying the large,medium,trails bit contribution to the objective function,the scheduling problem is converted into Optimal Weight-based graph coloring algorithm loading field paths model and algorithm determines the appropriate conflict,the difficulty factor and sorting algorithms conflict elimination algorithm is designed to answer.And the results of data analysis by examples and comparative verification proved that the model and the idea is feasible.Third,the loading field paths with a time delay problem assignment model and algorithm.loading field path allocation to the stability and robustness of the distribution plan for the destination,with delays in loading into the robust modeling graph coloring problem.For problem,,design and coding to achieve through a genetic algorithm to solve this problem,it proves the validity of the model and genetic algorithm.