Pub Date : 2021-04-20DOI: 10.1016/J.COR.2021.105338
Saurabh Chandra, Manish Sarkhel, A. Vatsa
{"title":"Capacitated facility location-allocation problem for wastewater treatment in an industrial cluster","authors":"Saurabh Chandra, Manish Sarkhel, A. Vatsa","doi":"10.1016/J.COR.2021.105338","DOIUrl":"https://doi.org/10.1016/J.COR.2021.105338","url":null,"abstract":"","PeriodicalId":10582,"journal":{"name":"Comput. Oper. Res.","volume":"13 1","pages":"105338"},"PeriodicalIF":0.0,"publicationDate":"2021-04-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78883214","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-04-10DOI: 10.1016/J.COR.2021.105299
Duy Tran, Behrouz Babaki, Dries Van Daele, Pieter Leyman, P. D. Causmaecker
{"title":"Local search for constrained graph clustering in biological networks","authors":"Duy Tran, Behrouz Babaki, Dries Van Daele, Pieter Leyman, P. D. Causmaecker","doi":"10.1016/J.COR.2021.105299","DOIUrl":"https://doi.org/10.1016/J.COR.2021.105299","url":null,"abstract":"","PeriodicalId":10582,"journal":{"name":"Comput. Oper. Res.","volume":"17 1","pages":"105299"},"PeriodicalIF":0.0,"publicationDate":"2021-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83692634","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-04-10DOI: 10.1016/J.COR.2021.105291
Abdoul Bitar, S. Dauzére-Pérés, C. Yugma
{"title":"Unrelated parallel machine scheduling with new criteria: Complexity and models","authors":"Abdoul Bitar, S. Dauzére-Pérés, C. Yugma","doi":"10.1016/J.COR.2021.105291","DOIUrl":"https://doi.org/10.1016/J.COR.2021.105291","url":null,"abstract":"","PeriodicalId":10582,"journal":{"name":"Comput. Oper. Res.","volume":"33 1","pages":"105291"},"PeriodicalIF":0.0,"publicationDate":"2021-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82459834","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
We study the type-2 integrated process-planning and scheduling (IPPS) problem where each job is represented by a directed network graph. To the best of our knowledge, there is only one mathematical model in the literature implementing the type-2 IPPS partially, and the solution methods available for this problem are all based on heuristics and metaheuristics. We introduce three properties that enable us to fully formulate all aspects of the type-2 IPPS problem with a mathematical programming model for the first time. To solve our model, we propose a logic-based Benders decomposition hybridized with constraint programming. We decompose the problem into two smaller problems in such a way that we can use the best solution technique for each part. To enhance our solution approach, we develop a relaxation. We evaluate our proposed method using a well-known benchmark including 24 instances and compare its performance with eight existing solution methods solving the same benchmark. We solve all the 24 instances of this benchmark to optimality where seven of these 24 instances are solved to optimality for the first time. We also generate a set of new 144 larger instances to further evaluate our solution methods and provide insights on when each method performs better.
{"title":"Type-2 integrated process-planning and scheduling problem: Reformulation and solution algorithms","authors":"B. Naderi, Mehmet A. Begen, G. Zaric","doi":"10.2139/SSRN.3838101","DOIUrl":"https://doi.org/10.2139/SSRN.3838101","url":null,"abstract":"We study the type-2 integrated process-planning and scheduling (IPPS) problem where each job is represented by a directed network graph. To the best of our knowledge, there is only one mathematical model in the literature implementing the type-2 IPPS partially, and the solution methods available for this problem are all based on heuristics and metaheuristics. We introduce three properties that enable us to fully formulate all aspects of the type-2 IPPS problem with a mathematical programming model for the first time. To solve our model, we propose a logic-based Benders decomposition hybridized with constraint programming. We decompose the problem into two smaller problems in such a way that we can use the best solution technique for each part. To enhance our solution approach, we develop a relaxation. We evaluate our proposed method using a well-known benchmark including 24 instances and compare its performance with eight existing solution methods solving the same benchmark. We solve all the 24 instances of this benchmark to optimality where seven of these 24 instances are solved to optimality for the first time. We also generate a set of new 144 larger instances to further evaluate our solution methods and provide insights on when each method performs better.","PeriodicalId":10582,"journal":{"name":"Comput. Oper. Res.","volume":"142 1","pages":"105728"},"PeriodicalIF":0.0,"publicationDate":"2021-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82094283","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-04-01DOI: 10.1016/J.COR.2021.105292
C. Filippi, G. Guastaroba, D. L. Huerta-Muñoz, M. Speranza
{"title":"A kernel search heuristic for a fair facility location problem","authors":"C. Filippi, G. Guastaroba, D. L. Huerta-Muñoz, M. Speranza","doi":"10.1016/J.COR.2021.105292","DOIUrl":"https://doi.org/10.1016/J.COR.2021.105292","url":null,"abstract":"","PeriodicalId":10582,"journal":{"name":"Comput. Oper. Res.","volume":"38 1","pages":"105292"},"PeriodicalIF":0.0,"publicationDate":"2021-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73266324","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-04-01DOI: 10.1016/j.cor.2020.105172
Yan Luo, Yinggui Zhang, Jiaxiao Huang, Huiyu Yang
{"title":"Multi-route planning of multimodal transportation for oversize and heavyweight cargo based on reconstruction","authors":"Yan Luo, Yinggui Zhang, Jiaxiao Huang, Huiyu Yang","doi":"10.1016/j.cor.2020.105172","DOIUrl":"https://doi.org/10.1016/j.cor.2020.105172","url":null,"abstract":"","PeriodicalId":10582,"journal":{"name":"Comput. Oper. Res.","volume":"93 1","pages":"105172"},"PeriodicalIF":0.0,"publicationDate":"2021-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80446564","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-04-01DOI: 10.1016/j.cor.2020.105174
M. Hassan, A. Saucier, S. Yacout, F. Soumis
{"title":"A mixed integer linear programming model for multi-sector planning using speed and heading changes","authors":"M. Hassan, A. Saucier, S. Yacout, F. Soumis","doi":"10.1016/j.cor.2020.105174","DOIUrl":"https://doi.org/10.1016/j.cor.2020.105174","url":null,"abstract":"","PeriodicalId":10582,"journal":{"name":"Comput. Oper. Res.","volume":"31 1","pages":"105174"},"PeriodicalIF":0.0,"publicationDate":"2021-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79960589","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-04-01DOI: 10.1016/j.cor.2020.105169
L. A. San-José, J. Sicilia, B. Abdul-Jalbar
{"title":"Optimal policy for an inventory system with demand dependent on price, time and frequency of advertisement","authors":"L. A. San-José, J. Sicilia, B. Abdul-Jalbar","doi":"10.1016/j.cor.2020.105169","DOIUrl":"https://doi.org/10.1016/j.cor.2020.105169","url":null,"abstract":"","PeriodicalId":10582,"journal":{"name":"Comput. Oper. Res.","volume":"12 1","pages":"105169"},"PeriodicalIF":0.0,"publicationDate":"2021-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88883736","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：