Search Results - "Resende, Mauricio G. C"

Biased random-key genetic algorithms for combinatorial optimization by Gonçalves, José Fernando, Resende, Mauricio G. C.

“…Random-key genetic algorithms were introduced by Bean (ORSA J. Comput. 6:154–160, 1994 ) for solving sequencing problems in combinatorial optimization. Since…”
Get full text

Fast local search for the maximum independent set problem by Andrade, Diogo V., Resende, Mauricio G. C., Werneck, Renato F.

“…Given a graph G =( V , E ), the independent set problem is that of finding a maximum-cardinality subset S of V such that no two vertices in S are adjacent. We…”
Get full text

A biased random-key genetic algorithm for the capacitated minimum spanning tree problem by Ruiz, Efrain, Albareda-Sambola, Maria, Fernández, Elena, Resende, Mauricio G.C.

“…This paper focuses on the capacitated minimum spanning tree (CMST) problem. Given a central processor and a set of remote terminals with specified demands for…”
Get full text

Heuristics for a hub location-routing problem by Lopes, Mauro Cardoso, de Andrade, Carlos Eduardo, de Queiroz, Thiago Alves, Resende, Mauricio G. C., Miyazawa, Flávio Keidi

“…We investigate a variant of the many‐to‐many hub location‐routing problem which consists in partitioning the set of nodes of a graph into routes containing…”
Get full text

An extended Akers graphical method with a biased random-key genetic algorithm for job-shop scheduling by Gonçalves, José Fernando, Resende, Mauricio G. C.

“…This paper presents a local search, based on a new neighborhood for the job‐shop scheduling problem, and its application within a biased random‐key genetic…”
Get full text

A biased random-key genetic algorithm for the unequal area facility layout problem by Gonçalves, José Fernando, Resende, Mauricio G.C.

“…•A BRKGA for the unequal area facility layout problem is presented.•A novel facility placement procedure is developed.•A hybrid BRKGA and LP is used to solve…”
Get full text

A biased random key genetic algorithm for 2D and 3D bin packing problems by Gonçalves, José Fernando, Resende, Mauricio G.C.

“…In this paper we present a novel biased random-key genetic algorithm (BRKGA) for 2D and 3D bin packing problems. The approach uses a maximal-space…”
Get full text

Multi-start methods for combinatorial optimization by Martí, Rafael, Resende, Mauricio G.C., Ribeiro, Celso C.

“…► Description of the origins of the multi-start methodology. ► Revision of the main publications, including the characteristics of “early methods”. ►…”
Get full text

Preface to the Special Issue on Metaheuristics: Recent Advances and Applications by Festa, Paola, Gaspero, Luca Di, Pavone, Mario, Resende, Mauricio G. C.

Get full text

Parallel hybrid heuristics for the permutation flow shop problem by Ravetti, Martín Gómez, Riveros, Carlos, Mendes, Alexandre, Resende, Mauricio G. C., Pardalos, Panos M.

“…This paper addresses the Permutation Flowshop Problem with minimization of makespan, which is denoted by Fm | prmu | C max . In the permutational scenario, the…”
Get full text

A hybrid genetic algorithm for the job shop scheduling problem by Gonçalves, José Fernando, de Magalhães Mendes, Jorge José, Resende, Maurı́cio G.C.

“…This paper presents a hybrid genetic algorithm for the job shop scheduling problem. The chromosome representation of the problem is based on random keys. The…”
Get full text

A parallel multi-population biased random-key genetic algorithm for a container loading problem by Gonçalves, José Fernando, Resende, Mauricio G.C.

“…This paper presents a multi-population biased random-key genetic algorithm (BRKGA) for the single container loading problem (3D-CLP) where several rectangular…”
Get full text

Multiobjective GRASP with Path Relinking by Martí, Rafael, Campos, Vicente, Resende, Mauricio G.C., Duarte, Abraham

“…•We classify previous GRASP and Path Relink. in multiobjective optimization.•We propose the different ways to apply GRASP and PR to multiobjective…”
Get full text

Path-relinking intensification methods for stochastic local search algorithms by Ribeiro, Celso C., Resende, Mauricio G. C.

“…Path-relinking is major enhancement to heuristic search methods for solving combinatorial optimization problems, leading to significant improvements in both…”
Get full text

A biased random‐key genetic algorithm for the home health care problem by Kummer, Alberto F., de Araújo, Olinto C.B., Buriol, Luciana S., Resende, Mauricio G.C.

“…Home health care problems consist in scheduling visits to home patients by health professionals while following a series of requirements. This paper studies…”
Get full text

A light‐touch routing optimization tool (RoOT) for vaccine and medical supply distribution in Mozambique by P.G. Petroianu, Larissa, Zabinsky, Zelda B., Zameer, Mariam, Chu, Yi, Muteia, Mamiza M., Resende, Mauricio G.C., Coelho, Aida L., Wei, Jiarui, Purty, Turam, Draiva, Abel, Lopes, Alvaro

“…Planning vaccine distribution in rural and urban poor communities is challenging, due in part to inadequate vehicles, limited cold storage, road availability,…”
Get full text

A biased random-key genetic algorithm with forward-backward improvement for the resource constrained project scheduling problem by Gonçalves, José Fernando, Resende, Mauricio G. C., Mendes, Jorge J. M.

“…This paper presents a biased random-key genetic algorithm for the resource constrained project scheduling problem. The chromosome representation of the problem…”
Get full text

A hybrid multistart heuristic for the uncapacitated facility location problem by Resende, Mauricio G.C., Werneck, Renato F.

“…We present a multistart heuristic for the uncapacitated facility location problem, based on a very successful method we originally developed for the p-median…”
Get full text

A hybrid Lagrangean heuristic with GRASP and path-relinking for set k-covering by Pessoa, Luciana S., Resende, Mauricio G.C., Ribeiro, Celso C.

“…The set multicovering or set k-covering problem is an extension of the classical set covering problem, in which each object is required to be covered at least…”
Get full text

A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set by Feo, Thomas A, Resende, Mauricio G. C, Smith, Stuart H

“…An efficient randomized heuristic for a maximum independent set is presented. The procedure is tested on randomly generated graphs having from 400 to 3,500…”
Get full text