2013
DOI: 10.12785/amis/070637
|View full text |Cite
|
Sign up to set email alerts
|

Particle Swarm Optimization Algorithm for Multisalesman Problem with Time and Capacity Constraints

Abstract: Classic multiple traveling salesman problem (MTSP) requires to find the k closed circular paths which minimize the sum of the path lengths, and each vertex is visited only once by a salesman. This paper presents an optimized model for the balanced Multiple-salesman Problem with time and capacity constraints, it requires that a salesman visits each vertex at least once and returns to the starting vertex within given time. The balanced MSP is more widely used than MTSP. We describe a particle swarm optimization … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4

Citation Types

0
12
0

Year Published

2015
2015
2020
2020

Publication Types

Select...
10

Relationship

0
10

Authors

Journals

citations
Cited by 28 publications
(12 citation statements)
references
References 17 publications
0
12
0
Order By: Relevance
“…Heuristic algorithms for antenna design include genetic algorithm (GA) [22], particle swarm optimization (PSO) [23], differential evolution [24,25], and neighborhood field optimization [26]. Recently, improved heuristic algorithms have been used to design wireless communication network designs, power allocation, and antennas [27,28].…”
Section: Introductionmentioning
confidence: 99%
“…Heuristic algorithms for antenna design include genetic algorithm (GA) [22], particle swarm optimization (PSO) [23], differential evolution [24,25], and neighborhood field optimization [26]. Recently, improved heuristic algorithms have been used to design wireless communication network designs, power allocation, and antennas [27,28].…”
Section: Introductionmentioning
confidence: 99%
“…Yu et al studied a decomposition method for bound constrained optimization problems [15]. Stochastic algorithms such as evolutionary algorithms, particle swarm optimization [16,17], and artificial bee colony converge slower than deterministic ones [18][19][20] though they take objective functions as black-box, which makes these algorithms applicable to nearly all kinds of antenna design problems. Parallel execution of optimization algorithms could greatly save computational time [21,22].…”
Section: Introductionmentioning
confidence: 99%
“…A large number of iterations is needed for standard PSO algorithm to obtain a satisfactory solution [27]. This is not acceptable for users as antenna simulation often takes a long time.…”
Section: Introductionmentioning
confidence: 99%