Results 11 to 20 of about 21,842 (258)
Variable neighborhood search for maximum diverse grouping problem [PDF]
Yugoslav Journal of Operations Research, 2014 This paper presents a general variable neighborhood search (GVNS) heuristic for solving the maximum diverse grouping problem. Extensive computational experiments performed on a series of large random graphs as well as on several instances of the
Urošević Dragan
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
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
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
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
Designing WDM networks by a variable neighborhood search
Journal of Telecommunications and Information Technology, 2006 With the ever-rising data volume that is demanded by the market, network planning in order to minimize the necessary investment while meeting the demands is constantly an important task for the network providers.
Belén Melián-Batista +2 more
doaj +1 more source
Mathematics, 2023 Logistics problems represent an important class of real-world problems where even small improvements in solution quality can lead to significant decreases in operational costs.
Luka Matijević +2 more
doaj +1 more source
Bringing order into the neighborhoods: relaxation guided variable neighborhood search [PDF]
Journal of Heuristics, 2007 In this article we investigate a new variant of Variable Neighborhood Search (VNS): Relaxation Guided Variable Neighborhood Search. It is based on the general VNS scheme and a new Variable Neighborhood Descent (VND) algorithm. The ordering of the neighborhood structures in this VND is determined dynamically by solving relaxations of them. The objective
Jakob Puchinger, Günther R. Raidl
openaire +2 more sources