Linear network optimization: algorithms and codes
Linear network optimization: algorithms and codes
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Journal of the ACM (JACM)
Expert Systems with Applications: An International Journal
| Hi-index | 0.98 |
In a general multimodal system, interface and interaction coordination involves the deliberate assembly of modal movement units MMU's (i.e., vessel, vehicle, or rail car) activities into schedules such that interfaces are facilitated, and the joint variable cost of coordination of intermodal interaction is minimized. In this paper, two methods of nonstochastic scheduling coordination are described, and their application in a globally integrated transport system network model is shown [1]. The first method expresses the scheduling problem in the form of the Hitchcock transportation problem in accordance with a method derived by Dantzig and Fulkerson [2]. The second method is derived from network flow theory and is based on the 'out-of-kilter' method devised by Fulkerson [3]. This paper seeks to provide a basis for implementing dedicated logistics submodels such as MMU and staff scheduling submodels, and to examine MMU staffing requirements on a selected real system. These minimize the ratio of labor for scheduling modal interactions, and modal coordination to the frequency of arrivals/departures at a consolidation node, thereby maximizing MMU availability, and minimizing MMU system maintenance costs.