Encontrados 32 documentos, a visualizar página 1 de 4

Concave Minimum Cost Network Flow Problems Solved with a Colony of Ants

In this work we address the Single-Source Uncapacitated Minimum Cost Network Flow Problem with concave cost functions. This problem is NP-hard, therefore we propose a hybrid heuristic to solve it. Our goal is not only to apply an Ant Colony Optimization (ACO) algorithm to such a problem, but also to provide an insight on the behaviour of the parameters in the performance of the algorithm. The performance of the...

Normal Forms of Necessary Conditions for Dynamic Optimization Problems with Pat...

There has been a longstanding interest in deriving conditions under which dynamic optimization problems are normal, that is, the necessary conditions of optimality (NCO) can be written with a nonzero multiplier associated with the objective function. This paper builds upon previous results on nondegenerate NCO for trajectory constrained optimal control problems to provide even stronger, normal forms of the cond...

Solving Hop-constrained MST problems with ACO

Optimal Control of Infinite-Horizon Growth Models - A Direct Approach

Optimal Control of Infinite-Horizon Growth Models - a direct approach

Recent Results on Approximate Optimization Methods for the Unit Commitment Problem

Ant Colony Optimization: a literature survey

Solving Concave Network Flow Problems

BRKGA adapted to multiobjective unit commitment problem Solving Pareto frontier...

Obstacle avoidance in optimal switching of a formation geometry