Results 11 to 20 of about 794,304 (306)
Complete Local Search with Memory
Journal of Heuristics, 2002 Neighborhood search heuristics like local search and its variants are some of the most popular approaches to solve discrete optimization problems of moderate to large size. Apart from tabu search, most of these heuristics are memoryless. In this paper we introduce a new neighborhood search heuristic that makes effective use of memory structures in a ...
Diptesh Ghosh, Gerard Sierksma
openaire +6 more sources
Computers & Operations Research, 1998 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
R.J.M. Vaessens +2 more
openaire +3 more sources
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
Genetic algorithms with guided and local search strategies for university course timetabling [PDF]
, 2011 This article is posted here with permission from the IEEE - Copyright @ 2011 IEEEThe university course timetabling problem (UCTP) is a combinatorial optimization problem, in which a set of events has to be scheduled into time slots and located into ...
Yang, S, Jat, SN, Yang, Shengxiang
core +2 more sources
BLENDER: Enabling Local Search with a Hybrid Differential Privacy Model
The Journal of Privacy and Confidentiality, 2019 We propose a hybrid model of differential privacy that considers a combination of regular and opt-in users who desire the differential privacy guarantees of the local privacy model and the trusted curator model, respectively.
Brendan Avent +4 more
doaj +1 more source
Achieving optimal illumination conditions using local search [PDF]
, 2015 In this research we attempt to achieve optimal illumination conditions in enclosed spaces that contain multiple illumination devices using local search algorithms.
Sioutis, Marios +5 more
core +1 more source
Multi–dimensional firefly algorithm based on local search for solving unit commitment problem
Frontiers in Energy Research, 2023 The Unit Commitment problem (UC) is a complex mixed-integer nonlinear programming problem, so the main challenge faced by many researchers is obtaining the optimal solution.
Yude Yang, Yuan Feng, Lizhen Yang
doaj +1 more source
New Heuristic Local Search Method for University Course Timetabling [PDF]
مدیریت نوآوری و راهبردهای عملیاتی, 2023 Purpose: This paper presents a new two-phase method for solving the curriculum-based university course timetabling problem. A new metaheuristic approach is used in both phases of the new present method.Methodology: A feasible, high-quality solution is ...
Mohammad Sadegh Shiri +2 more
doaj +1 more source
Local Search for Unsatisfiability [PDF]
, 2006 Local search is widely applied to satisfiable SAT problems, and on some classes outperforms backtrack search. An intriguing challenge posed by Selman, Kautz and McAllester in 1997 is to use it instead to prove unsatisfiability. We investigate two distinct approaches.
Steven D. Prestwich, Inês Lynce
openaire +1 more source