Lexicographically Maximum Contraflow Problem with Vertex Capacities

The contraflow approach has been extensively considered in the literature for modeling evacuations and has been claimed, due to its lane-direction-reversal capability, as an efficient idea to speed up the evacuation process. This paper considers the contraflow evacuation model on network with priori...

Full description

Saved in:
Bibliographic Details
Main Authors: Phanindra Prasad Bhandari, Shree Ram Khadka
Format: Article
Language:English
Published: Wiley 2021-01-01
Series:International Journal of Mathematics and Mathematical Sciences
Online Access:http://dx.doi.org/10.1155/2021/6651135
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1849400600066785280
author Phanindra Prasad Bhandari
Shree Ram Khadka
author_facet Phanindra Prasad Bhandari
Shree Ram Khadka
author_sort Phanindra Prasad Bhandari
collection DOAJ
description The contraflow approach has been extensively considered in the literature for modeling evacuations and has been claimed, due to its lane-direction-reversal capability, as an efficient idea to speed up the evacuation process. This paper considers the contraflow evacuation model on network with prioritized capacitated vertices that allows evacuees to be held at intermediate spots too, respecting their capacities and priority order. In particular, it studies the maximum flow evacuation planning problem and proposes polynomial and pseudo-polynomial time solution algorithms for static network and dynamic multinetwork, respectively. A real dataset of Kathmandu road network with evacuation spaces is considered to implement the algorithm designed for dynamic multinetwork and to observe its computational performance.
format Article
id doaj-art-8e07a66fdb594abfa7913b76a3d5079d
institution Kabale University
issn 0161-1712
1687-0425
language English
publishDate 2021-01-01
publisher Wiley
record_format Article
series International Journal of Mathematics and Mathematical Sciences
spelling doaj-art-8e07a66fdb594abfa7913b76a3d5079d2025-08-20T03:37:57ZengWileyInternational Journal of Mathematics and Mathematical Sciences0161-17121687-04252021-01-01202110.1155/2021/66511356651135Lexicographically Maximum Contraflow Problem with Vertex CapacitiesPhanindra Prasad Bhandari0Shree Ram Khadka1Central Department of Mathematics, Tribhuvan University Kathmandu, Kirtipur, NepalCentral Department of Mathematics, Tribhuvan University Kathmandu, Kirtipur, NepalThe contraflow approach has been extensively considered in the literature for modeling evacuations and has been claimed, due to its lane-direction-reversal capability, as an efficient idea to speed up the evacuation process. This paper considers the contraflow evacuation model on network with prioritized capacitated vertices that allows evacuees to be held at intermediate spots too, respecting their capacities and priority order. In particular, it studies the maximum flow evacuation planning problem and proposes polynomial and pseudo-polynomial time solution algorithms for static network and dynamic multinetwork, respectively. A real dataset of Kathmandu road network with evacuation spaces is considered to implement the algorithm designed for dynamic multinetwork and to observe its computational performance.http://dx.doi.org/10.1155/2021/6651135
spellingShingle Phanindra Prasad Bhandari
Shree Ram Khadka
Lexicographically Maximum Contraflow Problem with Vertex Capacities
International Journal of Mathematics and Mathematical Sciences
title Lexicographically Maximum Contraflow Problem with Vertex Capacities
title_full Lexicographically Maximum Contraflow Problem with Vertex Capacities
title_fullStr Lexicographically Maximum Contraflow Problem with Vertex Capacities
title_full_unstemmed Lexicographically Maximum Contraflow Problem with Vertex Capacities
title_short Lexicographically Maximum Contraflow Problem with Vertex Capacities
title_sort lexicographically maximum contraflow problem with vertex capacities
url http://dx.doi.org/10.1155/2021/6651135
work_keys_str_mv AT phanindraprasadbhandari lexicographicallymaximumcontraflowproblemwithvertexcapacities
AT shreeramkhadka lexicographicallymaximumcontraflowproblemwithvertexcapacities