This paper proposes a minimax regret model for liner shipping fleet deployment with uncertain demand. The minimax regret model does not need the probability distribution function of the demand, and the model is consistent with how network planners are evaluated. However, the model is large because of the incorporation of all possible demand scenarios. A dynamic scenario inclusion method is proposed for efficiently solving the minimax model with only a small subset of the demand scenarios. A case study based on an Asia–Europe–Oceania liner shipping network demonstrates the applicability of the proposed model and method.
GoliasM. M.A Bi-Objective Berth Allocation Formulation to Account for Vessel Handling Time Uncertainty. Maritime Economics and Logistics, Vol. 13, No. 4, 2011, pp. 419–441.
3.
GoliasM. M., BoileM., and TheofanisS.. Discrete Berth-Scheduling Problem: Toward a Unified Mathematical Formulation. In Transportation Research Record: Journal of the Transportation Research Board, No. 2168, Transportation Research Board of the National Academies, Washington, D.C., 2010, pp. 1–8.
4.
GoliasM., BoileM., TheofanisS., and EfstathiouC.. The Berth-Scheduling Problem: Maximizing Berth Productivity and Minimizing Fuel Consumption and Emissions Production. In Transportation Research Record: Journal of the Transportation Research Board, No. 2166, Transportation Research Board of the National Academies, Washington, D.C., 2010, pp. 20–27.
5.
JinJ., LeeD. H., and CaoJ. X.. Storage Yard Management in Maritime Container Terminals. Transportation Science, 2014. DOI:10.1287/trsc.2014.0527.
6.
JinJ., LeeD. H., and HuH.. Tactical Berth and Yard Template Design at Container Transshipment Terminals: A Column Generation Based Approach. Transportation Research Part E, Vol. 73, 2015, pp. 168–184.
7.
LeeD. H., and JinJ.. Feeder Vessel Management at Container Transshipment Terminals. Transportation Research Part E, Vol. 49, No. 1, 2013, pp. 201–216.
8.
LeeD.-H., JinJ. G., and ChenJ. H.. Integrated Bay Allocation and Yard Crane Scheduling Problem for Transshipment Containers. In Transportation Research Record: Journal of the Transportation Research Board, No. 2222, Transportation Research Board of the National Academies, Washington, D.C., 2011, pp. 63–71.
9.
LeeD.-H., JinJ. G., and ChenJ. H.. Schedule Template Design and Storage Allocation for Cyclically Visiting Feeders in Container Transshipment Hubs. In Transportation Research Record: Journal of the Transportation Research Board, No. 2273, Transportation Research Board of the National Academies, Washington, D.C., 2012, pp. 87–95.
10.
LeeD. H., JinJ., and ChenJ.. Terminal and Yard Allocation Problem for a Container Transshipment Hub with Multiple Terminals. Transportation Research Part E, Vol. 48, No. 2, 2012, pp. 516–528.
11.
ZhenL.Tactical Berth Allocation Under Uncertainty. European Journal of Operational Research, Vol. 247, 2015, pp. 928–944.
12.
ChristiansenM., FagerholtK., and RonenD.. Ship Routing and Scheduling: Status and Perspectives. Transportation Science, Vol. 38, No. 1, 2004, pp. 1–18.
13.
ChristiansenM., FagerholtK., NygreenB., and RonenD.. Ship Routing and Scheduling in the New Millennium. European Journal of Operational Research, Vol. 228, No. 3, 2013, pp. 467–478.
14.
MengQ., WangS., AnderssonH., and ThunK.. Containership Routing and Scheduling in Liner Shipping: Overview and Future Research Directions. Transportation Science, Vol. 48, No. 2, 2014, pp. 265–280.
15.
WangS., and MengQ.. Reversing Port Rotation Directions in a Container Liner Shipping Network. Transportation Research Part B, Vol. 50, 2013, pp. 61–73.
16.
LiuZ., MengQ., WangS., and SunZ.. Global Intermodal Liner Shipping Network Design. Transportation Research Part E, Vol. 61, 2014, pp. 28–39.
17.
WangS., LiuZ., and MengQ.. Segment-Based Alteration for Container Liner Shipping Network Design. Transportation Research Part B, Vol. 72, 2015, pp. 128–145.
18.
WangS., MengQ., and LiuZ.. Containership Scheduling with Transit-Time-Sensitive Container Shipment Demand. Transportation Research Part B, Vol. 54, 2013, pp. 68–83.
19.
WangD. Z. W., and LoH. K.. Mixed-Fleet Ferry Routing and Scheduling with Passengers’ Preferences for Differential Services. Transportation Research Part B, Vol. 42, No. 9, 2008, pp. 798–822.
20.
MengQ., WangS., and LeeC.-Y.. A Tailored Branch-and-Price Approach for a Tramp Ship Routing and Bunkering Problem. Transportation Research Part B, Vol. 72, 2015, pp. 1–19.
21.
ZhenL., ShenT., WangS., and YuS.. Models on Ship Scheduling in Transshipment Hubs with Considering Bunker Cost. International Journal of Production Economics, Vol. 173, 2016, pp. 111–121.
22.
WangS.Essential Elements in Tactical Planning Models for Container Liner Shipping. Transportation Research Part B, Vol. 54, 2013, pp. 84–99.
23.
WangS., MengQ., and BellM. G. H.. Liner Ship Route Capacity Utilization Estimation with a Bounded Polyhedral Container Shipment Demand Pattern. Transportation Research Part B, Vol. 47, 2013, pp. 57–76.
24.
WangS., LiuZ., and BellM. G. H.. Profit-Based Maritime Container Assignment Models for Liner Shipping Networks. Transportation Research Part B, Vol. 72, 2015, pp. 59–76.
25.
PerakisA. N., and JaramilloD. I.. Fleet Deployment Optimization for Liner Shipping Part 1. Background, Problem Formulation and Solution Approaches. Maritime Policy and Management, Vol. 18, No. 3, 1991, pp. 183–200.
26.
ChoS. C., and PerakisA. N.. Optimal Liner Fleet Routing Strategies. Maritime Policy and Management, Vol. 23, No. 3, 1996, pp. 249–259.
27.
PowellB. J., and PerakisA. N.. Fleet Deployment Optimization for Liner Shipping: An Integer Programming Model. Maritime Policy and Management, Vol. 24, No. 2, 1997, pp. 183–192.
28.
FagerholtK.Optimal Fleet Design in a Ship Routing Problem. International Transactions in Operational Research, Vol. 6, No. 5, 1999, pp. 453–464.
29.
FagerholtK.Designing Optimal Routes in a Liner Shipping Problem. Maritime Policy and Management, Vol. 31, No. 4, 2004, pp. 259–268.
30.
FagerholtK., JohnsenT. A. V., and LindstadH.. Fleet Deployment in Liner Shipping: A Case Study. Maritime Policy and Management, Vol. 36, No. 5, 2009, pp. 397–409.
31.
GelarehS., and MengQ.. A Novel Modeling Approach for the Fleet Deployment Problem Within a Short-Term Planning Horizon. Transportation Research Part E, Vol. 46, No. 1, 2010, pp. 76–89.
32.
WangS., and MengQ.. Liner Ship Fleet Deployment with Container Transshipment Operations. Transportation Research Part E, Vol. 48, No. 2, 2012, pp. 470–484.
33.
NorstadI., FagerholtK., HvattumL. M., ArnulfH. S., and BjørkliA.. Maritime Fleet Deployment with Voyage Separation Requirements. Flexible Services and Manufacturing Journal, Vol. 27, No. 2–3, 2013, pp. 180–199.
34.
MengQ., and WangT.. A Chance Constrained Programming Model for Short-Term Liner Ship Fleet Planning Problems. Maritime Policy and Management, Vol. 37, No. 4, 2010, pp. 329–346.
35.
MengQ., WangT., and WangS.. Short-Term Liner Ship Fleet Planning with Container Transshipment and Uncertain Demand. European Journal of Operational Research, Vol. 223, No. 1, 2012, pp. 96–105.
36.
WangT., MengQ., and WangS.. Robust Optimization Model for Liner Ship Fleet Planning with Container Transshipment and Uncertain Demand. In Transportation Research Record: Journal of the Transportation Research Board, No. 2273, Transportation Research Board of the National Academies, Washington, D.C., 2012, pp. 18–28.
37.
WuJ., SunH., WangD. Z. W., ZhongM., HanL., and SiB.. Bounded-Rationality Based Day-to-Day Evolution Model for Travel Behavior Analysis of Urban Railway Network. Transportation Research Part C, Vol. 31, 2013, pp. 73–82.
38.
QuX., WangS., and ZhangJ.. On the Fundamental Diagram for Freeway Traffic: A Novel Calibration Approach for Single-Regime Models. Transportation Research Part B, Vol. 73, 2015, pp. 91–102.
39.
ZhenL., and WangK.. A Stochastic Programming Model for Multi-Product Oriented Multi-Channel Component Replenishment. Computers and Operations Research, Vol. 60, 2015, pp. 79–90.
40.
LiF., GaoZ., LiK., and WangD. Z. W.. Train Routing Model and Algorithm Combined with Train Scheduling. Journal of Transportation Engineering, Vol. 139, No. 1, 2013, pp. 81–91.
41.
LiuH., and WangD. Z. W.. Global Optimization Method for Network Design Problem with Stochastic User Equilibrium. Transportation Research Part B, Vol. 72, 2015, pp. 20–39.
42.
WangD. Z. W., LiuH., and SzetoW. Y.. A Novel Discrete Network Design Problem Formulation and Its Global Optimization Solution Algorithm. Transportation Research Part E, Vol. 79, 2015, pp. 213–230.
43.
RiemannR., WangD. Z. W., and BuschF.. Optimal Location of Wireless Charging Facilities for Electric Vehicles: Flow-Capturing Location Model with Stochastic User Equilibrium. Transportation Research Part C, Vol. 58, 2015, pp. 1–12.
44.
LoH. K., AnK., and LinW. H.. Ferry Service Network Design Under Demand Uncertainty. Transportation Research Part E, Vol. 59, 2013, pp. 48–70.
45.
BellM. G. H., LiuX., RioultJ., and AngeloudisP.. A Cost-Based Maritime Container Assignment Model. Transportation Research Part B, Vol. 58, 2013, pp. 58–70.
