A new efficient encoding mode of genetic algorithms for the generalized plant allocation problem

機構典藏 > College of Business and Management > Graduate Institute & Department of Information Management > Journal Article > Item 987654321/21079

Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/21079

Title:	A new efficient encoding mode of genetic algorithms for the generalized plant allocation problem
Authors:	侯永昌;Hou, Young-chang;張應華;Chang, Y. H.
Contributors:	淡江大學資訊管理學系
Date:	2004-09-01
Issue Date:	2009-11-30 13:13:08 (UTC+8)
Publisher:	中央研究院資訊科學研究所
Abstract:	This study proposes a novel, efficient means of encoding genetic algorithms to solve the generalized plant allocation problem. The problem relates to allocating products across plants to minimize a total cost function. The proposed encoding method can reduce the search space of solutions more efficiently than the penalty encoding method does. The new encoding method thus exhibits higher performance. It need involve only a few more generations to yield sufficiently good solutions when the number of plants is increased. The penalty encoding method, however, requires many more generations to yield the same solutions. Additionally, a new simultaneous crossover and mutation operation is proposed to enable the new method of encoding chromosomes to run correctly following standard genetic algorithm procedures. In addition to the mathematical certification, the performance of this approach is evaluated using some test problems of various sizes. Solutions obtained by this approach are always efficient.
Relation:	Journal of information science and engineering 20(5), pp.1019-1034
Appears in Collections:	[Graduate Institute & Department of Information Management] Journal Article

Files in This Item:

File	Size	Format
	0Kb	Unknown	432	View/Open
A new efficient encoding mode of genetic algorithms for the generalized plant allocation problem.pdf	198Kb	Adobe PDF	2	View/Open
index.html	0Kb	HTML	148	View/Open