Variable neighbourhood search: methods and applications

Resumo. O controle populacional do mosquito Aedes aegypti na fase aquática é uma prática comum no Brasil. Agentes sanitários removem criadouros dos mosquitos e/ou aplicam larvicidas em vários locais das cidades. Mas estas práticas, além de muito caras para os órgãos de vigilância sanitária, são muitas vezes realizadas de forma insuficiente. Portanto, neste trabalho propomos um modelo de otimização multiobjetivo visando determinar estratégias otimizadas para o controle do mosquito, visando utilizar o mínimo possível de controle aquático e que manter a população de mosquitos em um nível mínimo. Para resolução deste modelo foi proposto um algoritmo heurístico baseado em busca em vizinhança variável (VNS-Variable neighborhood search). Ao final são apresentadas simulações computacionais.Palavras-chave. Aedes aegypti, Metaheurística, Modelagem matemática.

show abstract

“…Para resolver numericamente o problema de otimização (8)- (11) propõe-se o algoritmo heurístico VNS-Variable neighborhood search [8].…”

Section: Algoritmo Vns_aedesunclassified

Algoritmo de Busca em Vizinhança Variável para Determinação de Controle Otimizado para a População de Aedes aegypti

Florentino¹,

Cantane²,

Reis³

et al. 2018

Proceeding Series of the Brazilian Society of Computational and Applied Mathematics

View full text Add to dashboard Cite

show abstract

“…When the neighborhood size increases, the number of changed routing decisions increases. The VNS algorithm used is an adaptation of the "Basic" VNS described in Hansen et al (2008).…”

Section: Mathematical Models 31 Optimization Of Discrete Event Dynamicsmentioning

confidence: 99%

Optimal Scheduling and Routing of Free-range AGVs at Large Scale Automated Container Terminals

Corman¹,

Xin²,

Negenborn³

et al. 2016

Period. Polytech. Transp. Eng.

View full text Add to dashboard Cite

show abstract

“…2, 3 and 4 by i∈M Y ik = 1, ∀k ∈ N, (10) (12) and adding Y ik ≥ 0, ∀k ∈ N, ∀i ∈ M to constraints (9). Constraints (10) ensure that each job is assigned exactly to one machine.…”

Section: Fig 2 Graphical Representation Of a Solutionmentioning

confidence: 99%

“…In both stages, strategies borrowed from variable neighbourhood descent (VND) metaheuristic [9] have been developed which rely on the following facts: (i) a local minimum with respect to one neighbourhood structure is not necessarily so with another and (ii) a global minimum is a local minimum with respect to all possible neighbourhood structures. An initial solution is improved by exploring several neighbourhood structures N g (g = 1, .…”

Section: Improvement Proceduresmentioning

confidence: 99%

Efficient metaheuristic algorithm and re-formulations for the unrelated parallel machine scheduling problem with sequence and machine-dependent setup times

Avalos-Rosales

Ángel-Bello

Alvarez

2014

Int J Adv Manuf Technol

View full text Add to dashboard Cite

In this paper, an unrelated parallel machine scheduling problem with sequence and machine-dependent setup times and makespan minimization is studied. A new makespan linearization and several mixed integer formulations are proposed for this problem. These formulations outperform the previously published formulations regarding size of instances and computational time to reach optimal solutions. Using these models, it is possible to solve instances six times larger than what was previously solved and to obtain optimal solutions on instances of the same size up to four orders of magnitude faster. A metaheuristic algorithm based on multi-start algorithm and variable neighbourhood descent metaheuristic is proposed. Composite movements were defined for the improvement phase of the proposed metaheuristic algorithm that considerably improved the performance of the algorithm providing small deviations from optimal solutions in medium-sized instances and outperforming the best known solutions for large instances.

show abstract

Variable neighbourhood search: methods and applications

Cited by 256 publications

References 236 publications

Algoritmo de Busca em Vizinhança Variável para Determinação de Controle Otimizado para a População de Aedes aegypti

Algoritmo de Busca em Vizinhança Variável para Determinação de Controle Otimizado para a População de Aedes aegypti

Optimal Scheduling and Routing of Free-range AGVs at Large Scale Automated Container Terminals

Efficient metaheuristic algorithm and re-formulations for the unrelated parallel machine scheduling problem with sequence and machine-dependent setup times

Contact Info

Product

Resources

About