一类带时间窗车辆分配问题的贪婪算法

摘要

本文对一类带时间窗的车辆分配问题进行了分析，引入了车辆任务的概念，并将问题转化为车辆与车辆任务的匹配问题，同时制订了运输任务选择和车辆选择的贪婪策略，并在此基础上设计了车辆分配问题的贪婪算法，最后通过实例验证了算法的有效性。%A vehicle allocation problem with time windows is analyzed .The concept of vehicle task is defined . The vehicle allocation problem is transformed into the problem : the vehicle matches the vehicle task .And the greedy method of choice transportation task and vehicle are instituted .On the basis of the above, the greedy al-gorithm on vehicle allocation is devised.At last a case is proved to validate the feasibility of the algorithm .