摘要
当客户要求车辆一次性完成发送以及收集货物的任务时,只需考虑车辆的路径安排即可。但若客户进一步提出在时间窗内完成的话,就必须考虑客户的等待时间——客户的满意度的衡量标准,等待时间越短满意度越高。因此问题的目标为最小化车辆路径总长度、最小化所有客户等待时间之和。本文通过加权转变为单目标函数,由最邻近法及最廉价插入法得到初始解后经过禁忌搜索算法可得到改进算法,解并通过实例对不同权参数的情况进行了比较。
When customers require the vehicles to pickup and delivery goods simultaneous,we just consider how to arrange the path of every vehicle.However,if costomers further propose the vehicles to complete within time windows,costumers＇ waiting time which is regarded as the criterion of customers satisfaction must be considered,that is,the shorter,the higher the satisfaction.Therefore the goal is to minimize the total length of vehicles＇ paths,and to minimize the sum of all customers＇ waiting time.In this paper,combining into a single objective function by weight,initial solution,obtained by the nearest neighbor method and the cheapest insertion method,can be improved by tabu search algorithm.Finally solutions of different parameters are compared.
出处
《运筹与管理》
CSCD
北大核心
2011年第1期60-64,共5页
Operations Research and Management Science
基金
国家自然科学基金资助项目(20710015)
上海市教委研创新项目(08ZY78
07ZZ178)
关键词
运筹学
最邻近法
最廉价插入法
禁忌搜索法
车辆路径问题
客户满意度
vehicle routing problem
customer satisfaction
time window
nearest neighbor method
cheapest insertion method
tabu search
