Results 11 to 20 of about 5,119,730 (291)
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 +3 more sources
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 +3 more sources
Scheduled penalty Variable Neighborhood Search
Computers & Operations Research, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Barrett W. Thomas, MANNI, Emanuele
openaire +3 more sources
Collaborative Variable Neighborhood Search
, 2018 Variable neighborhood search (VNS) is a well-known metaheuristic. Two main ingredients are needed for its design: a collection \(M=(N_1, \ldots , N_r)\) of neighborhood structures and a local search LS (often using its own single neighborhood L). M has a diversification purpose (search for unexplored zones of the solution space S), whereas LS plays an ...
Zufferey, Nicolas, Gallay, Olivier
openaire +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
Gaussian variable neighborhood search for continuous optimization
Computers & Operations Research, 2012 Variable Neighborhood Search (VNS) has shown to be a powerful tool for solving both discrete and box-constrained continuous optimization problems. In this note we extend the methodology by allowing also to address unconstrained continuous optimization problems.
Emilio Carrizosa +3 more
openaire +5 more sources
Scheduling of Patients in Emergency Departments with a Variable Neighborhood Search
, 2021 The dynamic scheduling of patients to doctors in an emergency department environment is tackled in this work. We consider the case in which patients arrive dynamically during the working hours, and the objective is to minimize the weighted tardiness.
Iori, Manuel +11 more
core +2 more sources
A Variable Neighborhood Search Branching for the Electric Vehicle Routing Problem with Time Windows [PDF]
, 2014 E-mobility plays a key role especially in contexts where the transportation activities impact a lot on the total costs. The Electric Vehicles (EVs) are becoming an effective alternative to the internal combustion engines guaranteeing cheaper and eco ...
PEZZELLA, Ferdinando +3 more
core +3 more sources
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
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