摘要
建立了具有时间约束的满载VSP问题的线性规划模型,给出了一种基于节约值比较的旨在最小化成本的启发式算法。该算法将满载车辆路线分为三种基本结构,即两点往返、多点连续实载、多点间隔实载,将车辆固定成本和变动成本同时加入到节约值计算中,根据路线结构计算更新节约值,在考虑时间约束的基础上参考节约值最大或机会节约值最大两种策略选择任务连接,得出车辆调度路线。经算例证明,该算法求得优化的调度路线。
The problem of scheduling vehicles to execute a set of orders in full truckload under time window constraints was discussed in this paper. An algorithm based on saving comparison to the LP model was developed which aims to minimize the vehicle cost. After summarizing three basic route structures and adding both fixed and variable costs of vehicles into saving calculation, a optimized route was got by choosing the connecting technique like saving maximization or opportunity-saving maximization. It proves to get an optimized result via the example.
出处
《工业工程与管理》
2006年第4期39-42,49,共5页
Industrial Engineering and Management
基金
上海市科委重大科技攻关项目(03dz15006)
关键词
节约法
机会节约值
固定成本
车辆调度
saving matrix method
opportunity saving
fixed cost
vehicle scheduling
