The dynamic space allocation problem: Applying hybrid GRASP and Tabu search metaheuristics

Título:

The dynamic space allocation problem: Applying hybrid GRASP and Tabu search metaheuristics

Autor:

Luiz Satoru Ochi

Ano:

2012

DOI:

10.1016/j.cor.2011.05.016

Revista:

Computers & Operations Research

ISSN:

03050548

Tags:

Evolutionary Algorithm

Problemas de roteamento e scheduling

Hybrid Algorithms: MIP with Metaheuristics

Idioma:

Inglês

Buscar essa publicação no Google Acadêmico

Publicações com a mesma autoria

An evolutionary hybrid metaheuristic for solving the vehicle routing problem with heterogeneous fleet

A Parallel Genetic Algorithm for the Vehicle Routing Problems

A GRASP-based approach to the generalized minimum spanning tree problem

GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem

Exploring parallel multi-GPU local search strategies in a metaheuristic framework

Finding the Maximum Multi Improvement on neighborhood exploration

Um Algoritmo Evolutivo Híbrido para a Formação de Células de Manufatura em Sistemas de Produção

A Tabu search heuristic with efficient diversification strategies for the class/teacher timetabling problem

Large Neighborhoods with Implicit Customer Selection for Vehicle Routing Problems with Profits

A polyhedral approach to the generalized minimum labeling spanning tree problem