Sign in to use this feature.

Years

Between: -

Subjects

remove_circle_outline

Journals

Article Types

Countries / Regions

remove_circle_outline

Search Results (1)

Search Parameters:
Keywords = bilayer local search technique

Order results
Result details
Results per page
Select all
Export citation of selected articles as:
22 pages, 2453 KiB  
Article
Bilayer Local Search Enhanced Particle Swarm Optimization for the Capacitated Vehicle Routing Problem
by A. K. M. Foysal Ahmed and Ji Ung Sun
Algorithms 2018, 11(3), 31; https://doi.org/10.3390/a11030031 - 15 Mar 2018
Cited by 18 | Viewed by 6460
Abstract
The classical capacitated vehicle routing problem (CVRP) is a very popular combinatorial optimization problem in the field of logistics and supply chain management. Although CVRP has drawn interests of many researchers, no standard way has been established yet to obtain best known solutions [...] Read more.
The classical capacitated vehicle routing problem (CVRP) is a very popular combinatorial optimization problem in the field of logistics and supply chain management. Although CVRP has drawn interests of many researchers, no standard way has been established yet to obtain best known solutions for all the different problem sets. We propose an efficient algorithm Bilayer Local Search-based Particle Swarm Optimization (BLS-PSO) along with a novel decoding method to solve CVRP. Decoding method is important to relate the encoded particle position to a feasible CVRP solution. In bilayer local search, one layer of local search is for the whole population in any iteration whereas another one is applied only on the pool of the best particles generated in different generations. Such searching strategies help the BLS-PSO to perform better than the existing proposals by obtaining best known solutions for most of the existing benchmark problems within very reasonable computational time. Computational results also show that the performance achieved by the proposed algorithm outperforms other PSO-based approaches. Full article
(This article belongs to the Special Issue Metaheuristics for Rich Vehicle Routing Problems)
Show Figures

Figure 1

Back to TopTop