基于匈牙利算法的多车型配送问题  

Heterogeneous-vehicle Distribution Problem Based on Hungarian Algorithm

作　　者：于焕英[1] 孙晚华[1] 何峣[2] 

机构地区：[1]北京交通大学交通运输学院,北京100044 [2]香港科技大学

出　　处：《物流技术》2010年第11期74-75,共2页Logistics Technology

摘　　要：多车型车辆调度是一类高难度的运输决策工作,在编制合理的车辆使用方案过程中,要求以最低的费用完成运输工作量,实现经济效益最大化。不同种类的货物要求不同的运输车辆,通过对车辆需求特性及车辆参数的分析,建立了以最小总油耗量为目标函数的车辆调度模型,选用匈牙利算法对该模型求解,经过实际计算验证,结果切实可行。Heterogeneous-vehicle scheduling is a difficult task of transportation decision-making, which, during the drawing up of efficient vehicle dispatching plans, requires accomplishing the transport workload at minimal cost to maximize economic benefit. In view of the fact that different cargoes have demand for different transportation vehicles, the paper analyzes characteristics of vehicle demand and vehicle pa- rameters, establishes a vehicle scheduling model with minimal fuel consumption as the target function and employs Hungarian algorithm for its solution, which is verified as effective and feasible by a subsequent numerical study.

关 键 词：匈牙利算法 多车型 配送 

分 类 号：F224.0[经济管理—国民经济]