Multi-Objective Ant Colony Optimization for Multi-Depot Heterogenous Vehicle Routing Problem

A Multipopulation Multiobjective Ant Colony System Considering Travel and Prevention Costs for Vehicle Routing in COVID-19-Like Epidemics

“…To date, there have been many works about multi-objective ACS/ACO algorithms for solving traditional transportation problems [27], [47]- [49]. Among them, few multi-population algorithms have obtained promising results in VRP [49]. However, the algorithm proposed in this paper is very different from these existing algorithms in three aspects.…”

“…Secondly, the work related to the proposed algorithm is reviewed. To date, there have been many works about multi-objective ACS/ACO algorithms for solving traditional transportation problems [27], [47]- [49]. Among them, few multi-population algorithms have obtained promising results in VRP [49].…”

“…As the VRP4E model is firstly proposed in this paper and no other algorithms have been designed for it, we can only adapt some widely-used and state-of-the-art multi-objective algorithms and apply them to solve the VRP4E model for comparisons. To be specific, this paper adopts six algorithms, which are NSGA-II [56], MOEA/D [57], TS-MOEA [58], coevolutionary constrained multi-objective optimization (CCMO) [59], multi-objective local search (MOLS) [60], ant colony algorithm (ACA) [48] and multi-objective ACO (MOACO) [49]. The NSGA-II and MOEA/D are well-known and widely-used state-of-the-art approaches for multi-objective optimization and have been also widely researched in various multi-objective VRP variants [10], while the TS-MOEA is a currently-proposed two-stage multi-objective algorithm that combines the NSGA-II and MOEA/D for multi-objective VRP problems.…”

Penerapan Algoritma Tabu Search Pada Model Acvrp Untuk Menentukan Rute Pengangkutan Sampah Yang Optimal Di Kecamatan Kalidoni

“…Salah satu variasi VRP adalah Capacitated Vehicle Routing Problem (CVRP) dimana proses pengangkutan sampah memperhitungkan kapasitas kendaraan dan kapasitas permintaan pada setiap rute (Yuliza et al, 2020;Puspita et al, 2021). CVRP dibagi menjadi dua bentuk yaitu CVRP simetris, yaitu perjalanan dari tempat i ke j sama dengan perjalanan dari tempat j ke i sehingga matriks jarak yang dihasilkan simetris (Kubil et al, 2018). Bentuk kedua adalah CVRP asimetris dimana perjalanan dari tempat i ke j tidak sama dengan perjalanan dari tempat j ke i sehingga matriks jarak yang dihasilkan asimetris (Li et al, 2019;Leggieri & Haouari, 2018).…”