Solving a fuel delivery problem by heuristic and exact approaches

Avella, Pasquale; Boccia, Maurizio; Sforza, Antonio

doi:10.1016/s0377-2217(02)00676-8

Cited by 113 publications

(66 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Varian MRK ini telah dibahas oleh Christofides et al [17]. Penelitian lainnya, antara lain, adalah Chajakis and Guignard [18], Avella et al [19], El Fallahi et al [20], Derigs et al [21], dan Reed et al [22].…”

Section: * Penulis Korespondensiunclassified

Algoritma Genetika untuk Pemecahan Masalah Rute Kendaraan dengan Ukuran dan Campuran Armada, Trip Majemuk, Pengiriman Terbagi, Produk Majemuk, dan Kendaraan dengan Kompartemen Majemuk

Suprayogi

Paillin

2018

jti

View full text Add to dashboard Cite

This paper discusses a variant of the basic vehicle routing problem (VRP) by including the following characteristics: fleet size and mix, multiple trips, split delivery, multiple products, and multiple compartments. One of real cases of this problem is related to determining tanker's routes in delivering fuel products from a supply port to a number of destination ports. Each tanker has several compartments where each compartment is dedicated to a certain fuel product. In this paper, a solution approach based on genetic algorithm (GA) is proposed and tested using nine hypothetical instances. Experiment results show that the proposed GA gives consistent results measured by coefficient variations.

show abstract

Section: * Penulis Korespondensiunclassified

Algoritma Genetika untuk Pemecahan Masalah Rute Kendaraan dengan Ukuran dan Campuran Armada, Trip Majemuk, Pengiriman Terbagi, Produk Majemuk, dan Kendaraan dengan Kompartemen Majemuk

Suprayogi

Paillin

2018

jti

View full text Add to dashboard Cite

show abstract

“…In the case of Michigan, they reduced the number of tankers used from 130 to 102 over a one-week planning period. Avella et al [9] studied the case of a company 30 supplying three types of fuel to a set of gas stations located in an urban area. They considered that each tank in the delivery vehicles must be either completely full or completely empty.…”

Section: Oil Gas and Fuel Applicationsmentioning

confidence: 99%

“…[31] studied a problem similar to that of Avella et al [9] but also considered the loading of tanker trucks divided into compartments, which is of primary importance since there are several small gas stations throughout Eastern Quebec, the area of application, 5 and because trucks are not equipped with flow meters. Song and Savelsbergh [81] worked with Praxair on another variant of the inventory-routing problem.…”

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

“…Further applications of MCVRP in the context of petrol station replenishment were presented in the literature, Avella et al (2004) developed a heuristic and branch-and-price algorithm based on a set partitioning formulation to solve a realword petrol replenishment problem with several tank-trucks of different types. Ng et al (2008) studied two small petrol distribution networks in Hong Kong.…”

Section: Introductionmentioning

confidence: 99%

“…To the best of our knowledge, few other contributions have considered the variant defined above of the MCVRP and have solved the problem without taking into account its periodicity aspect (Avella et al 2004;Coelho and Laporte 2015;Lahyani et al 2015), stochastic demands (Elbek and Wøhlk 2016), time windows (Cornillier et al 2009), free assignment of products to compartments (Oppen and Løkketangen 2008;Cornillier et al 2009;Coelho and Laporte 2015). Both these works fall under the category of inventory-routing problems.…”

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

Solving a fuel delivery problem by heuristic and exact approaches

Cited by 113 publications

References 11 publications

Algoritma Genetika untuk Pemecahan Masalah Rute Kendaraan dengan Ukuran dan Campuran Armada, Trip Majemuk, Pengiriman Terbagi, Produk Majemuk, dan Kendaraan dengan Kompartemen Majemuk

Algoritma Genetika untuk Pemecahan Masalah Rute Kendaraan dengan Ukuran dan Campuran Armada, Trip Majemuk, Pengiriman Terbagi, Produk Majemuk, dan Kendaraan dengan Kompartemen Majemuk

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