The late acceptance hill-climbing heuristic
type: Item
instance of: scholarly article
title: The late acceptance hill-climbing heuristic
zbMATH Open document ID: 1380.90231
author: Yuri Bykov
author: Edmund K. Burke
published in: European Journal of Operational Research
publication date: 2018-02-16T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6839951
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: metaheuristics
zbMATH Keywords: late acceptance hill climbing
zbMATH Keywords: timetabling
zbMATH Keywords: travelling salesman problem
describes a project that uses: Concorde
MaRDI profile type: Publication
full work available at URL: j.ejor.2016.07.012
OpenAlex ID: W2108910404
cites work: An adaptive artificial bee colony and late-acceptance hill-climbing algorithm for examination timetabling
cites work: Applied simulated annealing
cites work: Techniques for Producing School Timetables on a Computer and their Application to other Scheduling Problems
cites work: Q3425132
cites work: An Adaptive Flex-Deluge Approach to University Exam Timetabling
cites work: A step counting hill climbing algorithm applied to university examination timetabling
cites work: Simulated Annealing: Searching for an Optimal Temperature Schedule
cites work: New optimization heuristics. The great deluge algorithm and the record- to-record travel
cites work: Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
cites work: Old Bachelor Acceptance: A New Class of Non-Monotone Threshold Accepting Methods
cites work: Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
cites work: Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
cites work: Q4365133
cites work: Optimization by Simulated Annealing
cites work: A survey of metaheuristic-based techniques for university timetabling problems
cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem
cites work: Setting the research agenda in automated timetabling: the second international timetabling competition
cites work: Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
cites work: A survey of search methodologies and automated system development for examination timetabling
cites work: Adaptive memory programming: a unified view of metaheuristics
DOI: 10.1016/J.EJOR.2016.07.012
description: scientific article; zbMATH DE number 6839951