| Autor: |
Ali Asghar Rahmani Hosseinabadi, Atekeh Zolfagharian, Pouya Alinezhad |
| Rok vydání: |
2020 |
| Předmět: |
|
| Zdroj: |
Recent Developments and the New Direction in Soft-Computing Foundations and Applications ISBN: 9783030471231 |
| DOI: |
10.1007/978-3-030-47124-8_21 |
| Popis: |
Open Vehicle Routing Problem (OVRP) is categorized as one of the most important versions of Vehicle Routing Problem (VRP) attracted great interests due to its significant applications in industries and service centers. The objective of the OVRP is to minimize the number of used vehicles and total traveled distance or total travel time. Recently, some algorithms have been introduced for solving the OVRP including the Simulated Annealing (SA), Genetic Algorithm (GA), neighborhood search algorithms and etc. In this paper, a new meta-heuristic algorithm called OVRP_SAICA is presented for the OVRP as a kind of combinatorial optimization problem. The proposed algorithm is compared with different kinds of algorithms and the obtained results of solving some benchmark instances confirmed that it has a high efficiency and is superior to them in solving the OVRP. |
| Databáze: |
OpenAIRE |
| Externí odkaz: |
|
