{"title":"求解单机总加权延迟问题的变邻域下降法","authors":"Hiba Yahyaoui, S. Krichen, B. Derbel, E. Talbi","doi":"10.1109/ICMSAO.2013.6552673","DOIUrl":null,"url":null,"abstract":"In this paper a Variable Neighborhood Descent (VND) approach, is developed to solve the Single Machine Total Weighted Tardiness Problem (SMTWTP). New strategy was proposed to select iteratively the accurate neighborhood. Our approach was compared to VND state-of-the-art approaches. Statistical tests were also applied on the empirical results, to show that the DR_VND outperforms the proposed approaches for 72 % of instances for the SMTWTP. The proposed approach was applied on a real case.","PeriodicalId":339666,"journal":{"name":"2013 5th International Conference on Modeling, Simulation and Applied Optimization (ICMSAO)","volume":"319 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"A Variable Neighborhood Descent for solving the Single Machine Total Weighted Tardiness Problem\",\"authors\":\"Hiba Yahyaoui, S. Krichen, B. Derbel, E. Talbi\",\"doi\":\"10.1109/ICMSAO.2013.6552673\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper a Variable Neighborhood Descent (VND) approach, is developed to solve the Single Machine Total Weighted Tardiness Problem (SMTWTP). New strategy was proposed to select iteratively the accurate neighborhood. Our approach was compared to VND state-of-the-art approaches. Statistical tests were also applied on the empirical results, to show that the DR_VND outperforms the proposed approaches for 72 % of instances for the SMTWTP. The proposed approach was applied on a real case.\",\"PeriodicalId\":339666,\"journal\":{\"name\":\"2013 5th International Conference on Modeling, Simulation and Applied Optimization (ICMSAO)\",\"volume\":\"319 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-04-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 5th International Conference on Modeling, Simulation and Applied Optimization (ICMSAO)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICMSAO.2013.6552673\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 5th International Conference on Modeling, Simulation and Applied Optimization (ICMSAO)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICMSAO.2013.6552673","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Variable Neighborhood Descent for solving the Single Machine Total Weighted Tardiness Problem
In this paper a Variable Neighborhood Descent (VND) approach, is developed to solve the Single Machine Total Weighted Tardiness Problem (SMTWTP). New strategy was proposed to select iteratively the accurate neighborhood. Our approach was compared to VND state-of-the-art approaches. Statistical tests were also applied on the empirical results, to show that the DR_VND outperforms the proposed approaches for 72 % of instances for the SMTWTP. The proposed approach was applied on a real case.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
