Genetic algorithm for network cost minimization using threshold based discounting (Q1769997)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Genetic algorithm for network cost minimization using threshold based discounting |
scientific article; zbMATH DE number 2152450
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Genetic algorithm for network cost minimization using threshold based discounting |
scientific article; zbMATH DE number 2152450 |
Statements
Genetic algorithm for network cost minimization using threshold based discounting (English)
0 references
5 April 2005
0 references
This paper describes a genetic algorithm for a network flow problem. The key characteristic in this problem is that there may be a threshold associated to an arc such that if the amount of flow over an arc exceeds the corresponding threshold, a discount applies with respect to the costs. The solution of the linear programming relaxation of an integer formulation of the problem is used as a starting point for a genetic algorithm. Computational results are presented for instances with up to 25 nodes.
0 references
genetic algorithm
0 references
network problem
0 references
0.88118416
0 references
0 references
0.8738502
0 references
0 references
0 references
0 references
0.85700965
0 references
0.85693705
0 references
