基于承运人视角的运输线路组合问题及粒子群算法求解

The Transportation Route Combination Problem Based on the Carrier Perspective andthe Particle Swarm Optimization Algorithm

运输服务组合拍卖能够很大程度地利用承运人的运力,而选择合适的运输线路组合是运输服务的关键问题之一。本文基于承运人的视角对运输线路组合问题展开研究,建立了承运人收益最大化数学模型。根据任务时间紧迫性设计了粒子群算法对模型求解,并通过数值算例验证了算法的可行性。

The combined auction of transportation services can make use of the carrier's capacity to a large extent,and choosing the right combination of transportation routes is one of the key issues for transportation services.Based on the perspective of the carrier,this paper studies the transportation route combination problem,and establishes a mathematical model for maximizing carrier revenue.According to the urgency of task time,a particle swarm algorithm is designed to solve the model,and the feasibility of the algorithm is verified by numerical examples.