Results 11 to 20 of about 7,662,913 (346)
Stagnation Detection with Randomized Local Search* [PDF]
Evolutionary Computation, 2021 Recently a mechanism called stagnation detection was proposed that automatically adjusts the mutation rate of evolutionary algorithms when they encounter local optima.
A. Rajabi, C. Witt
semanticscholar +1 more source
Axioms, 2023 The university course timetable problem (UCTP) is known to be NP-hard, with solution complexity growing exponentially with the problem size. This paper introduces an algorithm that effectively tackles UCTPs by employing a combination of exploration and ...
Rakesh P. Badoni +8 more
doaj +1 more source
NLocalSAT: Boosting Local Search with Solution Prediction [PDF]
International Joint Conference on Artificial Intelligence, 2020 The Boolean satisfiability problem (SAT) is a famous NP-complete problem in computer science. An effective way for solving a satisfiable SAT problem is the stochastic local search (SLS). However, in this method, the initialization is assigned in a random
Wenjie Zhang +6 more
semanticscholar +1 more source
R-tree data structure implementation for Computer Aided Engineering (CAE) tools
International Journal for Simulation and Multidisciplinary Design Optimization, 2021 Searching and handling geometric data are basic requirements of any Computer Aided Engineering application (CAE). Spatial search and local search has greater importance in CAD and CAE applications for reducing the model preparation time.
Shelar Vaibhav +2 more
doaj +1 more source
Local Search is a Remarkably Strong Baseline for Neural Architecture Search [PDF]
International Conference on Evolutionary Multi-Criterion Optimization, 2020 Neural Architecture Search (NAS), i.e., the automation of neural network design, has gained much popularity in recent years with increasingly complex search algorithms being proposed. Yet, solid comparisons with simple baselines are often missing. At the
T. D. Ottelander +3 more
semanticscholar +1 more source
A time-predefined approach to course timetabling [PDF]
Yugoslav Journal of Operations Research, 2003 A common weakness of local search metaheuristics, such as Simulated Annealing, in solving combinatorial optimization problems, is the necessity of setting a certain number of parameters.
Burke Edmund +3 more
doaj +1 more source
A Hybrid Large Neighborhood Search Algorithm for Solving the Multi Depot UAV Swarm Routing Problem
IEEE Access, 2021 This paper focuses on a modified Multi-Depot Unmanned Aerial Vehicle Routing Problem (MMDUAVRP). Comparing to classic multi-depot vehicle routing problem, our studied problem has no constraints to restrict the depot where the Unmanned Aerial Vehicle (UAV)
Xiaohui Li +4 more
doaj +1 more source
Applied Sciences, 2021 The COVID-19 pandemic has challenged all physical interactions. Social distancing, face masks and other rules have reshaped our way of living during the last year.
Rubén Ferrero-Guillén +3 more
doaj +1 more source
Energies, 2021 The use of parallel applications in High-Performance Computing (HPC) demands high computing times and energy resources. Inadequate scheduling produces longer computing times which, in turn, increases energy consumption and monetary cost.
Alejandro Santiago +7 more
doaj +1 more source
Mathematics, 2022 This paper addresses a biobjective bus routing problem that pays attention to both the routing cost and the total distance walked by the individuals to reach their assigned pickup point. These two objectives are conflicting.
Herminia I. Calvete +2 more
doaj +1 more source