Skip to main content
Log in

Bacterial memetic algorithm for simultaneous optimization of path planning and flow shop scheduling problems

  • Original Article
  • Published:
Artificial Life and Robotics Aims and scope Submit manuscript

Abstract

The paper deals with simultaneous optimization of path planning of mobile robots and flow shop scheduling problem. The goal of the path planning problem is to determine an optimal collision-free path between a start and a target point for a mobile robot in an environment surrounded by obstacles. The objective is to minimize the path length without colliding with an obstacle. On the other hand, shop scheduling problems deal with processing a given set of jobs on a given number of machines. Each operation has an associated machine on which it has to be processed for a given length of time. The problem is to minimize the overall time demand of the whole process. In this paper, we deal with two robots carrying items between the machines. Bacterial memetic algorithm is proposed for solving this combined problem. The algorithm is verified by experimental simulations and compared to classical techniques.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2

Similar content being viewed by others

References

  1. Hosseinzadeh A, Izadkhah H (2010) Evolutionary approach for mobile robot path planning in complex environment. Int J Comput Sci Issues 7(4):1–9

    Google Scholar 

  2. Xiao J, Michalewicz Z, Zhang L, Trojanowski K (1997) Adaptive evolutionary planner/navigator for mobile robots. IEEE Trans Evol Comput 1(1):18–28

    Article  Google Scholar 

  3. Grabowski J, Pempera J (2007) The permutation flowshop problem with blocking. A tabu search approach. Int J Manag Sci 35:302–311

    Google Scholar 

  4. Mirabi M, Ashkezari MD (2011) Application of hybrid meta-heuristic approach to solve flow-shop scheduling problem. Aust J Basic Appl Sci 5(10):93–98

    Google Scholar 

  5. Nawa NE, Furuhashi T (1999) Fuzzy system parameters discovery by bacterial evolutionary algorithm. IEEE Trans Fuzzy Syst 7(5):608–616

    Article  Google Scholar 

  6. Moscato P (1989) On evolution, search, optimization, genetic algorithms and martial arts: towards memetic algorithms. Technical report. Caltech concurrent computation program, report. 826, California Institute of Technology, Pasadena

  7. Botzheim J, Cabrita C, Kóczy LT, Ruano AE (2005) Fuzzy rule extraction by bacterial memetic algorithms. In: Proceedings of the 11th World Congress of International Fuzzy Systems Association, IFSA 2005, Beijing, pp 1563–1568

  8. Botzheim J, Toda Y, Kubota N (2012) Bacterial memetic algorithm for offline path planning of mobile robots. Memet Comput 4(1):73–86

    Article  Google Scholar 

  9. Földesi P, Botzheim J, Kóczy LT (2011) Eugenic bacterial memetic algorithm for fuzzy road transport traveling salesman problem. Int J Innov Comput Inf Cont 7(5(B)):2775–2798

    Google Scholar 

  10. Holland JH (1992) Adaption in natural and artificial systems. The MIT Press, Cambridge

  11. Reeves CR (1995) A genetic algorithm for flow shop sequencing. Comput Ops Res 22(1):5–13

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to János Botzheim.

About this article

Cite this article

Botzheim, J., Toda, Y. & Kubota, N. Bacterial memetic algorithm for simultaneous optimization of path planning and flow shop scheduling problems. Artif Life Robotics 17, 107–112 (2012). https://doi.org/10.1007/s10015-012-0021-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10015-012-0021-9

Keywords

Navigation