Results 1 to 10 of about 657,946 (259)
Quantum-Walk-Inspired Dynamic Adiabatic Local Search [PDF]
Entropy, 2023 We investigate the irreconcilability issue that arises when translating the search algorithm from the Continuous Time Quantum Walk (CTQW) framework to the Adiabatic Quantum Computing (AQC) framework.
Chen-Fu Chiang, Paul M. Alsing
doaj +2 more sources
Improved Local Search with Momentum for Bayesian Networks Structure Learning [PDF]
Entropy, 2021 Bayesian Networks structure learning (BNSL) is a troublesome problem that aims to search for an optimal structure. An exact search tends to sacrifice a significant amount of time and memory to promote accuracy, while the local search can tackle complex ...
Xiaohan Liu +3 more
doaj +2 more sources
A Modified Genetic Algorithm with Local Search Strategies and Multi-Crossover Operator for Job Shop Scheduling Problem [PDF]
Sensors, 2020 It is not uncommon for today’s problems to fall within the scope of the well-known class of NP-Hard problems. These problems generally do not have an analytical solution, and it is necessary to use meta-heuristics to solve them.
Monique Simplicio Viana +2 more
doaj +2 more sources
Initial Solution Generation and Diversified Variable Picking in Local Search for (Weighted) Partial MaxSAT [PDF]
Entropy, 2022 The (weighted) partial maximum satisfiability ((W)PMS) problem is an important generalization of the classic problem of propositional (Boolean) satisfiability with a wide range of real-world applications. In this paper, we propose an initialization and a
Zaijun Zhang +4 more
doaj +2 more sources
Multi-directional local search.
Comput Oper Res, 2012 This paper introduces multi-directional local search, a metaheuristic for multi-objective optimization. We first motivate the method and present an algorithmic framework for it. We then apply it to several known multi-objective problems such as the multi-objective multi-dimensional knapsack problem, the bi-objective set packing problem and the bi ...
Tricoire F.
europepmc +5 more sources
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
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
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