Hybrid Multi-agent Approach to Solve the Multi-depot Heterogeneous Fleet Vehicle Routing Problem with Time Window (MDHFVRPTW)

Abdallah, Marwa Ben; Ennigrou, Meriem

doi:10.1007/978-3-030-14347-3_37

Cited by 2 publications

(2 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The results of this study indicate that using PSO can minimize the total distance traveled and minimize the total cost of the vehicle route that is operated. Research conducted by Sombuntham & Kachitvichyanukul (2010) (Sun et al, 2015), completion of the Multi Depot Heterogeneous Fleet with Time Windows by (Abdallah & Ennigrou, 2020). The solution Vehicle Routing Problem Heterogeneous Fleet with Mixed Back Smooth and Time Windows was carried out by (Belmecheri et al, 2010) and research conducted on the completion of the Capacitated Vehicle Routing Problem by (Alinezhad et al, 2018;Iswari & Asih, 2018).…”

Section: Introductionmentioning

confidence: 99%

“…Conducted a VRP comparison test (Abdallah & Ennigrou, 2020), using the Multi-depot Heterogeneous Fleet Vehicle Routing Problem with Time Windows (MDHFVRPTW) model.research compares the performance of computational performance and also solutions using three methods, namely the PSO Algorithm, GA and the Memetic Algorithm. The results showed that PSO had the best CPU times compared to GA and ME.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Optimization of Vehicle Routing Problem Using Particle Swarm Optimization: A Case Study Watering Plants in Yogyakarta City

Andriyansah

Linarti

2022

JITI

View full text Add to dashboard Cite

Dinas Lingkungan Hidup (DLH) Yogyakarta City always tries to monitor, control, and control activities regarding all aspects of the environment, one of which is watering plants. The right path must be selected so as not to exceed the time limit set. This study aims to determine the direction of watering plants in Sector 3 for Vehicle Route Problem (VRP) using the Particle Swarm Optimization (PSO) and compare the performance results of the PSO method with the Genetic Algorithm (GA) in previous studies. The VRP criteria are heterogeneous fleet, intermediated facility, multi-trip, split delivery, and times window (VRPHFIFMTSDTW). The results of the comparison between the two methods, namely, the GA method, are better than the PSO method in terms of computational time efficiency and fitness value. The total travel time for the GA method is 22 minutes, or 2.1% faster than the PSO method. In contrast, the total distance traveled by the PSO method is 345 meters shorter than the GA method. These two methods' results are also excellent compared to the current watering route. The difference in total mileage is about 20.4%, and total travel time is about 11.7% between the two methods.

show abstract

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%