Index Terms
- “The quickest transshipment problem”
Recommendations
A berth allocation planning problem with direct transshipment consideration
With the rapid development of container transport industry, container terminal systems have become more and more busy. Some measures and facilities are taken to improve the container throughput, such as Mega Ship, Mega Crane, Deep water Port, Automatic ...
A label-setting algorithm for finding a quickest path
The quickest path problem is to find a path to send a given amount of data from the source to the destination with minimum transmission time. To find the quickest path, existing algorithms enumerate nondominated paths with distinct capacity, and then ...
The Quickest Transshipment Problem
A dynamic network consists of a graph with capacities and transit times on its edges. The quickest transshipment problem is defined by a dynamic network with several sources and sinks; each source has a specified supply and each sink has a specified ...
Comments