摘要
本文主要研究周期固定、需求已知的变质性产品经济批量问题求解算法,在现有研究的基础上,针对以往启发式算法从单一结点搜索而效率低、计算量大的缺点,提出一种遗传算法.本算法将订货周期序列进行编码.为了能将最优个体保留到下一代,要在生成下一代种群之前将当前最优个体与上一代最优个体进行比较,保留最优个体到下一代种群中,然后进行选择.
The main goal of this paper is to study solution algorithm of economic lot size problems with perishable inventory, basis studying in now available document, calculate amounts big shortcomings, giving that one kind a genetic algorithm specifically for the heuristic method algorithm in the past searching for. This algorithm carries out the period array ordering goods encoding. For being able to optimize individual reserve arrive at younger generation, general present is give preferential treatment most particular and previous optimum individual of generation carries out comparison before generating younger generation population, reserving optimum arriving at making one＇s option then in younger generation population.
出处
《哈尔滨理工大学学报》
CAS
2008年第6期46-48,52,共4页
Journal of Harbin University of Science and Technology
关键词
经济批量
遗传算法
种群
economic lot size
genetic algorithm
population
