Relevant bibliographies by topics / Variable neighborhood search method

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers

Academic literature on the topic 'Variable neighborhood search method'

Author: Grafiati
Published: 4 June 2021
Last updated: 9 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Variable neighborhood search method.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Variable neighborhood search method"

1

Erromdhani, Ridha, Bassem Jarboui, Mansour Eddaly, Abdelwaheb Rebai, and Nenad Mladenovic. "Variable neighborhood formulation search approach for the multi-item capacitated lot-sizing problem with time windows and setup times." Yugoslav Journal of Operations Research 27, no. 3 (2017): 301–22. http://dx.doi.org/10.2298/yjor160417017e.

Full text
Abstract:
In this paper we suggest a new variant of Variable neighborhood search designed for solving Mixed integer programming problems. We call it Variable neighborhood formulation search (VNFS), since both neighborhoods and formulations are changed during the search. VNS deals with integer variables, while an available (commercial) solver is responsible for continues variables and the objective function value. We address the multi-item capacitated lotsizing problem with production time windows and setup times, under the non-customer specific case. This problem is known to be NP-hard and can be formulated as a mixed 0-1 program. Neighborhoods are induced from the Hamming distance in 0-1 variables, while the objective function values in the corresponding neighborhoods are evaluated using different mathematical programming formulations of the problem. The computational experiments show that our approach is more effective and efficient when compared with the existing methods from the literature.
APA, Harvard, Vancouver, ISO, and other styles
2

ALBAREDA-SAMBOLA, MARIA, ANTONIO ALONSO-AYUSO, ELISENDA MOLINA, and CLARA SIMÓN DE BLAS. "VARIABLE NEIGHBORHOOD SEARCH FOR ORDER BATCHING IN A WAREHOUSE." Asia-Pacific Journal of Operational Research 26, no. 05 (October 2009): 655–83. http://dx.doi.org/10.1142/s0217595909002390.

Full text
Abstract:
In this paper we address the problem of batching orders in a warehouse, with the objective of minimizing the total travel time. Order batching is an NP-hard optimization problem that is very difficult to solve exactly in practice. Thus, most implemented solutions are based on elementary heuristic methods that perform a relatively limited exploration of the solution space. As an alternative, we propose a heuristic based on variable neighborhood search, where the emphasis is placed on performing an intensive exploration of the most promising regions of the solution space. Simulations are conducted to study the performance of the method with different warehouse configurations, and an exhaustive comparative analysis, which considers all the best known heuristics, is carried out. The results obtained show that the proposed heuristic is competitive and that it provides a suitable method which can be used in practice. Additionally, since the performance of the algorithms depends heavily on factors such as storage policy, routing strategies, or the structure of the orders, we have developed an ANOVA in order to consider the effect of all the above factors on the different methods tested.
APA, Harvard, Vancouver, ISO, and other styles
3

Xiang, Wan-li, Yin-zhen Li, Rui-chun He, Xue-lei Meng, and Mei-qing An. "A Multistrategy Artificial Bee Colony Algorithm Enlightened by Variable Neighborhood Search." Computational Intelligence and Neuroscience 2019 (November 3, 2019): 1–19. http://dx.doi.org/10.1155/2019/2564754.

Full text
Abstract:
Artificial bee colony (ABC) has a good exploration ability against its exploitation ability. For enhancing its comprehensive performance, we proposed a multistrategy artificial bee colony (ABCVNS for short) based on the variable neighborhood search method. First, a search strategy candidate pool composed of two search strategies, i.e., ABC/best/1 and ABC/rand/1, is proposed and employed in the employed bee phase and onlooker bee phase. Second, we present another search strategy candidate pool which consists of the original random search strategy and the opposition-based learning method. Then, it is used to further balance the exploration and exploitation abilities in the scout bee phase. Last but not least, motivated by the scheme of neighborhood change of variable neighborhood search, a simple yet efficient choice mechanism of search strategies is presented. Subsequently, the effectiveness of ABCVNS is carried out on two test suites composed of fifty-eight problems. Furthermore, comparisons among ABCVNS and several famous methods are also carried out. The related experimental results clearly demonstrate the effectiveness and the superiority of ABCVNS.
APA, Harvard, Vancouver, ISO, and other styles
4

Matic, Dragan, Jozef Kratica, and Vladimir Filipovic. "Variable neighborhood search for solving bandwidth coloring problem." Computer Science and Information Systems 14, no. 2 (2017): 309–27. http://dx.doi.org/10.2298/csis160320012m.

Full text
Abstract:
This paper presents a variable neighborhood search (VNS) algorithm for solving bandwidth coloring problem (BCP) and bandwidth multicoloring problem (BMCP). BCP and BMCP are generalizations of the well known vertex coloring problem and they are of a great interest from both theoretical and practical points of view. Presented VNS combines a shaking procedure which perturbs the colors for an increasing number of vertices and a specific variable neighborhood descent (VND) procedure, based on the specially designed arrangement of the vertices which are the subject of re-coloring. By this approach, local search is split in a series of disjoint procedures, enabling better choice of the vertices which are addressed to recolor. The experiments performed on the geometric graphs from the literature show that proposed method is highly competitive with the state-of-the-art algorithms and improves 2 out of 33 previous best known solutions for BMCP.
APA, Harvard, Vancouver, ISO, and other styles
5

Alharkan, Ibrahim, Khaled Bamatraf, Mohammed A. Noman, Husam Kaid, Emad S. Abouel Nasr, and Abdulaziz M. El-Tamimi. "An Order Effect of Neighborhood Structures in Variable Neighborhood Search Algorithm for Minimizing the Makespan in an Identical Parallel Machine Scheduling." Mathematical Problems in Engineering 2018 (2018): 1–8. http://dx.doi.org/10.1155/2018/3586731.

Full text
Abstract:
Variable neighborhood search (VNS) algorithm is proposed for scheduling identical parallel machine. The objective is to study the effect of adding a new neighborhood structure and changing the order of the neighborhood structures on minimizing the makespan. To enhance the quality of the final solution, a machine based encoding method and five neighborhood structures are used in VNS. Two initial solution methods which were used in two versions of improved VNS (IVNS) are employed, namely, longest processing time (LPT) initial solution, denoted as HIVNS, and random initial solution, denoted as RIVNS. The proposed versions are compared with LPT, simulated annealing (SA), genetic algorithm (GA), modified variable neighborhood search (MVNS), and improved variable neighborhood search (IVNS) algorithms from the literature. Computational results show that changing the order of neighborhood structures and adding a new neighborhood structure can yield a better solution in terms of average makespan.
APA, Harvard, Vancouver, ISO, and other styles
6

Huang, Song, Na Tian, and Zhicheng Ji. "Particle swarm optimization with variable neighborhood search for multiobjective flexible job shop scheduling problem." International Journal of Modeling, Simulation, and Scientific Computing 07, no. 03 (August 23, 2016): 1650024. http://dx.doi.org/10.1142/s1793962316500240.

Full text
Abstract:
The simulation on benchmarks is a very simple and efficient method to evaluate the performance of the algorithm for solving flexible job shop scheduling model. Due to the assignment and scheduling decisions, flexible job shop scheduling problem (FJSP) becomes extremely hard to solve for production management. A discrete multi-objective particle swarm optimization (PSO) and simulated annealing (SA) algorithm with variable neighborhood search is developed for FJSP with three criteria: the makespan, the total workload and the critical machine workload. Firstly, a discrete PSO is designed and then SA algorithm performs variable neighborhood search integrating two neighborhoods on public critical block to enhance the search ability. Finally, the selection strategy of the personal-best individual and global-best individual from the external archive is developed in multi-objective optimization. Through the experimental simulation on matlab, the tests on Kacem instances, Brdata instances and BCdata instances show that the modified discrete multi-objective PSO algorithm is a promising and valid method for optimizing FJSP with three criteria.
APA, Harvard, Vancouver, ISO, and other styles
7

Gu, Xiaolin, Ming Huang, and Xu Liang. "An Improved Genetic Algorithm with Adaptive Variable Neighborhood Search for FJSP." Algorithms 12, no. 11 (November 14, 2019): 243. http://dx.doi.org/10.3390/a12110243.

Full text
Abstract:
For solving the complex flexible job-shop scheduling problem, an improved genetic algorithm with adaptive variable neighborhood search (IGA-AVNS) is proposed. The improved genetic algorithm first uses a hybrid method combining operation sequence (OS) random selection with machine assignment (MA) hybrid method selection to generate the initial population, and it then groups the population. Each group uses an improved genetic operation for global search, then the better solutions from each group are stored in the elite library, and finally, the adaptive local neighborhood search is used in the elite library for detailed local searches. The simulation experiments are carried out by three sets of international standard examples. The experimental results show that the IGA-AVNS algorithm is an effective algorithm for solving flexible job-shop scheduling problems.
APA, Harvard, Vancouver, ISO, and other styles
8

Khelifa, Meriem, and Dalila Boughaci. "A Variable Neighborhood Search Method for Solving the Traveling Tournaments Problem." Electronic Notes in Discrete Mathematics 47 (February 2015): 157–64. http://dx.doi.org/10.1016/j.endm.2014.11.021.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Vasquez, Michel, and Nicolas Zufferey. "Consistent Neighborhood Search for Combinatorial Optimization." ISRN Computational Mathematics 2012 (September 13, 2012): 1–12. http://dx.doi.org/10.5402/2012/671423.

Full text
Abstract:
Many optimization problems (from academia or industry) require the use of a local search to find a satisfying solution in a reasonable amount of time, even if the optimality is not guaranteed. Usually, local search algorithms operate in a search space which contains complete solutions (feasible or not) to the problem. In contrast, in Consistent Neighborhood Search (CNS), after each variable assignment, the conflicting variables are deleted to keep the partial solution feasible, and the search can stop when all the variables have a value. In this paper, we formally propose a new heuristic solution method, CNS, which has a search behavior between exhaustive tree search and local search working with complete solutions. We then discuss, with a unified view, the great success of some existing heuristics, which can however be considered within the CNS framework, in various fields: graph coloring, frequency assignment in telecommunication networks, vehicle fleet management with maintenance constraints, and satellite range scheduling. Moreover, some lessons are given in order to have guidelines for the adaptation of CNS to other problems.
APA, Harvard, Vancouver, ISO, and other styles
10

Kusrini. "Variable Neighborhood Simplex Search Methods for Global Optimization Models." Journal of Computer Science 8, no. 4 (October 1, 2012): 613–20. http://dx.doi.org/10.3844/jcssp.2012.613.620.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Variable neighborhood search method"

1

Stefana, Janićijević. "Metode promena formulacija i okolina za problem maksimalne klike grafa." Phd thesis, Univerzitet u Novom Sadu, Fakultet tehničkih nauka u Novom Sadu, 2016. http://www.cris.uns.ac.rs/record.jsf?recordId=101446&source=NDLTD&language=en.

Full text
Abstract:
Doktorska disertacija se bavi temama rešavanja računarski teškihproblema kombinatorne optimizacije. Istaknut je problem maksimalneklike kao predstavnik određenih struktura u grafovima. Problemmaksimalne klike i sa njim povezani problemi su formulisani kaonelinearne funkcije. Rešavani su sa ciljem otkrivanja novih metodakoje pronalaze dobre aproksimacije rešenja za neko razumno vreme.Predložene su varijante Metode promenljivih okolina na rešavanjemaksimalne klike u grafu. Povezani problemi na grafovima se moguprimeniti na pretragu informacija, raspoređivanje, procesiranjesignala, teoriju klasifikacije, teoriju kodiranja, itd. Svi algoritmisu implementirani i uspešno testirani na brojnim različitimprimerima.
This Ph.D. thesis addresses topics NP hard problem solving approaches incombinatorial optimization and according to that it is highlighted maximumclique problem as a representative of certain structures in graphs. Maximumclique problem and related problems with this have been formulated as nonlinear functions which have been solved to research for new methods andgood solution approximations for some reasonable time. It has beenproposed several different extensions of Variable Neighborhood Searchmethod. Related problems on graphs could be applied on informationretrieval, scheduling, signal processing, theory of classi_cation, theory ofcoding, etc. Algorithms are implemented and successfully tested on variousdifferent tasks.
APA, Harvard, Vancouver, ISO, and other styles
2

Lahyani, Rahma. "Une matheuristique unifiée pour résoudre des problèmes de tournées de véhicules riches." Thesis, Ecole centrale de Lille, 2014. http://www.theses.fr/2014ECLI0011/document.

Full text
Abstract:
L’objectif de cette thèse est de développer un cadre méthodologique pour les problèmes de tournées de véhicules riches (RVRPs). Nous présentons d’abord une taxonomie et une définition élaborée des RVRPs basée sur une analyse typologique réalisée en fonction de deux critères discriminatoires. Dans cette thèse, nous nous intéressons à la résolution du problème de tournées de véhicules multi-dépôt multi-compartiment multi-produits avec fenêtres de temps (MDMCMCm-VRPTW). Nous proposons une heuristique de génération de colonnes unifiée qui inclut une matheuristique de type VNS. La matheuristique combine plusieurs heuristiques de routage de type destruction et insertion ainsi que des procédures efficaces de contrôle de réalisabilité des contraintes afin de résoudre le MDMCMCm-VRPTW pour un seul véhicule. Deux voisinages de chargement, basés sur la résolution de programmes mathématiques sont proposées. Des études expérimentales approfondies sont conduites sur un ensemble de 191 instances pour des VRPs moins complexes. Les expérimentations valident la compétitivité de la matheuristique unifiée. Une analyse de sensibilité révèle l’importance de certains choix algorithmiques et des voisinages de chargement pour parvenir à des solutions de très bonne qualité. La matheuristique basée sur la méthode de VNS est intégrée dans l’heuristique de génération de colonnes pour résoudre le MDMCMCm-VRPTW. Nous proposons une méthode exacte de post-traitement capable d’optimiser l’affectation des clients aux tournées de véhicules. Enfin, nous résolvons un RVRP qui survient dans le processus de collecte de l’huile d’olive en Tunisie à l’aide d’un algorithme exact de type branch-and-cut
The purpose of this thesis is to develop a solution framework for Rich Vehicle Routing Problems (RVRPs). We first provide a comprehensive survey of the RVRP literature as well as a taxonomy. Selected papers addressing various variants are classified according to the proposed taxonomy. A cluster analysis based on two discriminating criteria is performed and leads to define RVRPs. In this thesis we are interested in solving a multi-depot multi-compartment multi-commodity vehicle routing problem with time windows (MDMCMCm-VRPTW). We propose a unified column generation heuristic cooperating with a variable neighborhood search (VNS) matheuristic. The VNS combines several removal and insertion routing heuristics as well as computationally efficient constraint checking. Two loading neighborhoods based on the solution of mathematical programs are proposed to intensify the search. On a set of 191 instances of less complex routing problems, the unified matheuristic turns to be competitive. A sensitivity analysis, performed on more complex generated instances reveals the importance of some algorithmic features and of loading neighborhoods for reaching high quality solutions. The VNS based matheuristic is embedded in a column generation heuristic to solve the MDMCMCm-VRPTW. We propose an exact post-processing method to optimize the assignment ofcustomers to vehicle routes. Last, we introduce, model and solve to optimality a RVRP arising in the olive oil collection process in Tunisia. We propose an exact branch-and-cut algorithm to solve the problem. We evaluate the performance of the algorithm on real data sets under different transportation scenarios
APA, Harvard, Vancouver, ISO, and other styles
3

Svensson, Jesper. "Designing a large neighborhood search method to solve a multi-processor avionics scheduling problem." Thesis, Linköpings universitet, Tillämpad matematik, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-177878.

Full text
Abstract:
This thesis introduces a Large Neighborhood Search (LNS) method to solve a multi-processor avionics scheduling problem. In a typical scheduling problem, tasks are scheduled with exact starting times. In this thesis however, tasks will instead be assigned to disjoint time segments, called buckets. For an assignment to be feasible, precedence relations and capacity constraints related to network and computing resources need to be fulfilled. The introduced LNS method relies on solving Mixed-Integer Programming (MIP)-models. To make progress in the search for a feasible assignment, we construct a MIP-model that allows violation of the problem constraints at a cost of increased objective value. The LNS method uses two operators, a destroy operator that chooses a set of tasks that are allowed to change buckets, and a repair operator that through solving the MIP-model creates a new schedule. This thesis develops 11 types of destroy operators and 30 (concrete) variants of them. The MIP-based LNS is evaluated on a set of 60 instances with up to 84 000 tasks and 21 processors. The instances belongs to six categories of varying difficulty. The MIP-based LNS solves 50 instances within our time limit, and the largest instance solved has 77 757 tasks. This is significantly better than solving the complete MIP-model in a single step. With this approach only 36 instances can be solved within our time limit and the largest instance solved has 48554 tasks.
APA, Harvard, Vancouver, ISO, and other styles
4

Aleman, Rafael E. "A Guided Neighborhood Search Applied to the Split Delivery Vehicle Routing Problem." Wright State University / OhioLINK, 2009. http://rave.ohiolink.edu/etdc/view?acc_num=wright1237575805.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Rahim, Fatih. "A Variable Neighborhood Search Procedure For The Combined Location With Partial Coverage And Selective Traveling Salesman Problem." Master's thesis, METU, 2010. http://etd.lib.metu.edu.tr/upload/3/12611949/index.pdf.

Full text
Abstract:
In this study, a metaheuristic procedure, particularly a variable neighborhood search procedure, is proposed to solve the combined location and selective traveling salesman problem in glass recycling. The collection of used glass is done by a collecting vehicle that visits a number of predefined collection centers, like restaurants and hospitals that are going to be referred to as compulsory points. Meanwhile, it is desired to locate a predetermined number of bottle banks to residential areas. The aim is to determine the location of these bottle banks and the route of the collecting vehicle so that all compulsory points and all bottle banks are visited and the maximum profit is obtained. Population zones are defined in residential areas and it is assumed that the people in a particular population zone will recycle their used glass to the closest bottle bank that fully or partially covers their zone. A Variable Neighborhood Search algorithm and its variant have been utilized for the solution of the problem. Computational experiments have been made on small and medium scale test problems, randomly generated and adapted from the literature.
APA, Harvard, Vancouver, ISO, and other styles
6

Araújo, Aurélio de Aquino. "Otimização aplicada ao processo de transmissão de Acinetobacter spp em unidades de terapia intensiva." Botucatu, 2018. http://hdl.handle.net/11449/181504.

Full text
Abstract:
Orientador: Daniela Renata Cantane
Resumo: Originadas na década de 1970, as Infecções Hospitalares vêm cada vez mais tomando proporções colossais, acarretando óbito em cerca de 30% dos pacientes em Unidades de Terapia Intensiva (UTI). Os pacientes diagnosticados com a infecções permanecem muito tempo internados, gerando um custo muito alto para os hospitais. No ambiente hospitalar a bactéria Acinetobacter baumannii a principal responsável por tais infecções, devido a sua facilidade de sobreviver em ambientes secos e úmidos, podendo sobreviver tanto no organismo humano, quanto nos ambientes que os profissionais da saúde entram em contato (computadores, equipamentos médicos, etc). Os principais vetores desta bactéria são os próprios agentes de saúde, visto que os pacientes na UTI estão todos acamados. No entanto, medidas de higienização extremamente necessárias para conter surtos da infecções o. Por outro lado, devido as emergências nestas unidades, muitas vezes não há tempo hábil para tais procedimentos. Visto que impossível uma medida total de higienização e uma taxa nula de contato da equipe de trabalho com o ambiente em UTIs, importante conhecer quais são as mínimas medidas necessárias para a diminuição de infecções hospitalares. Neste contexto, o objetivo deste trabalho propor e analisar um modelo que descreva a dinâmica de transmissão da infecção dentro de uma UTI, considerando pacientes e profissionais da saúde, assim como, propor um modelo de otimização visando determinar quais as mínimas medidas de higienização... (Resumo completo, clicar acesso eletrônico abaixo)
Abstract: Originated in the 1970s, Hospital Infections come every time more taking colossal proportions, causing death in about 30% of patients in Intensive Care Units (ICU). Patients diagnosed with infections remain long hospitalized, generating a very high cost for hospitals. In the hospital environment, Acinetobacter baumannii is the main responsible for such infections due to their ease of survival in dry and humid, and can survive both in the human body and in the environments that health workers contact (computers, medical equipment, etc.). The main vectors of this bacterium are the health agents themselves, since the patients in the ICU are all bedridden. However, hygiene measures are extremely necessary to contain outbreaks of infection. On the other hand, due to emergencies in these units, there is often no time for such procedures. Since a total sanitation measure and it is important to know the minimum measures necessary for the decrease of infections. In this context, the objective xiii of this work is to propose and analyze a model that describes the dynamics of transmission of infection within an ICU, considering patients and health professionals, as well as to propose an optimization model aiming to determine the minimum hygienic measures are needed to minimize the number of infected patients. A Variable Neighborhood Search Metaheuristic was proposed to solve the optimization model. For validation of the models were carried out computational simulations. These simulation... (Complete abstract click electronic access below)
Mestre
APA, Harvard, Vancouver, ISO, and other styles
7

Ouali, Abdelkader. "Méthodes hybrides parallèles pour la résolution de problèmes d'optimisation combinatoire : application au clustering sous contraintes." Thesis, Normandie, 2017. http://www.theses.fr/2017NORMC215/document.

Full text
Abstract:
Les problèmes d’optimisation combinatoire sont devenus la cible de nombreuses recherches scientifiques pour leur importance dans la résolution de problèmes académiques et de problèmes réels rencontrés dans le domaine de l’ingénierie et dans l’industrie. La résolution de ces problèmes par des méthodes exactes ne peut être envisagée à cause des délais de traitement souvent exorbitants que nécessiteraient ces méthodes pour atteindre la (les) solution(s) optimale(s). Dans cette thèse, nous nous sommes intéressés au contexte algorithmique de résolution des problèmes combinatoires, et au contexte de modélisation de ces problèmes. Au niveau algorithmique, nous avons appréhendé les méthodes hybrides qui excellent par leur capacité à faire coopérer les méthodes exactes et les méthodes approchées afin de produire rapidement des solutions. Au niveau modélisation, nous avons travaillé sur la spécification et la résolution exacte des problématiques complexes de fouille des ensembles de motifs en étudiant tout particulièrement le passage à l’échelle sur des bases de données de grande taille. D'une part, nous avons proposé une première parallélisation de l'algorithme DGVNS, appelée CPDGVNS, qui explore en parallèle les différents clusters fournis par la décomposition arborescente en partageant la meilleure solution trouvée sur un modèle maître-travailleur. Deux autres stratégies, appelées RADGVNS et RSDGVNS, ont été proposées qui améliorent la fréquence d'échange des solutions intermédiaires entre les différents processus. Les expérimentations effectuées sur des problèmes combinatoires difficiles montrent l'adéquation et l'efficacité de nos méthodes parallèles. D'autre part, nous avons proposé une approche hybride combinant à la fois les techniques de programmation linéaire en nombres entiers (PLNE) et la fouille de motifs. Notre approche est complète et tire profit du cadre général de la PLNE (en procurant un haut niveau de flexibilité et d’expressivité) et des heuristiques spécialisées pour l’exploration et l’extraction de données (pour améliorer les temps de calcul). Outre le cadre général de l’extraction des ensembles de motifs, nous avons étudié plus particulièrement deux problèmes : le clustering conceptuel et le problème de tuilage (tiling). Les expérimentations menées ont montré l’apport de notre proposition par rapport aux approches à base de contraintes et aux heuristiques spécialisées
Combinatorial optimization problems have become the target of many scientific researches for their importance in solving academic problems and real problems encountered in the field of engineering and industry. Solving these problems by exact methods is often intractable because of the exorbitant time processing that these methods would require to reach the optimal solution(s). In this thesis, we were interested in the algorithmic context of solving combinatorial problems, and the modeling context of these problems. At the algorithmic level, we have explored the hybrid methods which excel in their ability to cooperate exact methods and approximate methods in order to produce rapidly solutions of best quality. At the modeling level, we worked on the specification and the exact resolution of complex problems in pattern set mining, in particular, by studying scaling issues in large databases. On the one hand, we proposed a first parallelization of the DGVNS algorithm, called CPDGVNS, which explores in parallel the different clusters of the tree decomposition by sharing the best overall solution on a master-worker model. Two other strategies, called RADGVNS and RSDGVNS, have been proposed which improve the frequency of exchanging intermediate solutions between the different processes. Experiments carried out on difficult combinatorial problems show the effectiveness of our parallel methods. On the other hand, we proposed a hybrid approach combining techniques of both Integer Linear Programming (ILP) and pattern mining. Our approach is comprehensive and takes advantage of the general ILP framework (by providing a high level of flexibility and expressiveness) and specialized heuristics for data mining (to improve computing time). In addition to the general framework for the pattern set mining, two problems were studied: conceptual clustering and the tiling problem. The experiments carried out showed the contribution of our proposition in relation to constraint-based approaches and specialized heuristics
APA, Harvard, Vancouver, ISO, and other styles
8

Mjirda, Anis. "Recherche à voisinage variable pour des problèmes de routage avec ou sans gestion de stock." Thesis, Valenciennes, 2014. http://www.theses.fr/2014VALE0023/document.

Full text
Abstract:
Dans cette thèse nous nous intéressons à l'étude et à la résolution de problèmes d'optimisation dans le domaine du transport. La première problématique concerne le problème d'élaboration de tournées avec gestion des stocks, et nous considérons dans une seconde partie le problème du voyageur de commerce avec tirant d'eau. Nous avons développé des approches basées sur la recherche à voisinage variable pour résoudre ces problèmes NP-Difficiles, en proposant différentes structures de voisinages et schémas de résolution efficaces. L'évaluation globale des approches proposées sur des instances de la littérature montre leur efficacité. En particulier, nos algorithmes ont amélioré les résultats obtenus par les meilleures approches existantes pour ces deux problèmes
This thesis deals with the study of optimization problems in the transportation domain. We first address the inventory routing problem and we consider the traveling salesman problem with draft limits in a second part. In both cases we have developed methods based on the variable neighborhood search to solve these NP-hard problems. We have proposed several efficient neighborhood structures and solving frameworks. The global evaluation of the proposed approach on sets of benchmarks available in the litterature shows a remarkable efficency and effectiveness. In particular, our algorithms have improved the results obtained by the current best approaches for these two problems
APA, Harvard, Vancouver, ISO, and other styles
9

Kohn, Robert [Verfasser], Oliver [Akademischer Betreuer] Rose, and Stefan [Akademischer Betreuer] Pickl. "A Framework for Batch Scheduling with Variable Neighborhood Search in Wafer Fabrication / Robert Kohn. Universität der Bundeswehr München, Fakultät für Informatik. Betreuer: Oliver Rose. Gutachter: Oliver Rose ; Stefan Pickl." Neubiberg : Universitätsbibliothek der Universität der Bundeswehr München, 2015. http://d-nb.info/1099961645/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Kohn, Robert Verfasser], Oliver [Akademischer Betreuer] [Rose, and Stefan [Akademischer Betreuer] Pickl. "A Framework for Batch Scheduling with Variable Neighborhood Search in Wafer Fabrication / Robert Kohn. Universität der Bundeswehr München, Fakultät für Informatik. Betreuer: Oliver Rose. Gutachter: Oliver Rose ; Stefan Pickl." Neubiberg : Universitätsbibliothek der Universität der Bundeswehr München, 2015. http://nbn-resolving.de/urn:nbn:de:bvb:706-4555.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Variable neighborhood search method"

1

Benmansour, Rachid, Angelo Sifaleras, and Nenad Mladenović, eds. Variable Neighborhood Search. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-44932-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Sifaleras, Angelo, Said Salhi, and Jack Brimberg, eds. Variable Neighborhood Search. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-15843-9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Mladenovic, Nenad, Andrei Sleptchenko, Angelo Sifaleras, and Mohammed Omar, eds. Variable Neighborhood Search. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-69625-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Mladenović, Nenad, Angelo Sifaleras, and Rachid Benmansour. Variable Neighborhood Search: 7th International Conference, ICVNS 2019, Rabat, Morocco, October 3–5, 2019, Revised Selected Papers. Springer, 2020.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Tuttle, Michael C. Search and Documentation of Underwater Archaeological Sites. Edited by Ben Ford, Donny L. Hamilton, and Alexis Catsambis. Oxford University Press, 2012. http://dx.doi.org/10.1093/oxfordhb/9780199336005.013.0005.

Full text
Abstract:
Archaeological survey is fundamental to archaeological data collection. Underwater archaeology is developing and maturing as a discipline. The levels of technology available for investigations are variable depending on the objectives of surveys. Prior to entering the field, it is essential to do a complete desktop research, an in-office examination of available literature, and to develop a survey plan. This article describes different methods and the tools used for probing, which are used for examining subsurface features or defining the extent of a site. Remote sensing is an effective method to search for cultural material in a marine context. Once a general survey has located acoustic targets, magnetic anomalies, or other areas of interest, a predisturbance site survey of the targets may be conducted. Accurate positioning during a predisturbance investigation is critical. With an area survey complete or a predisturbance survey conducted, the next step in the archaeological process is excavation.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Variable neighborhood search method"

1

Mrkela, Lazar, and Zorica Stanimirović. "Skewed Variable Neighborhood Search Method for the Weighted Generalized Regenerator Location Problem." In Variable Neighborhood Search, 182–201. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-15843-9_15.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Papalitsas, Christos, Theodore Andronikos, and Panagiotis Karakostas. "Studying the Impact of Perturbation Methods on the Efficiency of GVNS for the ATSP." In Variable Neighborhood Search, 287–302. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-15843-9_22.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Boughaci, Dalila, and Hanane Douah. "A Variable Neighborhood Search-Based Method with Learning for Image Steganography." In Sustainable Development and Social Responsibility—Volume 2, 7–18. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-32902-0_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Li, Xinyu, and Liang Gao. "A Hybrid Genetic Algorithm with Variable Neighborhood Search for Dynamic IPPS." In Engineering Applications of Computational Methods, 429–53. Berlin, Heidelberg: Springer Berlin Heidelberg, 2020. http://dx.doi.org/10.1007/978-3-662-55305-3_20.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Kardam, Yogita Singh, and Kamal Srivastava. "General Variable Neighborhood Search for the Minimum Stretch Spanning Tree Problem." In Computational Methods and Data Engineering, 149–64. Singapore: Springer Singapore, 2020. http://dx.doi.org/10.1007/978-981-15-6876-3_12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Sifaleras, Angelo, and Ioannis Konstantaras. "A Survey on Variable Neighborhood Search Methods for Supply Network Inventory." In Network Algorithms, Data Mining, and Applications, 71–82. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-37157-9_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Raeesi N., Mohammad R., and Ziad Kobti. "Incorporating Highly Explorative Methods to Improve the Performance of Variable Neighborhood Search." In Transactions on Computational Science XXI, 315–38. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-45318-2_14.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Hansen, Pierre, and Nenad Mladenović. "Variable Neighborhood Search." In Search Methodologies, 313–37. Boston, MA: Springer US, 2013. http://dx.doi.org/10.1007/978-1-4614-6940-7_12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Hansen, Pierre, Nenad Mladenović, Jack Brimberg, and José A. Moreno Pérez. "Variable Neighborhood Search." In Handbook of Metaheuristics, 61–86. Boston, MA: Springer US, 2010. http://dx.doi.org/10.1007/978-1-4419-1665-5_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Hansen, Pierre, and Nenad Mladenović. "Variable Neighborhood Search." In Handbook of Heuristics, 759–87. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-07124-4_19.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Variable neighborhood search method"

1

Papalitsas, Christos, Konstantinos Giannakis, Theodore Andronikos, Dimitrios Theotokis, and Angelo Sifaleras. "Initialization methods for the TSP with Time Windows using Variable Neighborhood Search." In 2015 6th International Conference on Information, Intelligence, Systems and Applications (IISA). IEEE, 2015. http://dx.doi.org/10.1109/iisa.2015.7388106.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Rezgui, Jihene, Abdelhakim Hafid, Racha Ben Ali, and Michel Gendreau. "A variable neighborhood search method for multi-objective channel assignment problem in Multi-Radio WMNs." In 2010 IEEE 35th Conference on Local Computer Networks (LCN 2010). IEEE, 2010. http://dx.doi.org/10.1109/lcn.2010.5735788.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Ghodsi, Reza, and Alireza Shamekhi Amiri. "A Variable Neighborhood Search Method for an Integrated Cellular Manufacturing Systems with Production Planning and System Reconfiguration." In 2010 Fourth Asia International Conference on Mathematical/Analytical Modelling and Computer Simulation. IEEE, 2010. http://dx.doi.org/10.1109/ams.2010.47.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Yu, Shengping, Ying Tang, Tianyou Chai, Qiang Liu, and Yefeng Liu. "Scheduling Method for Steelmaking and Continuous Casting Production Based on Heuristic Algorithm and Variable Neighborhood Search Algorithm." In 2018 IEEE Conference on Decision and Control (CDC). IEEE, 2018. http://dx.doi.org/10.1109/cdc.2018.8619146.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Schachter, Richard David, Nair Maria Maia de Abreu, Valdir Agustinho de Melo, and Eliane Maria Loiola. "Development of a Computer Program for the Optimization of Deck Accommodation Arrangements of Ships and Craft Applying GRASP and VNS Meta-Heuristics Methods." In ASME 2011 30th International Conference on Ocean, Offshore and Arctic Engineering. ASMEDC, 2011. http://dx.doi.org/10.1115/omae2011-50135.

Full text
Abstract:
This work presents a computer program developed for the definition of Deck Accommodation Arrangements of ships and craft that allocates spaces in an automated process, in order to help the designer with options and initial ideas for its definition or to optimize arrangements propositions. This optimization process is usually done based on experience, using maritime regulations and practices. It is an evolution of previous works [14] which adopted the Quadratic Assignment Problem (QAP), that allowed the user to select units to be assigned to demarcated spaces and the program provides optimized options of arrangements, which can be transformed, in turn, into drawings. In this work, a hybrid meta-heuristic has been incorporated to the program, namely the Greedy Randomized Adaptive Search Procedures — GRASP [7], and for the local search of solutions, the Variable Neighborhood Search — VNS [8], to improve the results. The program incorporates the mathematical model, containing menus of types of accommodation/compartments or deck units, for the user’s selection. Visualization and manipulation screens for friendly use were created, that allow the designer to quickly assemble deck arrangements in spaces, with an indirect tri-dimensionality feature. The program processes position and flow matrices, being the later ones determined through calibration (being modifiable) as a function of applicable Regulations of ILO 147 Convention, SOLAS and NORMAM (Brazilian Administration), incorporating as well maritime practice and usual ergonomic criteria for requirements of safety and habitability. The results can be used for General Arrangement drawings and can aid in the calculations of light weight and center of gravity, sail area, etc. A small discussion of recommendations for accommodation arrangements of the related regulations, rules of thumb derived from design practice and ergonomic criteria is provided.
APA, Harvard, Vancouver, ISO, and other styles
6

Boudane, Fatima, and Ali Berrichi. "Variable neighborhood search for automatic density-based clustering." In 2017 International Conference on Mathematics and Information Technology (ICMIT). IEEE, 2017. http://dx.doi.org/10.1109/mathit.2017.8259708.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Bernabe Loranca, Maria Beatriz, Rogelio Gonzalez Velazquez, Elias Olivares Benitez, David Pinto Avendano, Javier Plmirez Rodriguez, and Jose Luis Martinez Flores. "Partitioning with Variable Neighborhood Search: A bioinspired approach." In 2012 World Congress on Nature and Biologically Inspired Computing (NaBIC). IEEE, 2012. http://dx.doi.org/10.1109/nabic.2012.6402254.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Hamza, Khorshid Adel, and Aise Zulal Sevkli. "A Variable Neighborhood Search for Solving Sudoku Puzzles." In International Conference on Evolutionary Computation Theory and Applications. SCITEPRESS - Science and and Technology Publications, 2014. http://dx.doi.org/10.5220/0005154903260331.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Sangsawang, Ornurai, and Sunarin Chanta. "Variable Neighborhood Search for Optimal Railway Station Location." In CIIS 2019: 2019 The 2nd International Conference on Computational Intelligence and Intelligent Systems. New York, NY, USA: ACM, 2019. http://dx.doi.org/10.1145/3372422.3372453.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Lo, Min-Hua, Yun-Chia Liang, and Jih-Chang Hsieh. "A modified variable neighborhood search algorithm for orienteering problems." In Industrial Engineering (CIE-40). IEEE, 2010. http://dx.doi.org/10.1109/iccie.2010.5668224.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Variable neighborhood search method' for particular source types:
Journal articles Dissertations / Theses
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography