Single-Machine Scheduling to Minimize Total Completion Time and Tardiness with Two Competing Agents by Wen-Chiung Lee, Yau-Ren Shiau, Yu-Hsiang Chung, Lawson Ding

“…A branch-and-bound algorithm is developed to derive the optimal sequence and two simulated annealing heuristic algorithms are proposed to search for the near-optimal solutions. …”
Get full text

Energy-Efficient Virtual Machine Migration and Consolidation Algorithm in Cloud Data Center by Hongjian Li, Yu Dai, Rui Liu, Yi Jiang

“…Compared with traditional heuristic algorithms, the algorithm reduces the number of active physical nodes and the amount of VM's migration effectively, and obtains better energy efficiency in cloud data center.…”
Get full text

<italic>UAV-NavS</italic>: Three-Dimensional Navigation System of Multiple Unmanned Aerial Vehicles Using Hybrid Optimization Algorithm by Monia Digra, Upma Jain, Ram Kishan Dewangan, Himanshu Suyal

“…The efficiency of the proposed hybrid approach is compared with other meta-heuristic algorithms for multi-UAV navigation. Results obtained through simulation ensure the validity of the proposed approach.…”
Get full text

Integrated Berth Allocation and Time-Variant Quay Crane Scheduling with Tidal Impact in Approach Channel by Xiaogang Jiao, Feifeng Zheng, Ming Liu, Yinfeng Xu

“…An integer linear programming model is developed, and then three heuristic algorithms, Genetic Algorithm, Hybrid Particle Swarm Optimization, and Hybrid Simulated Annealing, are proposed to solve the model. …”
Get full text

A Dynamic Scheduling Method of Earth-Observing Satellites by Employing Rolling Horizon Strategy by Qiu Dishan, He Chuan, Liu Jin, Ma Manhao

“…We also propose three dynamic scheduling algorithms by the combination of the RH strategy and various heuristic algorithms. Finally, the scheduling results of different algorithms are compared and the presented methods in this paper are demonstrated to be efficient by extensive experiments.…”
Get full text

A Genetic Algorithm to Minimize the Total Tardiness for M-Machine Permutation Flowshop Problems by Chia-Shin Chung, James Flynn, Walter Rom, Piotr Staliński

“…We also undertake a numerical study comparing GA with an optimal branch and bound algorithm, and various heuristic algorithms including the well known NEH algorithm and a local search heuristic LH. …”
Get full text

The Airport Gate Assignment Problem: A Survey by Abdelghani Bouras, Mageed A. Ghaleb, Umar S. Suryahatmaja, Ahmed M. Salem

“…Our survey covers both theoretical and real AGAP with the description of mathematical formulations and resolution methods such as exact algorithms, heuristic algorithms, and metaheuristic algorithms. We also provide a research trend that can inspire researchers about new problems in this area.…”
Get full text

A Deep Reinforcement Learning Approach to the Optimization of Data Center Task Scheduling by Haiying Che, Zixing Bai, Rong Zuo, Honglei Li

“…The task-scheduling operation with traditional heuristic algorithms is facing the challenges of uncertainty and complexity of the data center environment. …”
Get full text

Designing a Multi-Objective Closed-loop Supply Chain Mathematical Model with Supplier Selection Approach and considering Discount by Esmat Saadi, kiamars fathi, Reza Radfar

“…The presented model generates Pareto solutions using two proposed meta-heuristic algorithms, multi objective particle swarm optimization and non-dominated sorting genetic algorithm and combination of the two. …”
Get full text

Dynamic Resource Management in 802.11 Wireless Mesh Networks by George Athanasiou

“…The iterative heuristic algorithms that we propose controls the communication load of each mesh AP in a distributed manner. …”
Get full text

Resource optimization algorithm of combination of NFV and SDN for application of multiple services by Xiaorong ZHU, Qian ZHANG

“…Various services of internet of things (IoT) require flexible network deployment to guarantee different quality of service (QoS).Aiming at the problem of IoT service function chain deployment,network function virtualization (NFV) and software defined networking (SDN) were combined to optimize resources.Considering forwarding cost and traffic load balance,a joint optimization model of virtual network function placement and service function chain routing was given and was proved to be NP-Hard.In order to solve this model,two heuristic algorithms were proposed.One was the service chain deployment algorithm of first routing then placing (FRTP) and the other was the placing followed by routing (PFBR) based on node priority.Simulation results demonstrate that FRTP and PFBR algorithm can significantly balance network traffic load while alleviating congestion and improving the acceptance ratio of the chain requests compared with other algorithms.…”
Get full text

Bayesian network structure learning algorithm based on hybrid binary salp swarm-differential evolution algorithm by Bin LIU, Ruixing FAN, Haoran LIU, Liyue ZHANG, Haiyu WANG, Chunlan ZHANG

“…Aiming at the disadvantages of Bayesian network structure learned by heuristic algorithms,which were trapping in local minimums and having low search efficiency,a method of learning Bayesian network structure based on hybrid binary slap swarm-differential evolution algorithm was proposed.An adaptive scale factor was used to balance local and global search in the swarm grouping stage.The improved mutation operator and crossover operator were taken into salp search strategy and differential search strategy respectively to renew different subswarms in the update stage.Two-point mutation operator was adopted to improve the swarm’s diversity in the stage of merging of subswarms.The convergence analysis of the proposed algorithm demonstrates that best structure can be found through the iterative search of population.Experimental results show that the convergence accuracy and efficiency of the proposed algorithm are improved compared with other algorithms.…”
Get full text

A Class of Efficient Algorithms for the Bi-Level Demand Adjustment Problems in Congested Traffic Networks by Lan Cheng, Jun Xie, Jun Huang, Liyang Feng, Qianni Wang, Hongtai Yang

“…This paper studies a class of gradient-descent heuristic algorithms for the bi-level demand adjustment problem (DAP), which seeks to adjust origin-destination (OD) matrices based on observed link flows in congested transportation networks. …”
Get full text

A Two-Stage Greedy Genetic Algorithm for Simultaneous Delivery and Monitoring Tasks with Time Windows by Mingyang Tang, Jiaying Sun, Rongyang Zou

“…The simulation results indicate that TGGA outperforms existing heuristic algorithms.…”
Get full text

Node Selection Algorithms with Data Accuracy Guarantee in Service-Oriented Wireless Sensor Networks by Hongju Cheng, Ronglie Guo, Yuzhong Chen

“…Secondarily, we have proposed two heuristic algorithms, namely, Separate Selection Algorithm (SSA) and Combined Selection Algorithm (CSA). …”
Get full text

Survey on IPv6 address scanning technology based on seed sources by Guo LI, Lin HE, Guanglei SONG, Zhiliang WANG, Jiahai YANG, Zimu LI

“…Nowadays,the state-of-the-art technologies can spend a very short time to scan the whole IPv4 space,but these methods cannot be applied to the huge IPv6 space easily.Therefore,many researchers propose different heuristic algorithms for the sake of IPv6 scanning.The common way of these algorithms is to input collected IPv6 seed addresses and output new most likely active IPv6 addresses as candidates for later scanning.These methods greatly reduce the scanning range of the active address area.These technologies based on seed addresses were classified,analyzed and summarized,and detailed analysis of the advantages and disadvantages of each method was given.And the several challenges faced by the methods were discussed.73M seed addresses were collected in total from two sources,including published IPv6 datasets in papers and Beijing Node of China Education and Research Network.Through the proposed experiments,time performance and hit rate of four IPv6 address scanning technologies based on seed addresses was compared.Finally,the own thoughts on this field and some future research directions were proposed.…”
Get full text

Parameter Selection for PSO-Based Hybrid Algorithms and Its Effect on Crack Detection in Cantilever Beams by Amin Ghannadiasl, Saeedeh Ghaemifard

“…The importance of the parameters of any optimization algorithm, especially meta-heuristic algorithms that have been created to simplify the solution of optimization problems, is inevitable. …”
Get full text

A novel intelligent photonic design method enabled by metamaterials and k-nearest neighbor by Fan Hangming, Pan Junlin, Wang Yongchen, Yuan Zhe, Cheng Mengfan, Yang Qi, Liu Deming, Deng Lei

“…Here, we present an efficient methodology that combines metamaterials, heuristic algorithms, and machine learning to facilitate the rapid development of intricate devices. …”
Get full text

AoI-oriented low-energy-consumption information collection and transmission scheduling mechanism for emergency UAV networks by Yuming ZHANG, Lianming XU, Siyuan YIN, Linrun JIANG, Li WANG, Aiguo FEI

“…To address the information collection and aggregation issue in emergency scenarios characterized by the lack of public infrastructure and unstable satellite signals, an information timeliness-oriented information collection and transmission scheduling mechanism was proposed for emergency unmanned aerial vehicle (UAV) networks where information collection and transmission capabilities were constrained by energy consumption.Considering the age of information (AoI) as the metric and constraint of information timeliness, a stochastics optimization problem was constructed with the objective of minimizing UAV information collection and transmission energy consumption.By resorting to the Lyapunov optimization technique, virtual queues were established to impose information timeliness constraints on queue lengths, and the original problem was decoupled into two sub-problems, information collection and transmission scheduling, with the premise of ensuring system stability.Corresponding heuristic algorithms were proposed for each sub-problem.Simulation results demonstrate that the proposed algorithm outperforms conventional queue scheduling approaches in convergence rates and system energy consumption with guaranteed information timeliness.…”
Get full text

Optimal Design of a Hazardous Materials Transportation Network considering Uncertainty in Accident Consequences by Hongfei Jia, Junzhe Li

“…The model is transformed using chance-constrained programming and solved using heuristic algorithms. We apply the model to the highway network in Anhui province, China, to verify its validity. …”
Get full text