Petrol delivery tanker assignment and routing: a case study in Hong Kong

Ng, Wan Lung; Leung, Stephen C. H.; Lam, Jolie; Pan, Shi-De

doi:10.1057/palgrave.jors.2602464

Cited by 48 publications

(26 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Russell and Chalinor [11] propose a greedy algorithm for scheduling trucks used in the pickup and delivery of crude oil. Ng et al [12] develop a decision support system to the assignment and routing of tank trucks. Cornillier et al [13] propose a heuristic for the multiperiod petrol station replenishment problem, while Benantar et al [14] formulate the problem taking into account multi-compartment trucks and time windows.…”

Section: Literature Reviewmentioning

confidence: 99%

Simulation of Tank Truck Loading Operations in a Fuel Distribution Terminal

Reis¹,

Pitombeira-Neto²,

Rolim³

2017

Int. j. simul. model.

View full text Add to dashboard Cite

Tank truck loading operations in fuel distribution terminals have particular characteristics which are challenging to simulate. Demands for different fuel types are correlated rather than independent. In addition, queuing policies which do not address the current state of the terminal may increase equipment idleness and trucks' lead time. We propose a decomposition of the joint probability distribution of fuel types and a procedure to simulate it. We also propose a new queuing policy aimed at reducing equipment idleness and trucks' lead time. The procedures are tested and validated through a discrete-event simulation model of a real fuel distribution terminal. We simulate alternative scenarios in which we increase fuel flow rate as well as the number of loading arms and test a new queuing policy. Results show the effectiveness of the simulation procedure in replicating real performance indicators. Moreover, the proposed idleness-based queuing policy resulted in lower idleness and lead time compared with a first-come-first-served policy.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Simulation of Tank Truck Loading Operations in a Fuel Distribution Terminal

Reis¹,

Pitombeira-Neto²,

Rolim³

2017

Int. j. simul. model.

View full text Add to dashboard Cite

show abstract

“…They developed bounds on the volume delivered per mile, which was used to determine customer-plant assignment. Ng et al [66] designed a decision support system combining heuristic and optimal routing for a tanker assignment and routing problem for petroleum products in Hong Kong. They reported an increase in the volume delivered as well as 10 better route designs.…”

Section: Oil Gas and Fuel Applicationsmentioning

confidence: 99%

Road-based goods transportation: a survey of real-world logistics applications from 2000 to 2015

Coelho

Renaud

Laporte

2016

INFOR: Information Systems and Operational Research

View full text Add to dashboard Cite

5The vehicle routing problem has been widely studied from a technical point of view for more than 50 years. Many of its variants are rooted in practical settings.This paper provides a survey of the main real-life applications of road-based goods transportation over the past 15 years. It reviews papers in the areas of oil, gas and fuel transportation, retail, waste collection and management, mail and package de-10 livery and food distribution. Some perspectives on future research and applications are discussed.

show abstract

“…Ng et al (2008) studied two small petrol distribution networks in Hong Kong. They presented a model for simultaneously assigning trips to trucks and stations.…”

Section: Introductionmentioning

confidence: 99%

Two metaheuristic approaches for solving the multi-compartment vehicle routing problem

et al. 2018

View full text Add to dashboard Cite

We address in this paper a multi-compartment vehicle routing problem (MCVRP) that aims to plan the delivery of different products to a set of geographically dispatched customers. The MCVRP is encountered in many industries, our research has been motivated by petrol station replenishment problem. The main objective of the delivery process is to minimize the total driving distance by the used trucks. The problem configuration is described through a prefixed set of trucks with several compartments and a set of customers with demands and prefixed delivery. Given such inputs, the minimization of the total traveled distance is subject to assignment and routing constraints that express the capacity limitations of each truck's compartment in terms of the pathways' restrictions. For the NPhardness of the problem, we propose in this paper two algorithms mainly for large problem instances: an adaptive variable neighborhood search (AVNS) and a Partially Matched Crossover PMX-based Genetic Algorithm to solve this problem with the goal of ensuring a better solution quality. We compare the ability of the proposed AVNS with the exact solution using CPLEX and a set of benchmark problem instances is used to analyze the performance of the both proposed meta-heuristics.

show abstract

Petrol delivery tanker assignment and routing: a case study in Hong Kong

Cited by 48 publications

References 15 publications

Simulation of Tank Truck Loading Operations in a Fuel Distribution Terminal

Simulation of Tank Truck Loading Operations in a Fuel Distribution Terminal

Road-based goods transportation: a survey of real-world logistics applications from 2000 to 2015

Two metaheuristic approaches for solving the multi-compartment vehicle routing problem

Contact Info

Product

Resources

About