Sciweavers

2180 search results - page 81 / 436
» Comparing bio-inspired algorithms in constrained optimizatio...
Sort
View
CP
2005
Springer
15 years 3 months ago
Solving Large-Scale Nonlinear Programming Problems by Constraint Partitioning
Abstract. In this paper, we present a constraint-partitioning approach for finding local optimal solutions of large-scale mixed-integer nonlinear programming problems (MINLPs). Ba...
Benjamin W. Wah, Yixin Chen
CP
2003
Springer
15 years 3 months ago
Cost-Based Filtering for Shorter Path Constraints
Abstract. Many real world problems, e.g. personnel scheduling and transportation planning, can be modeled naturally as Constrained Shortest Path Problems (CSPPs), i.e., as Shortest...
Meinolf Sellmann
HM
2005
Springer
97views Optimization» more  HM 2005»
15 years 3 months ago
Comparing Parallelization of an ACO: Message Passing vs. Shared Memory
We present a shared memory approach to the parallelization of the Ant Colony Optimization (ACO) metaheuristic and a performance comparison with an existing message passing implemen...
Pierre Delisle, Marc Gravel, Michaël Krajecki...
KDD
2007
ACM
197views Data Mining» more  KDD 2007»
15 years 10 months ago
Learning the kernel matrix in discriminant analysis via quadratically constrained quadratic programming
The kernel function plays a central role in kernel methods. In this paper, we consider the automated learning of the kernel matrix over a convex combination of pre-specified kerne...
Jieping Ye, Shuiwang Ji, Jianhui Chen
EOR
2008
140views more  EOR 2008»
14 years 9 months ago
Combining two pheromone structures for solving the car sequencing problem with Ant Colony Optimization
The car sequencing problem involves scheduling cars along an assembly line while satisfying capacity constraints. In this paper, we describe an Ant Colony Optimization (ACO) algor...
Christine Solnon