{"title":"A family of hybrid conjugate gradient method with restart procedure for unconstrained optimizations and image restorations","authors":"Xianzhen Jiang, X. Ye, Zefeng Huang, Meixing Liu","doi":"10.2139/ssrn.4352068","DOIUrl":"https://doi.org/10.2139/ssrn.4352068","url":null,"abstract":"","PeriodicalId":10582,"journal":{"name":"Comput. Oper. Res.","volume":"68 1","pages":"106341"},"PeriodicalIF":0.0,"publicationDate":"2023-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82340377","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}
{"title":"Using submodularity in solving the robust bandwidth packing problem with queuing delay guarantees","authors":"Seulgi Joung","doi":"10.2139/ssrn.4352072","DOIUrl":"https://doi.org/10.2139/ssrn.4352072","url":null,"abstract":"","PeriodicalId":10582,"journal":{"name":"Comput. Oper. Res.","volume":"8 1","pages":"106374"},"PeriodicalIF":0.0,"publicationDate":"2023-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90830511","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}
Zhipeng Lü, Yuan Fang, Zhouxing Su, Yang Wang, Xinyun Wu, F. Glover
{"title":"Dual-neighborhood iterated local search for routing and wavelength assignment","authors":"Zhipeng Lü, Yuan Fang, Zhouxing Su, Yang Wang, Xinyun Wu, F. Glover","doi":"10.2139/ssrn.4329421","DOIUrl":"https://doi.org/10.2139/ssrn.4329421","url":null,"abstract":"","PeriodicalId":10582,"journal":{"name":"Comput. Oper. Res.","volume":"45 1","pages":"106396"},"PeriodicalIF":0.0,"publicationDate":"2023-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86355721","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}
Mariam Sangaré, Eric Bourreau, B. Fortz, Amaury Pachurka, Michael Poss
This paper focuses on optimizing the collective self-consumption rate in energy communities by scheduling members’ loads. The community remains connected to the public grid and comprises pro-sumers, traditional consumers, and distributed storage units. Prosumers can exchange their energy with the public grid or other members. The proposed strategy aims at implementing a Demand Side Management program taking advantage of controllable loads’ characteristics. A MILP formulation of the problem allows, on the one hand, to give the optimal planning for electrical devices’ operations. On the other hand, it provides optimal solutions for managing the storage units, peer-to-peer exchanges, and interactions with the public grid to minimize the energy flows from the public grid over time. However, this MILP only allows for solving small problem instances. Thus, we develop a column generation-based heuristic for large problem instances. Our numerical experiments based on real data collected in the south of France show that joining an energy community saves money on energy bills and reduces the total energy drawn from the primary grid by at least 15%.
{"title":"Loads scheduling for demand response in energy communities","authors":"Mariam Sangaré, Eric Bourreau, B. Fortz, Amaury Pachurka, Michael Poss","doi":"10.2139/ssrn.4255726","DOIUrl":"https://doi.org/10.2139/ssrn.4255726","url":null,"abstract":"This paper focuses on optimizing the collective self-consumption rate in energy communities by scheduling members’ loads. The community remains connected to the public grid and comprises pro-sumers, traditional consumers, and distributed storage units. Prosumers can exchange their energy with the public grid or other members. The proposed strategy aims at implementing a Demand Side Management program taking advantage of controllable loads’ characteristics. A MILP formulation of the problem allows, on the one hand, to give the optimal planning for electrical devices’ operations. On the other hand, it provides optimal solutions for managing the storage units, peer-to-peer exchanges, and interactions with the public grid to minimize the energy flows from the public grid over time. However, this MILP only allows for solving small problem instances. Thus, we develop a column generation-based heuristic for large problem instances. Our numerical experiments based on real data collected in the south of France show that joining an energy community saves money on energy bills and reduces the total energy drawn from the primary grid by at least 15%.","PeriodicalId":10582,"journal":{"name":"Comput. Oper. Res.","volume":"43 1","pages":"106358"},"PeriodicalIF":0.0,"publicationDate":"2023-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87797991","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}
{"title":"Simulation-based inventory management of perishable products via linear discrete choice models","authors":"D. Gioia, L. Felizardo, P. Brandimarte","doi":"10.2139/ssrn.4207541","DOIUrl":"https://doi.org/10.2139/ssrn.4207541","url":null,"abstract":"","PeriodicalId":10582,"journal":{"name":"Comput. Oper. Res.","volume":"5 1","pages":"106270"},"PeriodicalIF":0.0,"publicationDate":"2023-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72587014","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}
{"title":"A neural network approach to performance analysis of tandem lines: The value of analytical knowledge","authors":"N. Dieleman, J. Berkhout, B. Heidergott","doi":"10.2139/ssrn.4078394","DOIUrl":"https://doi.org/10.2139/ssrn.4078394","url":null,"abstract":"","PeriodicalId":10582,"journal":{"name":"Comput. Oper. Res.","volume":"115 1","pages":"106124"},"PeriodicalIF":0.0,"publicationDate":"2023-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85569105","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}
{"title":"Logic-based Benders decomposition for the preemptive flexible job-shop scheduling problem","authors":"Carla Juvin, L. Houssin, P. Lopez","doi":"10.2139/ssrn.4068164","DOIUrl":"https://doi.org/10.2139/ssrn.4068164","url":null,"abstract":"","PeriodicalId":10582,"journal":{"name":"Comput. Oper. Res.","volume":"2009 1","pages":"106156"},"PeriodicalIF":0.0,"publicationDate":"2023-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86255868","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}
Most public facilities in the European countries, including France, Germany, and the UK, were built during the reconstruction projects between 1950 and 1980. Owing to the deteriorating state of such vital infrastructure has become relatively expensive in the recent decades. A significant part of the maintenance operation costs is spent on the technical staff. Therefore, the optimal use of the available workforce is essential to optimize the operation costs. This includes planning technical interventions, workload balancing, productivity improvement, etc. In this paper, we focus on the routing of technicians and scheduling of their tasks. We address for this purpose a variant of the workforce scheduling problem called the technician routing and scheduling problem (TRSP). This problem has applications in different fields, such as transportation infrastructure (rail and road networks), telecommunications, and sewage facilities. To solve the TRSP, we propose an enhanced iterated local search (eILS) approach. The enhancement of the ILS firstly includes an intensification procedure that incorporates a set of local search operators and removal-repair heuristics crafted for the TRSP. Next, four different mechanisms are used in the perturbation phase. Finally, an elite set of solutions is used to extensively explore the neighborhood of local optima as well as to enhance diversification during search space exploration. To measure the performance of the proposed method, experiments were conducted based on benchmark instances from the literature, and the results obtained were compared with those of an existing method. Our method achieved very good results, since it reached the best overall gap, which is three times lower than that of the literature. Furthermore, eILS improved the best-known solution for $34$ instances among a total of $56$ while maintaining reasonable computational times.
{"title":"Enhanced Iterated local search for the technician routing and scheduling problem","authors":"Ala-Eddine Yahiaoui, Sohaib Afifi, Hamid Afifi","doi":"10.2139/ssrn.4329426","DOIUrl":"https://doi.org/10.2139/ssrn.4329426","url":null,"abstract":"Most public facilities in the European countries, including France, Germany, and the UK, were built during the reconstruction projects between 1950 and 1980. Owing to the deteriorating state of such vital infrastructure has become relatively expensive in the recent decades. A significant part of the maintenance operation costs is spent on the technical staff. Therefore, the optimal use of the available workforce is essential to optimize the operation costs. This includes planning technical interventions, workload balancing, productivity improvement, etc. In this paper, we focus on the routing of technicians and scheduling of their tasks. We address for this purpose a variant of the workforce scheduling problem called the technician routing and scheduling problem (TRSP). This problem has applications in different fields, such as transportation infrastructure (rail and road networks), telecommunications, and sewage facilities. To solve the TRSP, we propose an enhanced iterated local search (eILS) approach. The enhancement of the ILS firstly includes an intensification procedure that incorporates a set of local search operators and removal-repair heuristics crafted for the TRSP. Next, four different mechanisms are used in the perturbation phase. Finally, an elite set of solutions is used to extensively explore the neighborhood of local optima as well as to enhance diversification during search space exploration. To measure the performance of the proposed method, experiments were conducted based on benchmark instances from the literature, and the results obtained were compared with those of an existing method. Our method achieved very good results, since it reached the best overall gap, which is three times lower than that of the literature. Furthermore, eILS improved the best-known solution for $34$ instances among a total of $56$ while maintaining reasonable computational times.","PeriodicalId":10582,"journal":{"name":"Comput. Oper. Res.","volume":"36 1","pages":"106385"},"PeriodicalIF":0.0,"publicationDate":"2023-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90347471","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
扫码关注我们
求助内容：
应助结果提醒方式：