Dynamic Multicommodity Contraflow Problem with Asymmetric Transit Times
A maximum dynamic multicommodity flow problem concerns with the transportation of several different commodities through the specific source-sink path of an underlying capacity network with the objective of maximizing the sum of commodity flows within a given time horizon. Motivated by the uneven roa...
Saved in:
| Main Authors: | Shiva Prakash Gupta, Urmila Pyakurel, Tanka Nath Dhamala |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2022-01-01
|
| Series: | Journal of Applied Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2022/3697141 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Network Reconfiguration with Orientation-Dependent Transit Times
by: Hari Nandan Nath, et al.
Published: (2021-01-01) -
Lexicographically Maximum Contraflow Problem with Vertex Capacities
by: Phanindra Prasad Bhandari, et al.
Published: (2021-01-01) -
Solving of the problem of heating process of prismatic alloys and slugs in regime of contraflow
by: Ju. S. Postolnik, et al.
Published: (2003-05-01) -
A Graph-Induced Neighborhood Search Heuristic for the Capacitated Multicommodity Network Design Problem
by: Houshan Zhang
Published: (2025-02-01) -
An Improved Differential Evolution Algorithm for a Multicommodity Location-Inventory Problem with False Failure Returns
by: Congdong Li, et al.
Published: (2018-01-01)