Titlebook: Variable Neighborhood Search; 9th International Co Andrei Sleptchenko,Angelo Sifaleras,Pierre Hansen Conference proceedings 2023 The Editor

作業(yè)

書目名稱Variable Neighborhood Search影響因子(影響力)




書目名稱Variable Neighborhood Search影響因子(影響力)學(xué)科排名




書目名稱Variable Neighborhood Search網(wǎng)絡(luò)公開度




書目名稱Variable Neighborhood Search網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Variable Neighborhood Search被引頻次




書目名稱Variable Neighborhood Search被引頻次學(xué)科排名




書目名稱Variable Neighborhood Search年度引用




書目名稱Variable Neighborhood Search年度引用學(xué)科排名




書目名稱Variable Neighborhood Search讀者反饋




書目名稱Variable Neighborhood Search讀者反饋學(xué)科排名

habitat

,A VNS-Based Heuristic for?the?Minimum Number of?Resources Under a Perfect Schedule,thm (BVNS) under the use of different initial solutions. The obtained results were compared with an exact method published in the literature. Computational results show that the proposed algorithm is efficient and effective as it can obtain optimal solutions in 95.55% of the cases in a reasonable amount of time.

Asymptomatic

,An Effective VNS for?Delivery Districting,nning situations faced by delivery companies. We propose two best improvement local search procedures and a Basic Variable Neighborhood Search algorithm following the LIMA paradigm. The results suggest that our algorithm is able to find high-quality solutions within a relatively low time.

Mumble

0302-9743 United Arab Emirates, in October 2022..The 11 full papers presented in this volume were carefully reviewed and selected from 29 submissions. The papers describe recent advances in methods and applications of variable neighborhood search..978-3-031-34499-2978-3-031-34500-5Series ISSN 0302-9743 Series

MIRTH

Substitution

修改

,A VNS-Based Heuristic for?the?Minimum Number of?Resources Under a Perfect Schedule,h time restrictions which is known to be NP-complete problem. In particular, we study the performance of the Basic Variable Neighborhood Search algorithm (BVNS) under the use of different initial solutions. The obtained results were compared with an exact method published in the literature. Computat

AMEND

,BVNS for?Overlapping Community Detection,em emerge every day in this type of networks. For this reason, it is important to have procedures and mechanisms to obtain, process and analyze the information extracted from them and transform it into useful data. This situation has given rise to new hard combinatorial optimization problems related

細(xì)頸瓶

NUDGE

,Multi-objective Variable Neighborhood Search for?Improving Software Modularity,is area, we can find the Software Module Clustering Problem (SMCP). This problem, which has been proved to be .-hard, focuses on finding the best organization of a software project in terms of modularity. Since modular code is easier to understand, the result is an increase of the quality of softwar