The analysis of algorithm for transmitters locating problem by Saulius Lazaravičius, Narimantas Listopadskis

Subjects: “…combinatorial optimization…”
Get full text

VNE-AFS:virtual network embedding based on artificial fish swarm by Qiang ZHU, Hui-qiang WANG, Hong-wu LV, Zhen-dong WANG

Subjects: Get full text

Optimal Conflict Resolution for Vehicles With Intersecting and Overlapping Paths by Johan Karlsson, Nikolce Murgovski, Jonas Sjoberg

Subjects: Get full text

Optimization Techniques for Physician Scheduling Problem: A Systematic Review of Recent Advancements and Future Directions by Norizal Abdullah, Masri Ayob, Meng Chun Lam, Nasser R. Sabar, Graham Kendall, Mohamad Khairulamirin Md Razali

Subjects: Get full text

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

Improved ant colony optimization algorithm for solving constraint satisfaction problem by HANGYong-gang Z, HANGSi-bo Z, UEQiu-shi X

“…The traditional backtracking algorithm was less efficient on solving large-scale constraint satisfaction problem,and more difficult to be solved within a reasonable time.In order to overcome this problem,many incompleteness algo-rithms based on heuristic search have been proposed.Two improvements based on ant colony optimization meta-heuristic constraint solving algorithm were presented:First,arc consistency checks was done to preprocess before exploring the search space,Second,a new parameter setting scheme was proposed for ant colony optimization to improve the effi-ciency of the search.Finally,the improved algorithm is applied to solve random problems and combinatorial optimization problems.The results of the experiment have showed its superiority.…”
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

Spectrum allocation based on quantum cuckoo search algorithm in cognitive radio network by Xianping WANG, Hui CAO

“…There are discrete optimization problems for spectrum allocation in cognitive wireless network.A novel combinatorial optimization algorithm called quantum cuckoo search algorithm （QCSA）was proposed,which was based on quantum computing and cuckoo search algorithm.The quantum nest was used to represent multiple dimensionality solution for the optimization problem,and the global optimal position was found according to Lévy flights and quantum mutation strategy.In additional,some classical benchmark functions were employed to prove the effectiveness of QCSA,and a spectrum allocation method based on QCSA was proposed for cognitive network.Compared with classical spectrum allocation methods by using different network utility functions,the global optimal solution can be searched so fast.Simulation results show that the proposed spectrum allocation method based on QCSA is better than other traditional methods under different network utility functions.…”
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