Results 11 to 20 of about 9,166,026 (293)
Constraint-based local search for container freight rail scheduling [PDF]
, 2005 A traditional container rail service is based on regular timetables. This causes a risk that some customers may turn away if their preferred itinerary is not attainable and the take-up of some services in a fixed schedule may be low and therefore not ...
Indra-Payoong, Nakorn
core +6 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
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
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
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
Computers & Operations Research, 1998 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
R.J.M. Vaessens +2 more
openaire +3 more sources
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
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
Promet (Zagreb), 2019 Providing a satisfying delivery service is an important way to maintain the customers’ loyalty and further expand profits for manufacturers and logistics providers.
Manman Li, Jian Lu, Wenxin Ma
doaj +1 more source