Encontrados 21 documentos, a visualizar página 1 de 3

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...

Solving Hop-constrained MST problems with ACO

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...

Optimal formation Switching with collision avoidance and allowing variable agen...

Discrete and continuous dynamical systems: preface

These preface words, quoted in Francis Clarke's 1983 book, stroke a sensitive chord and set the tone for a vision fueling the construction of an extremely rich body of intertwined developments in nonsmooth analysis, optimization and control by a carefully networked community. This special issue comprises post-conference articles from a selection of works presented at the Workshop on Control, Nonsmooth Analys...

On the relation between inward pointing velocity conditions

Inward pointing velocity conditions are important in the study of whether trajectories remain within sets (the so-called invariance or viability) and also to establish constraint qualifications (CQ) under which necessary conditions of optimality for control problem can be guaranteed to be nondegenerate NCO or normal. In our research on nondegenerate NCO we have studied different types of CQs in the form of inwa...

A Biased Random Key Genetic Algorithm Approach for Unit Commitment Problem