TITLE

Dynamic Networks with Random Arc Capacities: Solution Methods and Applications

AUTHOR(S)
Cheung, Raymond K.
PUB. DATE
February 1994
SOURCE
Transportation Science;Feb94, Vol. 28 Issue 1, p82
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
Dynamic networks have long been proven to be an effective tool for numerous applications in areas of transportation, logistics, production planning, financial planning and communication systems. However, a vast majority of the research with dynamic networks focuses on deterministic models. In this article it focuses on the class of dynamic networks with random arc capacities. These networks can be used to model problems in dynamic fleet management and production and distribution planning. Within this framework, uncertain demand forecasts are modeled as arcs with random upper bounds. The result is typically a large-scale stochastic optimization problem.
ACCESSION #
4457841

 

Related Articles

  • A Stochastic, Dynamic Network Model for Railroad Car Distribution. Jordan, William C.; Turnquist, Mark A. // Transportation Science;May83, Vol. 17 Issue 2, p123 

    Freight cars represent a substantial portion of total railroad investment, and the low utilization of this major capital resource is certainly a contributing factor in the poor financial health of many railroads. A key element in improving utilization is the process of empty car redistribution....

  • Optimal Length Transportation Hypothesis to Model Proteasome Product Size Distribution. Zaikin, Alexey; Kurths, Juergen // Journal of Biological Physics;Jul2006, Vol. 32 Issue 3/4, p231 

    This paper discusses translocation features of the 20S proteasome in order to explain typical proteasome length distributions. We assume that the protein transport depends significantly on the fragment length with some optimal length which is transported most efficiently. By means of a simple...

  • Optimizing Empty Containers Distribution among Ports. Hajeeh, Mohammed A.; Behbehani, Weam // Journal of Mathematics & Statistics;2011, Vol. 7 Issue 3, p216 

    Problem statement: Empty containers are an essential part of the logistics of the movement, repositioning and distribution of containers. Optimizing the allocation and transportation of empty containers contributes significantly in reducing cost. Approach: A mathematical model is formulated with...

  • The Genetic Algorithm for Truck Dispatching Problems in Surface Mine. Ming-Xiang He; Jiu-Chuan Wei; Xin-Ming Lu; Bao-Xiang Huang // Information Technology Journal;2010, Vol. 9 Issue 4, p710 

    No abstract available.

  • THE A--FOREST ITERATION METHOD FOR THE STOCHASTlC GENERALIZED TRANSPORTATION PROBLEM. Qi, Liqun // Mathematics of Operations Research;Feb87, Vol. 12 Issue 1, p1 

    The stochastic generalized transportation problem (SGTP) is a stochastic program a with simple recourse where the master problem is a generalized transportation problem. The graph corresponding to an optimal solution of optimal solution of an SGTP can be characterized as an A-forest: each of its...

  • Time Minimizing Transportation Problems with Partial Limitations of Transported Amount for Transport Participants. Kolman, Pavel // AIP Conference Proceedings;2015, Vol. 1648 Issue 1, p1 

    In the field of transportation problems the most common optimization criterion is transportation costs minimization. However, there are situations where it is necessary to transport the materials quickly. This is especially in the case of transportation of perishable materials. In case the...

  • Bounded lower subdifferentiability optimization techniques: applications. Beliakov, Gleb; Ferrer, Albert // Journal of Global Optimization;Jun2010, Vol. 47 Issue 2, p211 

    In this article we develop a global optimization algorithm for quasiconvex programming where the objective function is a Lipschitz function which may have �flat parts�. We adapt the Extended Cutting Angle method to quasiconvex functions, which reduces significantly the number of...

  • Special Cases Solution of the Transport Problem. Amariei, Olga-Ioana; Gillich, Nicoleta; Hamat, Codruţa Oana // Analele Universitatii 'Eftimie Murgu';2015, Vol. 22 Issue 1, p35 

    In the present paper we are presenting an optimal way to solve the transport problems with intermediate centers, taking in consideration several approaches, using the Network Modelling Module of the WinQSB software. The transfer problem represents a special case of the transport problem, an...

  • TRANSPORTATION SIMPLEX (PRIMAL-DUAL) METHOD.  // Encyclopedia of Operations Research & Management Science;2001, p849 

    This entry discusses the transportation simplex method. The dual problem of the transportation problem's primal equation form is shown. The primal dual process is continuously repeated until an optimal solution comes out. Since transportation problems always has feasible solutions, optimal...

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics