Találati lista | Tudóstér

001-es BibID:	BIBFORM101696
035-os BibID:	(Scopus)85130388120 (WOS)000795560900001
Első szerző:	Le Thi Diem Chau (PhD hallgató)
Cím:	Clustering algorithm for a vehicle routing problem with time windows / Thi Diem Chau Le, Duc Duy Nguyen, Judit Oláh, Miklós Pakurár
Dátum:	2022
ISSN:	1648-4142 1648-3480
Megjegyzések:	The demand for daily food purchases has increased dramatically, especially during the Covid-19 pandemic. This requires suppliers to face a huge and complex problem of delivering products that meet the needs of their customers on a daily basis. It also puts great pressure on managers on how to make day-to-day decisions quickly and efficiently to both satisfy customer requirements and satisfy capacity constraints. This study proposes a combination of the cluster-first ??? route-second method and k-means clustering algorithm to deal with a large Vehicle Routing Problem with Time Windows (VRPTW) in the logistics and transportation field. The purpose of this research is to assist decision-makers to make quick and efficient decisions, based on optimal costs, the number of vehicles, delivery time, and truck capacity efficiency. A distribution system of perishable goods in Vietnam is used as a case study to illustrate the effectiveness of our mathematical model. In particular, perishable goods include fresh products of fish, chicken, beef, and pork. These products are packed in different sizes and transferred by vehicles with 1000 kg capacity. Besides, they are delivered from a depot to the main 39 customers of the company with arrival times following customers??? time window. All of the data are collected from a logistics company in Ho Chi Minh city (Vietnam). The result shows that the application of the clustering algorithm reduces the time for finding the optimal solutions. Especially, it only takes an average of 0.36 s to provide an optimal solution to a large Vehicle Routing Problem (VRP) with 39 nodes. In addition, the number of trucks, their operating costs, and their utilization are also shown fully. The logistics company needs 11 trucks to deliver their products to 39 customers. The utilization of each truck is more than 70%. This operation takes the total costs of 6586215.32 VND (Vietnamese Dong), of which, the transportation cost is 1086215.32 VND. This research mainly contributes an effective method for enterprises to quickly find the optimal solution to the problem of product supply.
Tárgyszavak:	Társadalomtudományok Gazdálkodás- és szervezéstudományok idegen nyelvű folyóiratközlemény külföldi lapban folyóiratcikk
Megjelenés:	Transport. - 37 : 1 (2022), p. 17-27. -
További szerzők:	Duy Duc Nguyen (közgazdász) Oláh Judit (1973-) (agrárközgazdász, logisztika) Pakurár Miklós (1959-) (agrárökonómus)
Pályázati támogatás:	EFOP-3.6.3-VEKOP-16-2017-00007 EFOP
Internet cím:	Szerző által megadott URL DOI Intézményi repozitóriumban (DEA) tárolt változat
Borító:
Saját polcon: