A maritime inventory routing problem: Practical approach

Song, Jin-Hwa; Furman, Kevin C.

doi:10.1016/j.cor.2010.10.031

Cited by 109 publications

(76 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…These event based models are known as time continuous models [13]. In [1,17,19,20,24,25], and [28] time discrete models are developed to capture the complicating factors with varying production and consumption rates.…”

Section: Literature Reviewmentioning

confidence: 99%

“…In [20] valid inequalities are included to improve the formulation presented for the liquefied natural gas inventory routing problem. Finally, [28] presents valid inequalities for MIRPs including several practical constraints for solving problems in different shipping segments.…”

Section: Literature Reviewmentioning

confidence: 99%

“…As discussed in both [6] and [28], most combined maritime routing and inventory management problems described in the literature have particular features and characteristics, and tailor-made methods are developed to solve the problems. These methods are often based on heuristics or decomposition techniques.…”

Section: Literature Reviewmentioning

confidence: 99%

“…Currently, it is possible to obtain optimal or near optimal solutions to small real instances occurring in maritime transportation problems using commercial solvers. See [2] for the case of Cape Verde, and [1,21,26,28].…”

Section: Literature Reviewmentioning

confidence: 99%

“…These problems are often called Maritime Inventory Routing Problems (MIRPs). Most of the published MIRP contributions are based on real cases from the industry, see for the single product case [7,9,18,16,17,20,29] and for the multiple products case [5,11,24,25,27,28].…”

Section: Literature Reviewmentioning

confidence: 99%

See 4 more Smart Citations

Discrete time and continuous time formulations for a short sea inventory routing problem

2016

View full text Add to dashboard Cite

We consider a fuel oil distribution problem where an oil company is responsible for the routing and scheduling of ships between ports such that the demand for various fuel oil products is satisfied during the planning horizon. The production/consumption rates are given and assumed to be constant. We provide two alternative mixed integer formulations: a discrete time model adapted from the case where the production/consumption rates are varying and a classical continuous time formulation. We discuss different extended formulations and valid inequalities that allow us to reduce the linear gap of the two initial formulations. A computational study comparing the various models accordingly to their size, linear gap and running time, was conducted based on real small-size instances, using a commercial software.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Section: Literature Reviewmentioning

confidence: 99%

Section: Literature Reviewmentioning

confidence: 99%

Section: Literature Reviewmentioning

confidence: 99%

Section: Literature Reviewmentioning

confidence: 99%

See 3 more Smart Citations

Discrete time and continuous time formulations for a short sea inventory routing problem

2016

View full text Add to dashboard Cite

show abstract

A maritime inventory routing problem: Discrete time formulations and valid inequalities

et al. 2013

View full text Add to dashboard Cite

show abstract

A matheuristic algorithm for the mixed capacitated general routing problem

Bosco¹,

Laganí

Musmanno

et al. 2014

Networks

View full text Add to dashboard Cite

We study the general routing problem defined on a mixed graph and subject to capacity constraints. Such a problem aims to find the set of routes of minimum overall cost servicing a subset of required elements like vertices, arcs, and edges, without exceeding the capacity of a fleet of homogeneous vehicles based at the same depot. The problem is a generalization of a large variety of node and arc routing problems. It belongs to the family of NP‐hard combinatorial problems. Instances with a small number of vehicles and required elements can be effectively solved by means of exact methods. Heuristic approaches are helpful to obtain feasible solutions for medium to large size instances. In this article, we present a matheuristic approach to the problem, in which a set of neighborhood structures is iteratively searched and a branch‐and‐cut algorithm is used to improve the quality of the solutions found during the search. The search is iterated within a defined global number of steps, in which the solution space is explored. We demonstrate the effectiveness of this approach through an extensive computational study on several benchmark instances. © 2014 Wiley Periodicals, Inc. NETWORKS, Vol. 64(4), 262–281 2014

show abstract

A maritime inventory routing problem: Practical approach

Cited by 109 publications

References 12 publications

Discrete time and continuous time formulations for a short sea inventory routing problem

Discrete time and continuous time formulations for a short sea inventory routing problem

A maritime inventory routing problem: Discrete time formulations and valid inequalities

A matheuristic algorithm for the mixed capacitated general routing problem

Contact Info

Product

Resources

About