Contribute to solve Vehicle Routing Problem with Hard Time Windows (VRPHTW) To Support the Transportation System in Hospitals.
- Publish Date:
- 09/06/2021
In this research, we study the possibility of contribution in solving Vehicle Routing Problem with Hard Time Windows (VRPHTW), which is one of the optimization problems that, has attracted a lot of attention at the present time. It is a problem of the NP-hard type. There is still no algorithm providing us with the optimal solution of this problem. All the used algorithms give approximate solutions.
In our research, we will present the Hybrid Algorithm (HA), which integrates the Guided Local Search Algorithm (GLS) and the Tabu Search Algorithm (TSA), which is based on the Saving Algorithm (SAv). We will then compare the quality of the solution resulted from this hybrid approach (GLS-TS )-SAv
with the results of well-known standard tests to determine the effectiveness of the presented approach.
