Hub-and-spoke network design and fleet deployment for string planning of liner shipping

Applied Mathematical Modelling

Volumn 37, Issue 5, 2013, Pages 3307-3321

  Gelareh, Shahin ^a,b,c   Maculan, Nelson ^d   Mahey, Philippe ^e,f   Monemi, Rahimeh Neamatian ^e,f  

^a UNIVERSITÉ D'ARTOIS   (France)

^b ECOLE CENTRALE DE LILLE   (France)

^c UNIV LILLE   (France)

^d FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

^e UNIVERSITÉ CLERMONT AUVERGNE   (France)

^f CNRS   (France)

Author keywords

Decomposition; Environment and emission; Integer programming; Lagrangian relaxation; Liner shipping; Transportation

Indexed keywords

CONTAINER VESSEL; DEPLOYMENT COSTS; ENVIRONMENTALLY-FRIENDLY; FLEET DEPLOYMENT; FREQUENCY SETTING; HEURISTIC PROCEDURES; HIGH-QUALITY SOLUTIONS; HUB-AND-SPOKE NETWORK DESIGN; LAGRANGIAN DECOMPOSITION; LAGRANGIAN RELAXATION; LINER SHIPPING; MIXED INTEGER LINEAR PROGRAMMING MODEL; NETWORK DESIGN; ORDERED SET; PROBLEM INSTANCES; SERVICE PROVIDER; SHIPPING CAPACITY; SHORT TERM; TRANSIT TIME; WEIGHTED SUM;

CONTAINERS; DECOMPOSITION; HEURISTIC METHODS; INTEGER PROGRAMMING; LAGRANGE MULTIPLIERS; ROTATION; TRANSPORTATION;

SERVICE VESSELS;

EID: 84872497309     PISSN: 0307904X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.apm.2012.07.017     Document Type: Article

References (49)

1. UNCTAD, Review Of Maritime Transport 2008, United Nations Conference on Trade and Development (UNCTAD), Geneva and New York, 2009.
2. Christiansen M., Fagerholt K., Ronen D. Ship routing and scheduling: status and perspective. Transp. Sci. 2004, 38(1):1-18.
3. Stopford M. Maritime Economics 1997, Routledge.
4. Christiansen M., Ronen D., Nygreen B., Fagerholt K. Maritime transportation. Handbooks Oper. Res. Manage. Sci. 2007, 14:189-284.
5. Cho S.-C., Perakis A. Optimal liner fleet routing strategies. Maritime Policy Manage. 1996, 23(3):249-259.
6. Ronen D. Cargo ships routing and scheduling: survey of models and problems. Eur. J. Oper. Res. 1983, 12:119-126.
7. Ronen D. Ship scheduling: the last decade. Eur. J. Oper. Res. 1993, 71:325-333.
8. Bremer W.M., Perakis A. An operational tanker scheduling optimization system: model implementation, results and possible extension. Maritime Policy Manage. 1992, 19(3):189-199.
9. Perakis A., Bremer W. An operational tanker scheduling optimization system: background, current practice and model formulation. Maritime Policy Manage. 1992, 19(3):177-187.
10. Kim S.H., Lee K.K. An optimization-based decision support system for ship scheduling. Comput. Indust. Eng. 1997, 33(3-4):689-692.
11. Cho S.C., Perakis A.N. An improved formulation for bulk cargo ship scheduling with a single loading port. Maritime Policy Manage. 2001, 28(4):339-345.
12. Reddy P., Karimi I., Srinivasan R. A new continuous-time formulation for scheduling crude oil operations. Chem. Eng. Sci. 2004, 59:1325-1341.
13. Brønmo G., Christiansen M., Fagerholt K., Nygreen B. A multi-start local search heuristic for ship scheduling - a computational study. Comput. Oper. Res. 2007, 34:900-917.
14. Korsvik J.E., Fagerholt K. A tabu search heuristic for ship routing and scheduling with flexible cargo quantities. J. Heuristics 2010, 16(2):117-137.
15. Alizadeh A.H., Nomikos N.K. Investment timing and trading strategies in the sale and purchase market for ships. Transp. Res. Part B: Methodol. 2007, 41(1):126-143.
16. Lium A.-G., Crainic T., Wallace S. A study of demand stochasticity in service network design. Transp. Sci. 2009, 43(2):144-157.
17. Hoff A., Lium A.-G., Lkketangen A., Crainic T. A metaheuristic for stochastic service network design. J. Heuristics 2009.
18. L.B. Reinhardt, B. Kallehauge, D. Pisinger, A branch and cut algorithm for the container shipping network design problem, Tech. Rep., Technical University of Denmark, 2010.
19. Gelareh S., Nickel S., Pisinger D. Liner shipping hub network design in a competitive environment. Transp. Res. Part E: Logist. Transp. Rev. Appear 2010.
20. Gelareh S., Pisinger D., deployment Fleet network design and hub location of liner shipping companies. Transp. Res. Part E: Logist. Transp. Rev. 2011.
21. Agarwal R., Ergun O. Ship scheduling and network design for cargo routing in linear shipping. Transp. Sci. 2008, 1-22.
22. Agarwal R., Ergun ö. Network design and allocation mechanisms for carrier alliances in liner shipping. Oper. Res. 2010, 58(6):1726.
23. Everett J., Hax A., Lewison V., Nutts D. Optimization of a fleet of large tankers and bulkers: a linear programming approach. Marine Technol. 1972, 9:430-438.
24. Perakis A., Jaramillo D. Fleet deployment optimization for liner shipping - Part 1. Background, problem formulation and solution approaches. Maritime Policy Manage. 1991, 18(3):183-200.
25. Jaramillo D., Perakis A. Fleet deployment optimization for liner shipping - Part 2. Implementation and results. Maritime Policy Manage. 1991, 18(4):235-262.
26. Powell B.J., Perakis A.N. Fleet deployment optimization for liner shipping: an integer programming model. Maritime Policy Manage. 1997, 24(2):183-192.
27. Papadakis N.A., Perakis A.N. A nonlinear approach to the multiorigin, multidestination fleet deployment problem. Naval Res. Logist. 1989, 36(4):515-528.
28. Perakis A., Papadakis N. Fleet deployment optimization models, Part I. Maritime Policy Manage. 1987, XIV(2):127-144.
29. Perakis A.N., Papadakis N.A. Fleet deployment optimization models, Part II. Maritime Policy Manage. 1987, XIV(2):145-155.
30. Perakis A. Fleet operation optimisation and fleet deployment. LLP 2002, 580-597. (Ch. 26).
31. Shintani K., Imai A., Nishimura E., Papadimitriou S. The container shipping network design problem with empty container repositioning. Transp. Res. Part E 2007, 43(1):39-59.
32. Gelareh S., Meng Q. A novel modeling approach for the fleet deployment problem within a short-term planning horizon. Transp. Res. Part E: Logist. Transp. Rev. 2010, 46(1):76-89.
33. Fisher M.L. The Lagrangian relaxation method for solving integer programming problems. Manage. Sci. 1981, 27(1):1-18.
34. Fisher M.L. The Lagrangian relaxation method for solving integer programming problems. Manage. Sci. 2004, 50(12):1861-1871.
35. Guignard M. Lagrangian relaxation. TOP 2003, 11(2):151-228.
36. Reinoso H., Maculan N. Lagrangean decomposition in integer linear programming: a new scheme. INFOR 1992, 30.
37. Thizy J. Analysis of Lagrangian decomposition for the multi-item capacitated lot-sizing problem. INFORM 1991, 29(4).
38. Michelon P., Maculan N. Lagrangean decomposition for integer nonlinear programming with linear constraints. Math. Program. 1991, 52(1):303-313.
39. Billionnet A., Soutif é. An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem. Eur. J. Oper. Res. 2004, 157(3):565-575.
40. Ruszczyński A. On convergence of an augmented Lagrangian decomposition method for sparse convex optimization. Math. Oper. Res. 1995, 634-656.
41. Rosa C., Ruszczyński A. On augmented Lagrangian decomposition methods for multistage stochastic programs. Ann. Oper. Res. 1996, 64(1):289-309.
42. Guignard M., Kim S. Lagrangean decomposition: a model yielding stronger lagrangean bounds. Math. Program. 1987, 39:215-228.
43. Held M., Karp R. The traveling-salesman problem and minimum spanning trees: Part II. Math. Program. 1971, 1(1):6-25.
44. Lemarechal C. An extension of Davidon methods to non differentiable problems. Nondiffer. Optimiz. 1975, 95-109.
45. Barahona F., Anbil R. The volume algorithm: producing primal solutions with a subgradient method. Math. Program. 2000, 87(3):385-399.
46. Bahiense L., Maculan N., Sagastizábal C.A. The volume algorithm revisited: relation with bundle methods. Math. Program. 2002, 94(1):41-69.
47. Larsson T., Patriksson M., Strömberg A. Ergodic, primal convergence in dual subgradient schemes for convex programming. Math. Program. 1999, 86(2):283-312.
48. MAERSKLine, What does maersk do for network planning, Personal Commun., 2010.
49. T. Notteboom, P. Carriou, Fuel surcharge practices of container shipping lines: is it about cost recovery or revenue making?, in: Proc. 2009 Int. Association Maritime Economists (IAME) Conf., April 2009, Copenhagen, Denmark.