Design of Large Thinned Arrays Using Different Biogeography-Based Optimization Migration Models by Sotirios K. Goudos, John N. Sahalos

“…Array thinning is a common discrete-valued combinatorial optimization problem. Evolutionary algorithms are suitable techniques for above-mentioned problem. …”
Get full text

Multi-values discrete particle swarm optimization for cross layer resource allocation in cooperative OFDMA systems by Wei LI, Chun-lin XIONG, De-gang WANG, Xiao-ying ZHANG, Ji-bo WEI

“…The proposed MDPSO can also be applied widely to solve the combinatorial optimization problems (COP). Furthermore, iterative waterfilling was used to complete power allocation. …”
Get full text

Forecasting trend changes of cement demand in the United States: An exploratory study by Ardavan Yazdanbakhsh

“…Two variable selection techniques were developed for time series of different lengths utilizing lasso and combinatorial optimization. In addition, a novel validation technique was devised using the bootstrap to evaluate models based on the variance of predicted time series values at the most recent known time points. …”
Get full text

D-Wave’s Nonlinear-Program Hybrid Solver: Description and Performance Analysis by Eneko Osaba, Pablo Miranda-Rodriguez

“…This paper describes this solver and evaluates its performance through a benchmark of 45 instances across three combinatorial optimization problems: the Traveling Salesman Problem, the Knapsack Problem, and the Maximum Cut Problem. …”
Get full text

Probability Mechanism Based Particle Swarm Optimization Algorithm and Its Application in Resource-Constrained Project Scheduling Problems by Shuai Li, Zhicong Zhang, Xiaohui Yan, Liangwei Zhang

“…In this paper, a new probability mechanism based particle swarm optimization (PMPSO) algorithm is proposed to solve combinatorial optimization problems. Based on the idea of traditional PSO, the algorithm generates new particles based on the optimal particles in the population and the historical optimal particles in the individual changes. …”
Get full text

A Local and Global Search Combine Particle Swarm Optimization Algorithm for Job-Shop Scheduling to Minimize Makespan by Zhigang Lian

“…The Job-shop scheduling problem (JSSP) is a branch of production scheduling, which is among the hardest combinatorial optimization problems. Many different approaches have been applied to optimize JSSP, but for some JSSP even with moderate size cannot be solved to guarantee optimality. …”
Get full text

Prioritized Experience Replay–Based Path Planning Algorithm for Multiple UAVs by Chongde Ren, Jinchao Chen, Chenglie Du

“…In complex environments, the path planning problem, which is a multiconstraint combinatorial optimization problem and hard to settle, requires considering numerous constraints and limitations and generates the best paths for each UAV to accomplish group tasks. …”
Get full text

Multi-Controller Placement Optimization Using Naked Mole-Rat Algorithm over Software-Defined Networking Environment by A. Binod Sapkota, B. Babu R. Dawadi, C. Shashidhar R. Joshi

“…CPP can be addressed as a multi-objective combinatorial optimization problem whose solution is a trade-off between multiple optimization parameters. …”
Get full text

xStripeMerge: efficient wide stripe generation approach based on erasure coding storage by Meiguang ZHENG, Taofei HUA, Xinyu ZHANG, Zhigang HU

“…To address the issue of wide stripe generation in existing erasure coding storage systems, where storage scaling approaches resulted in a significant increase in wide stripe generation bandwidth and stripe merge scheme was constrained by dual-stripes, an efficient wide stripe generation approach was proposed for the wide stripe generation problem under multi stripes merging.Two key operators for the multi-stripes merging progress were defined, and the wide stripe generation problem was modeled as a combinatorial optimization problem.The efficient wide stripe generation approach xStripeMerge was proposed that prioritize the search for narrow-stripes combining schemes with small parity block transmission costs.Experimental results show that xStripeMerge can reduce the wide stripe generation bandwidth by 75% compared to the advanced storage scaling method.The time and space complexity of xStripeMerge is much better than that of the extended dual-stripes merge approach.xStripeMerge can get the wide stripe generation scheme with similar performance in a shorter period of time and it is also suitable for large-scale storage systems.…”
Get full text

Scalable circuit depth reduction in feedback-based quantum optimization with a quadratic approximation by Don Arai, Ken N. Okada, Yuichiro Nakano, Kosuke Mitarai, Keisuke Fujii

“…Combinatorial optimization problems are one of the areas where near-term noisy quantum computers may have practical advantage against classical computers. …”
Get full text

A New Adaptive Hungarian Mating Scheme in Genetic Algorithms by Chanju Jung, Yong-Hyuk Kim, Yourim Yoon, Byung-Ro Moon

“…Well-known combinatorial optimization problems, the traveling salesperson problem, and the graph bisection problem are used for the test bed of our method. …”
Get full text

Antenna Configuration Method for RF Measurement Based on DOPs in Satellite Formation Flying by Weiqing Mu, Rongke Liu, Zijie Wang, Yukai Liu

“…In order to select the optimal antenna configuration in real time in a scene where the intersatellite position and attitude change dynamically, this study presents an optimal antenna configuration selection strategy and models the antenna configuration selection as a combinatorial optimization problem. Furthermore, the genetic algorithm (GA) with two encoding mechanisms is proposed to solve this problem. …”
Get full text

Rule-Based Classification Based on Ant Colony Optimization: A Comprehensive Review by Sayed Kaes Maruf Hossain, Sajia Afrin Ema, Hansuk Sohn

“…The Ant Colony Optimization (ACO) algorithms have been well-studied by the Operations Research community for solving combinatorial optimization problems. A handful of researchers in the Data Science community have successfully implemented various ACO methodologies for rule-based classification. …”
Get full text

Ranking of Search Requests in the Digital Information Retrieval System Based on Dynamic Neural Networks by Viera Bartosova, Svetlana Drobyazko, Sergii Bogachov, Olga Afanasieva, Maria Mikhailova

“…The architecture of the neural network model based on the dynamic Hopfield neural network with binary output function designed for combinatorial optimization of the final list of documents found in the digital information retrieval system was synthesized. …”
Get full text

Solution Algorithms for the Capacitated Location Tree Problem with Interconnections by Nidia Mendoza-Andrade, Efrain Ruiz-y-Ruiz, Suemi Rodriguez-Romo

“…This paper addresses the Capacitated Location Tree Problem with Interconnections, a new combinatorial optimization problem with applications in network design. …”
Get full text

Accelerating Grover Adaptive Search: Qubit and Gate Count Reduction Strategies With Higher Order Formulations by Yuki Sano, Kosuke Mitarai, Naoki Yamamoto, Naoki Ishikawa

“…Our strategies are also beneficial for general combinatorial optimization problems using one-hot encoding.…”
Get full text

Location planning techniques for Internet provider service unmanned aerial vehicles during crisis by Kassem Danach, Hassan Harb, Ameer Sardar Kwekha Rashid, Mutaz A.B. Al-Tarawneh, Wael Hosny Fouad Aly

“…This research not only provides practical insights for UAV deployment but also advances the field of combinatorial optimization through innovative hyperheuristic techniques.…”
Get full text

Classical and quantum algorithms for many-body problems by Ayral, Thomas

“…The many-body problem is central to many fields, such as condensed-matter physics and chemistry, but also to combinatorial optimization, which is nothing but a classical many-body problem. …”
Get full text

Smart Grid Dispatching Optimization for System Resilience Improvement by Li Liao, Chengjun Ji

“…The solution method of combinatorial optimization is analyzed, and the genetic optimization algorithm adopted in this paper is selected and discussed. …”
Get full text

A new approach for bin packing problem using knowledge reuse and improved heuristic by Jie Fang, Xubing Chen, Yunqing Rao, Yili Peng, kuan Yan

“…Abstract The two-dimensional (2D) irregular packing problem is a combinatorial optimization problem with NP-complete characteristics, which is common in the production process of clothing, ships, and plate metals. …”
Get full text