Cargando…
Multi-directional local search
This paper introduces multi-directional local search, a metaheuristic for multi-objective optimization. We first motivate the method and present an algorithmic framework for it. We then apply it to several known multi-objective problems such as the multi-objective multi-dimensional knapsack problem,...
Autor principal: | Tricoire, Fabien |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Pergamon Press
2012
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4132930/ https://www.ncbi.nlm.nih.gov/pubmed/25140071 http://dx.doi.org/10.1016/j.cor.2012.03.010 |
Ejemplares similares
-
The bi-objective stochastic covering tour problem
por: Tricoire, Fabien, et al.
Publicado: (2012) -
A branch-and-Benders-cut algorithm for a bi-objective stochastic facility location problem
por: Parragh, Sophie N., et al.
Publicado: (2021) -
Direct searches for new resonances in multi-boson events
por: Duda, Dominik
Publicado: (2021) -
Model-independent Direct CPV Searches in multi-body decays
por: Parkes, Chris
Publicado: (2018) -
Direction of arrival estimation and localization of multi-speech sources
por: Dey, Nilanjan, et al.
Publicado: (2017)