Solving the Traveling Salesman Problem: A Modified Metaheuristic Algorithm

Table 1

Parameter settings for the MPSO method.

Parameter	Description	Candidate value	Value
m	The number of population	[n/2], n, [3n/2], 2n, [5n/2], and 3n	2n
Alpha (percent)	The at least value of using gcbest	0-5-10-15-20–25	10
Beta (percent)	The at most value of using gcbest	75-80-85–90–95–100	90
SC	The number repetition of gbest as the stop condition	n/10, n/9, n/8, n/7, n/6, n/5, n/4, and n/3	n/4