Optimization Letters最新文献_第4页

Population-based iterated local search for batch scheduling on parallel machines with incompatible job families, release dates, and tardiness penalties 基于群体的迭代局部搜索，用于在具有不兼容作业族、发布日期和迟到惩罚的并行机器上进行批量调度

IF 1.6 4区数学

Optimization Letters Pub Date : 2024-04-26 DOI: 10.1007/s11590-024-02116-x

José Maurício Fernandes Medeiros, Anand Subramanian, Eduardo Queiroga

{"title":"Population-based iterated local search for batch scheduling on parallel machines with incompatible job families, release dates, and tardiness penalties","authors":"José Maurício Fernandes Medeiros, Anand Subramanian, Eduardo Queiroga","doi":"10.1007/s11590-024-02116-x","DOIUrl":"https://doi.org/10.1007/s11590-024-02116-x","url":null,"abstract":"This work addresses a parallel batch machine scheduling problem subject to tardiness penalties, release dates, and incompatible job families. In this environment, jobs of the same family are partitioned into batches and each batch is assigned to a machine. The objective is to determine the sequence in which the batches will be processed on each machine with a view of minimizing the total weighted tardiness. To solve the problem, we propose a population-based iterated local search algorithm that makes use of multiple neighborhood structures and an efficient perturbation mechanism. The algorithm also incorporates the time window decomposition (TWD) heuristic to generate the initial population and employs population control strategies aiming to promote individuals with higher fitness by combining the total weighted tardiness with the contribution to the diversity of the population. Extensive computational experiments were conducted on 4860 benchmark instances and the results obtained compare very favorably with those found by the best existing algorithms.","PeriodicalId":49720,"journal":{"name":"Optimization Letters","volume":"13 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2024-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140803817","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A comprehensive theoretical framework for the optimization of neural networks classification performance with respect to weighted metrics 根据加权指标优化神经网络分类性能的综合理论框架

IF 1.6 4区数学

Optimization Letters Pub Date : 2024-04-25 DOI: 10.1007/s11590-024-02112-1

Francesco Marchetti, Sabrina Guastavino, Cristina Campi, Federico Benvenuto, Michele Piana

引用次数: 0

On efficient algorithms for bottleneck path problems with many sources 关于多源瓶颈路径问题的高效算法

IF 1.6 4区数学

Optimization Letters Pub Date : 2024-04-18 DOI: 10.1007/s11590-024-02113-0

Kirill V. Kaymakov, Dmitry S. Malyshev

{"title":"On efficient algorithms for bottleneck path problems with many sources","authors":"Kirill V. Kaymakov, Dmitry S. Malyshev","doi":"10.1007/s11590-024-02113-0","DOIUrl":"https://doi.org/10.1007/s11590-024-02113-0","url":null,"abstract":"For given edge-capacitated connected graph and two its vertices s and t, the bottleneck (or (max min )) path problem is to find the maximum value of path-minimum edge capacities among all paths, connecting s and t. It can be generalized by finding the bottleneck values between s and all possible t. These problems arise as subproblems in the known maximum flow problem, having applications in many real-life tasks. For any graph with n vertices and m edges, they can be solved in O(m) and O(t(m, n)) times, respectively, where (t(m,n)=min (m+nlog (n),malpha (m,n))) and (alpha (cdot ,cdot )) is the inverse Ackermann function. In this paper, we generalize of the bottleneck path problems by considering their versions with k sources. For the first of them, where k pairs of sources and targets are (offline or online) given, we present an (O((m+k)log (n)))-time randomized and an (O(m+(n+k)log (n)))-time deterministic algorithms for the offline and online versions, respectively. For the second one, where the bottleneck values are found between k sources and all targets, we present an (O(t(m,n)+kn))-time offline/online algorithm.","PeriodicalId":49720,"journal":{"name":"Optimization Letters","volume":"57 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2024-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140624385","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Affine optimal k-proper connected edge colorings 仿射最优 k-Proper 连接边着色

IF 1.6 4区数学

Optimization Letters Pub Date : 2024-04-13 DOI: 10.1007/s11590-024-02111-2

Robert D. Barish, Tetsuo Shibuya

{"title":"Affine optimal k-proper connected edge colorings","authors":"Robert D. Barish, Tetsuo Shibuya","doi":"10.1007/s11590-024-02111-2","DOIUrl":"https://doi.org/10.1007/s11590-024-02111-2","url":null,"abstract":"We introduce affine optimal k-proper connected edge colorings as a variation on Fujita’s notion of optimal k-proper connected colorings (Fujita in Optim Lett 14(6):1371–1380, 2020. https://doi.org/10.1007/s11590-019-01442-9) with applications to the frequency assignment problem. Here, for a simple undirected graph G with edge set (E_G), such a coloring corresponds to a decomposition of (E_G) into color classes (C_1, C_2, ldots , C_n), with associated weights (w_1, w_2, ldots , w_n), minimizing a specified affine function ({mathcal {A}}, {:=},sum _{i=1}^{n} left( w_i cdot |C_i|right)), while also ensuring the existence of k vertex disjoint proper paths (i.e., simple paths with no two adjacent edges in the same color class) between all pairs of vertices. In this context, we define (zeta _{{mathcal {A}}}^k(G)) as the minimum possible value of ({mathcal {A}}) under a k-proper connectivity requirement. For any fixed number of color classes, we show that computing (zeta _{{mathcal {A}}}^k(G)) is treewidth fixed parameter tractable. However, we also show that determining (zeta _{{mathcal {A}}^{prime }}^k(G)) with the affine function ({mathcal {A}}^{prime } , {:=},0 cdot |C_1| + |C_2|) is NP-hard for 2-connected planar graphs in the case where (k = 1), cubic 3-connected planar graphs for (k = 2), and k-connected graphs (forall k ge 3). We also show that no fully polynomial-time randomized approximation scheme can exist for approximating (zeta _{{mathcal {A}}^{prime }}^k(G)) under any of the aforementioned constraints unless (NP=RP).","PeriodicalId":49720,"journal":{"name":"Optimization Letters","volume":"55 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2024-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140588246","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

An improvement of the Goldstein line search 戈德斯坦线搜索的改进

IF 1.6 4区数学

Optimization Letters Pub Date : 2024-04-05 DOI: 10.1007/s11590-024-02110-3

Arnold Neumaier, Morteza Kimiaei

引用次数: 0

An approximation algorithm for k-level squared metric facility location problem with outliers 有异常值的 k 级平方度量设施定位问题的近似算法

IF 1.6 4区数学

Optimization Letters Pub Date : 2024-04-04 DOI: 10.1007/s11590-024-02107-y

Li Zhang, Jing Yuan, Qiaoliang Li

引用次数: 0

On penalized reload cost path, walk, tour and maximum flow: hardness and approximation 关于受惩罚的重载成本路径、行走、游览和最大流量：硬度和近似值

IF 1.6 4区数学

Optimization Letters Pub Date : 2024-04-03 DOI: 10.1007/s11590-024-02108-x

Donatella Granata

{"title":"On penalized reload cost path, walk, tour and maximum flow: hardness and approximation","authors":"Donatella Granata","doi":"10.1007/s11590-024-02108-x","DOIUrl":"https://doi.org/10.1007/s11590-024-02108-x","url":null,"abstract":"A meticulous description of a real network with respect to its heterogeneous physical infrastructure and properties is necessary for network design assessment. Quantifying the costs of making these structures work together effectively, and taking into account any hidden charges they may incur, can lead to improve the quality of service and reduce mandatory maintenance requirements, and mitigate the cost associated with finding a valid solution. For these reasons, we devote our attention to a novel approach to produce a more complete representation of the overall costs on the reload cost network. This approach considers both the cost of reloading due to linking structures and their internal charges, which we refer to as the penalized reload cost. We investigate the complexity and approximability of finding an optimal path, walk, tour, and maximum flow problems under penalized reload cost. All these problems turn out to be NP-complete. We prove that, unless P=NP, even if the reload cost matrix is symmetric and satisfies the triangle inequality, the problem of finding a path, tour, and a maximum flow with a minimum penalized reload cost cannot be approximated within any constant (alpha <2), and finding a walk is not approximable within any factor (beta le 3).","PeriodicalId":49720,"journal":{"name":"Optimization Letters","volume":"1 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2024-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140588191","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Decentralized bilevel optimization 分散式双层优化

IF 1.6 4区数学

Optimization Letters Pub Date : 2024-03-26 DOI: 10.1007/s11590-024-02101-4

Xuxing Chen, Minhui Huang, Shiqian Ma

引用次数: 0

On the implementation of ADMM with dynamically configurable parameter for the separable $$ell _{1}/ell _{2}$$ minimization 关于针对可分离的 $$ell _{1}/ell _{2}$ 最小化问题实现带动态可配置参数的 ADMM

IF 1.6 4区数学

Optimization Letters Pub Date : 2024-03-26 DOI: 10.1007/s11590-024-02106-z

Jun Wang, Qiang Ma

引用次数: 0

The projected splitting iterative methods based on tensor splitting and its majorization matrix splitting for the tensor complementarity problem 基于张量分裂及其大化矩阵分裂的张量互补问题的投影分裂迭代法