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:

001-es BibID:	BIBFORM090180
Első szerző:	Le Thi Diem Chau (PhD hallgató)
Cím:	Optimal vehicle routes schedules in picking up and delivering cargo containers considering time win-dow in Logistics distribution networks: A case study / Thi Diem Chau Le, Duy Duc Nguyen, Judit Oláh, Miklós Pakurár
Dátum:	2020
ISSN:	2353-7779
Megjegyzések:	This study describes a pickup and delivery vehicle routing problem, considering time windows in reality. The problem of tractor truck routes is formulated by a mixed integer programming model. Besides this, three algorithms - a guided local search, a tabu search, and simulated annealing - are proposed as solutions. The aims of our study are to optimize the number of internal tractor trucks used, and create optimal routes in order to minimize total logistics costs, including the fixed and variable costs of an internal vehicle group and the renting cost of external vehicles. Besides, our study also evaluates both the quality of solutions and the time to find optimal solutions to select the best suitable algorithm for the real problem mentioned above. A novel mathematical model is formulated by OR tools for Python. Compared to the current solution, our results reduced total costs by 18%, increased the proportion of orders completed by internal vehicles (84%), and the proportion of orders delivered on time (100%). Our study provides a mathematical model with time constraints and large job volumes for a complex distribution network in reality. The proposed mathematical model provides effective solutions for making decisions at logistics companies. Furthermore, our study emphasizes that simu-lated annealing is a more suitable algorithm than the two others for this vehicle routing problem.
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:	Production Engineering Archives. - 26 : 4 (2020), p. 178-184. -
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)
Internet cím:	Szerző által megadott URL DOI Intézményi repozitóriumban (DEA) tárolt változat
Borító:
Saját polcon: