2009 IEEE Symposium on Computational Intelligence in Scheduling 2009
DOI: 10.1109/scis.2009.4927022
|View full text |Cite
|
Sign up to set email alerts
|

A particle swarm optimization algorithm with crossover for vehicle routing problem with time windows

Abstract: The vehicle routing problem (VRP) is a very important combinatorial optimization and nonlinear programming problem in the fields of transportation, distribution and logistics. In this paper, a particle swarm optimization (PSO) algorithm with crossover for VRP is proposed. The PSO algorithm combined with the crossover operation of genetic algorithm (GA) can avoid being trapped in local optimum due to using probability searching. We apply the proposed algorithm to an example of VRP, and compare its result with t… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
8
0

Year Published

2010
2010
2019
2019

Publication Types

Select...
4
2
2

Relationship

0
8

Authors

Journals

citations
Cited by 13 publications
(8 citation statements)
references
References 7 publications
0
8
0
Order By: Relevance
“…Since most green problems are belonging of multi-objective optimization, PSO can be employed in particular problems. Although in multinomial function particle populations will quickly lose diversity and PSO will cause premature convergence and trap to local front rather than global ones [35]- [37], some researchers proposed some operators (like crossover) or hybridize by other algorithm to overcome partly the problem [35], [38]- [40]. Liu et al [38] and Masrom et al [39] hybridized PSO and GA to solve vehicle routing problem as a nonlinear transportation problem which the final algorithms can be used for logistics network optimization in GrSC problems.…”
Section: A Particle Swarm Optimizationmentioning
confidence: 99%
“…Since most green problems are belonging of multi-objective optimization, PSO can be employed in particular problems. Although in multinomial function particle populations will quickly lose diversity and PSO will cause premature convergence and trap to local front rather than global ones [35]- [37], some researchers proposed some operators (like crossover) or hybridize by other algorithm to overcome partly the problem [35], [38]- [40]. Liu et al [38] and Masrom et al [39] hybridized PSO and GA to solve vehicle routing problem as a nonlinear transportation problem which the final algorithms can be used for logistics network optimization in GrSC problems.…”
Section: A Particle Swarm Optimizationmentioning
confidence: 99%
“…Hard time window is that each task must be completed within the specific time. However, soft time window is that if a task can not be completed within the specific time, given a punishment [9]. VRPTW can be generally described as: given a logistics distribution center O , own K vehicles, the capacity of each vehicle is denoted ( 1,2, , ) …”
Section: Description and Mathematic Modelmentioning
confidence: 99%
“…Since the 1990's, some artificial intelligence methods have been suggested, such as the genetic algorithm (GA), Tabu Search, Simulated Annealing and so on [3][4][5][6][7]. Recently, Ant colony optimization and particle swarm optimization has been a popular approach used to solve some VRP problems [8].…”
Section: Introductionmentioning
confidence: 99%
“…The search progress is strictly stochastic. Particle swarm optimization PSO is another evolutionary method that was developed by Kennedy and Elberhart in 1995 [9]. PSO is an example of a meta-heuristic algorithm.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation