A novel oriented cuckoo search algorithm to improve DV-Hop performance for cyber–physical systems

Cui, Zhihua; Sun, Bin; Wang, Gai-Ge; Xue, Yu; Chen, Jinjun

doi:10.1016/j.jpdc.2016.10.011

Cited by 235 publications

(112 citation statements)

References 45 publications

Supporting

Mentioning

111

Contrasting

Unclassified

Order By: Relevance

“…The stopping criterion for Lingo was set to when it found the optimal solution, with a maximum duration of 250 h. The stopping criterion of DE was the number of iterations, with a threshold of 500 iterations. Set NP = 50, F = 2.0, and CR = 0.8 [7,19]. The results of DE compared with Lingo v.11 are shown in Table 6.…”

Section: Experimental Results Of Differential Evolution Algorithm (Dementioning

confidence: 99%

“…The well-known metaheuristics include the Krill Herd (KH) algorithm [4][5][6], the Cuckoo algorithm [7,8], and the Monarch Butterfly Optimization (MBO) [9,10], which can improve efficiency by using the Lévy flight operator and fly straight operator [11], the Hybridizing Harmony Search [12], the Bat algorithm [13], the Elephant Herding Optimization (EHO) [14], or the Earthworm optimization algorithm (EWA) [15].…”

Section: Literature Reviewmentioning

confidence: 99%

See 1 more Smart Citation

An Improved Differential Evolution Algorithm for Crop Planning in the Northeastern Region of Thailand

Ketsripongsa

Pitakaso

Sethanan

et al. 2018

MCA

View full text Add to dashboard Cite

Abstract:This research aimed to solve the economic crop planning problem, considering transportation logistics to maximize the profit from cultivated activities. Income is derived from the selling price and production rate of the plants; costs are due to operating and transportation expenses. Two solving methods are presented: (1) developing a mathematical model and solving it using Lingo v.11, and (2) using three improved Differential Evolution (DE) Algorithms-I-DE-SW, I-DE-CY, and I-DE-KV-which are DE with swap, cyclic moves (CY), and K-variables moves (KV) respectively. The algorithms were tested by 16 test instances, including this case study. The computational results showed that Lingo v.11 and all DE algorithms can find the optimal solution eight out of 16 times. Regarding the remaining test instances, Lingo v.11 was unable to find the optimal solution within 400 h. The results for the DE algorithms were compared with the best solution generated within that time. The DE solutions were 1.196-1.488% better than the best solution generated by Lingo v.11 and used 200 times less computational time. Comparing the three DE algorithms, MDE-KV was the DE that was the most flexible, with the biggest neighborhood structure, and outperformed the other DE algorithms.

show abstract

Section: Experimental Results Of Differential Evolution Algorithm (Dementioning

confidence: 99%

Section: Literature Reviewmentioning

confidence: 99%

An Improved Differential Evolution Algorithm for Crop Planning in the Northeastern Region of Thailand

Ketsripongsa

Pitakaso

Sethanan

et al. 2018

MCA

View full text Add to dashboard Cite

show abstract

“…Later, we may use artifact to denote artifact class since we focus on the model level in this work. In the age of cloud computing, workflows are often deployed in cloud, in which data security is especially significant. Thus, the privacy property of data is considered in the specification.…”

Section: Formal Model For Artifact‐centric Business Processesmentioning

confidence: 99%

Toward configurable modeling for artifact‐centric business processes

Kang

Long

Zhang

2019

Concurrency and Computation

View full text Add to dashboard Cite

Summary There are usually process model variants for a business as its application and evolution. Configurable process modeling is an effective approach for the design and development of business process models by reuse. However, the existing configurable process modeling approaches focus on traditional activity‐centric business processes, which is unfeasible for the new modeling paradigm of artifact‐centric business processes. To solve the problem, we propose a configurable modeling framework, especially for artifact‐centric business processes. To derive the integrated model for multiple process model variants, we propose a merger operation for artifact‐centric process model variants. We get a configurable artifact‐centric process model by identifying configurable points in the integrated model by common and variable characteristics. Moreover, the associated configuration alternatives are set accordingly for configurable points, in which the property of data privacy is considered. New artifact‐centric process models can be derived by configuration based on the behavior of a configurable model. To facilitate the process configuration, guidelines are analyzed based on the notion of process element relation graph. A case study is conducted to illustrate the effectiveness of our approach with a real‐world business process developed for Real Estate Administration (REA) in Hangzhou, China.

show abstract

“…The Internet of Things (IoT), a new type of network technology and industry model, is widely regarded as one of the cores of information technology in the modern era. Wireless sensor networks (WSN) play an indispensable role in the IoT and are also taken seriously. WSN, a self‐organization network, is made up of a series of minor sensors.…”

Section: Introductionmentioning

confidence: 99%

A unified heuristic bat algorithm to optimize the LEACH protocol

Cai

Geng

et al. 2019

Concurrency and Computation

View full text Add to dashboard Cite

Summary Wireless sensor networks (WSN) have high value in the field of wireless communications. As the earliest WSN clustering protocol, Low Energy Adaptive Clustering Hierarchy (LEACH) can effectively reduce the energy consumption of data transmission in sensor networks. However, LEACH has some problems such as cluster head nodes are unevenly distributed. In this paper, a unified heuristic bat algorithm (UHBA) is proposed to optimize elections in cluster heads. This algorithm guarantees that the election of cluster heads can freely transform both global search and local search. Meanwhile, comparing with several other variants of the bat algorithm in CEC2013 test suite, it can be seen from results that UHBA has better performance. Moreover, the application of the algorithm on LEACH is better than other algorithms, which further proves that the algorithm has better results.

show abstract

A novel oriented cuckoo search algorithm to improve DV-Hop performance for cyber–physical systems

Cited by 235 publications

References 45 publications

An Improved Differential Evolution Algorithm for Crop Planning in the Northeastern Region of Thailand

An Improved Differential Evolution Algorithm for Crop Planning in the Northeastern Region of Thailand

Toward configurable modeling for artifact‐centric business processes

A unified heuristic bat algorithm to optimize the LEACH protocol

Contact Info

Product

Resources

About