13 papers · ranked by Valyu relevance
Chengtao Du, Jinzhong Zhang, Jie Fang, Heming Jia
The black-winged kite algorithm (BKA) integrates the Cauchy mutation strategy and the leader selection strategy to simulate high-altitude circling exploration, fixed-point diving attack, and group cooperative migration of the black-winged kites to approximate the global optimal solution. The BKA exhibits deficiencies…
Kirill Kukharenko, Laura Sanità
The simplex algorithm is one of the most popular algorithms to solve linear programs (LPs). Starting at an extreme point solution of an LP, it performs a sequence of basis exchanges (called pivots) that allows one to move to a better extreme point along an improving edge-direction of the underlying polyhedron. A key…
Anna Pietrenko-Dabrowska, Slawomir Koziel
Formal optimization is nowadays ubiquitous in microwave design. It is frequently conducted using electromagnetic (EM) simulations, which guarantee dependability. Yet, it is computationally expensive. Local tuning may involve hundreds of system analyses, whereas global EM-driven optimization typically generates…
Davut Izci, Serdar Ekinci, Gökhan Yüksek, Mostafa Rashdan + 4 more
Accurate parameter identification in nonlinear and chaotic dynamic systems requires optimization algorithms that can reliably balance global exploration and local refinement in complex, multimodal search landscapes. To address this challenge, a modified artificial protozoa optimizer (mAPO) is developed in this study by…
Wei Liu, Roberto dos Reis, Chad A. Mirkin, Vinayak P. Dravid + 2 more
Grain identification in polycrystalline nanoparticles, for example, determining which crystal phases are present at each spatial location, is fundamental to materials characterisation. This is particularly challenging when grains overlap extensively, as commonly occurs in four-dimensional scanning transmission electron…
Zhaoyang Wang, Xianghui Fu, Bo Deng, Yang Chen + 1 more
In algebraic topology, a k-dimensional simplex is defined as a convex polytope consisting of k + 1 vertices. If spatial dimensionality is not considered, it corresponds to the complete graph with k + 1 vertices in graph theory. The alternating sum of the number of simplices across dimensions yields a topological…
Haoyu Cheng, Han Qu, Sean McKenzie, Katherine R. Lawrence + 4 more
Telomere-to-telomere (T2T) assembly is the ultimate goal for de novo genome assembly. Existing algorithms capable of near T2T assembly all require Oxford Nanopore Technologies (ONT) ultra-long reads which are costly and experimentally challenging to obtain and are thus often unavailable for samples without established…
Joakim da Silva, Daniel Hernández Escobar, Tor Kjellsson Lindblom, Håkan Nordström + 1 more
As opposed to the ADMM method, the reference simplex method solves each problem corresponding to a weight vector sequentially, and the simplex times are thus expected to be linear in the number of weight vectors, as can be verified in Figure [mp70454-fig-0005]. This allows us to estimate the simplex run times for a…
Di Liu, Mengchi Li, Yushun Lei, Pei Yu + 3 more
In order to address the problem of efficiently distributing to multiple demand points within the city and multiple distribution centers on the urban fringes, this paper considers decision-making issues such as the selection of distribution centers and the planning of delivery routes. With the objective of minimizing…
Parth Brahmbhatt, David L. Cole, Victor M. Zavala, Styliani Avraamidou
Using Graph Modeling and Multi-Parametric Programming Authors: Parth Brahmbhatt, David L. Cole, Victor M. Zavala, Styliani Avraamidou Benders decomposition is a widely used method for solving large and structured optimization problems, but its performance is affected by the repeated solution of subproblems. We propose…
Zhuo Dai, Yefu Zhou, Bibhas Chandra Giri
In supply chain management, the location of facilities, inventory control, and vehicle routing are three key components. This paper incorporates a two-warehouse inventory system into the location- inventory-routing problems (LIRPs) and develops LIRP models with two warehouses in one-level, two-level, and three-level…
Jingsi Lin, Mohammad Waqar Ali Asad, Erkan Topal, Ping Chang + 1 more
Production scheduling models for open-pit mining complexes determine the optimal sequence for extracting mining blocks while adhering to technical and operational constraints. Although various mathematical models are available in the literature, solving them for large-scale operations remains computationally intensive.…
Yating Zhu, Tinghua Wang, Ning Zhao, Heming Jia
The Arctic Puffin Optimization (APO) algorithm, proposed in 2024, is a swarm intelligence optimization. Similar to other swarm intelligence optimization algorithms, it suffers from issues such as slow convergence in the early stage, being easy to fall into local optima, and insufficient balance between exploration and…