Brouer, Berit Dangaard

Desaulniers, Guy

Karsten, Christian Vad

Pisinger, David

Online Research Database In Technology

                       General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights.  • Users may download and print one copy of any publication from the public portal for the purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain • You may freely distribute the URL identifying the publication in the public portal   If you believe that this document breaches copyright please contact us providing details, and we will remove access to the work immediately and investigate your claim.     Downloaded from orbit.dtu.dk on: Dec 21, 2017A matheuristic for the liner shipping network design problem considering transit timerestrictionsBrouer, Berit Dangaard; Desaulniers, Guy; Karsten, Christian Vad; Pisinger, DavidPublication date:2014Document VersionPeer reviewed versionLink back to DTU OrbitCitation (APA):Brouer, B. D., Desaulniers, G., Karsten, C. V., & Pisinger, D. (2014). A matheuristic for the liner shipping networkdesign problem considering transit time restrictions. Abstract from ROUTE 2014, Snekkersted, Denmark.A matheuristic for the liner shipping network design problemconsidering transit time restrictionsBerit Dangaard Brouera,, Guy Desaulniersb, Christian Vad Karstena, David PisingeraaDepartment of Management Engineering, Technical University of Denmark, Produktionstorvet, Building 426,DK-2800 Kgs. Lyngby, DenmarkbPolytechnique Montre´al and GERAD, Department of mathematics and industrial engineering, C.P. 6079, Succ.Centre-Ville, Montre´al, Que´bec, Canada H3C 3A7AbstractThe liner shipping network design problem (LSNDP) is to construct a set of cyclic services (routes)to form a capacitated network for the transport of containerized cargo. The network design maxi-mizes the revenue of container transport considering the cost of vessels deployed to services, overallfuel consumption, port call costs and cargo handling costs. The liner shipping industry transportsabout 60% of the value of seaborne trade and inherently the lead time for a container transportincurs an inventory cost to the shipper. Therefore, the transit time of a container transport isan important parameter for a competitive liner shipping network. Literature on the LSNDP isquite scarce [3] compared to related maritime shipping transportation problems, but recent yearsshowed increased interest in the LSNDP (Agarwal and Ergun [1], Alvarez [2], Reinhardt andPisinger [7], Brouer et al. [3], Plum et al. [6]). Research on the LSNDP has focused on maximizingrevenue through efficient capacity utilization and minimization of cost. A reference model for theLSNDP and a benchmark suite of liner shipping network instances was introduced by Brouer et al.[3]. The benchmark instances for the LSNDP without transit time restrictions have been solvedby a heuristic column generator using a MIP to construct new routes in Brouer et al. [3] and by acomposite matheuristic in Brouer et al. [4]. In the present work we will extend the matheuristicpresented in Brouer et al. [4], which combines a greedy construction heuristic with an improvementheuristic fine tuning the current solution by solving an integer program (IP ) for each service toidentify a set of promising port call insertions and removals for each individual service. The transittime restrictions are not necessarily aligned with the desire to maximize utilization of the vessels inthe network, and increases the complexity of the multi-commodity flow problem (MCFP), whichneeds to be solved repeatedly to evaluate a given network configuration. Solving the MCFP with-out transit time restrictions has been identified as a bottleneck in local search methods for theLSNDP in [2, 3]. Karsten et al. [5] introduce a time constrained multi-commodity flow problemand computational experiments are performed on liner shipping networks from the matheuristicof Brouer et al. [4] extending the evaluation of the network to consider transit time restrictionson each individual cargo flow. The time constrained multi-commodity flow problem restricts allcargo transports to respect the maximal transit time from LINER-LIB 2012 for each commodity.The computational experiments of Karsten et al. [5] show that as little as 65% of the cargo, thatcould potentially be transported in an unconstrained network, can be met, when imposing timelimits in the considered instances. In Karsten et al. [5] a reduction of the graph along with anextension to handle groups of commodities in a single pass of a resource constrained shortest pathproblem result in computationally efficient evaluation of a given network design. In this work weEmail addresses: blof@dtu.dk (Berit Dangaard Brouer ), guy.desaulniers@gerad.ca (Guy Desaulniers),chrkr@dtu.dk (Christian Vad Karsten), pisinger@dtu.dk (David Pisinger)12will present a reformulation of the reference model from Brouer et al. [3] to consider transit timesfor each individual commodity in the liner shipping network design problem with transit timerestrictions (LSNDP-TT). We will extend the matheuristic of Brouer et al. [4] to consider transittime restrictions in the search. Computational results for the benchmark suite LINER-LIB 2012will be presented.References[1] R. Agarwal and O. Ergun. Ship scheduling and network design for cargo routing in linershipping. Transportation Science, 42(2):175–196, 2008.[2] J. F. Alvarez. Joint routing and deployment of a fleet of container vessels. Maritime Economics& Logistics, 11(2):186–208, 2009.[3] B.D. Brouer, J.F. Alvarez, C.E.M Plum, D. Pisinger, and M.M. Sigurd. A base integer program-ming model and benchmark suite for liner shipping network design. Transportation Science,2013. doi: 10.1287/trsc.2013.0471.[4] B.D Brouer, G. Desaulniers, and D. Pisinger. A matheuristic for the liner shipping networkdesign problem. Working paper, 2014.[5] C.V. Karsten, D. Pisinger, S. Ropke, and B.D. Brouer. The time constrained multi-commoditynetwork flow problem and its application to liner shipping network design. Working paper,2014.[6] C.E.M. Plum, D. Pisinger, and M. M. Sigurd. A service flow model for the liner shippingnetwork design problem. European Journal of Operational Research, 235(2):378–386, 2014.[7] L. B. Reinhardt and D. Pisinger. A branch and cut algorithm for the container shipping networkdesign problem. Flexible Services and Manufacturing Journal, 24(3):349–374, 2012.

A matheuristic for the liner shipping network design problem considering transit time restrictions

http://orbit.dtu.dk/ws/files/118301610/A_matheuristic_for_the_liner_1.pdf

A matheuristic for the liner shipping network design problem considering transit time restrictions

Abstract

Similar works

Full text

Available Versions

Online Research Database In Technology