Variable Neighborhood Search for a Colored Traveling Salesman Problem

Meng, Xianghu; Li, Jun; Dai, Xianzhong; Dou, Jun

doi:10.1109/tits.2017.2706720

Cited by 66 publications

(30 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The multiple traveling salesman problem (MTSP) is an important combinatorial optimization problem. Meng [13] presented a variable neighborhood search for the CTSP. A colored traveling salesman problem (CTSP) is a generalization of the well-known multiple traveling salesman problem.…”

Section: A the History Of The Traveling Salesman Problemmentioning

confidence: 99%

A Standardized Bare Bones Particle Swarm Optimization Algorithm for Traveling Salesman Problem

Guo¹,

Sato²

2020

IJMLC

View full text Add to dashboard Cite

The traveling salesman problem (TSP) plays an important role in theoretical computer science. It can be used to solve different route planning problems in the real world and has been proved to be NP-hard. Plenty of researchers tried to solve the TSP by the population-based algorithms. However, as a real-world problem, the TSP has two major differences with the benchmark functions. One is the visiting order of the TSP is a combination of integers and the other one is each city in the problem has to be exactly visited once. To cross the two problems, the standardized bare bones particle swarm optimization (SBBPSO) algorithm is proposed in this work. The Gaussian distribution is used to select the positions of particles in the next generation. A standardized converter is used to ensure the dimensions of each particle are integers and each city has been visited exactly once. To test the performance of the SBBPSO, several famous instances are used in the experiments. Also, the standard bare bones particle swarm optimizations algorithm is used as the control group. The experimental results confirm that the SBBPSO is able to solve the TSP.

show abstract

Section: A the History Of The Traveling Salesman Problemmentioning

confidence: 99%

A Standardized Bare Bones Particle Swarm Optimization Algorithm for Traveling Salesman Problem

Guo¹,

Sato²

2020

IJMLC

View full text Add to dashboard Cite

show abstract

“…It can thus be used to solve job scheduling problems with Multi-bridge machining systems. Meng et al (2017) present a more common CTSP, in which city colors are diverse. They use a variable neighborhood search (VNS) approach to solve it, instead of computationally intractable exact solutions.…”

Section: Related Workmentioning

confidence: 99%

Performance measurement of a solution for the travelling salesman problem for routing through the incorporation of service time variability

et al. 2019

View full text Add to dashboard Cite

This work assessed the performance of a solution to the problem of assigning service squads, incorporating the variability of service times. The initial problem was modelled as a Travelling Salesman Problem (TSP), whose solution was obtained by the ant colony algorithm, showing the efficient route to be followed by the squad. Assessment of the performance of the solution by discrete event simulation (DES) included the travel time and added the service time. The TSP solution indicated that up to six customer visits could be carried out in an 8hour working day. Validation by DES presented a stable behavior of the variance, regardless of the number of visit sites assigned along the route.

show abstract

“…(). The VNS has been successfully applied to many variants of the TSP (Sousa et al., ; Meng et al., ) and VRPs (Wen et al., ; Pop et al., ).…”

Section: Variable Neighbourhood Searchmentioning

confidence: 99%

The intermittent travelling salesman problem

Pham

Leyman

Causmaecker

2018

Int Trans Operational Res

View full text Add to dashboard Cite

In this paper, we introduce a new variant of the travelling salesman problem, namely the intermittent travelling salesman problem (ITSP), which is inspired by real‐world drilling/texturing applications. In this problem, each vertex can be visited more than once and there is a temperature constraint enforcing a time lapse between two consecutive visits. A branch‐and‐bound approach is proposed to solve small instances to optimality. We furthermore develop four variable neighbourhood search metaheuristics which produce high‐quality solutions for large instances. An instance library is built and made publicly available.

show abstract

Variable Neighborhood Search for a Colored Traveling Salesman Problem

Cited by 66 publications

References 29 publications

A Standardized Bare Bones Particle Swarm Optimization Algorithm for Traveling Salesman Problem

A Standardized Bare Bones Particle Swarm Optimization Algorithm for Traveling Salesman Problem

Performance measurement of a solution for the travelling salesman problem for routing through the incorporation of service time variability

The intermittent travelling salesman problem

Contact Info

Product

Resources

About