Hyperheuristics

swMATH424MaRDI QIDQ13184FDOQ13184

Author name not available (Why is that?)

Cited In (only showing first 100 items - show all)

• Search with evolutionary ruin and stochastic rebuild: a theoretic framework and a case study on exam timetabling
• Hyper-Heuristics: An Emerging Direction in Modern Search Technology
• Investigating Ahuja-Orlin's large neighbourhood search approach for examination timetabling
• Towards a practical engineering tool for rostering
• Generalized hyper-heuristics for solving 2D regular and irregular packing problems
• Title not available (Why is that?)
• A review of hyper-heuristics for educational timetabling
• A stochastic local search algorithm with adaptive acceptance for high-school timetabling
• Fairness in academic course timetabling
• Effective learning hyper-heuristics for the course timetabling problem
• Towards objective measures of algorithm performance across instance space
• Variable neighbourhood search: Methods and applications
• A simulated annealing hyper-heuristic methodology for flexible decision support
• A survey of school timetabling research
• Adaptive selection of heuristics for improving exam timetables
• Variable neighbourhood search: methods and applications
• A survey of search methodologies and automated system development for examination timetabling
• A computational study of a cutting plane algorithm for university course timetabling
• An effective hybrid algorithm for university course timetabling
• Case-based heuristic selection for timetabling problems
• Applying evolutionary computation to the school timetabling problem: The Greek case
• An investigation of fuzzy multiple heuristic orderings in the construction of university examination timetables
• A study of heuristic combinations for hyper-heuristic systems for the uncapacitated examination timetabling problem
• Hybrid variable neighbourhood approaches to university exam timetabling
• A hyper-heuristic for the longest common subsequence problem
• Metaheuristics for solving a multimodal home-healthcare scheduling problem
• Unified encoding for hyper-heuristics with application to bioinformatics
• A step counting hill climbing algorithm applied to university examination timetabling
• A hyper-heuristic approach to sequencing by hybridization of DNA sequences
• Operational research in education
• Memetic techniques for examination timetabling
• Modelling and evaluation issues in nurse rostering
• A simulated annealing with a new neighborhood structure based algorithm for high school timetabling problems
• A simulated annealing based hyperheuristic for determining shipper sizes for storage and transportation
• An iterated multi-stage selection hyper-heuristic
• A column generation approach for solving the examination-timetabling problem
• Exact and heuristic approaches to solve the Internet shopping optimization problem with delivery costs
• A multiobjective framework for heavily constrained examination timetabling problems
• Monte Carlo hyper-heuristics for examination timetabling
• A constructive approach to examination timetabling based on adaptive decomposition and ordering
• A grasp-knapsack hybrid for a nurse-scheduling problem
• A shift sequence based approach for nurse scheduling and a new benchmark dataset
• A hybrid metaheuristic case-based reasoning system for nurse rostering
• A cooperative hyper-heuristic search framework
• Coalition-based metaheuristic: a self-adaptive metaheuristic using reinforcement learning and mimetism
• A tabu search algorithm for the multi-period inspector scheduling problem
• Fast machine reassignment
• Effective patient prioritization in mass casualty incidents using hyperheuristics and the pilot method
• Finding good nurse duty schedules: a case study
• Exploring the role of graph spectra in graph coloring algorithm performance
• Discovering the suitability of optimisation algorithms by learning from evolved instances
• Self-adaptive learning based particle swarm optimization
• A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times
• Measuring instance difficulty for combinatorial optimization problems
• Generating meta-heuristic optimization code using ADATE
• A new dispatching rule based genetic algorithm for the multi-objective job shop problem
• DVRP: a hard dynamic combinatorial optimisation problem tackled by an evolutionary hyper-heuristic
• Adaptive linear combination of heuristic orderings in constructing examination timetables
• An adaptive guidance approach for the heuristic solution of a minimum multiple trip vehicle routing problem
• The examination timetabling problem at Universiti Malaysia Pahang: comparison of a constructive heuristic with an existing software solution
• A multi-objective evolutionary algorithm for examination timetabling
• Classification of applied methods of combinatorial optimization
• A graph-based hyper-heuristic for educational timetabling problems
• A survey of metaheuristic-based techniques for university timetabling problems
• A harmony search algorithm for university course timetabling
• A new model for automated examination timetabling
• Local search neighbourhoods for dealing with a novel nurse rostering model
• Evolutionary Computation in Combinatorial Optimization
• Memetic algorithms and hyperheuristics applied to a multiobjectivised two-dimensional packing problem
• GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem
• A review on algorithms for maximum clique problems
• A decomposed metaheuristic approach for a real-world university timetabling problem
• Decomposition-based algorithms for the crew scheduling and routing problem in road restoration
• Selecting and weighting features using a genetic algorithm in a case-based reasoning approach to personnel rostering
• Hyper-heuristic approaches for the response time variability problem
• A university-timetabling problem and its solution using Benders' partitioning---a case study
• Practices in timetabling in higher education institutions: a systematic review
• An Adaptive Flex-Deluge Approach to University Exam Timetabling
• An Artificial Bee Colony Based Hyper-heuristic for the Single Machine Order Acceptance and Scheduling Problem
• New feature selection paradigm based on hyper-heuristic technique
• Evolution of new algorithms for the binary knapsack problem
• Improving paper spread in examination timetables using integer programming
• Advancing Shannon entropy for measuring diversity in systems
• Dynamics of local search trajectory in traveling salesman problem
• Evolutionary hybrid approaches for generation scheduling in power systems
• A (0-1) goal programming model for scheduling the tour of a marketing executive
• A deep reinforcement learning based hyper-heuristic for combinatorial optimisation with uncertainties
• Two multi-start heuristics for the \(k\)-traveling salesman problem
• Combining metaheuristics with mathematical programming, constraint programming and machine learning
• Dynamic optimisation of preventative and corrective maintenance schedules for a large scale urban drainage system
• A methodology for determining an effective subset of heuristics in selection hyper-heuristics
• Markov chain methods for the bipartite Boolean quadratic programming problem
• Solving urban transit route design problem using selection hyper-heuristics
• Comments on: ``An overview of curriculum-based course timetabling
• A new model and a hyper-heuristic approach for two-dimensional shelf space allocation
• Evolutionary hyperheuristics for location-routing problem with simultaneous pickup and delivery
• The Gestalt heuristic: emerging abstraction to improve combinatorial search
• An ensemble algorithm with self-adaptive learning techniques for high-dimensional numerical optimization
• Recent advances in selection hyper-heuristics
• A guide-and-observe hyper-heuristic approach to the Eternity II puzzle

This page was built for software: Hyperheuristics