Full Text Available
Note: Clicking the button above will open the full text document at the original institutional repository in a new window.
Ant Colony Optimization approaches for the Sequential Ordering Problem
We present two algorithms within the framework of the Ant Colony Optimization (ACO) metaheuristic. The rst algorithm seeks to increase the exploration bias of Gambardella et al.'s (2012) Enhanced Ant Colony System (EACS) model, a model which heavily increases the exploitation bias of the already hi...
Saved in:
| Main Author: | |
|---|---|
| Format: | Thesis |
| Published: |
AUC Knowledge Fountain
2014
|
| Subjects: | |
| Tags: |
No Tags, Be the first to tag this record!
|
Similar Items: Ant Colony Optimization approaches for the Sequential Ordering Problem
- Validation of independent components using a hypothesis testing approach
- An ant colony optimisation approach to scheduling truck and drone delivery systems
- Constraints and invariance in target detection
- Optimal distributed generation location and sizing for loss minimization and voltage profile optimization using ant colony algorithm
- On alternative solution methods for solving approximate subproblems in SAO (Sequential Approximate Optimization)
- A population-based approach to sequential ordering problems