Wyniki wyszukiwania - Biblioteka Nauki

Nowa wersja platformy, zawierająca wyłącznie zasoby pełnotekstowe, jest już dostępna.
Przejdź na https://bibliotekanauki.pl

Ograniczanie wyników

2 Journal of Sustainable Development of Transport and Logistics

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

Five years of multi-depot vehicle routing problems

100%

Jayarathna N. , Lanel J. , Juman Z. A. M. S.

Journal of Sustainable Development of Transport and Logistics

2020

tom Vol. 5, No. 2

109--123

With vast range of applications in real life situations, the Vehicle Routing Problems (VRPs) have been the subject of countless studies since the late 1950s. However, a more realistic version of the classical VRP, where the distribution of goods is done from several depots is the Multi-Depot Vehicle Routing Problem (MDVRP), which has been the central attraction of recent researches. The objective of this problem is to find the routes for vehicles to serve all the customers at a minimal cost in terms of the number of routes and the total distance travelled without violating the capacity and travel time constraints of the vehicles, and it is handled with a variety of assumptions and constraints in the existing literature. This survey reviews the current status of the MDVRP and discuss the future direction regarding this problem.

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

100%

Jayarathna D. G. N. D. , Lanel G. H. J. , Juman Z. A. M. S.

Journal of Sustainable Development of Transport and Logistics

2021

tom Vol. 6, No. 2

43--59

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.