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

János Botzheim, Yuichiro Toda, Naoyuki Kubota

Research output: Contribution to journalArticle

3 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)107-112
Number of pages6
JournalArtificial Life and Robotics
Volume17
Issue number1
DOIs
Publication statusPublished - Oct 1 2012
Externally publishedYes

Keywords

  • Flow shop scheduling
  • Memetic algorithm
  • Path planning

ASJC Scopus subject areas

  • Biochemistry, Genetics and Molecular Biology(all)
  • Artificial Intelligence

Fingerprint Dive into the research topics of 'Bacterial memetic algorithm for simultaneous optimization of path planning and flow shop scheduling problems'. Together they form a unique fingerprint.

  • Cite this