An Ant Inspired Bacterial Foraging Methodology Proposed to Solve Open Shop Scheduling Problems

This paper represents the efficiency of the Ant inspired Bacterial Foraging Optimization (ABFO), the hybrid technique of Ant Colony Optimization (ACO) algorithm and Bacterial Foraging Optimization (BFO) algorithm from Bio Inspired Computing to solve the Open Shop Scheduling Problems (OSSP). The Ant inspired Bacterial Foraging Optimization (ABFO) was tested on the Open Shop Scheduling benchmark problems from the literature. The computational method of ABFO algorithm has shown improvement in finding the optimal solutions when compared with BFO algorithm for all small level test problems. Although ABFO algorithm has not achieved the best known solutions for larger instances of benchmarks problems, the optimal values are highly comparable to other best performing algorithms.

[1]  Anthony Brabazon,et al.  Option Model Calibration Using a Bacterial Foraging Optimization Algorithm , 2008, EvoWorkshops.

[2]  Kevin M. Passino,et al.  Biomimicry of bacterial foraging for distributed optimization and control , 2002 .

[3]  Kevin M. Passino,et al.  Bacterial Foraging Optimization , 2010, Int. J. Swarm Intell. Res..

[4]  Jun Zhang,et al.  Implementation of an Ant Colony Optimization technique for job shop scheduling problem , 2006 .

[5]  Ajith Abraham,et al.  Adaptive Computational Chemotaxis in Bacterial Foraging Optimization: An Analysis , 2009, IEEE Transactions on Evolutionary Computation.

[6]  Teofilo F. Gonzalez,et al.  Open Shop Scheduling to Minimize Finish Time , 1976, JACM.

[7]  Christian Blum,et al.  Beam-ACO - hybridizing ant colony optimization with beam search: an application to open shop scheduling , 2005, Comput. Oper. Res..

[8]  Tom Holvoet,et al.  Cooperative Ant Colony Optimization in Traffic Route Calculations , 2012, PAAMS.

[9]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[10]  Jason Brownlee,et al.  Clever Algorithms: Nature-Inspired Programming Recipes , 2012 .

[11]  Éric D. Taillard,et al.  Benchmarks for basic scheduling problems , 1993 .

[12]  Ching-Fang Liaw,et al.  A hybrid genetic algorithm for the open shop scheduling problem , 2000, Eur. J. Oper. Res..

[13]  O Seraj,et al.  A Tabu Search Method for a New Bi-Objective Open Shop Scheduling Problem by a Fuzzy Multi-Objective Decision Making Approach (RESEARCH NOTE) , 2009 .

[14]  André Langevin,et al.  An Optimal Constraint Programming Approach to the Open-Shop Problem , 2012, INFORMS J. Comput..

[15]  Ajith Abraham,et al.  Synergy of PSO and Bacterial Foraging Optimization - A Comparative Study on Numerical Benchmarks , 2008, Innovations in Hybrid Intelligent Systems.

[16]  Manuel López-Ibáñez,et al.  Ant colony optimization , 2010, GECCO '10.

[17]  Seda HEZER,et al.  SOLVING VEHICLE ROUTING PROBLEM WITH SIMULTANEOUS DELIVERY AND PICK-UP USING BACTERIAL FORAGING OPTIMIZATION ALGORITHM , 2011 .

[18]  H. Van Dyke Parunak,et al.  "Go to the ant": Engineering principles from natural multi-agent systems , 1997, Ann. Oper. Res..

[19]  Yichuan Shao,et al.  Cooperative Bacterial Foraging Optimization , 2009, 2009 International Conference on Future BioMedical Information Engineering (FBIE).