Multidisk Clutch Optimization Using Quantum Annealing by D. John Malcolm, Alexander Roth, Mladjan Radic, Pablo Martin-Ramiro, Jon Oillarburu, Borja Aizpurua, Roman Orus, Samuel Mugel

Subjects: Get full text

OPTIMIZATION OF CONFIGURATION OF INDUSTRIAL ETHERNET NETWORKS DURING DESIGN OF THE AUTOMATED PRODUCTION MANAGEMENT SYSTEM by V. A. Kholopov, E. N. Kashirskaya, M. V. Gusev

Subjects: Get full text

APPLICATIONS OF BRANCH-BOUND ALGORITHM TO SOLVE SOME OPTIMAL PROBLEMS RELATED TO THE HAMILTONIAN CYCLE BASED ON THE TSP by Đỗ Như An

“…The Traveling Salesman Problem (TSP) is the most prominent of the combinatorial optimization problems that belongs to NP-Hard. …”
Get full text

Chaotic Honeybees Optimization Algorithms Approach for Traveling Salesperson Problem by Pedro Palominos, Carla Ortega, Miguel Alfaro, Guillermo Fuertes, Manuel Vargas, Mauricio Camargo, Victor Parada, Gustavo Gatica

“…Due to the difficulty in solving combinatorial optimization problems, it is necessary to improve the performance of the algorithms by improving techniques to deal with complex optimizations. …”
Get full text

A 50-spin surface acoustic wave Ising machine by Artem Litvinenko, Roman Khymyn, Roman Ovcharov, Johan Åkerman

“…Abstract Time-multiplexed spinwave Ising Machines have unveiled a route towards miniaturized and low-cost combinatorial optimization solvers but are constrained in the number of spins by nonlinear spinwave dispersion. …”
Get full text

Modeling and Optimization of Multiaction Dynamic Dispatching Problem for Shared Autonomous Electric Vehicles by Ning Wang, Jiahui Guo

“…Then two optimization models from short-sighted view and farsighted view based on combinatorial optimization theory are built, respectively. The former focuses on the instant and single-step reward, while the latter aims at the accumulative and multistep return. …”
Get full text

Algorithm for determining the operating parameters of an electrical network in the problem of optimal reconfiguration in real time by Vladislav A. Rokhlov, Rustam N. Khamitov, Sergey N. Zherebtsov, Anastasia A. Latyntseva

“…The optimal network configuration is determined by solving the combinatorial optimization problem using the branch and bound method. …”
Get full text

An Integer Linear Programming Model for Partially Ordered Sets by Elsayed Badr, I.M. Selim, Hoda Mostafa, Hala Attiya

“…Linear programming is an important approach that is used to represent a large class of combinatorial optimization problems. The simplex algorithm is one of the algorithms for solving linear programming problems with exponential time complexity. …”
Get full text

Computing Edge Version of Resolvability and Double Resolvability of a Graph by Muhammad Ahmad, Zohaib Zahid, Tabasam Rashid, Juan Luis Garcia Guirao

“…The field of graph theory is extensively used to investigate structure models in biology, computer programming, chemistry, and combinatorial optimization. In order to work with the chemical structure, chemists require a mathematical form of the compound. …”
Get full text

Cooperative Quantum-Behaved Particle Swarm Optimization with Dynamic Varying Search Areas and Lévy Flight Disturbance by Desheng Li

“…According to the experimental results, the proposed method performs better than other variants of PSO on both benchmark test functions and the combinatorial optimization issue, that is, the job-shop scheduling problem.…”
Get full text

Fuzzy Chromatic Polynomial of Fuzzy Graphs with Crisp and Fuzzy Vertices Using α-Cuts by Mamo Abebe Ashebo, V. N. Srinivasa Rao Repalle

“…Coloring of fuzzy graphs has many real life applications in combinatorial optimization problems like traffic light system, exam scheduling, register allocation, etc. …”
Get full text

A New Model for Reassignment of Tasks to Available Employees in Iraq’s Firms by Dhurgam Kalel Ibrahim Alsaad, Reza Ghanbari, Ali Akbar Sohrabi, Khatere Ghorbani Moghadam

“…Generalized assignment problem (GAP) is a well-known problem in the combinatorial optimization. This problem is a specific form of assignment problem (AP) when the employees can carry out more than one task simultaneously or each work can be assigned to more than one employee. …”
Get full text

The Interplay Between Loss Functions and Structural Constraints in Dependency Parsing by Robin Kurtz, Marco Kuhlmann

“… Dependency parsing can be cast as a combinatorial optimization problem with the objective to find the highest-scoring graph, where edge scores are learnt from data. …”
Get full text

Stochastic logic in biased coupled photonic probabilistic bits by Michael Horodynski, Charles Roques-Carmes, Yannick Salamin, Seou Choi, Jamison Sloan, Di Luo, Marin Soljačić

“…An important computing approach that is still missing its corresponding optical hardware is probabilistic computing, used e.g. for solving difficult combinatorial optimization problems. In this study, we propose an experimentally viable photonic approach to solve arbitrary probabilistic computing problems. …”
Get full text

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

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

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

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