基于一种特设启发式算法的车辆优化调度问题研究

Research on vehicle scheduling problem based on a special heuristic algorithm

建立数学模型将最小车辆规模问题转化为车辆共享网络的精确表述,设计行程共享网络,通过结合了Edmond匹配算法,Dijkstra算法等经典算法的特设启发式算法解决共享网络的最大匹配和最优路径问题,进一步揭示车辆共享网络的结构特性,通过推导计算效率较高的优化车辆部署和调度算法以最优地解决最小车辆规模问题。用matlab仿真,得出最佳参数Δ,k的特设启发式算法,并进一步证明了该算法通过行程组合,减少了行程数量,进一步减少了车辆的需求,进而实现减少交通拥堵和环境污染的目标。

Establish mathematical models to translate the minimum vehicle size problem into an accurate representation of the vehicle's shared network. Design the itinerary sharing network, and combine the Edmond matching algorithm, the Dijkstra algorithm and other classical algorithms to solve the maximum matching and optimal path problem of the shared network, and further reveal the structural characteristics of the vehicle shared network. Optimize vehicle deployment and scheduling algorithms with higher computational efficiency to optimally address minimum vehicle size issues. Simulated with matlab, the special heuristic algorithm of the optimal parameters Δ, k is obtained, and it is further proved that the algorithm reduces the number of strokes through the stroke combination, further reduces the demand of the vehicle, and achieves the goal of reducing traffic congestion and environmental pollution.