Comput. Oper. Res.最新文献_第6页

Capacitated facility location-allocation problem for wastewater treatment in an industrial cluster 工业集群污水处理设施容量配置问题

Comput. Oper. Res. Pub Date : 2021-04-20 DOI: 10.1016/J.COR.2021.105338

Saurabh Chandra, Manish Sarkhel, A. Vatsa

引用次数: 9

Local search for constrained graph clustering in biological networks 生物网络中约束图聚类的局部搜索

Comput. Oper. Res. Pub Date : 2021-04-10 DOI: 10.1016/J.COR.2021.105299

Duy Tran, Behrouz Babaki, Dries Van Daele, Pieter Leyman, P. D. Causmaecker

引用次数: 4

Comput. Oper. Res. Pub Date : 2021-04-10 DOI: 10.1016/J.COR.2021.105291

Abdoul Bitar, S. Dauzére-Pérés, C. Yugma

引用次数: 22

Type-2 integrated process-planning and scheduling problem: Reformulation and solution algorithms 二类集成工艺规划与调度问题:重新表述与求解算法

Comput. Oper. Res. Pub Date : 2021-04-10 DOI: 10.2139/SSRN.3838101

B. Naderi, Mehmet A. Begen, G. Zaric

{"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}

引用次数: 5

A kernel search heuristic for a fair facility location problem 一个公平设施定位问题的核搜索启发式算法

Comput. Oper. Res. Pub Date : 2021-04-01 DOI: 10.1016/J.COR.2021.105292

C. Filippi, G. Guastaroba, D. L. Huerta-Muñoz, M. Speranza

引用次数: 13

Multi-route planning of multimodal transportation for oversize and heavyweight cargo based on reconstruction 基于重构的超大型、重型货物多式联运多路线规划

Comput. Oper. Res. Pub Date : 2021-04-01 DOI: 10.1016/j.cor.2020.105172

Yan Luo, Yinggui Zhang, Jiaxiao Huang, Huiyu Yang

引用次数: 11

Dimensioning a queue with state-dependent arrival rates 使用依赖于状态的到达率来确定队列的维度

Comput. Oper. Res. Pub Date : 2021-04-01 DOI: 10.1016/j.cor.2020.105179

B. Legros