Research And Practice Of Vehicle Scheduling Problem In Logistics Distribution

Along with the economic globalization and the network information technique stepping up, the modern logistics catches the whole social attention extensively as a new economy growth point. Being the direct means of the customer service, the model logistics is the important tache in the modern logistics undoubtedly, whether the distribution route is reasonable or not, it has great influence on distribution rate, transport cost and economic benefit. It is a very important work in the logistics distribution activity to constitute the distribution route by scientific and reasonable methods. It is significant meaning to raise the enterprise service quantity and strengthen the enterprise competition. The vehicle scheduling problem is the very core of the content in the logistics scopes, it is a typical NP-hard problem, involving in many research subjects such as operations research, applied mathematics, combinatorial optimization, network analysis, computer software, computer applications, logistics science, transportation management, etc. VSP becomes advanced and hot spots in the field of operations research and combinatorial optimization research, researches for VSP can promote actively the development of the theory and method of combinatorial optimization.The research result of the domestic and international VSP is analyised systematically completely in this paper. Based on the mathematics model, the target function and subject condition for logistics vehicle scheduling problem model is presented which adapt to the actual request of manufacturing. The non-full loaded pure pickup or pure delivery without time windows and with time windows VSP model is builded. By constructing the time windows testing subject condition, VSP with hard time windows is solved. The method extends the domain of applicability of the C-W method, and the way of handling the time constraints can be extended to other hetaistics of TSP. It is easy for the algorithm to handle all kinds of constraints and is provided with better interactive characteristic.In the course of constructing the route, the reduplicate delivery to domicile is eliminated.In the course of solving problem, the C-W saving methods is modified properly and combines with theDijkstra single-source shortest path algorithm, which not only the feasible result for the actual requests is accepted, but the question that the connotative point affects on the final path is analysied. By building the logistics vehivle scheduling system for manufacturing, the feasibility and feasibility of the above algorithm is verified.