Multi-point path planning based on the algorithm of colony-particle swarm optimization by Lijue LIU, Shuning LUO, Yan GAO, Meifei CHEN

Subjects: “…NP-hard problem…”
Get full text

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

Maximum Butterfly Generators Search in Bipartite Networks by Jianrong Huang, Guangyao Pang, Fei Hao

“…Enumerating maximal butterfly has been proved to be a NP-hard and suffers time and space complexity. To conquer this challenge, this paper pioneers a novel problem called maximal butterfly generators search (MBGS) for facilitating the detection of maximal butterflies. …”
Get full text

Security of the cryptosystems based on ergodic matrices by Hua-wei HUANG, Chang-wen PENG, Yun-yun QU, Chun-hua LI

“…The security of the public-key cryptosystems based on ergodicmatrices over finite field was analysed.According to the public key,a system of linear equations for the forged secret key bits is obtained by inverse matrix elimination method.It is proved that the computational TEME problem is solvablein polynomial time and the ciphertext of the PZZ1 cryptosystem can be decrypted by the forged secret key.In some case the SEME problem can be reduced to discrete logarithm problem in polynomial time.If the key parameters are chosen improperly,then PZZ2 cryptosystem is based on discrete logarithm problem instead of NP hard problem.…”
Get full text

Algorithm for the cloud service workflow scheduling with setup time and deadline constraints by Hong SHEN, Xiao-ping LI

“…Cost minimization with deadline constraints and setup time is a new resource allocation optimization problem in cloud computing.An integer programming model is constructed for this NP-hard problem.A novel probability model and updating mechanism is suggested for sampling the solution space.A heuristic method is investigated for generating good initial population.A hybrid estimation of distribution algorithm (HEDA) is proposed for the considered problem.The global best solution is adopted to balance the diversification and intensification of HEDA.Experimental results show that the proposed method is effective to optimize the workflow running cost within reasonable CPU time.…”
Get full text

Optimal cluster head deployment in heterogeneous wireless sensor networks by LIU Lin1, YU Hai-bin2

“…Cluster-based method has better adaptability and energy-efficiency to wireless sensor networks（WSN） used for environmental monitoring.If the cluster head is served by more powerful node,the performance of WSN will be improved greatly.In large scale WSN,high-power cluster head deployment is a kind of NP-hard problem.The optimal problem of cluster head deployment was formulated as an integer programming with the condition of restrictions of cluster head capacity and the maximal cluster radius.To satisfy the time effectiveness,a heuristic algorithm called KMSA was proposed which was a hybrid algorithm of K-mean and simulated annealing.The simulation results show that the KMSA can improve the performance of WSN on varieties of network size and cluster number.…”
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

RWA algorithm based on cost of photoelectric conversion device by Daoyun HU, Zhentai YANG, Qianchun LU, Jin QI

“…Over the past decade,carrier operator implement fine-grained traffic scheduling in optical transport network(OTN) by deploying optical-electric conversion(OEO) devices on ROADM,which can improve the spectrum utilization.However,OEO device is very expensive,which will increase the CAPEX and OPEX of carrier operator.A problem about traffic scheduling and the deployment of OEO devices in OTN was proposed.Then,the ILP model of this problem was built and it was proved NP-hard.Additionally,two novel algorithms named OEO-RWA and SA-RWA were proposed.At last,these algorithms were demonstrated can not only ensure flexibility of traffic scheduling,but also can reduce the number of OEO device through simulation.…”
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

Power control for successive interference cancellation algorithm based on game theory by Song-hua HU, Jian-jun ZHANG, Yang LU, Bin LIU, Jiang-hong HAN

“…It was proved that implementation of successive interference cancellation could improve network throughput in wireless networks,while in order to maximize network throughput,it was a NP-Hard problem that how to control transmission power when successive interference cancellation was used in wireless networks.A non-cooperative game theory is proposed to solve power control between wireless nodes for successive interference cancellation,in which non-cooperative game theory model is proposed and Nash equilibrium is analyzed,and also the proposed algorithm can ob-tain good network throughput than others,simulations validate the results and demonstrate the superiority of the algorithm.…”
Get full text

Green energy management in internet of things based on quality of service composition by Chong GUO, Wenqing YAN, Bin XU

“…With the rapid development of internet of things technology,the energy consumption of service composition in the internet of things is a key issue to be studied.The service composition problem in the internet of things mostly focuses on the evaluation based on quality of service(QoS) at present and ignores the overall enerqy cornsumption during the dynamic deployment of service qrnposition.Therefore,a QoS evaluation model and an energy evaluation model was proposed for service composition in the internet of things.Finally,considering the service composition in the internet of things is NP hard,the moth-flame optimization (MFO) was successfully applied to the QoS evaluation model and the energy evaluation model.The experimental results show that MFO has a better optimization effect in the above model,so as to realize the green energy management of the quality of service composition in the environment of the internet of things.…”
Get full text

A business attribute correlation multi-path routing algorithm based on SDN architecture by Xiang YU, Mingmin YI, Lu YANG

“…Currently,most of the routing algorithms support only one QoS parameter,and do not consider the fairness of system scheduling service.Obviously,multi-parameters constrains problem is NP hard problem,it is impossible to solve this kind of problem by traditional routing algorithms.The routing thought from ant colony algorithm（ACO）was introduced.On the basis of the ACO,and combined with the business attributes of traffic flow,a new algorithm was put forward which introduced the delay and packet loss into the ACO,as a dependence of routing.In new algorithm,which according to the real-time status of network,the suitable routing was chosen for different types traffic and forward by multi-path base on the classification of traffic flows.The experiment shows that this algorithm can decrease the delay and packet loss effectively.…”
Get full text

The adjacency dimension of some path related trees by Elham Hardany, Ali Behtoei

“…‎Since the problem of computing the adjacency dimension of a graph is NP-hard‎, ‎finding the adjacency dimension of special classes of graphs or obtaining good bounds on this invariant is valuable‎. ‎…”
Get full text

On coding over the spatial-temporal diversity for reliable transmission scheme in low-duty-cycle WSN by Yu-bo YAN, Pan-long YANG, Lei ZHANG, Zheng-lun QIU, Shan-lin HONG

“…A reliable data delivery scheme for low-duty-cycle wireless sensor networks(WSN)was proposed.Using this scheme,the unique spatial-temporal diversity in low-duty-cycle WSN was explored and exploited.Combining with coding schemes,the proposed scheme could achieve higher energy efficiency and lower delivery delay.The coding block allocation problem over multiple paths was formulated.As it was NP-hard,an approximate algorithm to tackle this difficulty was proposed.The impact of network parameters was further analyzed with experimental methods.Extensive simulations also show that,the coding over the spatial-temporal diversity scheme could achieve relatively reliable and low delay delivery with relatively less energy.…”
Get full text

Research on caching strategy based on transmission delay in Cell-Free massive MIMO systems by Rui WANG, Min SHEN, Yun HE, Xiangyan LIU

“…To meet the ultra-low latency and ultra-high reliability requirements of users in the future mobile Internet， the wireless caching technology was combined with Cell-Free massive MIMO systems.The caching model was designed based on AP cooperative caching and regional popularity evaluation.The transmission delay expression involving AP clustering， cooperative caching， and regional popularity was derived， and the content placement problem was expressed as total content transmission delay minimization.Through the demonstration of the NP-hard and submodular monotony of the optimization problem， the greedy algorithm-based optimization strategy was proposed.Simulation results show that the proposed strategy can effectively reduce the content transmission delay and improve the cache hit rate.…”
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