Buscar
Mostrando ítems 1-10 de 144
A Greedy Randomized Adaptive Search With Probabilistic Learning for solving the Uncapacitated Plant Cycle Location Problem
In this paper, we address the Uncapacitated Plant Cycle Location Problem. It is a location-routing problem aimed at determining a subset of locations to set up plants dedicated to serving customers. We propose a mathematical ...
A redistricting problem applied to meter reading in power distribution networks
(2014-01-01)
The capacitated redistricting problem (CRP) has the objective to redefine, under a given criterion, an initial set of districts of an urban area represented by a geographic network. Each node in the network has different ...
A redistricting problem applied to meter reading in power distribution networks
(2014-01-01)
The capacitated redistricting problem (CRP) has the objective to redefine, under a given criterion, an initial set of districts of an urban area represented by a geographic network. Each node in the network has different ...
Domain reduction using GRASP construction phase for transmission expansion planning problem
(2012-04-03)
This paper proposes a new strategy to reduce the combinatorial search space of a mixed integer linear programming (MILP) problem. The construction phase of greedy randomized adaptive search procedure (GRASP-CP) is employed ...
Domain reduction using GRASP construction phase for transmission expansion planning problem
(2012-04-03)
This paper proposes a new strategy to reduce the combinatorial search space of a mixed integer linear programming (MILP) problem. The construction phase of greedy randomized adaptive search procedure (GRASP-CP) is employed ...
Minimizing total tardiness in parallel machine scheduling with setup times: An adaptive memory-based GRASP approach
(Elsevier Science BvAmsterdamHolanda, 2007)
Grasp with memory-based mechanisms for minimizing total tardiness in single machine scheduling with setup times
(SpringerDordrechtHolanda, 2006)