|
In recent years , the logistics as \The goal is that the logistics for the least cost to meet consumer demand . As a special kind of distribution logistics , integrated forms of activities, in today's social and economic development is playing an increasingly important role. For logistics companies, logistics and distribution logistics vehicle scheduling system optimization is a key ring , but also an indispensable element in e-commerce activities . Correct and reasonable for vehicle scheduling , can effectively reduce vehicle Kongshi rate, reduce transportation costs, improve economic efficiency. Currently, vehicle scheduling problem solving many algorithms . However, as the problem is very complex , diverse constraints , solving the problem or need to pay a high price , or the problem for a lot of simplification , which are a serious impediment to the actual problem solving . Given this situation , the paper velodrome and more models with non- full time window of vehicle scheduling problem is studied . After reading a lot of papers on the basis of relevant information on the existing vehicle scheduling problem and the constraints of a mathematical model of classification analysis ; same time, the traditional heuristic algorithm, tabu search algorithms and the basic idea of ??genetic algorithms , performance, the applicability of a comparative analysis on the basis of the paper introduces tabu hybrid heuristic algorithm to solve the logistics distribution vehicle scheduling problem , and its selection operation , operation neighborhood structure has been improved , and the algorithm is verified by an example performance. This structure Tabu hybrid heuristic search algorithm is a two-tier structure, the full use of the different areas of the search method. Tabu hybrid heuristic algorithm for comparative analysis showed that: compared with the related algorithms , and its optimization capabilities , operational efficiency, reliability has improved to some extent , has a certain application value.
|