2015
DOI: 10.1051/ro/2014064
|View full text |Cite
|
Sign up to set email alerts
|

Vehicle routing problem with limited refueling halts using particle swarm optimization with greedy mutation operator

Abstract: Route planning and goods distribution are a major component of any logistics. Vehicle Routing Problem is a class of problems addressing the issues of logistics. Vehicle Routing Problem with Limited Refueling Halts is introduced in this paper. The objective is to plan a route with an emphasis on the time and cost involved in refueling vehicles. The method is tailored to find optimal routes with minimal halts at the refueling stations. The problem is modeled as a bi objective optimization problem and is solved u… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
3
0
2

Year Published

2018
2018
2023
2023

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 9 publications
(5 citation statements)
references
References 22 publications
0
3
0
2
Order By: Relevance
“…Poonthalir et al (2015) presented a bi-objective VRP model, which is solved via a Particle Swarm Optimization with a Greedy Mutation Operator, with restrictions on the number of refueling stops. In a similar study,Poonthalir and Nadarajan (2018) also discussed a bi-objective model of fuzzy GVRP (F-GVRP) examining the varying speed of vehicles.…”
mentioning
confidence: 99%
“…Poonthalir et al (2015) presented a bi-objective VRP model, which is solved via a Particle Swarm Optimization with a Greedy Mutation Operator, with restrictions on the number of refueling stops. In a similar study,Poonthalir and Nadarajan (2018) also discussed a bi-objective model of fuzzy GVRP (F-GVRP) examining the varying speed of vehicles.…”
mentioning
confidence: 99%
“…Details of the proposed algorithms are described as follows: 4.1 PSO Algorithm PSO algorithm is a population-based optimization technique which was introduced for the first time by Kennedy and Eberhart [34]. The main idea of this algorithm is based on animals' social behavior simulation such as birds and fishes which are living in a group [35]. It is assumed that the number of animals is seeking to the food in a random space and none of these animals have no information about the food place and instinctively only feels their distance towards of the food.…”
Section: -Methodologymentioning
confidence: 99%
“…All three of these parameters change over time and have a goal of improving the global search and convergence. The algorithm also uses a greedy mutation operator [106] to avoid getting stuck in local optima. The experiments were performed on a set of benchmark instances from [10].…”
Section: Particle Swarm Optimizationmentioning
confidence: 99%