Serveur d'exploration sur la visibilité du Havre

Attention, ce site est en cours de développement !
Attention, site généré par des moyens informatiques à partir de corpus bruts.
Les informations ne sont donc pas validées.

A hybrid Ant Colony Algorithm for the exam timetabling problem

Identifieur interne : 000476 ( Hal/Checkpoint ); précédent : 000475; suivant : 000477

A hybrid Ant Colony Algorithm for the exam timetabling problem

Auteurs : R. Abounacer [France] ; J. Boukachour [France] ; B. Dkhissi [Maroc] ; A. El Hilali Alaoui [Maroc]

Source :

RBID : Hal:hal-01286691

Descripteurs français

English descriptors

Abstract

Due to increased student numbers and regulation changes educational institutions that allow for greater flexibility, operations researchers and computer scientists have renewed their interest in developing effective methods to resolve the examination timetabling problem. Thus, in the intervening decades, important progress was made in the examination timetabling problem with appearance of adaptation of meta-heuristics. This paper presents a hybridization of the Ant Colony Algorithm and a Complete Local search with Memory heuristic, in order to maximize as much as possible; the free time between consecutive exams for each student, while respecting the conflict constraints, a student cannot sit more than one exam in the same timeslot.

Url:

Links toward previous steps (curation, corpus...)


Links to Exploration step

Hal:hal-01286691

Le document en format XML

<record>
<TEI>
<teiHeader>
<fileDesc>
<titleStmt>
<title xml:lang="en">A hybrid Ant Colony Algorithm for the exam timetabling problem</title>
<author>
<name sortKey="Abounacer, R" sort="Abounacer, R" uniqKey="Abounacer R" first="R." last="Abounacer">R. Abounacer</name>
<affiliation wicri:level="1">
<hal:affiliation type="laboratory" xml:id="struct-116471" status="VALID">
<orgName>Centre d'Etude et de Recherche en économiE et gestioN LogistiquE</orgName>
<orgName type="acronym">CERENE</orgName>
<desc>
<address>
<addrLine>Centre d'Etude et de Recherche en économiE et gestioN LogistiquE Faculté des Affaires Internationales Université du Havre 25 rue Philippe Lebon BP420, 76 057 Le Havre cedex, France Porte D110 Tel : (33)2 32 74 41 21 Email : CERENE@univ-lehavre.fr</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.univ-lehavre.fr/recherche/cerene/index.php</ref>
</desc>
<listRelation>
<relation active="#struct-300317" type="direct"></relation>
</listRelation>
<tutelles>
<tutelle active="#struct-300317" type="direct">
<org type="institution" xml:id="struct-300317" status="VALID">
<orgName>Université du Havre</orgName>
<desc>
<address>
<country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>France</country>
<placeName>
<settlement type="city">Le Havre</settlement>
<region type="region" nuts="2">Région Normandie</region>
<region type="old region" nuts="2">Haute-Normandie</region>
</placeName>
<orgName type="university">Université du Havre</orgName>
</affiliation>
</author>
<author>
<name sortKey="Boukachour, J" sort="Boukachour, J" uniqKey="Boukachour J" first="J." last="Boukachour">J. Boukachour</name>
<affiliation wicri:level="1">
<hal:affiliation type="laboratory" xml:id="struct-116471" status="VALID">
<orgName>Centre d'Etude et de Recherche en économiE et gestioN LogistiquE</orgName>
<orgName type="acronym">CERENE</orgName>
<desc>
<address>
<addrLine>Centre d'Etude et de Recherche en économiE et gestioN LogistiquE Faculté des Affaires Internationales Université du Havre 25 rue Philippe Lebon BP420, 76 057 Le Havre cedex, France Porte D110 Tel : (33)2 32 74 41 21 Email : CERENE@univ-lehavre.fr</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.univ-lehavre.fr/recherche/cerene/index.php</ref>
</desc>
<listRelation>
<relation active="#struct-300317" type="direct"></relation>
</listRelation>
<tutelles>
<tutelle active="#struct-300317" type="direct">
<org type="institution" xml:id="struct-300317" status="VALID">
<orgName>Université du Havre</orgName>
<desc>
<address>
<country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>France</country>
<placeName>
<settlement type="city">Le Havre</settlement>
<region type="region" nuts="2">Région Normandie</region>
<region type="old region" nuts="2">Haute-Normandie</region>
</placeName>
<orgName type="university">Université du Havre</orgName>
</affiliation>
</author>
<author>
<name sortKey="Dkhissi, B" sort="Dkhissi, B" uniqKey="Dkhissi B" first="B." last="Dkhissi">B. Dkhissi</name>
<affiliation wicri:level="1">
<hal:affiliation type="laboratory" xml:id="struct-452794" status="VALID">
<orgName>Laboratory of Modeling and Scientific Computing</orgName>
<orgName type="acronym">Faculté des Sciences et techniques de Fès </orgName>
<desc>
<address>
<addrLine>Laboratory of Modeling and Scientific ComputingFaculté des Sciences et techniques de Fès Saiss, Maroc</addrLine>
<country key="MA"></country>
</address>
</desc>
<listRelation>
<relation active="#struct-447007" type="direct"></relation>
</listRelation>
<tutelles>
<tutelle active="#struct-447007" type="direct">
<org type="institution" xml:id="struct-447007" status="VALID">
<orgName>Faculté des sciences</orgName>
<orgName type="acronym">Fès</orgName>
<desc>
<address>
<addrLine>Faculté des sciences, Fès, Maroc </addrLine>
<country key="MA"></country>
</address>
<ref type="url">http://www.fsdmfes.ac.ma/contact.php</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>Maroc</country>
</affiliation>
</author>
<author>
<name sortKey="El Hilali Alaoui, A" sort="El Hilali Alaoui, A" uniqKey="El Hilali Alaoui A" first="A." last="El Hilali Alaoui">A. El Hilali Alaoui</name>
<affiliation wicri:level="1">
<hal:affiliation type="laboratory" xml:id="struct-452794" status="VALID">
<orgName>Laboratory of Modeling and Scientific Computing</orgName>
<orgName type="acronym">Faculté des Sciences et techniques de Fès </orgName>
<desc>
<address>
<addrLine>Laboratory of Modeling and Scientific ComputingFaculté des Sciences et techniques de Fès Saiss, Maroc</addrLine>
<country key="MA"></country>
</address>
</desc>
<listRelation>
<relation active="#struct-447007" type="direct"></relation>
</listRelation>
<tutelles>
<tutelle active="#struct-447007" type="direct">
<org type="institution" xml:id="struct-447007" status="VALID">
<orgName>Faculté des sciences</orgName>
<orgName type="acronym">Fès</orgName>
<desc>
<address>
<addrLine>Faculté des sciences, Fès, Maroc </addrLine>
<country key="MA"></country>
</address>
<ref type="url">http://www.fsdmfes.ac.ma/contact.php</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>Maroc</country>
</affiliation>
</author>
</titleStmt>
<publicationStmt>
<idno type="wicri:source">HAL</idno>
<idno type="RBID">Hal:hal-01286691</idno>
<idno type="halId">hal-01286691</idno>
<idno type="halUri">https://hal.inria.fr/hal-01286691</idno>
<idno type="url">https://hal.inria.fr/hal-01286691</idno>
<date when="2010">2010</date>
<idno type="wicri:Area/Hal/Corpus">000023</idno>
<idno type="wicri:Area/Hal/Curation">000023</idno>
<idno type="wicri:Area/Hal/Checkpoint">000476</idno>
</publicationStmt>
<sourceDesc>
<biblStruct>
<analytic>
<title xml:lang="en">A hybrid Ant Colony Algorithm for the exam timetabling problem</title>
<author>
<name sortKey="Abounacer, R" sort="Abounacer, R" uniqKey="Abounacer R" first="R." last="Abounacer">R. Abounacer</name>
<affiliation wicri:level="1">
<hal:affiliation type="laboratory" xml:id="struct-116471" status="VALID">
<orgName>Centre d'Etude et de Recherche en économiE et gestioN LogistiquE</orgName>
<orgName type="acronym">CERENE</orgName>
<desc>
<address>
<addrLine>Centre d'Etude et de Recherche en économiE et gestioN LogistiquE Faculté des Affaires Internationales Université du Havre 25 rue Philippe Lebon BP420, 76 057 Le Havre cedex, France Porte D110 Tel : (33)2 32 74 41 21 Email : CERENE@univ-lehavre.fr</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.univ-lehavre.fr/recherche/cerene/index.php</ref>
</desc>
<listRelation>
<relation active="#struct-300317" type="direct"></relation>
</listRelation>
<tutelles>
<tutelle active="#struct-300317" type="direct">
<org type="institution" xml:id="struct-300317" status="VALID">
<orgName>Université du Havre</orgName>
<desc>
<address>
<country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>France</country>
<placeName>
<settlement type="city">Le Havre</settlement>
<region type="region" nuts="2">Région Normandie</region>
<region type="old region" nuts="2">Haute-Normandie</region>
</placeName>
<orgName type="university">Université du Havre</orgName>
</affiliation>
</author>
<author>
<name sortKey="Boukachour, J" sort="Boukachour, J" uniqKey="Boukachour J" first="J." last="Boukachour">J. Boukachour</name>
<affiliation wicri:level="1">
<hal:affiliation type="laboratory" xml:id="struct-116471" status="VALID">
<orgName>Centre d'Etude et de Recherche en économiE et gestioN LogistiquE</orgName>
<orgName type="acronym">CERENE</orgName>
<desc>
<address>
<addrLine>Centre d'Etude et de Recherche en économiE et gestioN LogistiquE Faculté des Affaires Internationales Université du Havre 25 rue Philippe Lebon BP420, 76 057 Le Havre cedex, France Porte D110 Tel : (33)2 32 74 41 21 Email : CERENE@univ-lehavre.fr</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.univ-lehavre.fr/recherche/cerene/index.php</ref>
</desc>
<listRelation>
<relation active="#struct-300317" type="direct"></relation>
</listRelation>
<tutelles>
<tutelle active="#struct-300317" type="direct">
<org type="institution" xml:id="struct-300317" status="VALID">
<orgName>Université du Havre</orgName>
<desc>
<address>
<country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>France</country>
<placeName>
<settlement type="city">Le Havre</settlement>
<region type="region" nuts="2">Région Normandie</region>
<region type="old region" nuts="2">Haute-Normandie</region>
</placeName>
<orgName type="university">Université du Havre</orgName>
</affiliation>
</author>
<author>
<name sortKey="Dkhissi, B" sort="Dkhissi, B" uniqKey="Dkhissi B" first="B." last="Dkhissi">B. Dkhissi</name>
<affiliation wicri:level="1">
<hal:affiliation type="laboratory" xml:id="struct-452794" status="VALID">
<orgName>Laboratory of Modeling and Scientific Computing</orgName>
<orgName type="acronym">Faculté des Sciences et techniques de Fès </orgName>
<desc>
<address>
<addrLine>Laboratory of Modeling and Scientific ComputingFaculté des Sciences et techniques de Fès Saiss, Maroc</addrLine>
<country key="MA"></country>
</address>
</desc>
<listRelation>
<relation active="#struct-447007" type="direct"></relation>
</listRelation>
<tutelles>
<tutelle active="#struct-447007" type="direct">
<org type="institution" xml:id="struct-447007" status="VALID">
<orgName>Faculté des sciences</orgName>
<orgName type="acronym">Fès</orgName>
<desc>
<address>
<addrLine>Faculté des sciences, Fès, Maroc </addrLine>
<country key="MA"></country>
</address>
<ref type="url">http://www.fsdmfes.ac.ma/contact.php</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>Maroc</country>
</affiliation>
</author>
<author>
<name sortKey="El Hilali Alaoui, A" sort="El Hilali Alaoui, A" uniqKey="El Hilali Alaoui A" first="A." last="El Hilali Alaoui">A. El Hilali Alaoui</name>
<affiliation wicri:level="1">
<hal:affiliation type="laboratory" xml:id="struct-452794" status="VALID">
<orgName>Laboratory of Modeling and Scientific Computing</orgName>
<orgName type="acronym">Faculté des Sciences et techniques de Fès </orgName>
<desc>
<address>
<addrLine>Laboratory of Modeling and Scientific ComputingFaculté des Sciences et techniques de Fès Saiss, Maroc</addrLine>
<country key="MA"></country>
</address>
</desc>
<listRelation>
<relation active="#struct-447007" type="direct"></relation>
</listRelation>
<tutelles>
<tutelle active="#struct-447007" type="direct">
<org type="institution" xml:id="struct-447007" status="VALID">
<orgName>Faculté des sciences</orgName>
<orgName type="acronym">Fès</orgName>
<desc>
<address>
<addrLine>Faculté des sciences, Fès, Maroc </addrLine>
<country key="MA"></country>
</address>
<ref type="url">http://www.fsdmfes.ac.ma/contact.php</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>Maroc</country>
</affiliation>
</author>
</analytic>
<series>
<title level="j">Revue Africaine de la Recherche en Informatique et Mathématiques Appliquées</title>
<idno type="ISSN">1638-5713</idno>
<imprint>
<date type="datePub">2010</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc>
<textClass>
<keywords scheme="mix" xml:lang="en">
<term> ant colony algorithm</term>
<term> complete local search with memory</term>
<term>exam timetabling problem</term>
</keywords>
<keywords scheme="mix" xml:lang="fr">
<term>algorithme de colonie de fourmis</term>
<term>problème de planification horaire des examens</term>
<term>recherche locale complète avec mémoire</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front>
<div type="abstract" xml:lang="en">Due to increased student numbers and regulation changes educational institutions that allow for greater flexibility, operations researchers and computer scientists have renewed their interest in developing effective methods to resolve the examination timetabling problem. Thus, in the intervening decades, important progress was made in the examination timetabling problem with appearance of adaptation of meta-heuristics. This paper presents a hybridization of the Ant Colony Algorithm and a Complete Local search with Memory heuristic, in order to maximize as much as possible; the free time between consecutive exams for each student, while respecting the conflict constraints, a student cannot sit more than one exam in the same timeslot.</div>
</front>
</TEI>
<hal api="V3">
<titleStmt>
<title xml:lang="en">A hybrid Ant Colony Algorithm for the exam timetabling problem</title>
<author role="aut">
<persName>
<forename type="first">R.</forename>
<surname>Abounacer</surname>
</persName>
<email></email>
<idno type="halauthor">1308346</idno>
<affiliation ref="#struct-116471"></affiliation>
<affiliation ref="#struct-452794"></affiliation>
</author>
<author role="aut">
<persName>
<forename type="first">J.</forename>
<surname>Boukachour</surname>
</persName>
<email></email>
<idno type="halauthor">1308347</idno>
<affiliation ref="#struct-116471"></affiliation>
</author>
<author role="aut">
<persName>
<forename type="first">B.</forename>
<surname>Dkhissi</surname>
</persName>
<email></email>
<idno type="halauthor">1308348</idno>
<affiliation ref="#struct-452794"></affiliation>
</author>
<author role="aut">
<persName>
<forename type="first">A.</forename>
<surname>El Hilali Alaoui</surname>
</persName>
<email></email>
<idno type="halauthor">1308349</idno>
<affiliation ref="#struct-452794"></affiliation>
</author>
<editor role="depositor">
<persName>
<forename>Coordination</forename>
<surname>Episciences Iam</surname>
</persName>
<email>episciences@inria.fr</email>
</editor>
</titleStmt>
<editionStmt>
<edition n="v1" type="current">
<date type="whenSubmitted">2016-03-11 11:36:47</date>
<date type="whenModified">2016-04-19 16:12:48</date>
<date type="whenReleased">2016-03-16 14:15:34</date>
<date type="whenProduced">2010</date>
<date type="whenEndEmbargoed">2016-03-11</date>
<ref type="file" target="https://hal.inria.fr/hal-01286691/document">
<date notBefore="2016-03-11"></date>
</ref>
<ref type="file" subtype="greenPublisher" n="1" target="https://hal.inria.fr/hal-01286691/file/Vol.12.pp.15-42.pdf">
<date notBefore="2016-03-11"></date>
</ref>
</edition>
<respStmt>
<resp>contributor</resp>
<name key="201264">
<persName>
<forename>Coordination</forename>
<surname>Episciences Iam</surname>
</persName>
<email>episciences@inria.fr</email>
</name>
</respStmt>
</editionStmt>
<publicationStmt>
<distributor>CCSD</distributor>
<idno type="halId">hal-01286691</idno>
<idno type="halUri">https://hal.inria.fr/hal-01286691</idno>
<idno type="halBibtex">abounacer:hal-01286691</idno>
<idno type="halRefHtml">Revue Africaine de la Recherche en Informatique et Mathématiques Appliquées, INRIA, 2010, 12, pp.15-42</idno>
<idno type="halRef">Revue Africaine de la Recherche en Informatique et Mathématiques Appliquées, INRIA, 2010, 12, pp.15-42</idno>
</publicationStmt>
<seriesStmt>
<idno type="stamp" n="UNIV-LEHAVRE">Université du Havre</idno>
<idno type="stamp" n="INSMI">CNRS-INSMI - INstitut des Sciences Mathématiques et de leurs Interactions</idno>
<idno type="stamp" n="COMUE-NORMANDIE">Normandie Université</idno>
<idno type="stamp" n="ARIMA">ARIMA</idno>
</seriesStmt>
<notesStmt>
<note type="audience" n="2">International</note>
<note type="popular" n="0">No</note>
<note type="peer" n="1">Yes</note>
</notesStmt>
<sourceDesc>
<biblStruct>
<analytic>
<title xml:lang="en">A hybrid Ant Colony Algorithm for the exam timetabling problem</title>
<author role="aut">
<persName>
<forename type="first">R.</forename>
<surname>Abounacer</surname>
</persName>
<idno type="halAuthorId">1308346</idno>
<affiliation ref="#struct-116471"></affiliation>
<affiliation ref="#struct-452794"></affiliation>
</author>
<author role="aut">
<persName>
<forename type="first">J.</forename>
<surname>Boukachour</surname>
</persName>
<idno type="halAuthorId">1308347</idno>
<affiliation ref="#struct-116471"></affiliation>
</author>
<author role="aut">
<persName>
<forename type="first">B.</forename>
<surname>Dkhissi</surname>
</persName>
<idno type="halAuthorId">1308348</idno>
<affiliation ref="#struct-452794"></affiliation>
</author>
<author role="aut">
<persName>
<forename type="first">A.</forename>
<surname>El Hilali Alaoui</surname>
</persName>
<idno type="halAuthorId">1308349</idno>
<affiliation ref="#struct-452794"></affiliation>
</author>
</analytic>
<monogr>
<idno type="halJournalId" status="VALID">62852</idno>
<idno type="issn">1638-5713</idno>
<title level="j">Revue Africaine de la Recherche en Informatique et Mathématiques Appliquées</title>
<imprint>
<publisher>INRIA</publisher>
<biblScope unit="volume">12</biblScope>
<biblScope unit="pp">15-42</biblScope>
<date type="datePub">2010</date>
</imprint>
</monogr>
</biblStruct>
</sourceDesc>
<profileDesc>
<langUsage>
<language ident="en">English</language>
</langUsage>
<textClass>
<keywords scheme="author">
<term xml:lang="en">exam timetabling problem</term>
<term xml:lang="en"> ant colony algorithm</term>
<term xml:lang="en"> complete local search with memory</term>
<term xml:lang="fr">problème de planification horaire des examens</term>
<term xml:lang="fr">algorithme de colonie de fourmis</term>
<term xml:lang="fr">recherche locale complète avec mémoire</term>
</keywords>
<classCode scheme="halDomain" n="info">Computer Science [cs]</classCode>
<classCode scheme="halDomain" n="math">Mathematics [math]</classCode>
<classCode scheme="halTypology" n="ART">Journal articles</classCode>
</textClass>
<abstract xml:lang="en">Due to increased student numbers and regulation changes educational institutions that allow for greater flexibility, operations researchers and computer scientists have renewed their interest in developing effective methods to resolve the examination timetabling problem. Thus, in the intervening decades, important progress was made in the examination timetabling problem with appearance of adaptation of meta-heuristics. This paper presents a hybridization of the Ant Colony Algorithm and a Complete Local search with Memory heuristic, in order to maximize as much as possible; the free time between consecutive exams for each student, while respecting the conflict constraints, a student cannot sit more than one exam in the same timeslot.</abstract>
<abstract xml:lang="fr">Vue l’augmentation du nombre d’étudiants dans les établissements scolaires et universitaires, le nombre d’examens à passer par chaque étudiant et les réformes pédagogiques actuelles, les planifications classiques des cours et des examens ne sont plus suffisantes, ce qui a amené les chercheurs opérationnels et les informaticiens à chercher des nouvelles méthodes pour résoudre le problème d’emploi du temps des examens. Notre travail consiste à planifier les examens de telle sorte à maximiser le temps de séparation entre deux examens consécutifs pour chaque étudiant et ceci en utilisant l’algorithme de colonies de fourmis hybridé avec une technique de recherche locale.</abstract>
</profileDesc>
</hal>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/France/explor/LeHavreV1/Data/Hal/Checkpoint
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000476 | SxmlIndent | more

Ou

HfdSelect -h $EXPLOR_AREA/Data/Hal/Checkpoint/biblio.hfd -nk 000476 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/France
   |area=    LeHavreV1
   |flux=    Hal
   |étape=   Checkpoint
   |type=    RBID
   |clé=     Hal:hal-01286691
   |texte=   A hybrid Ant Colony Algorithm for the exam timetabling problem
}}

Wicri

This area was generated with Dilib version V0.6.25.
Data generation: Sat Dec 3 14:37:02 2016. Site generation: Tue Mar 5 08:25:07 2024