关键词: 物流配送, 车辆调度, 粒子群优化算法, 爬山算法

Abstract: The logistics distribution vehicle scheduling problem is to arrange distribution efficiently with limited resources. The optimization goal is to obtain a program which has lower cost with the constraints of the requirements of the users and the conditions of the vehicles. Affected by many factors, such as the location and requirement of customers, and the transport capacity of delivery vehicles, the vehicle scheduling problem is very complicated. A mathematical model of the double-way vehicle scheduling problem is established, considering the mile limit and user limit, and referring to the classic vehicle routing problem model. Based on the particle swarm optimization, a distribution vehicle scheduling algorithm is given. And by using hill-climbing methods, the local searching ability of the particle swarm optimization algorithm is improved.

Key words: logistics distribution, vehicle scheduling, particle swarm optimization, hill-climbing method