Containership routing with time deadlines and simultaneous deliveries and pick-ups

Karlaftis, Matthew G.; Κεπαπτσόγλου, Κωνσταντίνος; Sambracos, Evangelos

doi:10.1016/j.tre.2008.05.001

Cited by 120 publications

(57 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Increasing importance of reverse logistics activities (Karlaftis et al (2009) Zerhouni et al (2013)). Mathematical models developed for the VRPSPD can be found in Dethlo (2001)), Montané and Galvão (2006) and Nagy and Salhi (2005) day) of a given time horizon (e.g., one week) and how much to deliver to each one of them, whereas Bertazzi et al (2008) explain that the inventory component arises because customers consume products over time and have a limited storage capacity.…”

Section: State Of the Artmentioning

confidence: 99%

The inventory-routing problem of returnable transport items with time windows and simultaneous pickup and delivery in closed-loop supply chains

Iassinovskaia

Limbourg

Riane³

2017

International Journal of Production Economics

105

View full text Add to dashboard Cite

Reducing environmental impact, related regulations and potential for operational benets are the main reasons why companies share their returnable transport items (RTIs) among the dierent partners of a closed-loop supply chain. In this paper, we consider a producer, located at a depot, who has to distribute his products packed in RTIs to a set of customers. Customers dene a time window wherein the service can begin. The producer is also in charge of the collection of empty RTIs for reuse in the next production cycle. Each partner has a storage area composed of both empty and loaded RTI stock, as characterized by initial levels and maximum storage capacity. As deliveries and returns are performed by a homogeneous eet of vehicles that can carry simultaneously empty and loaded RTIs, this research addresses a pickup and delivery inventory-routing problem within time windows (PDIRPTW) over a planning horizon.A mixed-integer linear program is developed and tested on small-scale instances. To handle more realistic large-scale problems, a cluster rst-route second matheuristic is proposed.

show abstract

Section: State Of the Artmentioning

confidence: 99%

The inventory-routing problem of returnable transport items with time windows and simultaneous pickup and delivery in closed-loop supply chains

Iassinovskaia

Limbourg

Riane³

2017

International Journal of Production Economics

105

View full text Add to dashboard Cite

show abstract

“…Salhi [13] also developed a solution for a heterogeneous fleet of vehicles routing through a heuristic improvement: an exchange of customers between routes, evaluation of the relationship that relates the fixed and operational costs. Among others, Taner et al [14], Caric et al [15], Karlaftis et al [16] or Jarpa et al [17] also address the problem related to vehicle routing.…”

Section: Fleet Management Optimizationmentioning

confidence: 99%

Sizing a fleet of containerships for a given market

Silva

Soares

2014

PROMET

View full text Add to dashboard Cite

show abstract

“…The solution method is based on complete enumeration solved by a MIP solver. Similarly, Karlaftis et al (2009) solve a problem for the region of the Aegean sea using a genetic algorithm. These models do not deal with transhipments at multiple ports and the resulting interaction between different services.…”

Section: Introductionmentioning

confidence: 99%

A matheuristic for the liner shipping network design problem

Brouer

Desaulniers

Pisinger

2014

Transportation Research Part E: Logistics and Transportation Re

View full text Add to dashboard Cite

We present a matheuristic, an integer programming based heuristic, for the Liner Shipping Network Design Problem. The heuristic applies a greedy construction heuristic based on an interpretation of the liner shipping network design problem as a multiple quadratic knapsack problem. The construction heuristic is combined with an improvement heuristic with a neighborhood defined by the solution space of a mixed integer program. The mixed integer program optimizes the removal and insertion of several port calls on a liner shipping service. The objective function is based on evaluation functions for revenue and transshipment of cargo along with in/decrease of vessel-and operational cost for the current solution. The evaluation functions may be used by heuristics in general to evaluate changes to a network design without solving a large scale multicommodity flow problem.

show abstract

Containership routing with time deadlines and simultaneous deliveries and pick-ups

Cited by 120 publications

References 21 publications

The inventory-routing problem of returnable transport items with time windows and simultaneous pickup and delivery in closed-loop supply chains

The inventory-routing problem of returnable transport items with time windows and simultaneous pickup and delivery in closed-loop supply chains

Sizing a fleet of containerships for a given market

A matheuristic for the liner shipping network design problem

Contact Info

Product

Resources

About