摘要
考察车辆路径问题 :足够多的车座落在一个中心车库 ,车从车库出发 ,最终返回到车库 ,满足顾客的运输需求 ,求服务所有顾客的总费用最小。每辆车的装载量不超过它的容量。本文提出一个新的VRP模型及基于贪婪算法的启发式算法 ,并给出了算法的一个下界 。
The basic Vehicle Routing Problem (VRP) is considered as: a fleet of vehicles stationed at a central depot is to be optimally routed to supply customers with being known demands subject only to vehicle capacity constraints. In this paper, we present a new model of VRP and a heuristic algorithm based on the greedy algorithm. It found a lower bound, and an example of this algorithm is proposed.
出处
《河北建筑科技学院学报》
2002年第3期81-84,共4页
Journal of Hebei Institute of Architectural Science & Technology
