Abstract

The abstract flow model deals with the flow  paths (routes) that satisfy the switching property. Contraflow is a widely accepted solution approach that increases the flow and decreases the evacuation time making the traffic smooth during evacuation by reversing the required road directions from the risk areas to the safe places. In this paper, we integrate the concepts of abstract flow and contraflow, give mathematical formulations of these models and present efficient algorithms for solving the abstract contraflow problems. The efficient solution procedures are presented for  maximum dynamic, lexicographically maximum and earliest arrival abstract contraflow  problems. This approach maximizes the flow value in given time and seeks to eliminate the crossing conflicts.

This work is licensed under a Creative Commons Attribution 4.0 License.