The Way of Solving Traveling Salesman Problem the Research on Scheduling in AS/RS

doi:10.1016/j.proeng.2011.08.1130

CORC > 兰州理工大学 > 兰州理工大学 > 机电工程学院

	The Way of Solving Traveling Salesman Problem the Research on Scheduling in AS/RS
	Fang Jingfang 1; Wang Ying 2; Lei Chunli 1; Feng Rui-cheng 1
	2011
关键词	AS/RS scheduling genetic algorithm heuristics
卷号	16
DOI	10.1016/j.proeng.2011.08.1130
英文摘要	The mathematical modeling of scheduling was established based on analyzing methods of solving TSP, and scheduling in AS/RS is concluded to be the methods of solving TSP. In order to solve TSP of scheduling in AS/RS, a modified genetic algorithm is applied. At last modified genetic algorithm, 3-opt heuristic algorithm and FIFO compared with each other by simulating result of them. (c) 2010 Published by Elsevier Ltd. Selection and/or peer-review under responsibility of Society for Automobile, Power and Energy Engineering
会议录	INTERNATIONAL WORKSHOP ON AUTOMOBILE, POWER AND ENERGY ENGINEERING
会议录出版者	ELSEVIER SCIENCE BV
会议录出版地	SARA BURGERHARTSTRAAT 25, PO BOX 211, 1000 AE AMSTERDAM, NETHERLANDS
语种	英语
WOS研究方向	Energy & Fuels ; Transportation
WOS记录号	WOS:000300376900088
内容类型	会议论文
源URL	[http://119.78.100.223/handle/2XXMBERH/37506]
专题	机电工程学院
通讯作者	Fang Jingfang
作者单位	1.Lanzhou Univ Technol, Key Lab Digital Mfg Technol & Applicat, Minist Educ, Lanzhou, Peoples R China 2.Zhejiang Gongshang Univ Coll Finance, Hangzhou, Peoples R China
推荐引用方式 GB/T 7714	Fang Jingfang,Wang Ying,Lei Chunli,et al. The Way of Solving Traveling Salesman Problem the Research on Scheduling in AS/RS[C]. 见:.