Five years of multi-depot vehicle routing problems

Jayarathna, Nuwan Dhammika; Lanel, Jayantha; Juman, Z. A. M. S.

doi:10.14254/jsdtl.2020.5-2.10

Cited by 13 publications

(6 citation statements)

References 38 publications

(48 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Finding the best routes for fleets to reach their customers has been the primary focus of the VRP -Vehicle Routing Problem, which involves calculating the lowest cost delivery directions or paths from a depot to a set of geographically dispersed client's crosswise manner (Jayarathna & Jayawardene 2019;Jayarathna et al 2019a, b;Jayarathna et al 2020Jayarathna et al , 2021aJayarathna et al , 2021bJayarathna et al ,2021c. While most of the literature has focused on inventory control within the warehouse concerning mini-applications of travel plans without having a holistic one, this research is formulated to address the issue of transportation from the warehouse to mini-hubs and from them to the retailers.…”

Section: Related Workmentioning

confidence: 99%

Optimizing petroleum redistribution in Sri Lanka: A cost-benefit transportation model

Jayarathna

2024

J. sustain. dev. transp. logist.

View full text Add to dashboard Cite

This case study is based on Ceylon Petroleum Corporation, Sri Lanka, the national oil and gas company and market leader in Sri Lanka. The company’s outbound logistics consists of a centralized distribution method and a redistribution process of its products across the island. However, this study mainly focused on one regional depot and one petroleum product, Kotagala depot and Lanka Auto Diesel. The currently centralized redistribution process has noticed extra routing costs due to the unreasonable consumption of additional distance. This problem is modelled as a variant of the vehicle routing problem with a heterogeneous vehicle fleet. Our objective is to minimize the routing costs (or milk-run) by imposing constraints on the capacity and the volume. The researcher introduces a centralized vehicle routing problem that is presented. The proposed vehicle routing problem has been used to find the optimal path between clusters. The computational investigation highlights the cost savings that this new VRP can accrue. Cost savings can be accrued as large as 32.35% compared to a company's existing method.

show abstract

Section: Related Workmentioning

confidence: 99%

Optimizing petroleum redistribution in Sri Lanka: A cost-benefit transportation model

Jayarathna

2024

J. sustain. dev. transp. logist.

View full text Add to dashboard Cite

show abstract

“…(Mwikali & Kavale, 2012) presented heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries. (Adipola,2017;Jayarathna, 2020;2021) introduced a branch-and-price approach to address a vehicle routing problem with time windows and multiple uses of vehicles. (Mwikali & Kavale, 2012) developed a solution approach for solving VRPTWs with constraint programming-based column generation.…”

Section: Issn 2520-2979mentioning

confidence: 99%

Modeling a cost benefit transportation model to optimize the redistribution process: Evidence study from Sri Lanka

Jayarathna

Lanel

Juman

2021

J. sustain. dev. transp. logist.

View full text Add to dashboard Cite

This study is a case study based on Softlogic Retail (Pvt) Ltd, Sri Lanka, which is a famous consumer electronics company and market leader in Sri Lanka. This company's outbound logistics have been considered in this research, and they are mainly forced into the redistribution process in Sri Lanka. Extra routing costs due to unreasonable consumption of additional distance have been noticed in the current redistribution process. Here, this problem is modeled as a variant of the vehicle routing problem with a heterogeneous vehicle fleet. Our objective is to minimize warehouse operation, administration, and transportation costs by imposing constraints on capacity and volume. The researchers propose new heuristic solutions to the problem. A proposed heuristic algorithm has been used to find the optimal path between clusters. The computational investigation highlights the cost savings that can be accrued by this new heuristic. The cost savings can be accrued at a rate of as much as 37.5 % compared to the company's existing method.

show abstract

“…In the academic environment, a mathematical representation of the goods transport in a logistics company is provided by the Vehicle Routing Problem (VRP) and its variants, which includes the minimization of the total distance traversed by a fleet of vehicles to meet the demand of geographically dispersed customers, subject to operational constraints. Involved in the VRP framework, the Multi-Depot Vehicle Routing Problem (MDVRP) corresponds to an essential and challenging approach in logistics management that has been considered mainly during the last decade by researchers and practitioners (Jayarathna et al, 2021;Karakatič & Podgorelec, 2015;Jayarathna et al, 2020). According to the MDVRP dynamics, several depots are presented from which the vehicles start and end their respective routes, delivering the demand to the customers that are spatially distributed.…”

Section: Introductionmentioning

confidence: 99%

A hybrid heuristic approach for the multi-objective multi depot vehicle routing problem

Londoño,

González,

Giraldo

et al. 2024

10.5267/j.ijiec

View full text Add to dashboard Cite

Efficiency in logistics is often affected by the fair distribution of the customers along the routes and the available depots for goods delivery. From this perspective, in this study, the Multi-depot Vehicle Routing Problem (MDVRP), by considering two objectives, is addressed. The two objectives in conflict for MDVRP are the distance traveled by vehicles and the standard deviation of the routes’ length. A significant standard deviation value provides a small distance traveled by vehicles, translated into unbalanced routes. We have used a weighted average objective function involving the two objectives. A Variable Neighborhood Search algorithm within a Chu-Beasley Genetic Algorithm has been proposed to solve the problem. For decision-making purposes, several values are chosen for the weight factors multiplying the terms at the objective function to build up a non-dominated front of solutions. The methodology is tested in large-size instances for the MDVRP, reporting noticeable results for managerial insights.

show abstract

Five years of multi-depot vehicle routing problems

Abstract: This open access article is distributed under a Creative Commons Attribution (CC-BY) 4.0 license.

Cited by 13 publications

References 38 publications

Optimizing petroleum redistribution in Sri Lanka: A cost-benefit transportation model

Optimizing petroleum redistribution in Sri Lanka: A cost-benefit transportation model

Modeling a cost benefit transportation model to optimize the redistribution process: Evidence study from Sri Lanka

A hybrid heuristic approach for the multi-objective multi depot vehicle routing problem

Contact Info

Product

Resources

About