A Study on The Dynamic Network Flow Problems
With Applications to The Dynamic Resource Managment in Logistics Networks
Versandkostenfrei!
Versandfertig in 6-10 Tagen
44,99 €
inkl. MwSt.
PAYBACK Punkte
22 °P sammeln!
How to manage resources efficiently is an essential problem for logistics service operators. The developments in information and communication technologies have created new opportunities for managing resources dynamically so as more efficient than the static ways. While real-time tracking of shipment and equipment status allows the planning and control of the resources to be more responsive to changes, on the other hand, however, managing resources dynamically is increasingly complex and difficult because of the uncertainty lies in demands, costs or transportation times. This study is motivate...
How to manage resources efficiently is an essential problem for logistics service operators. The developments in information and communication technologies have created new opportunities for managing resources dynamically so as more efficient than the static ways. While real-time tracking of shipment and equipment status allows the planning and control of the resources to be more responsive to changes, on the other hand, however, managing resources dynamically is increasingly complex and difficult because of the uncertainty lies in demands, costs or transportation times. This study is motivated to model, analyze, and provide a method on managing the flow dynamically by leveraging the capability of obtaining real-time information. In particular, we look at the flow management problems over dynamic stochastic networks. We consider the problems of managing single resource flow as well as the problem of multiple resources flow, and introduce a new idea to capture the dynamism of the managing decision process under uncertain environment. We hope this study can stimulate more research on this kind of methods and its variants that can be applied in more than logistics management problems.
Andere Kunden interessierten sich für
