An FPTAS for Quickest Multi-commodity Contraflow Problem with Asymmetric Transit Times
Keywords:
Asymmetric transit times, Contraflow, Network flow, Quickest multi-commodity, ∆-condensedAbstract
One of the challenges in operations research is to route numerous commodities from particular supply locations to the corresponding demand points across the lanes of a network infrastructure while maintaining capacity restrictions. The quickest multi-commodity flow problem would be one of those that reduces the time it takes to complete the process. Reorienting lanes toward demand sites can increase outbound lane capacity. The quickest multi-commodity contraflow problem is NP-hard computationally. We use a ∆-condensed time-expanded graph to propose an FPTAS for this problem by including the lane reversal technique. We look into asymmetric transit times on anti-parallel arcs to address the unequal road conditions and flow dependency.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2022 Institute of Science and Technology, T.U.
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
The copyright of the articles is held by the Institute of Science and Technology, Tribhuvan University (IoST- TU). The views and interpretations in this journal are those of the author(s). They are not attributable to the IoST-TU and do not imply the expression of any opinion concerning the legal status of any country, territory, city, area of its authorities, or concerning the delimitation of its frontiers or boundaries. The corresponding author is responsible for any conflict of interest between authors and others.
The articles in the Journal of Institute of Science and Technology are licensed under a Creative Commons Attribution- Share Alike 4.0 International License (CC: BY-NC), which permits use, distribution and reproduction in any medium or format, remix, transfer, and build upon the materials for any purpose, even commercially, provided the original work is properly cited.
