A computational study of local search algorithms for Italian high-school timetabling
In this paper we report on a computational experience with a local search algorithm for High-school Timetabling Problems. The timetable has to satisfy "hard" requirements, that are mandatory, and should minimize the violation of "soft" constraints. In our approach, we combine Sim...
Gespeichert in:
| Veröffentlicht in: | Journal of heuristics 2007-12, Vol.13 (6), p.543-556 |
|---|---|
| Hauptverfasser: | , , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 556 |
|---|---|
| container_issue | 6 |
| container_start_page | 543 |
| container_title | Journal of heuristics |
| container_volume | 13 |
| creator | Avella, Pasquale D’Auria, Bernardo Salerno, Saverio Vasil’ev, Igor |
| description | In this paper we report on a computational experience with a local search algorithm for High-school Timetabling Problems. The timetable has to satisfy "hard" requirements, that are mandatory, and should minimize the violation of "soft" constraints. In our approach, we combine Simulated Annealing with a Very Large-Scale Neighborhood search where the neighborhood is explored by solving an Integer Programming problem. We report on a computational experience validating the usefulness of the proposed approach. [PUBLICATION ABSTRACT] |
| doi_str_mv | 10.1007/s10732-007-9025-3 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_199265063</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1380144231</sourcerecordid><originalsourceid>FETCH-LOGICAL-c272t-c39b53df2aff195de776fd872d17d20c78d5d7f96b1f852dc6dacccbaad334fa3</originalsourceid><addsrcrecordid>eNotkE1LAzEURYMoWKs_wF1wH82HmUyWpagtFNzUdXiTTDopM01NMov-e2eoq3ceXC7cg9Azo6-MUvWWGVWCkwmJplwScYMWTCpOtNDqdmJRM8K4YPfoIecjpVTXUizQfoVtHM5jgRLiCXqcy-guOHrcRzu_LSTbYegPMYXSDRn7mPC2QB_ghLtw6Ei2XYw9LmFoCzR9OB0e0Z2HPrdP_3eJfj4_9usN2X1_bderHbFc8UKs0I0UznPwnmnpWqUq72rFHVOOU6tqJ53yumqYryV3tnJgrW0AnBDvHsQSvVx7zyn-jm0u5hjHNK3IhmnNK0krMYXYNWRTzDm13pxTGCBdDKNmdmeu7syMszsjxB97kmO6</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>199265063</pqid></control><display><type>article</type><title>A computational study of local search algorithms for Italian high-school timetabling</title><source>SpringerLink Journals - AutoHoldings</source><creator>Avella, Pasquale ; D’Auria, Bernardo ; Salerno, Saverio ; Vasil’ev, Igor</creator><creatorcontrib>Avella, Pasquale ; D’Auria, Bernardo ; Salerno, Saverio ; Vasil’ev, Igor</creatorcontrib><description>In this paper we report on a computational experience with a local search algorithm for High-school Timetabling Problems. The timetable has to satisfy "hard" requirements, that are mandatory, and should minimize the violation of "soft" constraints. In our approach, we combine Simulated Annealing with a Very Large-Scale Neighborhood search where the neighborhood is explored by solving an Integer Programming problem. We report on a computational experience validating the usefulness of the proposed approach. [PUBLICATION ABSTRACT]</description><identifier>ISSN: 1381-1231</identifier><identifier>EISSN: 1572-9397</identifier><identifier>DOI: 10.1007/s10732-007-9025-3</identifier><language>eng</language><publisher>Boston: Springer Nature B.V</publisher><subject>Algorithms ; Control theory ; Curricula ; Integer programming ; Neighborhoods ; Scheduling algorithms ; Schools ; Studies ; Teachers ; Workloads</subject><ispartof>Journal of heuristics, 2007-12, Vol.13 (6), p.543-556</ispartof><rights>Springer Science+Business Media, LLC 2007</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c272t-c39b53df2aff195de776fd872d17d20c78d5d7f96b1f852dc6dacccbaad334fa3</citedby><cites>FETCH-LOGICAL-c272t-c39b53df2aff195de776fd872d17d20c78d5d7f96b1f852dc6dacccbaad334fa3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,27901,27902</link.rule.ids></links><search><creatorcontrib>Avella, Pasquale</creatorcontrib><creatorcontrib>D’Auria, Bernardo</creatorcontrib><creatorcontrib>Salerno, Saverio</creatorcontrib><creatorcontrib>Vasil’ev, Igor</creatorcontrib><title>A computational study of local search algorithms for Italian high-school timetabling</title><title>Journal of heuristics</title><description>In this paper we report on a computational experience with a local search algorithm for High-school Timetabling Problems. The timetable has to satisfy "hard" requirements, that are mandatory, and should minimize the violation of "soft" constraints. In our approach, we combine Simulated Annealing with a Very Large-Scale Neighborhood search where the neighborhood is explored by solving an Integer Programming problem. We report on a computational experience validating the usefulness of the proposed approach. [PUBLICATION ABSTRACT]</description><subject>Algorithms</subject><subject>Control theory</subject><subject>Curricula</subject><subject>Integer programming</subject><subject>Neighborhoods</subject><subject>Scheduling algorithms</subject><subject>Schools</subject><subject>Studies</subject><subject>Teachers</subject><subject>Workloads</subject><issn>1381-1231</issn><issn>1572-9397</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2007</creationdate><recordtype>article</recordtype><sourceid>BENPR</sourceid><recordid>eNotkE1LAzEURYMoWKs_wF1wH82HmUyWpagtFNzUdXiTTDopM01NMov-e2eoq3ceXC7cg9Azo6-MUvWWGVWCkwmJplwScYMWTCpOtNDqdmJRM8K4YPfoIecjpVTXUizQfoVtHM5jgRLiCXqcy-guOHrcRzu_LSTbYegPMYXSDRn7mPC2QB_ghLtw6Ei2XYw9LmFoCzR9OB0e0Z2HPrdP_3eJfj4_9usN2X1_bderHbFc8UKs0I0UznPwnmnpWqUq72rFHVOOU6tqJ53yumqYryV3tnJgrW0AnBDvHsQSvVx7zyn-jm0u5hjHNK3IhmnNK0krMYXYNWRTzDm13pxTGCBdDKNmdmeu7syMszsjxB97kmO6</recordid><startdate>20071201</startdate><enddate>20071201</enddate><creator>Avella, Pasquale</creator><creator>D’Auria, Bernardo</creator><creator>Salerno, Saverio</creator><creator>Vasil’ev, Igor</creator><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7WY</scope><scope>7WZ</scope><scope>7XB</scope><scope>87Z</scope><scope>8AL</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>8FL</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FRNLG</scope><scope>F~G</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>L.-</scope><scope>M0C</scope><scope>M0N</scope><scope>P5Z</scope><scope>P62</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PYYUZ</scope><scope>Q9U</scope></search><sort><creationdate>20071201</creationdate><title>A computational study of local search algorithms for Italian high-school timetabling</title><author>Avella, Pasquale ; D’Auria, Bernardo ; Salerno, Saverio ; Vasil’ev, Igor</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c272t-c39b53df2aff195de776fd872d17d20c78d5d7f96b1f852dc6dacccbaad334fa3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2007</creationdate><topic>Algorithms</topic><topic>Control theory</topic><topic>Curricula</topic><topic>Integer programming</topic><topic>Neighborhoods</topic><topic>Scheduling algorithms</topic><topic>Schools</topic><topic>Studies</topic><topic>Teachers</topic><topic>Workloads</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Avella, Pasquale</creatorcontrib><creatorcontrib>D’Auria, Bernardo</creatorcontrib><creatorcontrib>Salerno, Saverio</creatorcontrib><creatorcontrib>Vasil’ev, Igor</creatorcontrib><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>ABI/INFORM Collection</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Global (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>Business Premium Collection (Alumni)</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>Computer Science Database</collection><collection>ABI/INFORM Professional Advanced</collection><collection>ABI/INFORM Global</collection><collection>Computing Database</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>ProQuest One Business</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ABI/INFORM Collection China</collection><collection>ProQuest Central Basic</collection><jtitle>Journal of heuristics</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Avella, Pasquale</au><au>D’Auria, Bernardo</au><au>Salerno, Saverio</au><au>Vasil’ev, Igor</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A computational study of local search algorithms for Italian high-school timetabling</atitle><jtitle>Journal of heuristics</jtitle><date>2007-12-01</date><risdate>2007</risdate><volume>13</volume><issue>6</issue><spage>543</spage><epage>556</epage><pages>543-556</pages><issn>1381-1231</issn><eissn>1572-9397</eissn><abstract>In this paper we report on a computational experience with a local search algorithm for High-school Timetabling Problems. The timetable has to satisfy "hard" requirements, that are mandatory, and should minimize the violation of "soft" constraints. In our approach, we combine Simulated Annealing with a Very Large-Scale Neighborhood search where the neighborhood is explored by solving an Integer Programming problem. We report on a computational experience validating the usefulness of the proposed approach. [PUBLICATION ABSTRACT]</abstract><cop>Boston</cop><pub>Springer Nature B.V</pub><doi>10.1007/s10732-007-9025-3</doi><tpages>14</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1381-1231 |
| ispartof | Journal of heuristics, 2007-12, Vol.13 (6), p.543-556 |
| issn | 1381-1231 1572-9397 |
| language | eng |
| recordid | cdi_proquest_journals_199265063 |
| source | SpringerLink Journals - AutoHoldings |
| subjects | Algorithms Control theory Curricula Integer programming Neighborhoods Scheduling algorithms Schools Studies Teachers Workloads |
| title | A computational study of local search algorithms for Italian high-school timetabling |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-03T16%3A43%3A22IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20computational%20study%20of%20local%20search%20algorithms%20for%20Italian%20high-school%20timetabling&rft.jtitle=Journal%20of%20heuristics&rft.au=Avella,%20Pasquale&rft.date=2007-12-01&rft.volume=13&rft.issue=6&rft.spage=543&rft.epage=556&rft.pages=543-556&rft.issn=1381-1231&rft.eissn=1572-9397&rft_id=info:doi/10.1007/s10732-007-9025-3&rft_dat=%3Cproquest_cross%3E1380144231%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=199265063&rft_id=info:pmid/&rfr_iscdi=true |