Honey-bees optimization algorithm applied to path planning problem

A survey: algorithms simulating bee swarm intelligence

“…This metaheuristic was applied to a data-mining problem by Benatchba et al (2005) and used to solve partitioning and scheduling problems in code design (Koudil et al 2007). Curkovic and Jerbic (2007) applied Honey-bees mating algorithm to a non linear Diophantine equation benchmark problem and compared the results to the results of a genetic algorithm. In the same study, they also applied the algorithm to solve a problem of guidance of mobile robot through the space with differently shaped and distributed obstacles.…”

“…Numerical problems Lu and Zhou (2008a) Bee system Improvement on GA Sato and Hagiwara (1997) Model of information sharing and processing model of bees Information sharing on LAN, WAN, Internet Walker (2003) Discrete bee dance Algorithm Pattern formation on a grid Gordon et al (2003) Bee hive algorithm Routing in networks Wedde et al (2004) Routing in networks Wedde and Farooq (2005a) Routing in networks Wedde and Farooq (2005b) Qos unicast routing scheme Wang et al (2007) (2006) On-line search Navrat et al (2007) Honey bee search algorithm Sparse reconstruction Olague and Puente (2006) Ecological algorithm Pure algorithm, optimal ordering Yonezawa and Kikuchi (1996) Systems biology Passino (2006) Quorum sensing Software fault tolerant system Gutierrez and Huhns (2008) Decentralized honey bee algorithm Dynamic server allocation in internet hosting centers Nakrani and Tovey (2004b) Honey bee algorithm Autonomic server orchestration in internet hosting centers (2003) Data mining Benatchba et al (2005) Partitioning and scheduling problems Koudil et al (2007) Non linear diophantine equation benchmark problem, guidance of mobile robot through the space with differently shaped and distributed obstacles Curkovic and Jerbic (2007) Combinatorial optimization problems, stochastic dynamic programming Chang (2006) Infinite horizon-discounted cost stochastic dynamic programming problems Chang (2006) Multiobjective optimization Niknam et al (2008) Complex evaluation functions and TSP Yang et al (2007c) Ground anti-aircraft weapon system networks…”

Co-Evolutionary Algorithm for Motion Planning of Two Industrial Robots with Overlapping Workspaces

“…A comprehensive overview on robot motion planning can be found in [3]. If a path planning problem is presented in the optimization context, robust optimization techniques, such as evolutionary algorithms [4], swarm intelligence concepts [5] etc. have proven suitable, even though the problem is NP-complete and PSPACE-hard even in its simplest form.…”

A hybrid optimization approach for sustainable process planning and scheduling

“…Koudil et al [27] applied HBMO to solve partitioning and scheduling problems in code design. Curkovic and Jerbic [7] used HBMO to address the non-linear diophantine equation benchmark problem. Haddad et al applied HBMO to optimize reservoir operation and distribution systems.…”