Periodic Capacitated Vehicle Routing for Retail Distribution of Fuel Oils

Carotenuto, Pasquale; Giordani, Stefano; Massari, Simone; Vagaggini, Fabrizio

doi:10.1016/j.trpro.2015.09.027

Cited by 19 publications

(14 citation statements)

References 25 publications

(28 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…They found new best solutions for a number of large instances. The periodic VRP for Retail Distribution of Fuel Oils studied by Carotenuto et al [16], a hybrid genetic algorithm was developed for solving it on a set of real case studies and on a set of randomly generated instances. Carotenuto et al [16] provided a mathematical formulation for the multi-depot periodic VRP.…”

Section: Related Workmentioning

confidence: 99%

“…The periodic VRP for Retail Distribution of Fuel Oils studied by Carotenuto et al [16], a hybrid genetic algorithm was developed for solving it on a set of real case studies and on a set of randomly generated instances. Carotenuto et al [16] provided a mathematical formulation for the multi-depot periodic VRP. They also proposed a hybrid genetic algorithm for solving the problem due to the large size of the real instances which the company has to deal with.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Hybrid ANT Colony Algorithm for the Multi-depot Periodic Open Capacitated Arc Routing Problem

Kanso¹

2020

IJAIA

View full text Add to dashboard Cite

In this paper we present a hybrid technique that applies an ant colony optimization algorithm followed by simulated annealing local search approach to solving the Multi-Depot Periodic Open Capacitated Arc Routing Problem (MDPOCARP). This problem is a new variant of OCARP that has never been studied in the literature and consists of determining optimal routes in each period where each route starts from a given depot, visits a list of required edges and finishes by the last one. The final edge of the route is not required to be a depot. We developed a constructive heuristic, called Nearest Insertion Heuristic (NIH) to build an initial solution. The proposed algorithm is evaluated on three different benchmarks sets and numerical results show that the proposed approach achieves highly efficient results.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Hybrid ANT Colony Algorithm for the Multi-depot Periodic Open Capacitated Arc Routing Problem

Kanso¹

2020

IJAIA

View full text Add to dashboard Cite

show abstract

“…Surjandari et al (2011) proposed the Tabu search algorithm for solving the petrol station replenishment problem. Carotenuto et al (2015) proposed a Hybrid genetic algorithm for solving the periodic vehicle routing problem (PVRP) for fuel-oil distribution. Moreover, a decision support approach hierarchical planning system was developed for solving oil procurement planning (Kallestrup et al, 2014).…”

Section: The Fuel Delivery Problemmentioning

confidence: 99%

A novel two-phase approach for solving the multi-compartment vehicle routing problem with a heterogeneous fleet of vehicles: a case study on fuel delivery

Chowmali¹,

Sukto²

2020

10.5267/j.dsl

View full text Add to dashboard Cite

Distribution of goods is one of the main issues that directly affect the performance of the companies since efficient distribution of goods saves energy costs and also leads to reduced environmental impact. The multi-compartment vehicle routing problem (MCVRP) with a heterogeneous fleet of vehicles is encountered when dealing with this situation in many practical cases. This paper is motivated by the fuel delivery problem where the main objective of this research is to minimize the total driving distance using a minimum number of vehicles. Based on a case study of twenty petrol stations in northeastern Thailand, a novel two-phase heuristic, which is a variant of the Fisher and Jaikumar Algorithm (FJA), is proposed. The study first formulates an MCVRP model and then a mixed-integer linear programming (MILP) model is formulated for selecting the numbers and types of vehicles. A new clustering-based model is also developed in order to select the seed nodes and all customer nodes are considered as candidate seed nodes. The new Generalized Assignment Problem model (GAP model) is formulated to allocate the customers into each cluster. Finally, based on the traveling salesman problem (TSP), each cluster is solved in order to minimize the total driving distance. Numerical results show that the proposed heuristic is effective for solving the proposed model. The proposed algorithm can be used to minimize the total driving distance and the number of vehicles of the distribution network for fuel delivery.

show abstract

“…Vidović et al (2014) expanded the scale of the above problem and developed an algorithm that could provide a solution over more days and for more stations (5 days and 50 petrol stations). Carotenuto et al (2015) proposed a genetic algorithm (GA) to address the unloading of a single type of petrol product in a largescale problem (at most 200 stations), with the objective of minimizing the total vehicle distance travelled within a week.…”

Section: Literature Reviewmentioning

confidence: 99%

A metaheuristic method for the multireturn-to-depot petrol truck routing problem with time windows

et al. 2019

View full text Add to dashboard Cite

The petrol truck routing problem is an important part of the petrol supply chain. This study focuses on determining routes for distributing petrol products from a depot to petrol stations with the objective of minimizing the total travel cost and the fixed cost required to use the trucks. We propose a mathematical model that considers petrol trucks returning to a depot multiple times and develop a heuristic algorithm based on a local branch-and-bound search with a tabu list and the Metropolis acceptance criterion. In addition, an approach that accelerates the solution process by adding several valid inequalities is presented. In this study, the trucks are homogeneous and have two compartments, and each truck can execute at most three tasks daily. The sales company arranges the transfer amount and the time windows for each station. The performance of the proposed algorithm is evaluated by comparing its results with the optimal results. In addition, a real-world case of routing petrol trucks in Beijing is studied to demonstrate the effectiveness of the proposed approach.

show abstract

Periodic Capacitated Vehicle Routing for Retail Distribution of Fuel Oils

Cited by 19 publications

References 25 publications

Hybrid ANT Colony Algorithm for the Multi-depot Periodic Open Capacitated Arc Routing Problem

Hybrid ANT Colony Algorithm for the Multi-depot Periodic Open Capacitated Arc Routing Problem

A novel two-phase approach for solving the multi-compartment vehicle routing problem with a heterogeneous fleet of vehicles: a case study on fuel delivery

A metaheuristic method for the multireturn-to-depot petrol truck routing problem with time windows

Contact Info

Product

Resources

About