Buscar
Mostrando ítems 1-10 de 93
Evolutionary multi-move path-relinking for transmission network expansion planning
(Ieee, 2010-01-01)
This paper presents the application of a new metaheuristic algorithm to solve the transmission expansion planning problem. A simple heuristic, using a relaxed network model associated with cost perturbation, is applied to ...
Evolutionary multi-move path-relinking for transmission network expansion planning
(2010-12-06)
This paper presents the application of a new metaheuristic algorithm to solve the transmission expansion planning problem. A simple heuristic, using a relaxed network model associated with cost perturbation, is applied to ...
Evolutionary multi-move path-relinking for transmission network expansion planning
(2010-12-06)
This paper presents the application of a new metaheuristic algorithm to solve the transmission expansion planning problem. A simple heuristic, using a relaxed network model associated with cost perturbation, is applied to ...
Aplicaçaõ das técnicas Path-relinking e Vocabulary buiding na melhoria de performance do algoritmo memético para o problema do caixeiro viajante assimétrico
(Universidade Federal do Rio Grande do NorteBRUFRNPrograma de Pós-Graduação em Matemática Aplicada e EstatísticaProbabilidade e Estatística; Modelagem Matemática, 2009-07-10)
The present essay shows strategies of improvement in a well succeded evolutionary metaheuristic to solve the Asymmetric Traveling Salesman Problem. Such steps consist in a Memetic Algorithm projected mainly to this problem. ...
GRASP with evolutionary path-relinking for the capacitated arc routing problem
(2011-10-31)
The Capacitated Arc Routing Problem (CARP) is a well-known NP-hard combinatorial optimization problem where, given an undirected graph, the objective is to find a minimum cost set of tours servicing a subset of required ...
GRASP with evolutionary path-relinking for the capacitated arc routing problem
(2011-10-31)
The Capacitated Arc Routing Problem (CARP) is a well-known NP-hard combinatorial optimization problem where, given an undirected graph, the objective is to find a minimum cost set of tours servicing a subset of required ...
GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem
(ELSEVIER SCIENCE BV, 2010)
This paper addresses the independent multi-plant, multi-period, and multi-item capacitated lot sizing problem where transfers between the plants are allowed. This is an NP-hard combinatorial optimization problem and few ...
DISEÑO RADIAL DE COMBUSTIBLE USANDO PATH RELINKING”
(2012-07-27)
El presente trabajo muestra los resultados obtenidos al implementar la técnica de optimización combinatoria conocida como Path Relinking (Re-encadenamiento de Trayectorias), al problema del diseño radial de ensambles de ...