The continuous-time service network design problem

N Boland, M Hewitt, L Marshall… - Operations …, 2017 - pubsonline.informs.org
Consolidation carriers transport shipments that are small relative to trailer capacity. To be
cost effective, the carrier must consolidate shipments, which requires coordinating their …

A dynamic combined flow algorithm for the two-commodity max-flow problem over delay-tolerant networks

T Zhang, H Li, J Li, S Zhang… - IEEE transactions on …, 2018 - ieeexplore.ieee.org
The multi-commodity flow problem plays an important role in network optimization, routing,
and service scheduling. With the network partitioning and the intermittent connectivity, the …

Incorporating holding costs in continuous-time service network design: New model, relaxation, and exact algorithm

S Shu, Z Xu, R Baldacci - Transportation Science, 2024 - pubsonline.informs.org
The continuous-time service network design problem (CTSNDP) occurs widely in practice. It
aims to minimize the total operational cost by optimizing the schedules of transportation …

[書籍][B] Generalizations of flows over time with applications in evacuation optimization

JP Kappmeier - 2015 - depositonce.tu-berlin.de
Dynamic networks are one of the most important concepts in the field of combinatorial
optimization. Additionally to the graph structure they contain information about travel times of …

[HTML][HTML] Abstract flows over time: A first step towards solving dynamic packing problems

JPW Kappmeier, J Matuschke, B Peis - Theoretical Computer Science, 2014 - Elsevier
Flows over time generalize classic network flows by introducing a notion of time. Each arc is
equipped with a transit time that specifies how long flow takes to traverse it, while flow rates …

Scheduling for time-constrained big-file transfer over multiple paths in cloud computing

C Lin, Y Bi, G Han, J Yang, H Zhao… - IEEE Transactions on …, 2018 - ieeexplore.ieee.org
Enormous increase in the scale of big-file generated by cloud computing has brought many
challenges to both computational and transfer infrastructures. For large file transfer in cloud …

[PDF][PDF] Approximation algorithms for complex network flow over time problems

M Groß - 2014 - depositonce.tu-berlin.de
Networks are omnipresent in our current world--ranging from streets, railroads, gas and
water pipelines, power cables or applications in biology, chemistry or economy there are …

[PDF][PDF] Models and algorithms for flow over time problems

SP Gupta - 2023 - researchgate.net
One of the primary difficulties in operational research is routing multiple distinct commodities
from specific supply sources to the corresponding demand points via the lanes of an …

Scheduling algorithms for time-constrained big-file transfers in the Internet of Vehicles

C Lin, Y Bi, H Zhao, Z Wang… - … of Communications and …, 2017 - ieeexplore.ieee.org
In order to transfer large files and provide high-quality services in the IoV (Internet of
Vehicles), intelligent routing and scheduling are indispensable for fast transfers and efficient …

[書籍][B] Network flows and network design in theory and practice

J Matuschke - 2014 - books.google.com
Network flow and network design problems arise in various application areas of
combinatorial optimization, eg, in transportation, production, or telecommunication. This …