摘要
车辆调度问题(VRP)是广泛应用于物流配送等领域的一类组合优化问题。对实际中广泛存在的可选时间窗的车辆调度问题(VRPATW)进行了研究,建立了VRPATW问题的数学模型,并利用PFIH算法和禁忌搜索的混合算法进行求解,最后通过实验说明此算法解决VRPATW问题的有效性和可行性。
Vehicle Routing Problem （VRP） is a kind of combinatorial optimization problem which plays an important role in the fields of physical distribution and logistics.VRP with Alternative Time Windows （VRPATW） is studied,a mathematical model of VRPATW is established and a PFIH-tabu search algorithm is introduced to solve.Then computational results are provided to show that the algorithm can be used to solve VRPATW efficiently.
出处
《计算机工程与应用》
CSCD
北大核心
2007年第26期181-183,共3页
Computer Engineering and Applications
基金
国家自然科学基金(the National Natural Science Foundation of Chinaunder GrantNo70471046)
