A taxonomic review of metaheuristic algorithms for solving the vehicle routing problem and its variants
Recently, a taxonomic review of the Vehicle Routing Problem (VRP) literature published
between 2009 and June 2015 stated that most of the surveyed articles use metaheuristics …
between 2009 and June 2015 stated that most of the surveyed articles use metaheuristics …
SF-FWA: A Self-Adaptive Fast Fireworks Algorithm for effective large-scale optimization
M Chen, Y Tan - Swarm and Evolutionary Computation, 2023 - Elsevier
Computationally efficient algorithms for large-scale black-box optimization have become
increasingly important in recent years due to the growing complexity of engineering and …
increasingly important in recent years due to the growing complexity of engineering and …
A survey on cooperative co-evolutionary algorithms
The first cooperative co-evolutionary algorithm (CCEA) was proposed by Potter and De Jong
in 1994 and since then many CCEAs have been proposed and successfully applied to …
in 1994 and since then many CCEAs have been proposed and successfully applied to …
Time-dependent multi-depot green vehicle routing problem with time windows considering temporal-spatial distance
H Fan, Y Zhang, P Tian, Y Lv, H Fan - Computers & Operations Research, 2021 - Elsevier
Reducing distribution costs is one of the effective ways for logistics enterprises to improve
their core competitiveness. Aiming at the multi-depot vehicle routing problem under the time …
their core competitiveness. Aiming at the multi-depot vehicle routing problem under the time …
Collaborative two-echelon multicenter vehicle routing optimization based on state–space–time network representation
Collaboration among service providers in a logistics network can greatly increase their
operation efficiencies and reduce transportation emissions. This study proposes, formulates …
operation efficiencies and reduce transportation emissions. This study proposes, formulates …
FC-Kmeans: Fixed-centered K-means algorithm
Clustering is one of the data mining methods that partition large-sized data into subgroups
according to their similarities. K-means clustering algorithm works well in spherical or …
according to their similarities. K-means clustering algorithm works well in spherical or …
An efficient variable neighborhood search with tabu shaking for a class of multi-depot vehicle routing problems
Abstract We present a Variable Tabu Neighborhood Search (VTNS) algorithm for solving a
class of Multi-Depot Vehicle Routing Problems (MDVRP). The proposed algorithm applies a …
class of Multi-Depot Vehicle Routing Problems (MDVRP). The proposed algorithm applies a …
A cooperative particle swarm optimization approach for tuning an MPC-based quadrotor trajectory tracking scheme
This paper presents a novel method for tuning a quadrotor trajectory-tracking model
predictive control (MPC) framework, based on cooperative particle swarm optimization …
predictive control (MPC) framework, based on cooperative particle swarm optimization …
Multi-robot exploration in task allocation problem
Task allocation is an important problem in multi-robot system which can be defined with
different setup for different application, ie coverage, surveillance and mining mission in static …
different setup for different application, ie coverage, surveillance and mining mission in static …
Time-dependent fleet size and mix multi-depot vehicle routing problem
This paper considers an extension of classical distribution problems and introduces the time-
dependent fleet size and mix multi-depot vehicle routing problem. This important class of …
dependent fleet size and mix multi-depot vehicle routing problem. This important class of …