Genetic algorithm for network cost minimization using threshold based discounting (Q1769997): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2017796362 / rank | |||
Normal rank | |||
Latest revision as of 08:41, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Genetic algorithm for network cost minimization using threshold based discounting |
scientific article |
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
