SZodixStudyAcademic Library

Shelves Open access

Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated

A Comparison of the Performance of Different Metaheuristics on the Timetabling Problem · Study

WorkA Comparison of the Performance of Different Metaheuristics on the Timetabling Problem

Olivia Rossi-Doria2003

Work2003

A Comparison of the Performance of Different Metaheuristics on the Timetabling Problem

Olivia Rossi-Doria · Michaël Sampels · Mauro Birattari · Marco Chiarandini · Marco Dorigo · Luca Maria Gambardella +6 more

131 citations·0/0 files stored·Lecture notes in computer science

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Scheduling and Timetabling Solutions Metaheuristic Optimization Algorithms Research Constraint Satisfaction and Optimization

Abstract

No abstract was published for this record.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 131 citations exist upstream.

References

1999A Survey of Automated Timetabling 1998Recent developments in practical course timetabling

Cited by

2007A hybrid evolutionary approach to the university course timetabling problem 2010Genetic Algorithms With Guided and Local Search Strategies for University Course Timetabling 2012Solving the post enrolment course timetabling problem by ant colony optimization 2006Applying evolutionary computation to the school timetabling problem: The Greek case 2007A Perspective on Bridging the Gap Between Theory and Practice in University Timetabling 2005The University Course Timetabling Problem with a Three-Phase Approach 2010A hybrid metaheuristic approach to the university course timetabling problem 2007Using a Randomised Iterative Improvement Algorithm with Composite Neighbourhood Structures for the University Course Timetabling Problem

Related works

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

2006Case-based heuristic selection for timetabling problemsarticle · 2 shared references 2009Setting the Research Agenda in Automated Timetabling: The Second International Timetabling Competitionarticle · 2 shared references 2006An effective hybrid algorithm for university course timetablingarticle · 2 shared references 2013A survey of school timetabling researcharticle · 2 shared references 2008Hybridizations within a graph-based hyper-heuristic framework for university timetabling problemsarticle · 2 shared references 2008Generating University Course Timetable Using Genetic Algorithms and Local Searchother · 2 shared references

Details

Year2003

Typeother

Published2003-01-01

VenueLecture notes in computer science

ISSN-L0302-9743

Languageen

Citations131

Files0 public / 0

ShelfScheduling and Timetabling Solutions

Identifiers

doi10.1007/978-3-540-45157-0_22

openalex_workW1532406186

Links

Imported from OpenAlex (CC0) — nothing here is generated.