农业食品工业单机调度问题的新型并行遗传算法

2011 International Conference on Communications, Computing and Control Applications (CCCA) Pub Date : 2011-03-03 DOI:10.1109/CCCA.2011.6031216

Asma Karray, M. Benrejeb, P. Borne

{"title":"农业食品工业单机调度问题的新型并行遗传算法","authors":"Asma Karray, M. Benrejeb, P. Borne","doi":"10.1109/CCCA.2011.6031216","DOIUrl":null,"url":null,"abstract":"this paper investigates the multi-objective single-machine scheduling problems in agro-food industry. These problems are strongly NP-hard and metaheuristics are known for theirs adaptability to this kind of problems. In this paper, is developed a novel parallel genetic algorithm to solve the single-machine scheduling problems. A comparison between the conventional and parallel versions of genetic algorithm is provided. It relates to the quality of the solution and the execution time of the two approaches. Computational experiments on benchmark data sets show that the proposed approach reach better solutions in short computational times.","PeriodicalId":259067,"journal":{"name":"2011 International Conference on Communications, Computing and Control Applications (CCCA)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"New parallel genetic algorithms for the single-machine scheduling problems in agro-food industry\",\"authors\":\"Asma Karray, M. Benrejeb, P. Borne\",\"doi\":\"10.1109/CCCA.2011.6031216\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"this paper investigates the multi-objective single-machine scheduling problems in agro-food industry. These problems are strongly NP-hard and metaheuristics are known for theirs adaptability to this kind of problems. In this paper, is developed a novel parallel genetic algorithm to solve the single-machine scheduling problems. A comparison between the conventional and parallel versions of genetic algorithm is provided. It relates to the quality of the solution and the execution time of the two approaches. Computational experiments on benchmark data sets show that the proposed approach reach better solutions in short computational times.\",\"PeriodicalId\":259067,\"journal\":{\"name\":\"2011 International Conference on Communications, Computing and Control Applications (CCCA)\",\"volume\":\"16 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-03-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 International Conference on Communications, Computing and Control Applications (CCCA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CCCA.2011.6031216\",\"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 International Conference on Communications, Computing and Control Applications (CCCA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCCA.2011.6031216","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 7

摘要

研究了农业食品工业中的多目标单机调度问题。这些问题具有很强的np难度，而元启发式以其对这类问题的适应性而闻名。本文提出了一种新的并行遗传算法来解决单机调度问题。对传统遗传算法和并行遗传算法进行了比较。它与解决方案的质量和两种方法的执行时间有关。在基准数据集上的计算实验表明，该方法在较短的计算时间内得到了较好的解。

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

查看原文本刊更多论文

New parallel genetic algorithms for the single-machine scheduling problems in agro-food industry

this paper investigates the multi-objective single-machine scheduling problems in agro-food industry. These problems are strongly NP-hard and metaheuristics are known for theirs adaptability to this kind of problems. In this paper, is developed a novel parallel genetic algorithm to solve the single-machine scheduling problems. A comparison between the conventional and parallel versions of genetic algorithm is provided. It relates to the quality of the solution and the execution time of the two approaches. Computational experiments on benchmark data sets show that the proposed approach reach better solutions in short computational times.

求助全文

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

来源期刊

2011 International Conference on Communications, Computing and Control Applications (CCCA)

自引率

0.00%

发文量