Move acceptance in local search metaheuristics for cross-domain search

QR Code

Move acceptance in local search metaheuristics for cross-domain search

Metaheuristics provide high-level instructions for designing heuristic optimisation algorithms and have been successfully applied to a range of computationally hard real-world problems. Local search metaheuristics operate under a single-point based search framework with the goal of iteratively impro...

Full description

Bibliographic Details
Main Authors:	Jackson, Warren G., Özcan, Ender, John, Robert I.
Format:	Article
Published:	Elsevier 2018
Subjects:	Combinatorial Optimization Parameter Control Stochastic Local Search Trajectory Methods Search Algorithms
Online Access:	https://eprints.nottingham.ac.uk/51615/

Similar Items

Move Acceptance in Local Search Metaheuristics for Cross-domain Heuristic Search
by: Jackson, Warren G
Published: (2021)

Tuning a Simulated Annealing metaheuristic for cross-domain search
by: Jackson, Warren G., et al.
Published: (2017)

Parameter tuning for cross-domain search
by: Gumus, Duriye Betul
Published: (2020)

A stochastic local search algorithm with adaptive acceptance for high-school timetabling
by: Kheiri, Ahmed, et al.
Published: (2014)

Evolutionary squeaky wheel optimization: a new framework for analysis
by: Li, Jingpeng, et al.
Published: (2011)

Improved local search approaches to solve the post enrolment course timetabling problem
by: Goh, Say Leng, et al.
Published: (2017)

An adaptive evolutionary multi-objective approach based on simulated annealing
by: Li, Hui, et al.
Published: (2011)

An investigation of Monte Carlo tree search and local search for course timetabling problems
by: Goh, Say Leng
Published: (2017)

Optimization of fed-batch fermentation processes using the Backtracking Search Algorithm
by: Zain, Mohamad Zihin bin Mohd, et al.
Published: (2017)

An Estimation of Distribution Algorithm with Intelligent Local Search for Rule-based Nurse Rostering
by: Aickelin, Uwe, et al.
Published: (2007)

An Estimation of Distribution Algorithm with Intelligent Local Search for Rule-based Nurse Rostering
by: Aickelin, Uwe, et al.
Published: (2007)

Iterated local search using an add and delete hyper- heuristic for university course timetabling
by: Soria-Alcaraz, Jorge A., et al.
Published: (2016)

A case study of controlling crossover in a selection hyper-heuristic framework using the multidimensional knapsack problem
by: Drake, John H., et al.
Published: (2015)

A hybrid combinatorial approach to a two-stage stochastic portfolio optimization model with uncertain asset prices
by: Cui, Tianxiang, et al.
Published: (2020)

A survey in semantic search technologies
by: Dong, Hai, et al.
Published: (2008)

Search literacy: learning to search to learn
by: Wilson, Max L., et al.
Published: (2016)

A time predefined variable depth search for nurse rostering
by: Burke, Edmund, et al.
Published: (2013)

Evolutionary local search for solving the office space allocation problem
by: Ulker, Ozgur, et al.
Published: (2012)

Metaheuristic and Multiobjective Approaches for Space Allocation
by: Landa Silva, Jesus Dario
Published: (2003)

Optimised Crossover Genetic Algorithms for Combinatorial Optimisation Problems
by: Nazif, Habibeh
Published: (2010)

Optimization Of Two-Dimensional Dual Beam Scanning System Using Genetic Algorithms
by: Koh, Johnny Siaw Paw
Published: (2008)

Fuzzy genetic algorithms for combinatorial optimisation problems
by: Varnamkhasti, Mohammad Jalali
Published: (2012)

A two-stage stochastic mixed-integer program modelling and hybrid solution approach to portfolio selection problems
by: He, Fang, et al.
Published: (2014)

Search with evolutionary ruin and stochastic rebuild: a theoretic framework and a case study on exam timetabling
by: Li, Jingpeng, et al.
Published: (2014)

A multi-agent based cooperative approach to scheduling and routing
by: Martin, Simon, et al.
Published: (2016)

Fuzzy adaptive parameter control of a late acceptance hyper-heuristic
by: Jackson, Warren G., et al.
Published: (2014)

Exploring opportunities to facilitate serendipity in search
by: Rahman, M. Ataur, et al.
Published: (2015)

Putting the “systematic” into searching: tips for search strategies in systematic reviews
by: Grindlay, Douglas John Charles, et al.
Published: (2018)

A Tabu Search hyper-heuristic strategy for t-way test suite generation
by: Zamil, Kamal Z., et al.
Published: (2016)

Validate conference paper using dice coefficient.
by: Anuar, Nurhilyana, et al.
Published: (2010)

Dynamic Memory Allocation for CMAC using Binary Search Trees
by: Scarfe, Peter, et al.
Published: (2007)

A component based heuristic search method with evolutionary eliminations for hospital personnel scheduling
by: Li, Jingpeng, et al.
Published: (2008)

High involvement product information search on the internet among consumers in Yinchuan, China
by: Zhu, Beiyu
Published: (2016)

An investigation of tuning a memetic algorithm for cross-domain search
by: Gumus, Duriye Betul, et al.
Published: (2016)

Peptide refinement using a stochastic search
by: Lewis, Nicole H., et al.
Published: (2018)

New BFGS method for unconstrained optimization problem based on modified Armijo line search
by: Wan, Zhong, et al.
Published: (2012)

A Variable Neighbourhood Search for nurse scheduling with balanced preference satisfaction
by: Constantino, Ademir Aparecido, et al.
Published: (2015)

Visuospatial working memory mediates inhibitory and facilitatory guidance in preview search
by: Barrett, Doug J.K., et al.
Published: (2016)

A simulated annealing based genetic local search algorithm for multi-objective multicast routing problems
by: Xu, Ying, et al.
Published: (2013)

An iterated local search algorithm for the team orienteering problem with variable profits
by: Gunawan, Aldy, et al.
Published: (2018)