The late acceptance hill-climbing heuristic

DOI10.1016/j.ejor.2016.07.012zbMath1380.90231OpenAlexW2108910404MaRDI QIDQ1698884

Yuri Bykov, Edmund Kieran Burke

Publication date: 16 February 2018

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2016.07.012

zbMATH Keywords

combinatorial optimizationmetaheuristicstimetablingtravelling salesman problemlate acceptance hill climbing

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (22)

A goal-driven ruin and recreate heuristic for the 2D variable-sized bin packing problem with guillotine constraints ⋮ Late acceptance hill-climbing for high school timetabling ⋮ A step counting hill climbing algorithm applied to university examination timetabling ⋮ Design of automated negotiation mechanisms for decentralized heterogeneous machine scheduling ⋮ Simulated annealing for the machine reassignment problem ⋮ Large-scale vehicle routing problems: quantum annealing, tunings and results ⋮ Stochastic local search with learning automaton for the swap-body vehicle routing problem ⋮ Multi-machine energy-aware scheduling ⋮ A study on the pickup and delivery problem with time windows: matheuristics and new instances ⋮ Recent advances in selection hyper-heuristics ⋮ A cutoff time strategy based on the coupon collector's problem ⋮ The vessel swap-body routing problem ⋮ Ride sharing with flexible participants: a metaheuristic approach for large‐scale problems ⋮ Analysis of stochastic local search methods for the unrelated parallel machine scheduling problem ⋮ Expansion-based hill-climbing ⋮ Educational timetabling: problems, benchmarks, and state-of-the-art results ⋮ The late acceptance hill-climbing heuristic ⋮ Revisiting simulated annealing: a component-based analysis ⋮ Lower bounds and compact mathematical formulations for spacing soft constraints for university examination timetabling problems ⋮ The berth allocation problem in terminals with irregular layouts ⋮ A robust location-arc routing problem under uncertainty: mathematical model with lower and upper bounds ⋮ Scheduling for multi-robot routing with blocking and enabling constraints

Uses Software

• Concorde

Cites Work

• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• A step counting hill climbing algorithm applied to university examination timetabling
• An adaptive artificial bee colony and late-acceptance hill-climbing algorithm for examination timetabling
• A survey of search methodologies and automated system development for examination timetabling
• Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
• New optimization heuristics. The great deluge algorithm and the record- to-record travel
• Applied simulated annealing
• The late acceptance hill-climbing heuristic
• Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
• A survey of metaheuristic-based techniques for university timetabling problems
• Setting the Research Agenda in Automated Timetabling: The Second International Timetabling Competition
• An Adaptive Flex-Deluge Approach to University Exam Timetabling
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
• Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
• Simulated Annealing: Searching for an Optimal Temperature Schedule
• Old Bachelor Acceptance: A New Class of Non-Monotone Threshold Accepting Methods
• Techniques for Producing School Timetables on a Computer and their Application to other Scheduling Problems
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Adaptive memory programming: a unified view of metaheuristics

This page was built for publication: The late acceptance hill-climbing heuristic