Network
instances type
Notation
- n: number of nodes
- m: number of arcs
- d: network density (d = m/n)
- k: number of criteria
- u: maximum arc cost, that is, the arc cost for each criteria are uniformly distributed over the set {1, …, u};
Arc orientation
- Arcs are oriented in direct networks, that is, (i, j) and (j, i) represent diferent arcs.
- Arcs are not oriented in undirected and acyclic networks
Network topology
|
|
Random: an Hamiltonian cycle is firstly generated to assure there is no superfluous nodes. The remainder arcs as well as the arc cost are randomly generated. |
|
|
|
Complete: the set of arcs is
{(i, j): i and j are two
different nodes of the network. Cost are
randomly generated. |
|
|
|
Square grid: Each node is
connected to his nearest neighbors in a square mesh. Costs are randomly
generated. |
|
