Optimal allocation of limited and random network resources to discrete stochastic demands for standardized cargo transportation networks

The authors consider the resource allocation problem with discrete random demands and discrete random resource capacities for standardized cargo transportation networks, in which a freight operator needs to determine the integral quantity of booking requests to be accepted for each product to maximize the expected profit. The authors formulate the problem as a stochastic integer programming model and provide theoretical results that completely characterize the optimal solution to the stochastic model under a special case. The authors present a progressive augmentation algorithm and a sampling based method for solving the stochastic model under a general case. The authors also offer numerical experiments to test the two methods and shed light on their performances.

• Record URL:
  https://doi.org/10.1016/j.trb.2016.06.002
• Record URL:
  http://www.sciencedirect.com/science/article/pii/S0191261516301321
• Availability:
  • Find a library where document is available. Order URL: http://worldcat.org/issn/01912615
• Supplemental Notes:
  • Abstract reprinted with permission of Elsevier.
• Authors:
  • Wang, Xinchang
• Publication Date: 2016-9

Language

• English

Media Info

• Media Type: Web
• Features: Appendices; Figures; References; Tables;
• Pagination: pp 310-331
• Serial:
  • Transportation Research Part B: Methodological
  • Volume: 91
  • Publisher: Elsevier
  • ISSN: 0191-2615
  • Serial URL: http://www.sciencedirect.com/science/journal/01912615

Subject/Index Terms

• TRT Terms: Cargo handling; Demand; Freight transportation; Integer programming; Networks; Optimization; Resource allocation; Stochastic processes; Yield management
• Subject Areas: Freight Transportation; Planning and Forecasting;

Filing Info

• Accession Number: 01608796
• Record Type: Publication
• Files: TRIS
• Created Date: Aug 4 2016 4:50PM