An overview of a heuristic for vehicle routing problem with time windows

doi:10.1016/S0360-8352(99)00086-8

完整後設資料紀錄

DC 欄位	值	語言
dc.contributor.author	Liu, FHF	en_US
dc.contributor.author	Shen, SY	en_US
dc.date.accessioned	2014-12-08T15:46:11Z	-
dc.date.available	2014-12-08T15:46:11Z	-
dc.date.issued	1999-10-01	en_US
dc.identifier.issn	0360-8352	en_US
dc.identifier.uri	http://dx.doi.org/10.1016/S0360-8352(99)00086-8	en_US
dc.identifier.uri	http://hdl.handle.net/11536/31055	-
dc.description.abstract	In this paper, a two-stage metaheuristic based on a new neighborhood structure is proposed to solve the vehicle routing problem with time windows. Our neighborhood construction focuses on the relationship between route(s) and node(s). Unlike the conventional methods for parallel route construction, we construct routes in a nested parallel manner to obtain higher solution quality. Computational results for 60 benchmark problems are reported. The results indicate that our approach is highly competitive with all existing heuristics, in particular very promising for solving problems with large size. (C) 1999 Elsevier Science Ltd. All rights reserved.	en_US
dc.language.iso	en_US	en_US
dc.subject	routing	en_US
dc.subject	time windows	en_US
dc.subject	neighborhood	en_US
dc.subject	heuristics	en_US
dc.title	An overview of a heuristic for vehicle routing problem with time windows	en_US
dc.type	Article	en_US
dc.identifier.doi	10.1016/S0360-8352(99)00086-8	en_US
dc.identifier.journal	COMPUTERS & INDUSTRIAL ENGINEERING	en_US
dc.citation.volume	37	en_US
dc.citation.issue	1-2	en_US
dc.citation.spage	331	en_US
dc.citation.epage	334	en_US
dc.contributor.department	工業工程與管理學系	zh_TW
dc.contributor.department	Department of Industrial Engineering and Management	en_US
dc.identifier.wosnumber	WOS:000081364300076	-
dc.citation.woscount	7	-
顯示於類別：	期刊論文

文件中的檔案：

000081364300076.pdf

若為 zip 檔案，請下載檔案解壓縮後，用瀏覽器開啟資料夾中的 index.html 瀏覽全文。