A heuristic and hybrid method for the tank allocation problem in maritime bulk shipping

Vilhelmsen, Charlotte; Larsen, Jesper; Lusby, Richard Martin

doi:10.1007/s10288-016-0319-x

Cited by 5 publications

(3 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The research also benchmarked its performance against two other reference algorithms. Additionally, Vilhelmsen et al . (2016) proposed a hybrid method combining heuristic and optimality-based methods to allocate appropriate cargoes to tanks available for loading in maritime bulk shipping.…”

Section: Literature Reviewmentioning

confidence: 99%

“…The research also benchmarked its performance against two other reference algorithms. Additionally, JILT 21,3 Vilhelmsen et al (2016) proposed a hybrid method combining heuristic and optimality-based methods to allocate appropriate cargoes to tanks available for loading in maritime bulk shipping. The computational times were proposed to evaluate the performance of the solutions.…”

Section: The Pickup and Delivery Process In The Physical Internet Sup...mentioning

confidence: 99%

See 1 more Smart Citation

Dynamic sustainable multiple-depot vehicle routing problem with simultaneous pickup and delivery in the context of the physical internet

Kantasa-Ard

Chargui

Bekrar

et al. 2023

JILT

View full text Add to dashboard Cite

PurposeThis paper proposes an approach to solve the vehicle routing problem with simultaneous pickup and delivery (VRPSPD) in the context of the Physical Internet (PI) supply chain. The main objective is to minimize the total distribution costs (transportation cost and holding cost) to supply retailers from PI hubs.Design/methodology/approachMixed integer programming (MIP) is proposed to solve the problem in smaller instances. A random local search (RLS) algorithm and a simulated annealing (SA) metaheuristic are proposed to solve larger instances of the problem.FindingsThe results show that SA provides the best solution in terms of total distribution cost and provides a good result regarding holding cost and transportation cost compared to other heuristic methods. Moreover, in terms of total carbon emissions, the PI concept proposed a better solution than the classical supply chain.Research limitations/implicationsThe sustainability of the route construction applied to the PI is validated through carbon emissions.Practical implicationsThis approach also relates to the main objectives of transportation in the PI context: reduce empty trips and share transportation resources between PI-hubs and retailers. The proposed approaches are then validated through a case study of agricultural products in Thailand. Social implicationsThis approach is also relevant with the reduction of driving hours on the road because of share transportation results and shorter distance than the classical route planning.Originality/valueThis paper addresses the VRPSPD problem in the PI context, which is based on sharing transportation and storage resources while considering sustainability.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Section: The Pickup and Delivery Process In The Physical Internet Sup...mentioning

confidence: 99%

Dynamic sustainable multiple-depot vehicle routing problem with simultaneous pickup and delivery in the context of the physical internet

Kantasa-Ard

Chargui

Bekrar

et al. 2023

JILT

View full text Add to dashboard Cite

show abstract

“…Hvattum et al (2009) present several models for the TAP that arises in maritime liquid bulk shipping, considering the loads being moved on and off the ship along a given trading route. Vilhelmsen et al (2016) further propose a hybrid method that can produce a feasible solution within a short period of time for a TAP on a given route. There also exist in the literature other types of loading and allocation problems in maritime transportation.…”

Section: Introductionmentioning

confidence: 99%

A two-phase heuristic for an in-port ship routing problem with tank allocation

Wang

Arnesen

Fagerholt

et al. 2018

Computers & Operations Research

View full text Add to dashboard Cite

This paper addresses an in-port ship routing problem with tank allocation that arises in the chemical shipping industry. The aim is to optimize a tanker's port call operation that integrates sequencing decisions for visiting terminals and allocating cargo loads to available tanks while taking into account cargo time windows, terminal draft limits and various tank allocation restrictions. We model the problem as a Traveling Salesman Problem with Pickups and Deliveries, Time Windows, Draft Limits and Tank Allocation (TSPPD-TWDLTA), and propose a two-phase heuristic to solve it. Computational studies show that the heuristic is able to provide good solutions to real-sized in-port routing problems with tank allocation in chemical shipping in a reasonable amount of time.

show abstract

Research on Refined Oil Distribution Strategy and Oil Gas Recovery Joint Optimization

Wang

Xiang

2020

Uncertainty and Operations Research

View full text Add to dashboard Cite

A heuristic and hybrid method for the tank allocation problem in maritime bulk shipping

Cited by 5 publications

References 14 publications

Dynamic sustainable multiple-depot vehicle routing problem with simultaneous pickup and delivery in the context of the physical internet

Dynamic sustainable multiple-depot vehicle routing problem with simultaneous pickup and delivery in the context of the physical internet

A two-phase heuristic for an in-port ship routing problem with tank allocation

Research on Refined Oil Distribution Strategy and Oil Gas Recovery Joint Optimization

Contact Info

Product

Resources

About