A Threshold Accepting Meta-heuristic for the Vehicle Routing Problem with Backhauls and Time Windows

CHUR > College of Management > Department of Transportation Technology and Logistice Management > Journal Articles > Item 987654321/35901

Please use this identifier to cite or link to this item: http://chur.chu.edu.tw/handle/987654321/35901

Title:	A Threshold Accepting Meta-heuristic for the Vehicle Routing Problem with Backhauls and Time Windows
Authors:	卓裕仁 Cho, Yuh-Jen
Contributors:	運輸科技與物流管理學系 Transportation Technology and Logistics Management
Keywords:	meta-heuristic;threshold accepting;vehicle routing problem;backhauls;time windows
Date:	2005
Issue Date:	2014-06-27 10:54:57 (UTC+8)
Abstract:	This paper presents a meta-heuristic, which is based on the Threshold Accepting combined with modified Nearest Neighbor and Exchange procedures, to solve the Vehicle Routing Problem with Backhauls and Time Windows (VRPBTW). The VRPBTW assumes that trucks
Appears in Collections:	[Department of Transportation Technology and Logistice Management] Journal Articles

Files in This Item:

File	Description	Size	Format
p_m620_0058.pdf		26Kb	Adobe PDF	154	View/Open