QQ客服 官方微博 反馈留言

	Dynamic vehicle routing problem with multiple objectives - Solution framework and computational experiments
	Tang, H ; Hu, MW
	2010-05-10 ; 2010-05-10
会议名称	NETWORK MODELING 2005 ; 84th Annual Meeting of the Transportation-Research-Board ; Washington, DC ; Web of Science
关键词	TRAVELING SALESMAN PROBLEM A-RIDE PROBLEM TIME WINDOWS EUCLIDEAN PLANE CONSTRAINTS Engineering, Civil Transportation Transportation Science & Technology
中文摘要	This paper addresses a dynamic vehicle routing problem related to courier mail services with explicit consideration of multiple objectives. This problem is modeled as a dynamic traveling repairman problem with time windows, and with three objectives considered: maximization of the number of serviced customers, minimization of customer waiting, and minimization of total travel time. A solution (simulation) framework, extending techniques developed for single-objective dynamic routing problems in the literature, is proposed to tackle this multiobjective problem. An efficient chained local search heuristic is embedded in this solution framework to solve the underlying static problem, the traveling salesman problem with time windows. Comprehensive simulation experiments conducted on data sets derived from benchmark problems show that the proposed algorithmic approach is able to provide high-quality solutions with limited computing effort. These experiments also indicate that the multiobjective model proposed in this study can offer much more attractive solutions to decision makers than single-objective models.
会议录出版者	TRANSPORTATION RESEARCH BOARD NATL RESEARCH COUNCIL ; WASHINGTON ; 500 FIFTH ST, NW, WASHINGTON, DC 20001 USA
语种	英语 ; 英语
内容类型	会议论文
源URL	[http://hdl.handle.net/123456789/20082]
专题	清华大学
推荐引用方式 GB/T 7714	Tang, H,Hu, MW. Dynamic vehicle routing problem with multiple objectives - Solution framework and computational experiments[C]. 见:NETWORK MODELING 2005, 84th Annual Meeting of the Transportation-Research-Board, Washington, DC, Web of Science.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。