loading
Papers Papers/2022 Papers Papers/2022

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Mahdi Bidar ; Malek Mouhoub and Samira Sadaoui

Affiliation: Department of Computer Science, University of Regina, Regina, Canada

Keyword(s): Constraint Satisfaction Problems (CSPs), Nature-inspired Techniques, Optimization, Metaheuristics.

Abstract: We present a new nature-inspired approach based on the Focus Group Optimization Algorithm (FGOA) for solving Constraint Satisfaction Problems (CSPs). CSPs are NP-complete problems meaning that solving them by classical systematic search methods requires exponential time, in theory. Appropriate alternatives are approximation methods such as metaheuristic algorithms which have shown successful results when solving combinatorial problems. FGOA is a new metaheuristic inspired by a human collaborative problem solving approach. In this paper, the steps of applying FGOA to CSPs are elaborated. More precisely, a new diversification method is devised to enable the algorithm to efficiently find solutions to CSPs, by escaping local optimum. To assess the performance of the proposed Discrete FGOA (DFGOA) in practice, we conducted several experiments on randomly generate hard to solve CSP instances (those near the phase transition) using the RB model. The results clearly show the ability of DFGOA to successfully find the solutions to these problems in very reasonable amount of time. (More)

CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 3.145.201.123

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Bidar, M., Mouhoub, M. and Sadaoui, S. (2020). Discrete Focus Group Optimization Algorithm for Solving Constraint Satisfaction Problems. In Proceedings of the 12th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART; ISBN 978-989-758-395-7; ISSN 2184-433X, SciTePress, pages 322-330. DOI: 10.5220/0008877803220330

@conference{icaart20,
author={Mahdi Bidar and Malek Mouhoub and Samira Sadaoui},
title={Discrete Focus Group Optimization Algorithm for Solving Constraint Satisfaction Problems},
booktitle={Proceedings of the 12th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART},
year={2020},
pages={322-330},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0008877803220330},
isbn={978-989-758-395-7},
issn={2184-433X},
}

TY - CONF

JO - Proceedings of the 12th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART
TI - Discrete Focus Group Optimization Algorithm for Solving Constraint Satisfaction Problems
SN - 978-989-758-395-7
IS - 2184-433X
AU - Bidar, M.
AU - Mouhoub, M.
AU - Sadaoui, S.
PY - 2020
SP - 322
EP - 330
DO - 10.5220/0008877803220330
PB - SciTePress

- Science and Technology Publications, Lda.
RESOURCES

Proceedings

Papers

Authors

Ontology

CONTACTS

Science and Technology Publications, Lda
Avenida de S. Francisco Xavier, Lote 7 Cv. C,
2900-616 Setúbal, Portugal.

Phone: +351 265 520 185 (National fixed network call)
Fax: +351 265 520 186
Email: info@scitepress.org

EXTERNAL LINKS

PRIMORIS

INSTICC

SCITEVENTS

CROSSREF

PROCEEDINGS SUBMITTED FOR INDEXATION BY:

dblp

Ei Compendex

SCOPUS

Semantic Scholar

Google Scholar

Microsoft Academic