发布求助
文献互助 智能选刊 最新文献

Comput. Oper. Res.最新文献

筛选
英文 中文
A family of hybrid conjugate gradient method with restart procedure for unconstrained optimizations and image restorations 一类带重启程序的混合共轭梯度法用于无约束优化和图像恢复
Comput. Oper. Res. Pub Date : 2023-11-01 DOI: 10.2139/ssrn.4352068
Xianzhen Jiang, X. Ye, Zefeng Huang, Meixing Liu
{"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}
引用次数: 1
Using submodularity in solving the robust bandwidth packing problem with queuing delay guarantees 用子模块化方法解决具有排队延迟保证的鲁棒带宽打包问题
Comput. Oper. Res. Pub Date : 2023-08-01 DOI: 10.2139/ssrn.4352072
Seulgi Joung
{"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}
引用次数: 1
Dual-neighborhood iterated local search for routing and wavelength assignment 双邻域迭代局部搜索路由和波长分配
Comput. Oper. Res. Pub Date : 2023-08-01 DOI: 10.2139/ssrn.4329421
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}
引用次数: 0
Loads scheduling for demand response in energy communities 能源社区需求响应的负荷调度
Comput. Oper. Res. Pub Date : 2023-07-01 DOI: 10.2139/ssrn.4255726
Mariam Sangaré, Eric Bourreau, B. Fortz, Amaury Pachurka, Michael Poss
{"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}
引用次数: 1
Simulation-based inventory management of perishable products via linear discrete choice models 基于线性离散选择模型的易腐产品仿真库存管理
Comput. Oper. Res. Pub Date : 2023-05-01 DOI: 10.2139/ssrn.4207541
D. Gioia, L. Felizardo, P. Brandimarte
{"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}
引用次数: 1
A neural network approach to performance analysis of tandem lines: The value of analytical knowledge 串联生产线性能分析的神经网络方法:分析知识的价值
Comput. Oper. Res. Pub Date : 2023-04-01 DOI: 10.2139/ssrn.4078394
N. Dieleman, J. Berkhout, B. Heidergott
{"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}
引用次数: 1
Logic-based Benders decomposition for the preemptive flexible job-shop scheduling problem 基于逻辑的柔性作业车间调度问题的Benders分解
Comput. Oper. Res. Pub Date : 2023-04-01 DOI: 10.2139/ssrn.4068164
Carla Juvin, L. Houssin, P. Lopez
{"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}
引用次数: 2
Manufacturing rescheduling after crisis or disaster-caused supply chain disruption 在危机或灾难导致的供应链中断后重新安排生产
Comput. Oper. Res. Pub Date : 2023-04-01 DOI: 10.2139/ssrn.3902825
H. Bo, Xiao Chen, Qi Luo, Wen-pu Wang
{"title":"Manufacturing rescheduling after crisis or disaster-caused supply chain disruption","authors":"H. Bo, Xiao Chen, Qi Luo, Wen-pu Wang","doi":"10.2139/ssrn.3902825","DOIUrl":"https://doi.org/10.2139/ssrn.3902825","url":null,"abstract":"","PeriodicalId":10582,"journal":{"name":"Comput. Oper. Res.","volume":"29 1","pages":"106266"},"PeriodicalIF":0.0,"publicationDate":"2023-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76445465","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}
引用次数: 0
Enhanced Iterated local search for the technician routing and scheduling problem 增强了对技术人员路由和调度问题的迭代本地搜索
Comput. Oper. Res. Pub Date : 2023-03-12 DOI: 10.2139/ssrn.4329426
Ala-Eddine Yahiaoui, Sohaib Afifi, Hamid Afifi
{"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}
引用次数: 0
A Large Neighbourhood Search Algorithm for Solving Container Loading Problems 求解集装箱装载问题的大邻域搜索算法
Comput. Oper. Res. Pub Date : 2023-03-01 DOI: 10.2139/ssrn.4122570
Özge Safak, Güneş Erdoğan
{"title":"A Large Neighbourhood Search Algorithm for Solving Container Loading Problems","authors":"Özge Safak, Güneş Erdoğan","doi":"10.2139/ssrn.4122570","DOIUrl":"https://doi.org/10.2139/ssrn.4122570","url":null,"abstract":"","PeriodicalId":10582,"journal":{"name":"Comput. Oper. Res.","volume":"38 1","pages":"106199"},"PeriodicalIF":0.0,"publicationDate":"2023-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76715869","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}
引用次数: 3
下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信