Results 11 to 20 of about 221,965 (288)
A Variable Neighborhood Search heuristic for rolling stock rescheduling
EURO Journal on Transportation and Logistics, 2021 We present a Variable Neighborhood Search heuristic for the rolling stock rescheduling problem. Rolling stock rescheduling is needed when a disruption leads to cancellations in the timetable.
Rowan Hoogervorst +3 more
doaj +1 more source
Buffer Allocation via Bottleneck-Based Variable Neighborhood Search
Applied Sciences, 2020 This study addresses the challenging problem of efficient buffer allocation in production lines. Suitable locations for buffer allocation are determined to satisfy the desired throughput, while a suitable balance between solution quality and computation ...
Sixiao Gao +5 more
doaj +1 more source
Variable neighborhood search for minimum linear arrangement problem [PDF]
Yugoslav Journal of Operations Research, 2016 The minimum linear arrangement problem is widely used and studied in many practical and theoretical applications. It consists of finding an embedding of the nodes of a graph on the line such that the sum of the resulting edge lengths is ...
Mladenović Nenad +2 more
doaj +1 more source
IEEE Access, 2021 In this paper, an adaptive variable neighborhood search ant colony algorithm (AVNSACA) is proposed to solve the vehicle routing problem with soft time windows (VRPSTW).
Meiling He +3 more
doaj +1 more source
Improved Firefly Algorithm with Variable Neighborhood Search for Data Clustering
مجلة بغداد للعلوم, 2022 Among the metaheuristic algorithms, population-based algorithms are an explorative search algorithm superior to the local search algorithm in terms of exploring the search space to find globally optimal solutions.
Hayder Naser Khraibet Al-Behadili
doaj +1 more source
Adaptive search techniques for problems in vehicle routing, part II: A numerical comparison [PDF]
Yugoslav Journal of Operations Research, 2015 Research in the field of vehicle routing often focused on finding new ideas and concepts in the development of fast and efficient algorithms for an improved solution process. Early studies introduce static tailor-made strategies, but trends show
Kritzinger Stefanie +3 more
doaj +1 more source
On Neighborhood Tree Search [PDF]
, 2012 We consider the neighborhood tree induced by alternating the use of different neighborhood structures within a local search descent. We investigate the issue of designing a search strategy operating at the neighborhood tree level by exploring different ...
Derbel, Bilel, Derbel, Houda
core +5 more sources
Self-Adjusting Variable Neighborhood Search Algorithm for Near-Optimal k-Means Clustering
Computation, 2020 The k-means problem is one of the most popular models in cluster analysis that minimizes the sum of the squared distances from clustered objects to the sought cluster centers (centroids).
Lev Kazakovtsev +3 more
doaj +1 more source
A variable neighborhood search simheuristic for project portfolio selection under uncertainty [PDF]
, 2018 With limited nancial resources, decision-makers in rms and governments face the task of selecting the best portfolio of projects to invest in. As the pool of project proposals increases and more realistic constraints are considered, the problem becomes
Döering, Jana +4 more
core +1 more source
Primal-dual variable neighborhood search for the simple plant-location problem [PDF]
, 2007 Copyright @ 2007 INFORMSThe variable neighborhood search metaheuristic is applied to the primal simple plant-location problem and to a reduced dual obtained by exploiting the complementary slackness conditions.
Brimberg, J +3 more
core +1 more source