The capacitated vehicle routing problem (CVRP) is a classical combinatorial optimization
problem, which has received much attention due to its main challenges as distribution …

Vehicle routing problem is a classical NP-hard optimization problem. In the present study,
we developed a hybrid algorithm namely HAFA, which incorporates certain aspects of firefly …

This paper presents a study on the application of Autonomous Delivery Vehicles (ADVs) in
last-mile delivery for urban logistics. Specifically, we focus on a routing problem using multi …

Abstract Chemical Reaction Optimization (CRO) is a recently established population based
metaheuristic for optimization problems inspired by the natural behavior of chemical …

In a multi-depot vehicle routing problem (MDVRP) of same-city delivery, driving distance and
actual loading can greatly influence the amount of carbon emissions generated. This paper …

Chemical reaction optimization (CRO) algorithm is a robust metaheuristic by simulating the
process of natural chemical reaction and has been applied for solving numerous realistic …

The Internet of Things integrates lots of capacitated vehicles in smart logistics. The routing
for capacitated vehicles is a combinatorial optimization problem which has been widely …

The minimum vertex cover problem (MVCP) is one of the well-known NP-complete problems
that can be used to formulate numerous real-life applications. The MVCP has been solved …

Multicore processors that support multithreading techniques have many advantages,
including processors' utilization, responsiveness, resource sharing, and economical usage …

Organizations spend considerable amount of time and money in distributing goods from
production centres to customers who are geographically distributed. When vehicles are …