求解1/3变量时空装配线平衡问题的多目标模因蚁群优化算法

2011 IEEE Workshop On Computational Intelligence In Production And Logistics Systems (CIPLS) Pub Date : 2011-04-11 DOI:10.1109/CIPLS.2011.5953354

M. Chica, O. Cordón, S. Damas, J. Bautista

{"title":"求解1/3变量时空装配线平衡问题的多目标模因蚁群优化算法","authors":"M. Chica, O. Cordón, S. Damas, J. Bautista","doi":"10.1109/CIPLS.2011.5953354","DOIUrl":null,"url":null,"abstract":"Time and space assembly line balancing considers realistic multiobjective versions of the classical assembly line balancing industrial problems, involving the joint optimization of conflicting criteria such as the cycle time, the number of stations, and/or the area of these stations. The aim of this contribution is to present a new multiobjective memetic algorithm based on ant colony optimization for the 1/3 variant of this family of industrial problems. This variant involves the joint minimisation of the number and the area of the stations, given a fixed cycle time limit. The good behaviour of the proposal is shown in nine problem instances.","PeriodicalId":103768,"journal":{"name":"2011 IEEE Workshop On Computational Intelligence In Production And Logistics Systems (CIPLS)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"A multiobjective memetic ant colony optimization algorithm for the 1/3 variant of the time and space assembly line balancing problem\",\"authors\":\"M. Chica, O. Cordón, S. Damas, J. Bautista\",\"doi\":\"10.1109/CIPLS.2011.5953354\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Time and space assembly line balancing considers realistic multiobjective versions of the classical assembly line balancing industrial problems, involving the joint optimization of conflicting criteria such as the cycle time, the number of stations, and/or the area of these stations. The aim of this contribution is to present a new multiobjective memetic algorithm based on ant colony optimization for the 1/3 variant of this family of industrial problems. This variant involves the joint minimisation of the number and the area of the stations, given a fixed cycle time limit. The good behaviour of the proposal is shown in nine problem instances.\",\"PeriodicalId\":103768,\"journal\":{\"name\":\"2011 IEEE Workshop On Computational Intelligence In Production And Logistics Systems (CIPLS)\",\"volume\":\"35 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-04-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 IEEE Workshop On Computational Intelligence In Production And Logistics Systems (CIPLS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CIPLS.2011.5953354\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE Workshop On Computational Intelligence In Production And Logistics Systems (CIPLS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIPLS.2011.5953354","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 9

摘要

时间和空间装配线平衡考虑了经典装配线平衡工业问题的现实多目标版本，涉及周期时间、工位数量和/或这些工位面积等冲突标准的联合优化。本文的目的是提出一种新的基于蚁群优化的多目标模因算法，用于解决这类工业问题的1/3变体。这种变体涉及在给定固定周期时间限制的情况下，联合最小化站点的数量和面积。通过9个问题实例证明了该方案的良好性能。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A multiobjective memetic ant colony optimization algorithm for the 1/3 variant of the time and space assembly line balancing problem

Time and space assembly line balancing considers realistic multiobjective versions of the classical assembly line balancing industrial problems, involving the joint optimization of conflicting criteria such as the cycle time, the number of stations, and/or the area of these stations. The aim of this contribution is to present a new multiobjective memetic algorithm based on ant colony optimization for the 1/3 variant of this family of industrial problems. This variant involves the joint minimisation of the number and the area of the stations, given a fixed cycle time limit. The good behaviour of the proposal is shown in nine problem instances.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2011 IEEE Workshop On Computational Intelligence In Production And Logistics Systems (CIPLS)

自引率

0.00%

发文量