Journal of Global Optimization最新文献_第3页

Parallel machine scheduling with position-dependent processing times and deteriorating maintenance activities 并行机器调度，处理时间取决于位置，维护活动不断恶化

IF 1.8 3区数学

Journal of Global Optimization Pub Date : 2024-06-27 DOI: 10.1007/s10898-024-01411-2

Chaoming Hu, Rui Zheng, Shaojun Lu, Xinbao Liu

{"title":"Parallel machine scheduling with position-dependent processing times and deteriorating maintenance activities","authors":"Chaoming Hu, Rui Zheng, Shaojun Lu, Xinbao Liu","doi":"10.1007/s10898-024-01411-2","DOIUrl":"https://doi.org/10.1007/s10898-024-01411-2","url":null,"abstract":"Maintenance and production exert reciprocal influence in practical manufacturing applications. However, decisions regarding production scheduling and maintenance planning are often made separately, leading to frequent conflicts between production and maintenance plans. This paper investigates an integrated production scheduling and maintenance planning problem for a parallel machine system, considering both deteriorating jobs and deteriorating maintenance activities. Additionally, the problem features constraints on the number of available maintenance activities due to maintenance budget limitations. The objective is to determine the optimal scheduling and maintenance plan that minimizes the makespan. To tackle this complex problem, we initially delve into the special case where jobs and maintenance activities are already assigned to machines. In our endeavor to minimize the makespan for each machine, we uncover some crucial structural properties and present a polynomial-time algorithm. Subsequently, we develop a hybrid algorithm that combines Whale Optimization Algorithm and Variable Neighborhood Search (WOA–VNS) to address the assignment challenge encompassing jobs and maintenance activities within the parallel machine environment. A series of rigorous comparative experiments are conducted to assess the effectiveness of the proposed algorithm. The results conclusively demonstrate the superior performance of the WOA–VNS algorithm over the WOA, VNS, ABC, and ACO algorithms in addressing the presented problem.","PeriodicalId":15961,"journal":{"name":"Journal of Global Optimization","volume":null,"pages":null},"PeriodicalIF":1.8,"publicationDate":"2024-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141501069","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Packing spheres with quasi-containment conditions 具有准封闭条件的包装球

IF 1.8 3区数学

Journal of Global Optimization Pub Date : 2024-06-21 DOI: 10.1007/s10898-024-01412-1

Andreas Fischer, Igor Litvinchev, Tetyana Romanova, Petro Stetsyuk, Georgiy Yaskov

引用次数: 0

Stochastic optimization problems with nonlinear dependence on a probability measure via the Wasserstein metric 通过瓦瑟斯坦度量非线性依赖概率度量的随机优化问题

IF 1.8 3区数学

Journal of Global Optimization Pub Date : 2024-06-20 DOI: 10.1007/s10898-024-01380-6

Vlasta Kaňková

{"title":"Stochastic optimization problems with nonlinear dependence on a probability measure via the Wasserstein metric","authors":"Vlasta Kaňková","doi":"10.1007/s10898-024-01380-6","DOIUrl":"https://doi.org/10.1007/s10898-024-01380-6","url":null,"abstract":"Nonlinear dependence on a probability measure has recently been encountered with increasing intensity in stochastic optimization. This type of dependence corresponds to many situations in applications; it can appear in problems static (one-stage), dynamic with finite (multi-stage) or infinite horizon, and single- and multi-objective ones. Moreover, the nonlinear dependence can appear not only in the objective functions but also in the constraint sets. In this paper, we will consider static one-objective problems in which the nonlinear dependence appears in the objective function and may also appear in the constraint sets. In detail, we consider “deterministic” constraint sets, whose dependence on the probability measure is nonlinear, constraint sets determined by second-order stochastic dominance, and sets given by mean-risk problems. The last mentioned instance means that the constraint set corresponds to solutions which guarantee acceptable values of both criteria. To obtain relevant assertions, we employ the stability results given by the Wasserstein metric, based on the ( {{mathcal {L}}}_{1} ) norm. We mainly focus on the case in which a solution has to be obtained on the basis of the data and of investigating a relationship between the original problem and its empirical version.","PeriodicalId":15961,"journal":{"name":"Journal of Global Optimization","volume":null,"pages":null},"PeriodicalIF":1.8,"publicationDate":"2024-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141501070","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Curvature-constrained Steiner networks with three terminals 有三个终端的曲率受限斯坦纳网络

IF 1.8 3区数学

Journal of Global Optimization Pub Date : 2024-06-17 DOI: 10.1007/s10898-024-01414-z

Peter A. Grossman, David Kirszenblat, Marcus Brazil, J. Hyam Rubinstein, Doreen A. Thomas

引用次数: 0

Online non-monotone diminishing return submodular maximization in the bandit setting 强盗背景下的在线非单调递减收益次模态最大化

IF 1.8 3区数学

Journal of Global Optimization Pub Date : 2024-06-13 DOI: 10.1007/s10898-024-01413-0

Jiachen Ju, Xiao Wang, Dachuan Xu

引用次数: 0

A novel algorithm for finding convex hull of a generic polygon with simulation of progressively supporting elastic lines 通过模拟逐步支撑的弹性线寻找一般多边形凸壳的新算法

IF 1.8 3区数学

Journal of Global Optimization Pub Date : 2024-06-12 DOI: 10.1007/s10898-024-01409-w

Yuping Cui, Guolei Zheng

引用次数: 0

A Bayesian approach to data-driven multi-stage stochastic optimization 数据驱动多阶段随机优化的贝叶斯方法

IF 1.8 3区数学

Journal of Global Optimization Pub Date : 2024-06-07 DOI: 10.1007/s10898-024-01410-3

Zhiping Chen, W. Ma

引用次数: 0

Deep learning the efficient frontier of convex vector optimization problems 深度学习凸向量优化问题的有效前沿

IF 1.8 3区数学

Journal of Global Optimization Pub Date : 2024-05-30 DOI: 10.1007/s10898-024-01408-x

Zachary Feinstein, Birgit Rudloff

引用次数: 0

On exact and inexact RLT and SDP-RLT relaxations of quadratic programs with box constraints 论带盒式约束的二次方程程序的精确和非精确 RLT 和 SDP-RLT 放松

IF 1.8 3区数学

Journal of Global Optimization Pub Date : 2024-05-30 DOI: 10.1007/s10898-024-01407-y

Yuzhou Qiu, E. Alper Yıldırım

{"title":"On exact and inexact RLT and SDP-RLT relaxations of quadratic programs with box constraints","authors":"Yuzhou Qiu, E. Alper Yıldırım","doi":"10.1007/s10898-024-01407-y","DOIUrl":"https://doi.org/10.1007/s10898-024-01407-y","url":null,"abstract":"Quadratic programs with box constraints involve minimizing a possibly nonconvex quadratic function subject to lower and upper bounds on each variable. This is a well-known NP-hard problem that frequently arises in various applications. We focus on two convex relaxations, namely the reformulation–linearization technique (RLT) relaxation and the SDP-RLT relaxation obtained by combining the Shor relaxation with the RLT relaxation. Both relaxations yield lower bounds on the optimal value of a quadratic program with box constraints. We show that each component of each vertex of the RLT relaxation lies in the set ({0,frac{1}{2},1}). We present complete algebraic descriptions of the set of instances that admit exact RLT relaxations as well as those that admit exact SDP-RLT relaxations. We show that our descriptions can be converted into algorithms for efficiently constructing instances with (1) exact RLT relaxations, (2) inexact RLT relaxations, (3) exact SDP-RLT relaxations, and (4) exact SDP-RLT but inexact RLT relaxations. Our preliminary computational experiments illustrate that our algorithms are capable of generating computationally challenging instances for state-of-the-art solvers.","PeriodicalId":15961,"journal":{"name":"Journal of Global Optimization","volume":null,"pages":null},"PeriodicalIF":1.8,"publicationDate":"2024-05-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141194395","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Optimization in complex spaces with the mixed Newton method 用混合牛顿法优化复杂空间

IF 1.8 3区数学

Journal of Global Optimization Pub Date : 2024-05-30 DOI: 10.1007/s10898-023-01355-z

Sergei Bakhurin, Roland Hildebrand, Mohammad Alkousa, Alexander Titov, Nikita Yudin

{"title":"Optimization in complex spaces with the mixed Newton method","authors":"Sergei Bakhurin, Roland Hildebrand, Mohammad Alkousa, Alexander Titov, Nikita Yudin","doi":"10.1007/s10898-023-01355-z","DOIUrl":"https://doi.org/10.1007/s10898-023-01355-z","url":null,"abstract":"We propose a second-order method for unconditional minimization of functions f(z) of complex arguments. We call it the mixed Newton method due to the use of the mixed Wirtinger derivative (frac{partial ^2f}{partial {bar{z}}partial z}) for computation of the search direction, as opposed to the full Hessian (frac{partial ^2f}{partial (z,{bar{z}})^2}) in the classical Newton method. The method has been developed for specific applications in wireless network communications, but its global convergence properties are shown to be superior on a more general class of functions f, namely sums of squares of absolute values of holomorphic functions. In particular, for such objective functions minima are surrounded by attraction basins, while the iterates are repelled from other types of critical points. We provide formulas for the asymptotic convergence rate and show that in the scalar case the method reduces to the well-known complex Newton method for the search of zeros of holomorphic functions. In this case, it exhibits generically fractal global convergence patterns.","PeriodicalId":15961,"journal":{"name":"Journal of Global Optimization","volume":null,"pages":null},"PeriodicalIF":1.8,"publicationDate":"2024-05-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141194259","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0