Defines the allowed coordinate types The root element of a network definition tree. Defines the topology of a network: Nodes and connections between them. Defines all nodes together with their locations and options. Defines a single node. Defines the coordinates of the node (only used for visualization purposes). Pixel coordinates can have any value. For geographical coordinates, this is the longitude in (-180,180], where locations west of Greenwich have negative x-coordinates. Pixel coordinates can have any value. For geographical coordinates, this is the latitude in [-90,90], where locations south of the equator have negative y-coordinates. The identifier of the node. The identifier must be unique within all the nodes. Defines the links in the network Defines a single link. The identifier of the source node. The identifier of the target node. Cost incurred by any unit of flow (in terms of routing unit 1) using the link. Cost incurred if this link is included in the final solution topology. Pre-installed capacity installed on this link, which can be used for expansion planning problems or for allocation problems. This module also includes the cost associated with the pre-installed capacity. A link with positive preinstalled capacity must be included in every solution with at least that capacity. Additional capacity may be installed as specified by the additional modules. Defines the pre-installed capacity installed on this link. The cost associated with the pre-installed link capacity. Note that this is a constant term included in the cost of every feasible solution, which is only included for the sake of completeness to get the total network cost in expansion planning problems. Defines a set of capacity modules which can be installed on a link in addition to the preinstalled capacity. Defines a single capacity module. Defines the capacity of a module which can be installed on the link (in addition to the pre-installed capacity). The interpretation of the capacities (whether multiples are allowed or not) depends on the link-capacity-model. The cost associated with each unit of the additional capacity. The identifier of the link, which must be unique within all the links. Collects some top level meta information about this demand matrix. Collects some top level meta data about a demand matrix. Specifies over which time horizon the demands have been averaged (optional) Specifies the point in time the data has been collected (optional) Specifies the unit of the demand data (optional) Specifies the origin of the data (optional) Defines the demands which have to be routed through the network. Defines a single demand. The identifier of the source node. The identifier of the source node. The individual routing unit of this demand. The total capacity of any link must be at least the sum of all flows through this link, multiplied with the corresponding routingUnits. With an integer routing model, each demand must be routed in integer units of its routing unit, i.e., in a bifurcated for this demand, the flow on each path of the routing must be an integer multiple of the routing unit. Furthermore, with an integer routing, for each demand routed over a given link, the link must have enough capacity provided by modules whose capacity is at least the routing unit of each demand. If all your demands have the same granularity, simply set all routing units to 1. This parameter value is interpreted for a specific demand such that at least routingUnit times demandValue many units must be routed through the network during normal operation (where all network components are active). Defines the set of admissible paths for a demand. Defines a single admissible path. Defines a link used in the path. The identifier of the path. The identifier must be unique within all the paths of a single demand. The maximum number of links used on a path to route this demand. The parameter maxPathLength is interpreted for a specific demand such that none of the routing paths of this demand consists of more than maxPathLength many links during normal operation. If no path length restrictions need to be considered this element is omitted. The identifier of the demand, which must be unique within all the demands.