A chance-constrained stochastic approach to intermodal container routing problems

PLOS ONE, Feb 2018

We consider a container routing problem with stochastic time variables in a sea-rail intermodal transportation system. The problem is formulated as a binary integer chance-constrained programming model including stochastic travel times and stochastic transfer time, with the objective of minimising the expected total cost. Two chance constraints are proposed to ensure that the container service satisfies ship fulfilment and cargo on-time delivery with pre-specified probabilities. A hybrid heuristic algorithm is employed to solve the binary integer chance-constrained programming model. Two case studies are conducted to demonstrate the feasibility of the proposed model and to analyse the impact of stochastic variables and chance-constraints on the optimal solution and total cost.

A PDF file should load here. If you do not see its contents the file may be temporarily unavailable at the journal website or you do not have a PDF plug-in installed and enabled in your browser.

Alternatively, you can download the file locally and open with any standalone PDF reader:

http://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0192275&type=printable

A chance-constrained stochastic approach to intermodal container routing problems

February A chance-constrained stochastic approach to intermodal container routing problems Yi Zhao 0 Ronghui Liu Xi Zhang 0 Anthony Whiteing Lazaros K. Gallos, Rutgers The State University of New Jersey, UNITED STATES 0 School of traffic and transportation Beijing Jiaotong University , Beijing , China , 2 Institute for Transport Studies, University of Leeds , Leeds , United Kingdom We consider a container routing problem with stochastic time variables in a sea-rail intermodal transportation system. The problem is formulated as a binary integer chance-constrained programming model including stochastic travel times and stochastic transfer time, with the objective of minimising the expected total cost. Two chance constraints are proposed to ensure that the container service satisfies ship fulfilment and cargo on-time delivery with pre-specified probabilities. A hybrid heuristic algorithm is employed to solve the binary integer chance-constrained programming model. Two case studies are conducted to demonstrate the feasibility of the proposed model and to analyse the impact of stochastic variables and chance-constraints on the optimal solution and total cost. - Data Availability Statement: All relevant data are within the paper and its Supporting Information files. Funding: China Scholarship Council (http://en.csc. edu.cn/) sponsored a visiting scholarship to YZ (the first author) which enabled him to spend a year visiting the University of Leeds where he was supervised by RL and AEW and conducted the research reported in this paper. UK Rail Safety and Standards Board (https://www.rssb.co.uk/) Project T1071 provided financial support to RL and AEW. The funders had no role in study design, data Introduction In recent decades, international trade has been growing rapidly throughout the world. At the same time, the development of intermodal logistics has offered opportunities for freight companies to replan their operations. The Intermodal freight transportation (IFT), defined as the transportation of cargoes by two or more different modes of transport [1±2], is a relatively young domain [ 3 ]. Generally, there are five key research issues on intermodal transportation as summarised in [ 4 ]. (i) Intermodal transportation policy: to analyse the effect of different policies on intermodal transportation, such as tax changes, train speed changes, train length changes, service quality changes and new infrastructure investment. (ii) Intermodal network design: to address how to construct or improve intermodal transportation infrastructure in order to satisfy the demands and optimize the objective criteria [ 5 ]. (iii) Intermodal service design: to decide on issues such as service frequency and terminal operation [ 6 ]. (iv) Intermodal routing problem: to specify the routes to transport each demand from its origin to its destination through an intermodal network. (v) Empty container repositioning: to optimize the reposition plan in order to meet forecast demand and to minimise repositioning costs. collection and analysis, decision to publish, or preparation of the manuscript. This paper focuses on issue (iv), i.e. the intermodal freight routing problem, and more specifically the intermodal cargo routing problem. As a cargo loading unit usually refers to a standardized container measured in Twenty-foot Equivalent Units (TEU), we limit our study scope to the intermodal container routing problem (ICRP) in this paper. The ICRP is described as the need to specify the container route that minimises the total transportation cost while satisfying delivery time constraints for each container freight demand. Table 1 lists the key literature on ICRP in terms of the stochasticity represented. The pioneering work of Barnhart and Ratliff [7] considered an ICRP which involves trailers and containers in a truck and rail IFT system. They formulated the ICRP as a shortest path problem minimising the sum of transportation cost and inventory cost and solved it by the weighted b-matching algorithm. The literatures that followed can be broadly classified as single-objective ICRP and multiobjective ICRP. The single-objective ICRP is usually to minimise the total cost, while the multi-objective ICRP is usually to minimise both transportation cost and travel time [ 8 ] or the weighted sum of the two [ 9 ]. For single-objective ICRPs, Ayar and Yaman [ 10 ] formulated the ICRP in a truck-ship intermodal network as a multi-commodity routing problem with a single objective to minimise the sum of transportation cost and inventory cost, where the transportation modes and routes were determined for each commodity. Ziliaskopoulos and Wardell [ 11 ] proposed a label correcting algorithm (i.e. scanning an eligible list) to find the least-time paths from origin nodes to destination nodes in a time-dependent intermodal network, with the objective to minimise the total travel time. The model was tested on several realistic networks with 50, 100, 500 and 1000 nodes, respectively. For multi-objective ICRPs, Cho et al. [ 8 ] formulated an integer programming model which considered export and import containers simultaneously. A label setting algorithm was applied to get the Pareto optimal solutions, and the model was demonstrated in a large-scale ship-railway-air network between Busan and Rotterdam. Chang [ 9 ] considered a container routing problem for minimising transportation cost and travel time in a truck-ship-air intermodal network, and formulated a multi-commodity flow problem with time window constraint, where each commodity represented a single origin-destination demand. The problem was formulated as a mixed integer nonlinear programming model and a heuristic algorithm, with relaxation and decomposition is proposed to solve the problem. In addition to travel time and cost, other factors have been taken into account as objectives in ICRP, such as travel time variability [ 12 ], risk [ 13 ] and CO2 emission [ 14 ]. The ICRPs were also combined with other relevant IFT problems, such as empty container reposition [ 15 ] and service network design [16±18]. Meng et al. [ 15 ] developed a mixed integer linear programming model for the routing of both laden containers and empty containers. Besides, the model determined the number of empty containers loaded, unloaded and transhipped at seaports simultaneously in an inland-maritime network. Crainic et al. [ 16 ] established a mixed integer Problems No No No No Yes nonlinear programming model to solve the problems of service design, freight routing and terminal policies with decomposition and column generation principles. An extension of this work was presented by Crainic et al. [ 17 ], who formulated an integer nonlinear programming to assign multi-commodity freight to a multimodal transportation network taking into consideration the operating cost, delay cost and energy consumption. Kim et al. [ 18 ] constructed a mixed integer programming to determine the transportation flow quantity and transportation mode on each route in a truck-rail intermodal network in Korea. The objective was to minimise the system cost with the limitation of cargo volumes at seaports and number of vehicles at each mode. Riessen et al. [ 19 ] combined a path based formulation and a minimum flow network formulation to design a service network in Europe taking into consideration both selfoperated service and subcontracted service, with specified routes of freight. All the above literature considered ICRP under deterministic conditions, where travel times and transfer times were treated as deterministic and represented an average condition. In practice, however, container transportation is full of unpredictable and stochastic elements. For example, Li et al. [ 20 ] described the uncertainty in the planning of transit itinerary and proposed a two-phase approach to find the best transit itineraries under uncertainty. Meng et al. [ 3 ] reviewed the routing and scheduling problem in container maritime transportation and concluded there are many uncertainties in container transportation. Travel time is perhaps the most uncertain factor in intermodal container transportation. For example, in the railway freight system, due to the lower priority of freight transportation, the travel time of freight trains is frequently impacted by passenger trains. As a result, it is difficult to ensure the punctuality of freight trains. While in the maritime system, travel time is also stochastic because of unexpected weather conditions, for example. In addition, container transfer time can also be variable due to different employee productivity. Such variabilities in an IFT system directly affect the chances of achieving good service connections and on-time delivery, and as such are a major concern for freight companies. Therefore, it is essential to consider the stochasticity of travel time and transfer time in container transportation, especially in a rail-sea transportation system. So far, there has been limited research on this issue, as noted in Demir et al. [ 14 ], Min [ 13 ], and Dong [ 21 ]. Specifically, Demir et al. [ 14 ] constructed a mixed integer nonlinear programming model for a green intermodal service network design problem with time uncertainty and demand uncertainty. A sample average approximation method was applied to solve the problem and minimise the total cost including transportation cost, transhipment cost, delayed cost and CO2 emissions-related cost. In Min [ 13 ], a chance-constrained goal programming was constructed to select the best intermodal route in order to minimise cost and risk as well as satisfy on-time delivery requirement. Dong [ 21 ] presented a two stage stochastic programming model to deal with both service capacity planning and container routing, taking into account uncertain demand. A Progressive Hedging Algorithm (PHA) was employed to solve the problem. High efficiency algorithms are crucial for generating a practical container routing plan. There has been extensive research on exact algorithms, such as branch and bound algorithms, cutting-plane methods, dynamic programming algorithms [ 8 ] and column generation algorithms [ 16 ]. However, as the container routing problem in real life is NP-hard, exact algorithms cannot compute the optimal solution efficiently and thus approximate algorithms are called for. Heuristic algorithms have been developed by Chang, Dong, Meng et al. and Moccia et al [9, 15, 21±22]. Some of these algorithms are combined with the decomposition technique, such as Lagrangian relaxation and Progressive hedging algorithm (PHA). In Chang [ 9 ], Lagrangian relaxation was used to separate the initial problem into two sub-problems which were solved by different exact algorithms. A Progressive hedging algorithm (PHA) was 3 / 22 employed by Dong [ 21 ] to decompose large scale problems. Besides, there are also other approximation algorithms such as Sample Average Approximation [ 14 ] and comprehensive evaluation methods [ 12 ]. For example, Yang et al. [ 12 ] presented an intermodal network optimization model based on goal programming to evaluate the objective value of 36 alternative routes from China to India considering transportation cost, transit time and travel time variability. The model was tested on a real intermodal network with two Chinese origins and four Indian destinations. In intermodal container transportation, the transportation time consists of travel time by different modes and transfer time between different modes, which can both affect the probability of on-time delivery and the feasibility of container route plan. Thus the complexity of robust container route plan lies in taking into account stochastic travel time and stochastic transfer time simultaneously. However, most literatures only consider one of them. In response to the complexity, this paper presents a chance constrained programming to deal with the container routing problem with respect to laden export container cargo and stochastic time parameters in an intermodal sea-rail network. The aim is to select the best routes for each container demand transported from its origin to its destination by rail and sea. The travel time and transfer time are treated as random variables. The proposed methodology will be demonstrated by one small-scale case and one practical sized case respectively, where both the deterministic situation and the stochastic situation are considered. The effects of stochastic time parameters on the optimal solution, and the relationships between cost and stochasticity, are also discussed. The contribution of this paper is threefold: (1) formulating a chance-constrained programming problem for the ICRP with stochastic travel times and stochastic transfer time; (2) proposing a hybrid heuristic algorithm to solve the problem; and (3) examining the effects of stochastic variables on different types of system costs and on cargo delivery punctuality. The rest of this paper is organised as follows. Section Problem statement introduces the container routing problem with stochastic time variables. Section A dual chance-constrained ICRP with stochastic time variables formulates the binary integer chance-constrained programming model for the ICRP with stochasticity. Section A hybrid heuristic solution algorithm describes the proposed hybrid solution method, while Section Numerical example presents a numerical example to illustrate the workings of the model and conducts sensitivity tests on the model parameters. Finally, Section Conclusion summaries the findings and highlights future research directions. Problem statement Intermodal container routing in a sea-rail network is complicated by three characteristics. First, Compared with other bulk freight transportation, containerized traffic is often more time-sensitive: goods in the container may be perishable or consumer goods with a short life cycle. Hence the delivery time of each demand is an important consideration in the routing problem. This requires simultaneous minimization of travel cost and on-time arrival with a predetermined punctuality. Second, in a sea-rail intermodal system, the transportation services usually follow fixed schedules and are less flexible than road services. Thus, the punctuality of services becomes extremely important. Unexpected delay on railway or at transfer sea ports may lead to missing scheduled sea sailings which depart according to fixed schedules. Third, Because of the transhipment between trains and ships, the component costs of intermodal container transportation include not only the transportation costs, but also inventory and transfer costs. The container routing problem addressed in this research is to select the minimal-cost routes considering stochastic travel time variables for total container demand originating from multiple inland railway stations and destining to a single foreign seaport in a sea-rail network. 4 / 22 To illustrate the problem, we first consider the case from a single origin to a single destination. Fig 1 illustrates a sea-rail network with a single origin A, two rail loading locations B and C, two hubs D and E where container cargoes can transfer between different modes, and one destination F. An export container cargo from A to F (or AF for short) can take the following twelve possible routes. A T!rainB T!rainD Shi!p…1=2=3† F A T!rain C T!rainD Shi!p…1=2=3† F A Tr!ain B Tr!ain E Shi!p…4=5=6† F A Tr!ain C Tr!ainE Shi!p…4=5=6† F For each container demand, there is a scheduled departure time at the origin railway station, and a promised delivery time at the destination port. Early departure is forbidden while late delivery is allowed but incurs penalty. For demand AF, assuming the optimal route is A T!rainC T!rainE S!hip4F Fig 1. An illustration of a rail-sea intermodal freight transportation network. 5 / 22 Let TdAF denote the train departure time at origin A, tAC and tCE respectively the travel time on rail links AC and CE, tE the transfer time at port E, and T4EF the scheduled departure time of ship 4 from port E. In deterministic circumstance, the constraint below should be satisfied to ensure that the container demand AF can catch the ship. TdAF ‡ tAC ‡ tCE ‡ tE TEF 4 Such constraint could be violated when the train travel times and transfer time are uncertain. In this paper, the travel time by train/ship and the transfer time at hubs are defined as random variables which follow normal distribution and uniform distribution, respectively. Assuming all the ships depart on time according to fixed schedules, the two chance constraints in Eqs (2)±(3) based on stochastic time variables are considered for cargo demand AF. Eq (2) sets out that the required probability that cargo AF can board the ship before the scheduled departure is higher than a given confidence level α. Eq (3) requires a confidence level by which the cargo AF arrives at the destination port by the promised delivery time no lower than β, where TpAF is the promised delivery time. PrfTdAF ‡ tAC ‡ tCE ‡ tE T4EFg a PrfTdAF ‡ tAC ‡ tCE ‡ tE ‡ t4EF TpAFg b …1† …2† …3† Based on the above constraints, a chance constrained programming of ICRP is formulated, which takes into account stochastic travel times on the railway and at sea, as well as stochastic transfer time at hubs. We present the model formulation in Section A dual chance-constrained ICRP with stochastic time variables below and a solution algorithm based on Monte-Carlo simulation in combination with a neural network in Section A hybrid heuristic solution algorithm. A dual chance-constrained ICRP with stochastic time variables In stochastic optimization, there are broadly three types of stochastic programming methods: expected value models, chance constrained programming, and dependent chance programming [ 23 ]. The chance constrained programming was first proposed in Charnes and Cooper [24] to solve optimization problems under various uncertain circumstances and to ensure that the decisions meet certain constraints with certain levels. The model has been applied widely in different subject areas, such as in biology [ 25 ], finance [ 26 ] and transportation [ 27 ]. In this paper, we formulate our stochastic ICRP problem as a chance-constrained optimisation model, in the sea-rail intermodal network. The sea-rail intermodal network is modelled as a directed graph G = (N, A). The set N of nodes represents the railway stations, transfer hubs and seaports, while the set A of arcs denotes railway arcs and ship arcs. Before proposing the chance constrained programming model for the container routing problem with stochastic parameters, we define the notations to be used as shown in Table 2. Notations (Continued) PLOS ONE | https://doi.org/10.1371/journal.pone.0192275 7 / 22 A chance-constrained optimisation formulation Our problem is formulated based on the following assumptions: Assumption 1: The cargo demands are represented in TEU. Assumption 2: All containers depart from their origins on time. Assumption 3: A container missing its succeeding ship service is treated as an unfulfilled demand and incurs a fixed penalty cost. Assumption 4: The railway transportation cost on arcs per container is proportional to the arc length. Assumption 5: The travel time ta on a railway link a follows a normal distribution [ 28 ], i.e. ta * N(μa, σa) with μa the mean travel time and sa ˆ f sa0 the standard deviation on link a, where sa0 ˆ 1 hour and f is a multiplier. The sea travel time tshd by ship s also follows a normal distribution, i.e. tshd N…ms; ss† with μs the mean and ss ˆ f ss0 standard deviation, where ss0 ˆ 1 day and f is a multiplier [ 29 ]. Assumption 6: The transfer time at a hub h follows a uniform distribution [ 30 ], i.e. th * U(mh, nh), where mh and nh denote the minimum and maximum values of the distribution respectively. Assumption 1 and Assumption 2 are common to model the characteristic of container demand in the literature on ICRP. Assumption 3 ensures that the container missing ship service is modelled, which leads to a penalty cost as a part of operation cost. Assumption 4 is in line with railway transportation practice that unit transportation cost is fixed and proportion to travel distance. For railway transportation, there are two types of delay. One is that trains are affected directly by some reasons, such as bad weather, staff operation mistakes, dispatching mistakes and infrastructure reconstruction. The other one is that trains are affected by other delayed trains. Both the two delays can result in stochastic travel time. For maritime transportation, the total cruise time consists of port service time and travel time between ports, which can be highly variable due to congestion, handling operation and adverse weather. Therefore, Assumption 5 describes the travel times by rail and sea as random variables following different normal distribution. Assumption 6 describes the transfer time as a random variable following a uniform distribution to model uncertainty at hubs, e.g., congestion, disruption and handling. The objective function is the expected value of total cost which contains five elements: transportation cost, transfer cost, inventory cost, late delivery penalty cost and non-fulfilment penalty cost. For each unit of demand between origin o and destination d, these costs are represented as follows. (i) Transportation cost: X X k2Rod a2A X X need to be transferred between different modes at transfer hubs. Thus, the transfer cost in Eq (5) is incurred by moving all container demands from rail terminals to seaports as well as loading and unloading operation. (iii) Inventory cost: ‡ min…god; 0† zhosd Tshd ‡ tshd ; o 2 O; d 2 D Inventory cost is incurred by containers waiting to be transferred or picked up. In the model, we only consider the inventory cost in transfer hubs (as in the first term) and destination ports (as in the second term). (iv) Late delivery penalty cost: ZodcI X X …6† …7† …8† …9† …10† X qodzhosd ˆ qshd; h 2 H; d 2 D; s 2 S Constraints (16)-(17) ensure that the cargo od transported by preceding railway services can catch the ensuing ship services with a possibility of at least α. If the cargo od missed the ensuing ship service, it will be viewed as an unfulfilled demand leading to a non-fulfilment penalty cost. (d) On-time delivery chance constraint: Constraint (18) ensures that the cargo od can arrive at the destination seaport before the promised delivery time with a possibility of at least β. Late arrival is allowed but leads to a penalty cost which is proportional to late delivery time. Constraints (11) and (12) respectively ensure flow conversation on railway arcs and ship arcs. (b) Capacity constraints: Constraints (13)-(14) respectively ensure that the flows on railway arc a and ship s are within the transportation capacity, while constraint (15) makes sure the flow at the hub h is within the transfer capacity. (c) Ship fulfilment chance constraint: PrfTdod ‡ yhodth zhosdTshdg a; o 2 O; d 2 D X X (e) Relationship between the decision variables and the uniqueness of the decisions: X s2S X zhosd ˆ yhod; o 2 O; d 2 D; h 2 H X X X A hybrid heuristic solution algorithm Generally, a large-scale stochastic binary integer programming problem such as the one proposed above is NP-hard. There have been many studies dedicated to developing efficient solution methods for such problems, for example Liu [ 23 ], Pagnoncelli et al. [ 31 ], Hvattum and Løkketangen [ 32 ], Yang et al. [ 33 ], Cao et al. [ 34 ], and Wang et al [ 35 ]. In this paper, we adopt the hybrid heuristic algorithm proposed by Liu [ 23 ] to solve our proposed chance-constrained stochastic rail-sea ICRP. The algorithm is composed of three parts: (1) a k-shortest path algorithm for identifying the candidate routes in the railway network; (2) a stochastic simulation model (i.e. Monte-Carlo simulation) for approximating the uncertainty functions and training a neural network; and (3) a genetic algorithm for searching for the optimal solution. The procedure of the algorithm is described as follows. Step 1: The k-shortest path algorithm is employed to generate the set Rod of candidate routes among all feasible routes in advance. In order to avoid searching feasible routes repeatedly, a set of k shortest paths for each cargo is first calculated using the algorithm proposed by Yen [ 36 ]. Step 2: The Monte-Carlo simulation is first employed to generate the random input variables and joint distributions and to compute the expected value of objective function and the probability of chance constraints. Such data is used as training data to calibrate the coefficients of the neural network. The trained neural network is then employed to approximate the uncertainty functions with a high computation speed and thus improve the computational efficiency of the solution algorithm. Step 3: Combined with the trained neural network, a genetic algorithm is used to solve the chance-constrained programming model. This combined Monte-Carlo, neural network and genetic algorithm forms the basis of the hybrid heuristic algorithm [ 23 ]. We now proceed to describe in Section Random variables simulation the stochastic simulation of random model variables, and in Section Hybrid algorithm the full hybrid solution algorithm for our proposed ICRP model. 11 / 22 Random variables simulation A Monte-Carlo method is used to simulate the random variables. Specifically, in our model, there are three types of random variables: travel time on railway arcs, travel time on ship arcs and transfer time at hubs. From these random variables, we define the following three functions which are the expected value of objective function and the two chance probabilities used in the chance constraints: U1 : xkod; yhod; zhosd !E‰F…xkod; yhod; zhosd†Š U2 : xkod; yhod; zhosd !PrfTdod ‡ …25† X when M is large enough, U1 can be estimated by mˆ1 Fm=M. Similarly, for Eqs (24) and (25), U2 and U3 are apXproximated by NXrandom samXples. FoXreach particular n = 1, 2, . . ., N, let XmˆM1 Fm=M h1,n X=1 if Tdod ‡ X h2H 1 if h2H s2Szhosd…TXshd N‡ tshd† Tpod and 0 otXherwNise, then with a large integer N, U2 and U3 can be estimated by nˆ1 h1;n=N !U2 and nˆ1 h2;n=N !U3, respectively. Considering the time-consuming process of stochastic simulation, a neural network is then trained and employed to approximate the uncertain functions as noted in next section. k2Rod xkodtkod ‡ h2Hyhodth s2SzhosdTshd and 0 otherwise, and h2,n = Hybrid algorithm As a global search method, the genetic algorithm has a high efficiency in solving complex optimization problems. Therefore in this paper, Monte-Carlo simulation, neural network and genetic algorithm are integrated to develop a hybrid heuristic algorithm for solving the chance-constrained programming, where a genetic algorithm is used to obtain the optimal container route plan, and the Monte-Carlo simulation and neural network are used to check the feasibility of solutions and calculate the objective value by simulating the stochasticity. The details about hybrid heuristic algorithm are described in Algorithm 1. Algorithm 1 Hybrid Heuristic Algorithm Step 1: Initialization Step 1.1: Generate k initial feasible railway routes by Yen’s [ 36 ] algorithm for each container demand according the given container demand information and give the initial railway route set Rod. Step 1.2: Generate I samples of decision variables as input data for training a neural network, denoted as xi, yi, zi (i = 1, 2, . . ., 3000). Step 2: Train a neural network Step 2.1: For each sample xi, yi, zi, estimate the values of uncertain functions U1, U2 and U3 as output data according to the distribution of random variables by Monte-Carlo simulation, denoted as ui,1, ui,2 and ui,3, respectively. Step 2.2: Use the input-output data T = {xi,yi,zi,ui,1, ui,2,ui,3|i = 1,. . .,3000} and gradient descent backpropagation algorithm to train a neural network by calibrating the values of network weights and obtain a trained neural network N which can then approximate the uncertain functions ui,1, ui,2, ui,3 by inputting xi, yi, zi. Step 3: Initialize relevant parameters (initial n = 1) and determine p chromosomes (i.e. p initial feasible solutions of container routes) to form initial population S (i.e. solution set) according to the T. Let (x ,y ,z ) is the best solution, E[F(x ,y ,z )] is the best objective value. Step 4: Let F(x,y,z) is the objective function. Favg, Fmax denote the average fitness value and the optimal fitness value in the current generation. c is a constant. Calculate the objective values E [F(x,y,z)] of all chromosomes in S by the trained neural network N and the fitness function [ 37 ] F …x; y; z† ˆ …c 1†Favg F…x; y; z† ‡ FFmmaaxx cFFaavvgg Favg. Fmax Favg Step 5: Select the chromosomes by spinning the roulette wheel and update the p chromosomes (x,y,z) by crossover and mutation operations and in which the feasibility of offspring is checked by the trained neural network N, then n n + 1. Step 6: According T and F (x ,y ,z ), search the best solution (xn,yn,zn) in current population Sn. If E [F(xn,yn,zn)]<E[F(x ,y ,z )], then (x ,y ,z ) (xn,yn, zn). Record and update the best solution (x ,y ,z ), the best objective value E[F(x ,y ,z )] and the best fitness value F (x ,y ,z ). Step 7: If n > 100, output the optimal solution (x ,y ,z ) and optimal objective value E[F(x ,y ,z )]; otherwise, go to Step 4. The heuristic hybrid algorithm is also illustrated as a flowchart in Fig 2. After inputting parameters and the trained neural network, a satisfied solution can be obtained in a short computation time. Numerical example In this section, we present a small example to demonstrate the chance constrained model and illustrate the effect of stochastic time variables on optimal solutions and the performance of the solutions. The following indices are used to evaluate the performance of the solutions. (i) Inventory cost: the unit inventory cost multiplied by the stocking time at transfer hubs and destinations. (ii) Late delivery cost: the unit delay cost multiplied by the difference of promised delivery time and actual delivery time. 13 / 22 Fig 2. The flowchart of hybrid heuristic algorithm. (iii) Non-fulfilment penalty cost: the unit non-fulfilment penalty cost multiplied by the number of containers missing their ship service. (iv) Total cost: the sum of total cost of all container demand base on the trained neural network. (v) Punctuality: the percentage of on-time delivery. Numerical test Case 1: A small-scale intermodal network. Consider a small-scale intermodal network with 5 railway stations, 2 transfer hubs and 1 destination seaport as shown in Fig 3. The cargo demand and the sea-rail network specifications are listed in Tables 3±6. All cargos are assumed to depart on time at zero hour. In addition, the travel times on all railway links and by all ships follow the same standard deviation σa and σs respectively. The cost parameters are set as follows. The late delivery cost cp1 and non-fulfilment cost cp2 are assumed to be 50 (US$/TEU/day) and 150 (US$/TEU) respectively. The unit inventory cost is set 0.8 (US$/TEU/day) according to the Regulations on Collection of Port Charges of the People's Republic of China (MOT, 2001). In addition, we set the default confidence levels α and β as 0.9 and 0.6 respectively. The heuristic hybrid algorithm is coded in MATLAB R2010a, whose key parameters are provided in S1 Appendix. The program is performed on a desktop PC with a core i5 3.00GHz processor and 8GB RAM. 14 / 22 Fig 3. The small-scale intermodal network. The case with deterministic travel time and transfer time is tested first. The optimal route for each cargo od demand is given as follows, leading to a total system cost of $101910: A stochastic case is then tested, where the multiplier f equals 1. The standard deviations of all rail link travel times are set equally as sa ˆ f sa0 ˆ 1hour; 8a 2 A, the standard deviations of all ship sea travel time equally as ss ˆ f ss0 ˆ 1day; 8s 2 S, while the range of transfer time Destination H H H Freight volume qod (TEUs) 68 68 68 Delivery time Topd (hours) variability at both seaports equally as (nh ± mh)/2 = 3 hour, 8h 2 H. The optimal solution is then given as follows, with a total system cost of $102260: AH : A BH : B CH : C ! D ! D ! E ! G ! F ! G ! …Ship 6† ! …Ship 2† ! …Ship 5† ! H ! H ! H Comparing the results of stochastic case and deterministic case, the stochastic travel time and transfer time result in a different optimal container route plan from that under the 16 / 22 Fig 4. The practical sized intermodal network. deterministic scenario. As compared with the deterministic case, with stochasticity, the demand from origin A to destination H now transfers at seaport G and takes onto a ship (ship 6) that departs later, while the demand from B to H also follows a different route. Singapore Singapore Singapore Singapore Singapore Singapore 3200 2800 2500 2000 2400 2600 17 / 22 Destination Freight volume qod (TEUs) Departure time Todd (day) Xian!Houma!Taiyuan!Shijiazhuang!Bazhou!Tianjin!(ship CISC)!Singapore Luoyang!Zhengzhou!Xinxiang!Heze!Tanzho u!Linyi!Jiaozhou!Qingdao!(ship AIS)!Singapore Zhengzhou!Xinxiang!Heze!Yanzhou!Jinan!Jiaozhou!Qingdao!(ship AIS)!Singapore Taiyuan!Shijiazhuang!Bazhou!Tianjin!(Ship AEU3)!Singapore Jinan!Jiaozhou!Qingdao!(ship AEM5)!Singapore Xuzhou!Ya nzhou!Jinan!Dezhou!Cangzhou!Tianjin!(ship AEU3) !Singapore Xian!Houma!Taiyuan!Shijiazhuang!Bazhou!Tianjin!(ship CSE) !Singapore Luoyang!Yueshan!Xinxiang!Anyang!Handan!Shijiazhuang!Bazhou!Tianjin!(ship AEU3)!Singapore Zhengzhou!Xinxiang!Anyang!Handan!Shijiazhuang!Hengshui!Dezhou!Cangzhou!Tianjin!(ship CISC)!Singapore Tiayuan!Shijiazhuang!Hengshui!Suning!Bazhou!Tianjin!(ship CISC)!Singapore Jinan!Jiaozhou!Qingdao!(ship AIS)!Singapore Xuzhou!Ya nzhou!Linyi!Jiaozhou!Qingdao!(ship AIS)!Singapore Table 7 lists the inventory cost, late delivery cost, non-fulfilment cost, total cost and punctuality for the two cases. It can be seen that the stochasticity leads to increased inventory cost, late delivery cost, non-fulfilment cost, and total cost. Case 2: A practical sized intermodal network. We now implement the model and algorithm on a realistic sea-rail intermodal network from China to Singapore with 25 railway stations, 2 transfer hubs and 1 destination seaport as shown in Fig 4, where six ship service routes (i.e. CSE, CISC, AEU3, AEM5, AIS, MEX2) are under operation from Tianjin and Qingdao to Singapore. It is assumed that six container demands need to be transported from China to Singapore, whose details are listed in Table 8. The transportation costs are calculated based on tariff rates provided by shipping companies and railway companies. In addition, other cost parameters are the same with those of the small-scale intermodal network. The case with deterministic time parameters is tested first. Then the case with stochastic time parameters is conducted, where confidence levels α and β are 0.9 and 0.6. Besides, the standard deviations of all railway links and all ship travel time are set as σa = 1 hour, 8a 2 A and σs = 1 day, 8s 2 S, while the range of transfer time variability at both seaports equally as (nh ± mh)/2 = 3 hour, 8h 2 H. Table 9 and 10 illustrate the results of the deterministic case and stochastic case. As the results presented in Table 10 show, the optimal route is strongly affected by the stochastic travel time and transfer time. For the container demand from Zhengzhou to Singapore, the railway route, transfer hub and ship route all change in order to reduce high penalty cost and satisfy on-time delivery request. With respect to the relevant costs, the inventory cost, late delivery cost and non-fulfilment cost all increase due to the delay caused by stochasticity. In addition, the punctuality also falls from 100% to 73%, leading to a lower service level. 18 / 22 Inventory cost (US$) Late delivery cost (US$) Non-fulfilment cost (US$) 0 100 1297 1331 4166 7121 10192 1432 0 0 0 52 0 160 Total cost (US$) 101910 102260 103190 105710 108550 111070 114800 100% 97% 88% 90% 81% 76% 72% AH:A!D!F!(Ship 1) !H BH:B!E!F!(Ship 2) !H CH:C!E!G!(Ship 5) !H AH:A!D!G!(Ship 6) !H BH:B!D!F!(Ship 2) !H CH:C!E!G!(Ship 5) !H AH:A!D!F!(Ship 2) !H BH:B!E!G!(Ship 6) !H CH:C!E!F!(Ship 2) !H AH:A!D!G!(Ship 6) !H BH:B!D!F!(Ship 3) !H CH:C!E!G!(Ship 6) !H AH:A!D!F!(Ship 3) !H BH:B!D!G!(Ship 6) !H CH:C!E!G!(Ship 4) !H AH:A!D!G!(Ship 6) !H BH:B!D!F!(Ship 3) !H CH:C!E!G!(Ship 4) !H AH:A!D!F!(Ship 3) !H BH:B!D!G!(Ship 4) !H CH:C!E!G!(Ship 6) !H Sensitivity analysis To study the influence of stochastic variables and model parameters, the tests under different standard deviations of travel time and different confidence level for the small-scale intermodal network are conducted. The impact of travel time variability. In this section, we investigate the impact of rail link and sea link travel times on the optimal solutions of our stochastic ICRP for the smallscale case. The optimal solutions and the performance of them under different multiplier f (i.e. different travel time variabilities σa and σs) are calculated and shown in Table 11. As shown in Table 11, the late delivery cost and total cost go up obviously with the growth of value f, while the punctuality presents an opposite trend that the higher the value f, the lower the punctuality. This implies higher travel time variability not only has an effect on route plans but results in more operation cost and lower service level. In addition, inventory cost rises to 1087 US dollars with some fluctuation, while the non-fulfilment cost changes irregularly. The impact of chance confidence levels. Our proposed stochastic ICRP model includes two confidence levels: the on-time probability α for the chosen ship service, and the other probability β for on-time delivery at the final destination. In this section, we investigate the effects of these two probabilities on the optimal solutions. For the first probability α, the smallscale case with different values of α is tested. We found, due to high penalty cost of non-fulfilment fixed for this case study, the route plan with high possibility of fulfilment is always favoured as the optimal one. Therefore changes in the fulfilment confidence level α do not 19 / 22 Fig 5. The total cost with different confidence level β and multiplier f. yield significantly different results. However, the on-time delivery confidence levels β are shown to have a significant impact on the optimal solutions. Fig 5 shows the total costs of optimal solutions under different values of β and different values of f (i.e. different travel time variabilities σa, σs). The fulfilment probability α in this test is 0.9. It can be seen that, as the value f grows, the total cost also increases under the same confidence level β, which is consistent with what we discussed in Table 11. This indicates that, with the increase of travel time variabilities, higher operation cost is required to remain the service level, i.e. the possibility for on-time delivery. Similarly, with the increase of β, the total cost goes up under the same value f. This implies that, with high confidence level β, the minimum-cost solution can not satisfy the request of on-time delivery probability. Consequently, it leads the change of optimal routes and higher operation costs in order to achieve higher punctuality. Conclusion In this paper, the intermodal container routing problem (ICRP) with stochastic time variables is formulated as a binary integer chance-constrained programming model to minimise total cost in a sea-rail transportation network. A hybrid heuristic algorithm incorporating Monte-Carlo, neural network and genetic algorithm is proposed to solve the problem under pre-determined confidence levels of chance constraints. A numerical example is presented to demonstrate the validity of the proposed model in solving ICRP. Sensitivity tests are conducted to examine the influence of model variables on the total cost and optimal routes for each demand. The results confirm that transportation stochasticity can lead to different optimal routing plans compared to the deterministic case. In addition, the stochastic travel time and transfer time not only increase inventory cost and total cost, but also incur the late delivery cost and non-fulfilment cost. The costs increase with increasing travel time variability. With higher ontime delivery probability, the number of feasible solutions reduces. This implies that higher operation costs would be required to meet higher service requirements. 20 / 22 For further research, as in Meng et al.[ 38 ], the demand could also be stochastic. Therefore we can further include the variation of demands in the container routing problem. Meanwhile, as stochastic demand and stochastic travel time can both affect the container route choices and the total operation cost, which conversely affects the performance of the intermodal network, it is therefore meaningful to integrate the container routing choice in the intermodal network design process. Supporting information S1 Appendix. Parameter setting for the numerical example. (DOCX) Acknowledgments We thank Hongbo Ye (University of Leeds) for his technical support. Author Contributions Conceptualization: Yi Zhao. Formal analysis: Yi Zhao. Funding acquisition: Xi Zhang. Investigation: Yi Zhao. Methodology: Yi Zhao, Ronghui Liu. Supervision: Ronghui Liu. Writing ± original draft: Yi Zhao. Writing ± review & editing: Ronghui Liu, Anthony Whiteing. 21 / 22 1. Crainic TG , Kim KH . Intermodal transportation . In: Cynthia B , Gilbert L , editors. Handbooks in operations research and management science . Amsterdam: North-Holland; 2007 . p. 467 ± 537 . 2. SteadieSeifi M , Dellaert NP , Nuijten W , Van Woensel T , Raoufi R . Multimodal freight transportation planning: A literature review . Eur J Oper Res. 2014 Feb 16 ; 233 ( 1 ):1± 5 . 3. Meng Q , Wang S , Andersson H , Thun K. Containership routing and scheduling in liner shipping: overview and future research directions . Transp Sci. 2013 May 10 ; 48 ( 2 ): 265 ± 80 . 4. Caris A , Macharis C , Janssens GK . Decision support in intermodal transport: a new research agenda . Comput Ind . 2013 Feb 28 ; 64 ( 2 ): 105 ± 12 . 5. Apivatanagul P . Network design formulations, modeling, and solution algorithms for goods movement strategic planning [dissertation] . Berkeley (CA): University of California Transportation Center; 2008 . 6. Crainic TG . Service network design in freight transportation . Eur J Oper Res. 2000 Apr 16 ; 122 ( 2 ): 272 ± 88 . Barnhart C , Ratliff HD . Modeling intermodal routing . J Bus Logist. 1993 Jan 1 ; 14 ( 1 ): 205 . 8. Cho JH , Kim HS , Choi HR . An intermodal transport network planning algorithm using dynamic programmingÐa case study: from Busan to Rotterdam in intermodal freight routing . Appl Intell . 2012 Apr 1 ; 36 ( 3 ): 529 ± 41 . 9 . Chang TS . Best routes selection in international intermodal networks . Comput Oper Res. 2008 Sep 30 ; 35 ( 9 ): 2877 ± 91 . 10. Ayar B , Yaman H. An intermodal multicommodity routing problem with scheduled services . Comput Optim Appl. 2012 Sep 1 : 1 ± 23 . 11. Ziliaskopoulos A , Wardell W. An intermodal optimum path algorithm for multimodal networks with dynamic arc travel times and switching delays . Eur J Oper Res. 2000 Sep 16 ; 125 ( 3 ): 486 ± 502 . 12. Yang X , Low JM , Tang LC . Analysis of intermodal freight from China to Indian Ocean: A goal programming approach . J Transp Geogr. 2011 Jul 31 ; 19 ( 4 ): 515 ± 27 . 13. Min H. International intermodal choices via chance-constrained goal programming . Transp Res Part A Policy Prac . 1991 Nov 30 ; 25 ( 6 ): 351 ± 62 . 14. Demir E , Burgholzer W , HrusÏovsky M , Arõkan E , Jammernegg W , Van Woensel T. A green intermodal service network design problem with travel time uncertainty . Transp Res Part B Methodol . 2016 Nov 30 ; 93 : 789 ± 807 . 15. Meng Q , Wang S , Liu Z. Network design for shipping service of large-scale intermodal liners . Transportation Research Record: J Transp Res Rec . 2012 Aug 23 ( 2269 ): 42 ± 50 . 16. Crainic TG , Rousseau JM . Multicommodity, multimode freight transportation: A general modeling and algorithmic framework for the service network design problem . Transp Res Part B Methodol . 1986 Jun 30 ; 20 ( 3 ): 225 ± 42 . 17. Crainic TG , Florian M , LeÂal JE . A model for the strategic planning of national freight transportation by rail . Transp Sci . 1990 Feb; 24 ( 1 ):1± 24 . 18. Kim HJ , Chang YT , Lee PT , Shin SH , Kim MJ . Optimizing the transportation of international container cargoes in Korea . Marit Policy Manag . 2008 Feb 1 ; 35 ( 1 ): 103 ± 22 . 19. Riessen BV , Negenborn RR , Dekker R , Lodewijks G. Service network design for an intermodal container network with flexible transit times and the possibility of using subcontracted transport . Int J of Ship and Transport Logit . 2015 ; 7 ( 4 ): 457 ± 78 . 20. Li JQ , Kong N , Hu X , Liu L . Large-scale transit itinerary planning under uncertainty . Transp Res Part C Emerg Technol . 2015 Nov 30 ; 60 : 397 ± 415 . 21. Dong JX , Lee CY , Song DP . Joint service capacity planning and dynamic container routing in shipping network with uncertain demands . Transp Res Part B Methodol . 2015 Aug 31 ; 78 : 404 ± 21 . 22. Moccia L , Cordeau JF , Laporte G , Ropke S , Valentini MP . Modeling and solving a multimodal transportation problem with flexible-time and scheduled services . Networks. 2011 Jan 1 ; 57 ( 1 ): 53 ± 68 . 23. Liu B. Theory and practice of uncertain programming . 2nd ed. Berlin: Springer; 2009 . Charnes A , Cooper WW . Chance-constrained programming . Manag Sci . 1959 Oct; 6 ( 1 ): 73 ± 9 . 25. Roush WB , Stock RH , Cravener TL , D'Alfonso TH . Using chance-constrained programming for animal feed formulation at Agway . Interfaces . 1994 Apr; 24 ( 2 ): 53 ± 8 . 26. Meng QC , Rong XX . A Robust Ordering Strategy for Retailers Facing a Free Shipping Option . PloS ONE . 2015 May; 10 ( 5 ):e0125939. https://doi.org/10.1371/journal.pone. 0125939 PMID: 25993533 27. Li S , Li X , Zhang D , Zhou L. Joint optimization of distribution network design and two-echelon inventory control with stochastic demand and CO2 emission tax charges . PloS ONE . 2017 Jan; 12 ( 1 ):e0168526. https://doi.org/10.1371/journal.pone. 0168526 PMID: 28103246 28. Li M , Liu Z , Zhang Y , Shi F . Distribution analysis of train interval journey time employing the censored model with shifting character . J Appl Stat . 2017 ; 44 ( 4 ): 715 ± 33 . 29. Kauczynski WE . Study of the reliability of the ship transportation by applying the historical hindcast weather data . Proceedings of the ASME 31st International Conference on Ocean, Offshore and Arctic Engineering; 2012 July 1 ±6; Rio de Janeiro, Brazil. New York: ASME; 2012 . p. 195 ± 203 . 30. Tan AC , Bowden R. The virtual intermodal transportation system (VITS) . Final report. National Center for Intermodal Transportation ; 2004 . 31. Pagnoncelli BK , Ahmed S , Shapiro A . Sample average approximation method for chance constrained programming: theory and applications . J Optim Theory Appl. 2009 Aug 1 ; 142 ( 2 ): 399 ± 416 . 32. Hvattum LM , Løkketangen A . Using scenario trees and progressive hedging for stochastic inventory routing problems . J Heuristics . 2009 Dec 1 ; 15 ( 6 ): 527 ± 57 . 33. Yang L , Gao Z , Li X , Li K. A weighted min±max model for balanced freight train routing problem with fuzzy information . Eng Optim . 2011 Dec 1 ; 43 ( 12 ): 1289 ± 309 . 34. Cao C , Gao Z , Li K. Capacity allocation problem with random demands for the rail container carrier . Eur J Oper Res. 2012 Feb 16 ; 217 ( 1 ): 214 ± 21 . 35. Wang T , Meng Q , Wang S , Tan Z . Risk management in liner ship fleet deployment: A joint chance constrained programming model . Transport Res E Logit . 2013 Dec 31 ; 60 : 1 ± 2 . 36. Yen JY . Finding the k shortest loopless paths in a network . Manag Sci . 1971 Jul; 17 ( 11 ): 712 ± 6 . 37. Goldberg DE , Holland JH. Genetic algorithms and machine learning . Mach Learn . 1988 Oct 1 ; 3 ( 2 ): 95 ± 9 . 38. Meng Q , Wang T , Wang S . Short-term liner ship fleet planning with container transshipment and uncertain container shipment demand . Eur J Oper Res. 2012 Nov 16 ; 223 ( 1 ): 96 ± 105 .


This is a preview of a remote PDF: http://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0192275&type=printable

Yi Zhao, Ronghui Liu, Xi Zhang, Anthony Whiteing. A chance-constrained stochastic approach to intermodal container routing problems, PLOS ONE, 2018, DOI: 10.1371/journal.pone.0192275