A migrating birds optimization algorithm for machine-part cell formation problems

RICARDO JAVIER SOTO DE GIORGIS, BRODERICK CRAWFORD LABRIN, Boris Almonacid, Fernando Paredes

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

15 Scopus citations

Abstract

Machine-Part Cell Formation Problems consists in organizing a plant as a set of cells, each one of them processing machines containing the same type of parts. In recent years, different meta-heuristic have been used to solve this problem. This paper addresses the problem of Machine-Part Cell Formation by using the Migrating Birds Optimization algorithm. The computational experiments show that in most of the benchmark problems the results obtained from the proposed approach are better than those obtained by other methods which are reported in the literature.

Original languageEnglish
Title of host publicationAdvances in Artificial Intelligence and Soft Computing - 14th Mexican International Conference on Artificial Intelligence, MICAI 2015, Proceedings
EditorsGrigori Sidorov, SofÍa N. Galicia-Haro
PublisherSpringer Verlag
Pages270-281
Number of pages12
ISBN (Print)9783319270593
DOIs
StatePublished - 1 Jan 2015
Event14th Mexican International Conference on Artificial Intelligence, MICAI 2015 - Cuernavaca, Morelos, Mexico
Duration: 25 Oct 201531 Oct 2015

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9413
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference14th Mexican International Conference on Artificial Intelligence, MICAI 2015
CountryMexico
CityCuernavaca, Morelos
Period25/10/1531/10/15

Keywords

  • Cell formation problem
  • Meta-heuristics
  • Migrating birds optimization
  • Nature-inspired algorithms

Fingerprint Dive into the research topics of 'A migrating birds optimization algorithm for machine-part cell formation problems'. Together they form a unique fingerprint.

Cite this