The Research on Railway Luggage & Package Shipping Plan Based on Service Network

2011 ◽  
Vol 135-136 ◽  
pp. 1087-1092
Author(s):  
Jin Zi Zheng ◽  
Jun Liu

Due to the particularity of railway luggage & package shipping organization and large requirement of luggage & package shipping, the problem of making luggage & package shipping plan is increasingly complex. In order to improve the efficiency of making luggage & package shipping plan and assist human work, this paper mainly discusses how to optimize the plan. Based on analyzing the characteristic of luggage & package shipping, this paper analyzes lots of factors that affects the rationality of the plan and establishes an optimization model with the objective of minimizing general cost based on service network, and then develops a Heuristic Algorithm. At last, the application of service network design model for luggage & package shipping and its solution approach are illustrated with the case.

2007 ◽  
Vol 24 (02) ◽  
pp. 161-179 ◽  
Author(s):  
ARNT-GUNNAR LIUM ◽  
TEODOR GABRIEL CRAINIC ◽  
STEIN W. WALLACE

Deterministic models, even if used repeatedly, will not capture the essence of planning in an uncertain world. Flexibility and robustness can only be properly valued in models that use stochastics explicitly, such as stochastic optimization models. However, it may also be very important to capture how the random phenomena are related to one another. In this article we show how the solution to a stochastic service network design model depends heavily on the correlation structure among the random demands. The major goal of this paper is to discuss why this happens, and to provide insights into the effects of correlations on solution structures. We illustrate by an example.


Author(s):  
José Miguel Quesada Pérez ◽  
Jean-Charles Lange ◽  
Jean-Sébastien Tancrez

Author(s):  
Mike Hewitt

The scheduled service network design problem (SSNDP) can support planning the transportation operations of consolidation carriers given shipment-level service commitments regarding available and due times. These available and due times impact transportation costs by constraining potential consolidation opportunities. However, such available and due times may be changed, either because of negotiations with customers or redesigned internal operations to increase shipment consolidation and reduce transportation costs. As changing these times can lead to customer service and operational issues, we presume a carrier seeks to do so for a limited number of shipments. We propose a new variant of the SSNDP, the flexible scheduled service network design problem, that identifies the shipments for which these times should be changed to minimize total transportation and handling costs. We present a solution approach for this problem that outperforms a commercial optimization solver on instances derived from the operations of a U.S. less-than-truckload freight transportation carrier. With an extensive computational study, we study the savings potential of leveraging flexibility and the operational settings that are fertile ground for doing so.


Sign in / Sign up

Export Citation Format

Share Document