OPTIMIZATION PROBLEM FOR NUMBER OF LOGIC GATES NEEDED TO IMPLEMENT MULTIPLE BOOLEAN FUNCTIONS USING DECODER by M. Onai, H. Skopyk

Subjects: Get full text

Review of Swarm Intelligence for Solving Symmetric Traveling Salesman Problem by Awaz Ahmad Shaban, Jayson A. Dela Fuente, Merdin Shamal Salih, Resen Ismail Ali

Subjects: Get full text

An Effective Hybrid Algorithm Based on Particle Swarm Optimization with Migration Method for Solving the Multiskill Resource-Constrained Project Scheduling Problem by Huu Dang Quoc, Loc Nguyen The, Cuong Nguyen Doan

“…The NP-Hard problems can be solved using metaheuristic methods to evolve the population over many generations, thereby finding approximate solutions. …”
Get full text

Evolutionary Computation with Spatial Receding Horizon Control to Minimize Network Coding Resources by Xiao-Bing Hu, Mark S. Leeson

“…The minimization of network coding resources, such as coding nodes and links, is a challenging task, not only because it is a NP-hard problem, but also because the problem scale is huge; for example, networks in real world may have thousands or even millions of nodes and links. …”
Get full text

TAS Scheduling With Grouping Flows by Hironao Abe, Yuhei Kawakami, Hideo Kawata, Takashi Nakanishi, Tomoaki Yoshida

“…However, designing a TAS schedule is an NP-hard problem, which becomes more difficult as the amount of delay guarantee flow increases. …”
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. The best algorithm for solving TSP is the branch-bound algorithm with exponential-time complexity. …”
Get full text

Optimasi Rute Rencana Perjalanan Pesawat Menggunakan Algoritma Late Acceptance Hill Climbing (Studi Kasus : Travelling Salesman Challenge 2.0) by Ahmad Muklason, I Gusti Agung Premananda

“…Permasalahan ini telah digolongkan sebagai permasalahan NP-Hard, sehingga membutuhkan algoritma non-deterministic untuk dapat menyelesaikan permasalahan ini. …”
Get full text

Parallel Batch Scheduling of Deteriorating Jobs with Release Dates and Rejection by Juan Zou, Cuixia Miao

“…First, we show that the problem is NP-hard in the ordinary sense. Then, we present two pseudopolynomial time algorithms and a fully polynomial-time approximation scheme to solve this problem. …”
Get full text

A Decomposition Algorithm for Learning Bayesian Networks Based on Scoring Function by Mingmin Zhu, Sanyang Liu

“…Learning Bayesian network (BN) structure from data is a typical NP-hard problem. But almost existing algorithms have the very high complexity when the number of variables is large. …”
Get full text

Two Parallel Machines Scheduling with Two-Vehicle Job Delivery to Minimize Makespan by Lisi Cao, Jianhong Hao, Dakui Jiang

“…A range of jobs of one customer in the problem have priority to be processed on two identical parallel machines without preemption and then delivered to the customer by two vehicles in batches. For this NP-hard problem, we first prove that it is impossible to have a polynomial heuristic with a worst-case performance ratio bound less than 2 unless P = NP. …”
Get full text

A Heuristic Algorithm for Resource Allocation/Reallocation Problem by S. Raja Balachandar, K. Kannan

“…The encouraging results especially for relatively large-size test problems indicate that this heuristic approach can successfully be used for finding good solutions for highly constrained NP-hard problems.…”
Get full text

Optimal Route Selection Decision-Making Based on Intelligent Network by Mengshu Zhao, Zhaohui Zhang

“…Modern intelligent network provides a lot of convenience for the development of the society, especially for some practical NP-hard optimal problems. In this paper, we study a game case which is a problem of optimal strategy of desert crossing based on intelligent network and then propose an optimal route selection decision-making. …”
Get full text

A Hybrid Metaheuristic for Multiple Runways Aircraft Landing Problem Based on Bat Algorithm by Jian Xie, Yongquan Zhou, Hongqing Zheng

“…The aircraft landing problem (ALP) is an NP-hard problem; the aim of ALP is to minimize the total cost of landing deviation from predefined target time under the condition of safe landing. …”
Get full text

An efficient load balancing algorithm for virtual machine allocation based on ant colony optimization by Peng Xu, Guimin He, Zhenhao Li, Zhongbao Zhang

“…To achieve this goal, we leverage the ant colony optimization to design an efficient virtual machine allocation algorithm based on the NP-hard feature of this problem. Specifically, we customize the ant colony optimization in the context of virtual machine allocation and introduce an improved physical machine selection strategy to the basic ant colony optimization in order to prevent the premature convergence or falling into the local optima. …”
Get full text

Optimizing Transmit Sequence and Instrumental Variables Receiver for Dual-Function Complexity System by Yu Yao, Junhui Zhao, Lenan Wu

“…All iterations involve the solution of NP-hard quadratic fractional problems. The relaxation plus randomization technique is used to find an approximate solution. …”
Get full text

Algorithmic Complexity and Bounds for Domination Subdivision Numbers of Graphs by Fu-Tao Hu, Chang-Xu Zhang, Shu-Cheng Yang

“…In this paper, we improve the above bound to sdγG≤dGu+dGv−NGu∩NGv−1, and furthermore, we show the decision problem for determining whether sdγG=1 is NP-hard. Moreover, we show some bounds or exact values for domination subdivision numbers of some graphs.…”
Get full text

Hybrid Metaheuristics for Solving a Fuzzy Single Batch-Processing Machine Scheduling Problem by S. Molla-Alizadeh-Zavardehi, R. Tavakkoli-Moghaddam, F. Hosseinzadeh Lotfi

“…Then, due to the complexity of the problem, which is NP-hard, we design two hybrid metaheuristics called GA-VNS and VNS-SA applying the advantages of genetic algorithm (GA), variable neighborhood search (VNS), and simulated annealing (SA) frameworks. …”
Get full text

Rainbow Connectivity Using a Rank Genetic Algorithm: Moore Cages with Girth Six by J. Cervantes-Ojeda, M. Gómez-Fuentes, D. González-Moreno, M. Olsen

“…The computation of the minimum number of colors of a rainbow coloring is known to be NP-Hard and the Rank Genetic Algorithm showed good behavior finding rainbow t-colorings with a small number of colors.…”
Get full text

Restoration Strategy Based on Optimal Relay Node Placement in Wireless Sensor Networks by Xiaoding Wang, Li Xu, Shuming Zhou

“…In fact, finding the optimal solution for connecting disjoint segments in terms of the number and positions of relay nodes is NP-hard. To address this issue, plenty of heuristics, such as STP-MSP (Cheng et al., 2008), MST-1 t RN (Lloyd et al., 2007), and CORP (Lee and Younis, 2010) are deeply pursued. …”
Get full text

A New Quasi-Human Algorithm for Solving the Packing Problem of Unit Equilateral Triangles by Ruimin Wang, Xiaozhuo Qi, Yuqiang Luo, Jianqiang Dong

“…Because this problem is nondeterministic polynomial (NP) hard and has the feature of continuity, it is necessary to limit the placements of unit equilateral triangles before optimizing and obtaining approximate solution (e.g., the unit equilateral triangles are not allowed to be rotated). …”
Get full text