2014
DOI: 10.1016/j.swevo.2013.12.003
|View full text |Cite
|
Sign up to set email alerts
|

A Bumble Bees Mating Optimization algorithm for the Open Vehicle Routing Problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
18
0
1

Year Published

2014
2014
2022
2022

Publication Types

Select...
6
3
1

Relationship

0
10

Authors

Journals

citations
Cited by 52 publications
(19 citation statements)
references
References 63 publications
0
18
0
1
Order By: Relevance
“…The open vehicle routing problem is studied in which the vehicle does not need to return to the depot after serving the last customer point. The results show that the hybrid ant colony optimization algorithm is an effective method for solving the open vehicle routing problem (Marinakis and Marinaki, 2014) [15]. It is due to the current environmental requirements with multipopulation metaheuristics for solving vehicle routing problems (Osaba and Díaz, 2016) [16].…”
Section: Vehicle Routing Optimizationmentioning
confidence: 99%
“…The open vehicle routing problem is studied in which the vehicle does not need to return to the depot after serving the last customer point. The results show that the hybrid ant colony optimization algorithm is an effective method for solving the open vehicle routing problem (Marinakis and Marinaki, 2014) [15]. It is due to the current environmental requirements with multipopulation metaheuristics for solving vehicle routing problems (Osaba and Díaz, 2016) [16].…”
Section: Vehicle Routing Optimizationmentioning
confidence: 99%
“…This, together with the fact that the Hamiltonian cycle problem (HCP) is NP-hard and can be reduced to the Hamiltonian path problem (HPP) [11], allows us to conclude that the shortest HPP is NP-hard. Consequently, the OVRP is also an NP-hard problem, justifying the development of heuristics and meta-heuristics (see [12], where a new swarm intelligence approach is proposed). The vehicle routing with backup provisioning, under discussion here, can be seen as a variant of the OVRP applied to the transportation of persons, considering multiple depots and having the possibility of backup provision to certain critical stops.…”
Section: State Of the Artmentioning
confidence: 99%
“…Therefore, many heuristic approaches have been developed to solve the problem. Among the most important heuristic algorithms used to solve the OVRP are those in [32][33][34][35][36][37][38][39].…”
Section: Introductionmentioning
confidence: 99%