Monte Carlo hyper-heuristics for examination timetabling (Q1761797): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10479-010-0782-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1969577093 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu-based large neighbourhood search methodology for the capacitated examination timetabling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid heuristics for examination timetabling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Final examination scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving examination timetabling problems through adaption of heuristic orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent research directions in automated timetabling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hyper-Heuristics: An Emerging Direction in Modern Search Technology / rank
 
Normal rank
Property / cites work
 
Property / cites work: A graph-based hyper-heuristic for educational timetabling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Novel Local-Search-Based Approaches to University Examination Timetabling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: The preparation of examination time-tables using a small-store computer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2779809 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4472016 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ant colony optimization for the examination scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simulated annealing based hyperheuristic for determining shipper sizes for storage and transportation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Timetable and Multicommodity Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2779804 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved multi-staged algorithmic process for~the~solution of the examination timetabling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692508 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A study on the use of ``self-generation'' in memetic algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A graph coloring algorithm for large scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of an annealing algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Setting the Research Agenda in Automated Timetabling: The Second International Timetabling Competition / rank
 
Normal rank
Property / cites work
 
Property / cites work: ITC2007 solver description: a hybrid approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of search methodologies and automated system development for examination timetabling / rank
 
Normal rank

Latest revision as of 22:00, 5 July 2024

scientific article
Language Label Description Also known as
English
Monte Carlo hyper-heuristics for examination timetabling
scientific article

    Statements

    Monte Carlo hyper-heuristics for examination timetabling (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    15 November 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    hyper-heuristics
    0 references
    simulated annealing
    0 references
    meta-heuristics
    0 references
    examination timetabling
    0 references
    reinforcement learning
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references