Name
Abstract | ||
|---|---|---|
Many formats have been d eveloped for r epresenting timetable data instances. The variety of data formats currently in u se makes the c omparison o f r esearch results and exchange of data e xtremely difficult. As many researchers have observed, the need for a standard d ata format for timetabling instances is now becoming urgent, so as to allow the sharing of data and testing of algorithms on standard b enchmarks. At present t his is not possible in research on timetable construction. In this paper we state the general requirements of a standard d ata format and present a standard data format and language for use in the evaluation of timetable instances. |
Year | DOI | Venue |
|---|---|---|
1997 | 10.1007/BFb0055891 | PATAT |
Keywords | Field | DocType |
timetabling instances,standard data format | Data mining,Data format,Information retrieval,Computer science,Travelling salesman problem,Schedule | Conference |
Volume | ISSN | ISBN |
1408 | 0302-9743 | 3-540-64979-4 |
Citations | PageRank | References |
11 | 0.91 | 4 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Edmund K. Burke | 1 | 5593 | 363.80 |
| Jeffrey H. Kingston | 2 | 336 | 38.79 |
| Paul A. Pepper | 3 | 11 | 0.91 |