Solving the set covering problem with a shuffled frog leaping algorithm

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

25 Scopus citations

Abstract

In this paper we design and evaluate a shuffled frog leaping algorithm that solves the set covering problem. The shuffled frog leaping algorithm is a novel metaheuristic inspired by natural memetics. It consists of an individual memetic evolution and a global memetic information exchange between a population of virtual frogs representing possible solutions of a problem at hand. The experimental results show the effectiveness of our approach which produces competitive results solving a portfolio of set covering problems from the OR-Library.

Original languageEnglish
Title of host publicationIntelligent Information and Database Systems - 7th Asian Conference, ACIIDS 2015, Proceedings
EditorsNgoc Thanh Nguyen, Bogdan Trawiński, Ngoc Thanh Nguyen, Raymond Kosala
PublisherSpringer Verlag
Pages41-50
Number of pages10
ISBN (Electronic)9783319157047
DOIs
StatePublished - 1 Jan 2015
Event7th Asian Conference on Intelligent Information and Database Systems, ACIIDS 2015 - Bali, Indonesia
Duration: 23 Mar 201525 Mar 2015

Publication series

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

Conference

Conference7th Asian Conference on Intelligent Information and Database Systems, ACIIDS 2015
CountryIndonesia
CityBali
Period23/03/1525/03/15

Keywords

  • Artificial and computational intelligence
  • Metaheuristics
  • Set covering problem
  • Shuffled frog leaping algorithm

Fingerprint Dive into the research topics of 'Solving the set covering problem with a shuffled frog leaping algorithm'. Together they form a unique fingerprint.

Cite this