Results 21 to 30 of about 3,752,335 (283)
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
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
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
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
The probabilistic heuristic in local (PHIL) search meta-strategy [PDF]
, 2005 Local search, in either best or first admissible form, generally suffers from poor solution qualities as search cannot be continued beyond locally optimal points. Even multiple start local search strategies can suffer this problem.
A. Ernst +10 more
core +1 more source
Guarding terrains via local search
Journal of Computational Geometry, 2014 We obtain a polynomial time approximation scheme for the terrain guarding problem improving upon several recent constant factor approximations. Our algorithm is a local search algorithm inspired by the recent results of Chan and Har-Peled (SoCG 2009) and
Erik Krohn +3 more
doaj +1 more source
Anytime Pareto local search [PDF]
European Journal of Operational Research, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dubois-Lacoste, Jérémie +2 more
openaire +4 more sources
International Journal of Computational Intelligence Systems, 2021 This paper proposes a hybrid approach for solving data clustering problems. This hybrid approach used one of the swarm intelligence algorithms (SIAs): grasshopper optimization algorithm (GOA) due to its robustness and effectiveness in solving ...
M. A. El-Shorbagy, A. Y. Ayoub
doaj +1 more source
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