Buscar
Mostrando ítems 1-10 de 1638
Column generaton methods assignment problemsMétodos de geração de colunas para problemas de atribuição
(2007-01-01)
This work presents column generation methods for two important assignment problems: the Generalized Assignment Problem (GAP) and the problem of assigning calls to switches in cellular mobile networks (PAGS) G4P is one of ...
A Useful Metaheuristic for Dynamic Channel Assignment in Mobile Cellular Systems
The prime objective of a Channel Assignment Problem (CAP) is to assign appropriate number of required channels to each cell in a way to achieve both efficient frequency spectrum utilization and minimization of interference ...
Survivable capacitated network design problem: new formulation and Lagrangean relaxation
(PALGRAVE MACMILLAN LTD, 2000)
This work is focused on the analysis of the survivable capacitated network design problem. This problem can be stated as follows: Given a supply network with point-to-point traffic demands, specific survivability requirements, ...
A strategic model of freight operations for rail transportation systems
(TAYLOR & FRANCIS LTD, 2004)
This paper formulates and analyzes a new strategic model for freight rail transportation systems. The objective of the model is predicting equilibrium flows and levels of service, given origin-destination (O-D) transportation ...
A frequency-based assignment model for congested transit networks with strict capacity constraints: characterization and computation of equilibria
(PERGAMON-ELSEVIER SCIENCE LTD, 2006-07)
This paper concerns a frequency-based route choice model for congested transit networks, which takes into account the consequences of congestion on the predicted flows as well as on the expected waiting and travel times. ...
Lagrangian heuristic for a class of the generalized assignment problems
(Pergamon-Elsevier B.V. Ltd, 2010-08-01)
A Lagrangian based heuristic is proposed for many-to-many assignment problems taking into account capacity limits for task and agents. A modified Lagrangian bound studied earlier by the authors is presented and a greedy ...
Lagrangian heuristic for a class of the generalized assignment problems
(Pergamon-Elsevier B.V. Ltd, 2010-08-01)
A Lagrangian based heuristic is proposed for many-to-many assignment problems taking into account capacity limits for task and agents. A modified Lagrangian bound studied earlier by the authors is presented and a greedy ...
A Double-Auction Mechanism for Distribution of Electrical Supply Capacities among Enterprises of an Industrial Park
(Institute of Electrical and Electronics Engineers, 2021-05)
Typically, an industry contracts a given electrical supply capacity to the energy distribution company for a relatively long time period. Such kind of contract is often expensive for the industry, because large supply ...
Métodos de geração de colunas para problemas de atribuição
(Associação Brasileira de Engenharia de Produção, 2007-04-01)
Este trabalho apresenta métodos de geração de colunas para dois importantes problemas de atribuição: o Problema Generalizado de Atribuição (PGA) e o Problema de Atribuição de Antenas a Comutadores (PAAC). O PGA é um dos ...
Métodos de geração de colunas para problemas de atribuição
(Associação Brasileira de Engenharia de Produção, 2007-04-01)
Este trabalho apresenta métodos de geração de colunas para dois importantes problemas de atribuição: o Problema Generalizado de Atribuição (PGA) e o Problema de Atribuição de Antenas a Comutadores (PAAC). O PGA é um dos ...