Combinatorial optimization problems are often encountered in real-world applications, including logistics, scheduling and ...

Combinatorial optimization problems are encountered often in various real-world applications, including logistics, scheduling, and network design ...

Abstract: Vehicle Routing Problem (VRP) is one of the combinatoric problems that is difficult to solve, so it is incorporated into an NP-hard problem. VRP aims to produce a set of shortest routes from ...

In urban areas with many commercial facilities, patrolling by police officers or security guards is essential for crime prevention, in addition to the use of surveillance cameras. To address the ...

Real-world Vehicle Routing Problems (VRPs) are characterized by a variety of practical constraints, making manual solver design both knowledge-intensive and time-consuming. Although there is ...

Abstract: The vehicle routing problem (VRP) is a computationally challenging combinatorial problem. It has been intensively studied by many researchers in the last sixty years. Due to the significant ...

Vehicle Routing Problem or simply VRP is a well known combinatorial optimization problem and a generalization of the travelling salesman problem. A definition of the problem is this: We have a number ...

In the past few years, the importance of electric mobility has increased in response to growing concerns about climate change. However, limited cruising range and sparse charging infrastructure could ...

In addition to the increasing population and rapid urbanization, the amount and variety of medical waste are rapidly increasing due to the coronavirus disease (COVID-19) pandemic affecting the whole ...

ABSTRACT: The vehicle routing problem (VRP) is classified as an NP-hard problem. Hence exact optimization methods may be difficult to solve these problems in acceptable CPU times, when the problem ...