Components

Introduction

There are several components implemented, which form the essential parts of each traffic model in MINAMI. The components usually have a base class, and the acutal implementation will inherit the base class, thus ensuring the uniformness of the interface. Here is the list we implemented:

  • Vehicle
  • Node
  • Link
  • Routing

Vehicle

class MNM_Veh

Vehicle class represents the vehicle in real world, but it can be 1/100 of one actual vehicle, therefore it is able to simulate the continuous vehicle flow in flow theory.

Current the vehicle class has in inheritance since we only implement the standard vehicle, the truck/bus will be implemented shortly. We describe the member variables in vehicle class as follows:

Vehicle_type m_type

specify the current link of vehicle, initialized as NULL, will be the pointer to the dlink object.

TInt m_start_time

specify the realse time of the vehicle.

TInt m_finish_time

specify the finish time of the vehicle, if not finished then set it as -1.

determined by the routing model and used by the node model.

MNM_Destination *m_dest

the destination of the vehicle, determined when the vehicle is released.

MNM_Origin *m_origin

the destination of the vehicle, determined when the vehicle is released.

Node

class MNM_Dnode

The node model will manage the vehicle movement, the node model is only responsible for the vehicles’ merging/diverging behaviors, the path of each vehicle is determined by the routing model.

TInt m_node_ID

node ID is used to identify the node.

contains the pointers for the in links, determined when hooking up the node and link.

contains the pointers for the out links, determined when hooking up the node and link.

TFlt m_flow_scalar

specify the quantity of one vehicle object, 2 means two MNM_Veh objects equal one actual vehicle.

Routing

class MNM_Routing

The routing class manages the paths of vehicles, it is the crutial part of the dynamic traffic assignment model. In our implementation, the routing model will take the network statistics as input and compute the routing for all finished vehicles on each link. Therefore the routing take place after the link loading but bofore the node loading.