Variable neighborhood search: basics and variants
EURO Journal on Computational Optimization, 2017 Variable neighborhood search (VNS) is a framework for building heuristics, based upon systematic changes of neighborhoods both in a descent phase, to find a local minimum, and in a perturbation phase to escape from the corresponding valley. In this paper,
Pierre Hansen +3 more
doaj +4 more sources
Collaborative variable neighborhood search for multi-objective distributed scheduling in two-stage hybrid flow shop with sequence-dependent setup times [PDF]
Scientific Reports, 2022 Distributed scheduling is seldom investigated in hybrid flow shops. In this study, distributed two-stage hybrid flow shop scheduling problem (DTHFSP) with sequence-dependent setup times is considered.
Jingcao Cai +5 more
doaj +2 more sources
Topological variable neighborhood search
Journal of Big DataThe design of the novel metaheuristic method, called Topological Variable Neighborhood Search, is presented and its theoretical properties are elaborated. The proposed metaheuristic method is implemented, applied to several well-known NP-hard problems on
Vladimir Filipović, Aleksandar Kartelj
doaj +2 more sources
A Survey on Variable Neighborhood Search for Sustainable Logistics
AlgorithmsSustainable logistics aims to balance economic efficiency, environmental responsibility, and social well-being in supply chain operations. This study explores the use of Variable Neighborhood Search (VNS), a metaheuristic optimization method, in ...
Jesica de Armas, José A. Moreno-Pérez
doaj +3 more sources
Influence of a neighborhood shape on the efficiency of continuous variable neighborhood search [PDF]
Yugoslav Journal of Operations Research, 2020 The efficiency of a Variable neighborhood search metaheuristic for continuous global optimization problems greatly depends on geometric shape of neighborhood structures used by the algorithm.
Dražić Milan
doaj +1 more source
Variable Neighborhood Search [PDF]
Computers & Operations Research, 1997 Variable neighborhood search (VNS) is a metaheuristic for solving combinatorial and global optimization problems. Its basic idea is systematic change of neighborhood both within a descent phase to find a local optimum and in a perturbation phase to get out of the corresponding valley.
Nenad Mladenovic, Pierre Hansen
openaire +2 more sources
Gaussian variable neighborhood search for the file transfer scheduling problem [PDF]
Yugoslav Journal of Operations Research, 2016 This paper presents new modifications of Variable Neighborhood Search approach for solving the file transfer scheduling problem. To obtain better solutions in a small neighborhood of a current solution, we implement two new local search ...
Dražić Zorica
doaj +1 more source
An Enhanced Evolutionary Local Search for the Split Delivery Vehicle Routing Problem [PDF]
International Journal of Supply and Operations Management, 2017 We present a simple and effective metaheuristic algorithm for the Split Delivery Vehicle Routing Problem (SDVRP). The SDVRP is a relaxation of the classical Vehicle Routing Problem in which a customer demand may be serviced by more than one vehicle.
Sanae Larioui
doaj +1 more source
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
Application of dynamic firework algorithm considering variable neighborhood strategy in flexible job shop scheduling problem [PDF]
E3S Web of Conferences, 2021 Aiming at the flexible job shop scheduling problem, this paper constructs a dual-objective mathematical model to minimize the maximum completion time and the minimum total processing cost.
Lv Jie, Zhang Fenqiang
doaj +1 more source