Optimizing Liner Shipping Fleet Repositioning Plans

Tierney, Kevin

doi:10.1007/978-3-319-17665-9

Cited by 7 publications

(15 citation statements)

References 119 publications

(117 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In paper (Zenzerovic and Beslic, 2003) doesn't takes into account costs, arisen from empty container reposition, but only said: "A ship will not yield profit if empty containers owned by the operator are transported, i.e., humanitarian aid, which is transported free of charge". The Ph.D. thesis-paper (Tierney, 2013) focused on the problem of fleet (not container equipment) reposition for Liner Shipping. In (Tsilingiris, 2005) author doesn't consider the leasing costs, which arise on experimental lines in the initial stage of their development.…”

Section: Analysis Of Recent Research and Publicationsmentioning

confidence: 99%

See 1 more Smart Citation

Containership Traffic Optimization on Feeder Shipping Line

Drozhzhyn

2016

Transport and Telecommunication Journal

View full text Add to dashboard Cite

This article is devoted to feeder containership traffic optimization on the trunk and feeder shipping lines. The optimization is fulfilled in case of the necessity of laden containers delivery between fixed pairs of ports as well as in case of the requirement not to exceed the vessel's capacity, taking into account her residual value during transition between feeder port lines. The paper takes into account uneven distribution of empty container equipment in ports of line and the solution is suggested considering the estimation of the empty TEU’s number which is subject to reposition.

show abstract

Section: Analysis Of Recent Research and Publicationsmentioning

confidence: 99%

“…The presented set of constraints (2) - (15) reflects the meaning of the conditions and assumptions formed in the formulation of the problem.…”

Section: Economic and Mathematical Model Of Feeder Containership Trafmentioning

confidence: 99%

Containership Traffic Optimization on Feeder Shipping Line

Drozhzhyn

2016

Transport and Telecommunication Journal

View full text Add to dashboard Cite

show abstract

“…As with the BPCTOP, there is a high motivation to find the optimal solutions, even if solving the problem to optimality is more difficult, since the cost of repositioning a single ship can be hundreds of thousands of dollars (Tierney et al 2012b). Tierney andJensen (2012, 2013) and Tierney (2013) solve a version of the LSFRP including cargo flows, which the version we address in this paper lacks. In these two papers, the authors sacrifice the flexibility of choosing amongst several phase-in and phase-out opportunities to lower the overall problem size enough to include cargo flows.…”

Section: Liner Shipping Fleet Repositioningmentioning

confidence: 99%

CP methods for scheduling and routing with time-dependent task costs

Kelareva

Tierney

Kilby

2014

EURO Journal on Computational Optimization

Self Cite

View full text Add to dashboard Cite

A particularly difficult class of scheduling and routing problems involves an objective that is a sum of time-varying action costs, which increases the size and complexity of such problems. Solve-and-improve approaches, which find an initial solution for a simplified model and improve it using a cost function, and mixed integer programming (MIP) are often used for solving such problems. However, constraint programming (CP), particularly with lazy clause generation (LCG), has been found to be faster than MIP for some scheduling problems with time-varying action costs. In this paper, we compare CP and LCG against a solve-and-improve approach for two recently introduced problems in the area of maritime logistics with time-varying action costs: the liner shipping fleet repositioning problem (LSFRP) and the bulk port cargo throughput optimisation problem (BPCTOP). We present a novel CP model for the LSFRP, which is faster than all previous methods and outperforms a simplified automated planning model without time-varying costs. We show that a LCG solver is faster for solving the BPCTOP than a standard finite domain CP solver with a simplified model. We find that CP and LCG are effective methods for solving problems with time-dependent task costs and are worth investigating for other scheduling and routing problems that are currently being solved using MIP or solve-and-improve approaches, E. Kelareva · P. Kilby Australian National University, Canberra, Australia E. Kelareva (B) · P. Kilby NICTA, Canberra, Australia e-mail: elena.kelareva@nicta.com.au even when customized global constraints are not available. We also investigate a novel approach to solving the BPCTOP-converting the problem into a vehicle routing problem (VRP) and solving using an existing VRP solver.

show abstract

“…Much of the state-of-the-art nature of this problem is covered in the book Tierney (2015). A number of different models are presented, but we are particularly interested in the models with cargo flows (Chapter 6) and without flexible visitations.…”

Section: The Liner-shipping Fleet-repositioning Problemmentioning

confidence: 99%

“…A number of different models are presented, but we are particularly interested in the models with cargo flows (Chapter 6) and without flexible visitations. Four main models are presented in Chapter 6 of Tierney's book [42]: an arc-flow model (6.2), a path-based model (6.3), and the equipment as flows and demands models (6.4.2-6.4.3). The arc-flow model is a standard MIP that can solve many small instances, but does not scale well.…”

Section: The Liner-shipping Fleet-repositioning Problemmentioning

confidence: 99%

Towards a general formulation of lazy constraints

Pearce¹

View full text Add to dashboard Cite

show abstract

Optimizing Liner Shipping Fleet Repositioning Plans

Cited by 7 publications

References 119 publications

Containership Traffic Optimization on Feeder Shipping Line

Containership Traffic Optimization on Feeder Shipping Line

CP methods for scheduling and routing with time-dependent task costs

Towards a general formulation of lazy constraints

Contact Info

Product

Resources

About