Network design, fleet deployment and empty repositioning in liner shipping

Rahime Neamatian Monemi1, Shahin Gelareh2
1Centre for Operational Research, Management Science and Information Systems (CORMSIS), University of Southampton, Southampton SO17 1BJ, United Kingdom
2Portsmouth Business School, Portsmouth, United Kingdom

Tóm tắt

Từ khóa


Tài liệu tham khảo

Agarwal, 2008, Ship schedulinig and network design for cargo routing in lienr shipping, Transp. Sci., 1

Benders, 2005, Partitioning procedures for solving mixed-variables programming problems, CMS, 2, 3, 10.1007/s10287-004-0020-y

Benders, 1962, Partitioning procedures for solving mixed-variables programming problems, Numerische mathematik, 4, 238, 10.1007/BF01386316

Braekers, 2011, Challenges in managing empty container movements at multiple planning levels, Transp. Rev., 31, 681, 10.1080/01441647.2011.584979

Brouer, 2013, A base integer programming model and benchmark suite for liner-shipping network design, Transp. Sci., 48, 281, 10.1287/trsc.2013.0471

Brouer, 2011, Liner shipping cargo allocation with repositioning of empty containers, INFOR, 49, 109

Chang, 2008, A heuristic solution for the empty container substitution problem, Transp. Res. Part E: Logist. Transp. Rev., 44, 203, 10.1016/j.tre.2007.07.001

Chuang, 2010, Planning the route of container ships: a fuzzy genetic approach, Expert Syst. Appl., 37, 2948, 10.1016/j.eswa.2009.09.040

Codato, 2006, Combinatorial Benders’ cuts for mixed-integer linear programming, Oper. Res.-Baltimore LINTHICUM, 54, 756, 10.1287/opre.1060.0286

Dang, 2012, Positioning empty containers under dependent demand process, Comput. Industr. Eng., 62, 708, 10.1016/j.cie.2011.11.021

Dong, 2009, Container fleet sizing and empty repositioning in liner shipping systems, Transp. Res. Part E: Logist. Transp. Rev., 45, 860, 10.1016/j.tre.2009.05.001

Ernst, 1996, Efficient algorithms for the uncapacitated single allocation p-hub median problem, Location Sci., 4, 139, 10.1016/S0966-8349(96)00011-3

Fagerholt, 2009, Fleet deployment in liner shipping: a case study, Maritime Policy Manage., 36, 397, 10.1080/03088830903187143

Fischetti, 1998, Solving the orienteering problem through branch-and-cut, INFORMS J. Comput., 10, 133, 10.1287/ijoc.10.2.133

Fischetti, 2009, Minimal infeasible subsystems and Benders cuts, Math. Programm.

Gelareh, 2010, A novel modeling approach for the fleet deployment problem within a short-term planning horizon, Transp. Res. Part E: Logist. Transp. Rev., 46, 76, 10.1016/j.tre.2009.06.004

Gelareh, 2010, A novel modeling approach for the fleet deployment problem within a short-term planning horizon, Transp. Res. Part E: Logist. Transp. Rev., 46, 76, 10.1016/j.tre.2009.06.004

Gelareh, 2011, Hub location problems in transportation networks, Transp. Res. Part E, 47, 1092, 10.1016/j.tre.2011.04.009

Gelareh, 2011, Fleet deployment, network design and hub location of liner shipping companies, Transp. Res. Part E: Logist. Transp. Rev., 47, 947, 10.1016/j.tre.2011.03.002

Huang, 2015, Liner services network design and fleet deployment with empty container repositioning, Comput. Industr. Eng., 89, 116, 10.1016/j.cie.2015.01.021

Imai, 2009, Multi-port vs. hub-and-spoke port calls by containerships, Transp. Res. Part E: Logist. Transp. Rev., 45, 740, 10.1016/j.tre.2009.01.002

Lee, 2015

Letchford, A.N., Lodi, A., 2002. Integer Programming and Combinatorial Optimization: 9th International IPCO Conference Cambridge, MA, USA, May 27–29, 2002 Proceedings. Springer Berlin Heidelberg, Berlin, Heidelberg, Ch. Polynomial-Time Separation of Simple Comb Inequalities, pp. 93–108.

Maculan, 2003, Integer linear models with a polynomial number of variables and constraints for some classical combinatorial optimization problems, Pesquisa Operacional, 23, 161, 10.1590/S0101-74382003000100012

Magnanti, 1986, Tailoring Benders decomposition for uncapacitated network design, Netflow at Pisa, 112, 10.1007/BFb0121090

Magnanti, 1981, Accelerating Benders decomposition: algorithmic enhancement and model selection criteria, Oper. Res., 29, 464, 10.1287/opre.29.3.464

McDaniel, 1977, A modified Benders’ partitioning algorithm for mixed integer programming, Manage. Sci., 24, 312, 10.1287/mnsc.24.3.312

Meng, 2011, Liner shipping service network design with empty container repositioning, Transp. Res. Part E: Logist. Transp. Rev., 47, 695, 10.1016/j.tre.2011.02.004

Meng, 2013, Containership routing and scheduling in liner shipping: overview and future research directions, Transp. Sci., 48, 265, 10.1287/trsc.2013.0461

Padberg, 1982, Odd minimum cut-sets and b-matchings, Math. Oper. Res., 7, 67, 10.1287/moor.7.1.67

Plum, 2014, A service flow model for the liner shipping network design problem, Eur. J. Oper. Res., 235, 378, 10.1016/j.ejor.2013.10.057

Poojari, 2009, Improving benders decomposition using a genetic algorithm, Eur. J. Oper. Res., 199, 89, 10.1016/j.ejor.2008.10.033

Reinhardt, 2012, A branch and cut algorithm for the container shipping network design problem, Flexible Services Manuf. J., 24, 349, 10.1007/s10696-011-9105-4

Rodrigue

Shen, 1995, A dss for empty container distribution planning, Decis. Support Syst., 15, 75, 10.1016/0167-9236(94)00037-S

Sherali, 2002, A modification of Benders’ decomposition algorithm for discrete subproblems: an approach for stochastic programs with integer recourse, J. Global Optim., 22, 319, 10.1023/A:1013827731218

Shintani, 2007, The container shipping network design problem with empty container repositioning, Transp. Res. Part E, 43, 39, 10.1016/j.tre.2005.05.003

Song, 2012, Cargo routing and empty container repositioning in multiple shipping service routes, Transp. Res. Part B: Meth., 46, 1556, 10.1016/j.trb.2012.08.003

Song, 2013, Long-haul liner service route design with ship deployment and empty container repositioning, Transp. Res. Part B: Meth., 55, 188, 10.1016/j.trb.2013.06.012

Tiernan, 1970, An efficient search algorithm to find the elementary circuits of a graph, Commun. ACM, 13, 722, 10.1145/362814.362819

Tran, 2015, Literature survey of network optimization in container liner shipping, Flexible Services Manuf. J., 27, 139, 10.1007/s10696-013-9179-2

UNCTAD, 2015. Unctad transport newsletter. Tech. rep.

Wang, 2007

Wang, 2015, Segment-based alteration for container liner shipping network design, Transp. Res. Part B: Meth., 72, 128, 10.1016/j.trb.2014.11.011

Wang, 2012, Liner ship fleet deployment with container transshipment operations, Transp. Res. Part E: Logist. Transp. Rev., 48, 470, 10.1016/j.tre.2011.10.011

Wang, 2014, Liner ship fleet deployment with uncertain demand, Transp. Res. Rec. J. Transp. Res. Board, 2409, 49, 10.3141/2409-07

Waters