Discrete Bacteria Foraging Optimization Algorithm for Vehicle Distribution Optimization in Graph Based Road Network Management
Bacteria Foraging Optimization (BFO) is a swarm intelligence optimization technique which has proven to be very effective in continuous search domain having several dimensions. In this paper a discrete and adaptive version of the Bacteria Foraging Optimization Algorithm is being introduced which will be useful in discrete search domain and all kind of multi-dimensional graph based problem. This Discrete Bacteria Foraging Optimization (DBFO) Algorithm is being analyzed and tested in the optimized route foundation phenomenon of a graph based road network and has been compared with the Ant Colony Optimization and Intelligent Water Drop with respect to global convergence. The road system is obsessed with multiple parameters which influence the management of the vehicles in the graph and needs to be analyzed and taken care of. Multiple parameters of the system demand multi-objective optimization using a weighted evaluation function which is carefully designed keeping in mind how the parameters behaves and how its variation dynamically changes the performance of the system. The new discrete version of BFO is being introduced for the first time and it readily suits all kind of graph based and combinatorial optimization problems.
Keywordsdiscrete bacteria foraging algorithm vehicle routing optimization combinatorial optimization graph search and path planning technique
Unable to display preview. Download preview PDF.
- 3.Liu, W., Chen, H., Chen, H., Chen, M.: RFID Network Scheduling Using an Adaptive Bacteria Foraging Algorithm. Journal of Computer Information Systems (JCIS) 7(4), 1238–1245 (2011)Google Scholar
- 4.Biswas, A., Dasgupta, S., Das, S., Abraham, A.: Synergy of PSO and BFO-A Comparative Study on Numerical Benchmarks. In: International Symposium on Hybrid Artificial Intelligent Systems (HAIS), Salamanca, Spain, pp. 255–263 (November 2007)Google Scholar