基于递进式蚁群算法求解多目标汽车制造排程问题1).pdfVIP

17 14 2006 7 叶 明 王宁生 南京航空航天大学, 南京, 210016 : 描述了多目标汽车排程问题的模型, 提出了一个 体解决策略, 即利用不同生产阶 段间的缓冲区, 通过基于改进的蚁群优化算法, 实现多目标汽车队列优化以及有限柔性下的队 列二次优化, 递进式地求解该问题提出运用蚁群算法解决以降低喷漆清洗成本和/ 重要选装 件0使用率均衡为目标的汽车队列优化问题; 设计了候选集) 蚁群算法求解环形油漆车身缓冲 区结构约束下的汽车队列二次优化问题算例分析结果表明, 提出的 体解决策略及算法具 有有效性和优越性 : ( CSP) ; ; ( ACO) ; : T P278 : 1004 ) 132X( 2006) 14 ) 1472 ) 05 A Step- ACO Algorithm for the Multi- obj ective Car Sequencing Problem Ye M ing Wang Ning heng Nanjing Univer ity of Aeronautic and A tronautic , Nanjing , 210016 Abstract: Thi paper pr e ented a mo del and the overall olution for the multi- objectiv e car e- quencing problem. By the com bination of multi- objective and ingle- objectiv e equencing optimiza- tion, w e u ed the buff er betw een diff erent pro duction tage to olve thi problem . Fir t , w e u ed ACO g et the car equence w hich ati f ied the objective of minim izing the co t of color purge and ta- bility of high pr iority option u ag e rate . T hen w e de igned Candidate- ACO to olve the CSP with limited flex ibility under the round tr ucture painted bo dy torag e. At la t , data how that the pro- po ed trategy and the algorithm are effective and u eful. Key words: car equencing problem( CSP) ; m ulti- objective optimization; ant colony optimization ( ACO) ; PBS 0 引言 , , , 3 , ( car equencing pr oblem, , CSP) , , , , , 3 , ) ( candidate ant colo ny optim ization, CA CO) CSP , ,