Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "Juman, Z. A. M. S." wg kryterium: Autor


Wyświetlanie 1-3 z 3
Tytuł:
Five years of multi-depot vehicle routing problems
Autorzy:
Jayarathna, Nuwan
Lanel, Jayantha
Juman, Z. A. M. S.
Powiązania:
https://bibliotekanauki.pl/articles/2141080.pdf
Data publikacji:
2020
Wydawca:
Fundacja Centrum Badań Socjologicznych
Tematy:
multi-depot vehicle routing problem
exact methods
heuristic
meta-heuristic
Opis:
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.
Źródło:
Journal of Sustainable Development of Transport and Logistics; 2020, 5, 2; 109-123
2520-2979
Pojawia się w:
Journal of Sustainable Development of Transport and Logistics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Modeling a cost benefit transportation model to optimize the redistribution process: Evidence study from Sri Lanka
Autorzy:
Jayarathna, D. G. Nuwan Dhammika
Lanel, G. H. J.
Juman, Z. A. M. S.
Powiązania:
https://bibliotekanauki.pl/articles/2141165.pdf
Data publikacji:
2021
Wydawca:
Fundacja Centrum Badań Socjologicznych
Tematy:
vehicle routing problem
heterogeneous vehicle fleet
redistribution process
heuristic method
Opis:
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.
Źródło:
Journal of Sustainable Development of Transport and Logistics; 2021, 6, 2; 43-59
2520-2979
Pojawia się w:
Journal of Sustainable Development of Transport and Logistics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Attaining a good primal solution to the uncapacitated transportation problem
Autorzy:
Juman, Z. A. M. S. Silmi
Nawarathne, N. G. S. A.
Hisam, M. S. M.
Powiązania:
https://bibliotekanauki.pl/articles/2141215.pdf
Data publikacji:
2022
Wydawca:
Fundacja Centrum Badań Socjologicznych
Tematy:
logistics and supply chain management
uncapacitated transportation problem
supply and demand requirements
primal solution
minimal total cost solution
Opis:
Transportation of products from sources to destinations with minimal total cost plays an important role in logistics and supply chain management. The Uncapacitated Transportation Problem (UTP) is a special case of network flow optimization problem. The prime objective of this UTP is to minimize the total cost of transporting products from origins to destinations subject to the respective supply and demand requirements. The UTP consists of special network structure. Due to the special structure of this problem, the transportation algorithm is preferred to solve it. The transportation algorithm consists of two major steps: 1) Finding an Initial Feasible Solution (IFS) to TP and 2) Examining the optimality of this IFS. A better IFS generates a lesser number of iterations to obtain a Minimal Total Cost Solution (MTCS). Recently, Juman and Nawarathne (2019)’s Method was introduced to find an IFS to UTP. In this paper, the Juman and Nawarathne (2019)’s Method is improved to get a better IFS to a UTP. A comparative study on a set of benchmark instances illustrates that the new improved method provides better primal solutions compared to the Juman and Nawarathne (2019)’s Method. The proposed method is found to yield the minimal total cost solutions to all the benchmark instances.
Źródło:
Journal of Sustainable Development of Transport and Logistics; 2022, 7, 1; 51-61
2520-2979
Pojawia się w:
Journal of Sustainable Development of Transport and Logistics
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-3 z 3

    Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies