Skip to main content

Artificial Plant Optimization Algorithm with Double Selection Strategies for DV-Hop

Buy Article:

$107.14 + tax (Refund Policy)

Artificial plant optimization algorithm (APOA) is a population-based stochastic optimization algorithm by simulating the plant growing mechanism. In the standard version, there is no furcation in each branch. This phenomenon is confused with the natural tree because in natural tree, each branch maintains many furcations to improve the efficiency of photosynthesis. To avoid this shortcoming, we incorporate two selection strategies into the methodology of the standard version, and propose one new variant called artificial plant optimization algorithm with double selection strategies. Furthermore, to investigate the performance, this new algorithm is applied to optimize the DV-Hop location algorithm. Simulation results show it achieves the better performance than DV-Hop.

Keywords: ARTIFICIAL PLANT OPTIMIZATION ALGORITHM; DV-HOP; ELITIST-TOURNAMENT SELECTION; TOURNAMENT SELECTION

Document Type: Research Article

Publication date: 01 September 2014

More about this publication?
  • The growing interest and activity in the field of sensor technologies requires a forum for rapid dissemination of important results: Sensor Letters is that forum. Sensor Letters offers scientists, engineers and medical experts timely, peer-reviewed research on sensor science and technology of the highest quality. Sensor Letters publish original rapid communications, full papers and timely state-of-the-art reviews encompassing the fundamental and applied research on sensor science and technology in all fields of science, engineering, and medicine. Highest priority will be given to short communications reporting important new scientific and technological findings.
  • Editorial Board
  • Information for Authors
  • Subscribe to this Title
  • Terms & Conditions
  • Ingenta Connect is not responsible for the content or availability of external websites
  • Access Key
  • Free content
  • Partial Free content
  • New content
  • Open access content
  • Partial Open access content
  • Subscribed content
  • Partial Subscribed content
  • Free trial content