Modern Logistics Distribution Vehicle Scheduling Problem

Recent years, logistics, taken as "third profit resource", has been developing rapidly. The object of logistics is to satisfy the requirements of consumers with least cost. As an especial and integrated activity of logistics, delivery brings into play more and more important effect in the modern society along with network age coming. For the corporations of logistics, vehicle scheduling problem is the key part of modern logistics system, and also the indispensable portion of the e-business activities.At present, the algorithms solving vehicle scheduling problem is plenty. But this problem is very complex and its restriction conditions are diversiform, so solving this problem needs to pay out prodigious cost, either or does a great deal of predigestions . These cumber the problem's solving badly.Whereas such circumstances, we studied a type of vehicle scheduling problem that single motor pool, multi-vehicles with time window in this paper. Based on reading lots of correlate papers, we classified and analyzed the restrictions and math models of vehicle scheduling problem. Simultaneity, we compare and analyze the basic idea, capability and applicability of tradition heuristic algorithm, tabu search algorithm and genetic algorithm. Based on this, we put forward a Genetic-Tabu hybrid meta-heuristic algorithm for vehicle scheduling problem and ameliorate its select operation and neighborhood structure operation, and getting across an example validates this algorithm's applicability.Genetic-Tabu hybrid meta-heuristic algorithm constructed in this paper is a double-deck structure. It makes the best of search methods in different fields. Exemplifications prove that this algorithm enhance capability of optimization, solving efficiency and reliability of running. Genetic-Tabu hybrid meta-heuristic algorithm counts for academic research and appliance in practice.