Artificial bee colony algorithm with generating neighbourhood solution for large scale coloured traveling salesman problem

Dong, Xianguang; Lin, Qing; Xu, Min; Cai, Yongle

doi:10.1049/iet-its.2018.5359

Cited by 40 publications

(16 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Another algorithm used for CTSP originating from MTSP is Artificial Bee Colony Algorithm. In a large-scale study with over 2000 cities, it was seen that ABC gave more successful results than Greedy GA, Hill-Climbing GA and Simulated Annealing GA. [12] GA was again used to minimize route distances in MTSP and to provide a balance between routes in another study. In this study where different selection and crossover combinations were compared, it was seen that both results obtained with multi-objective and mono-objective approaches were successful.…”

Section: B Literature Reviewmentioning

confidence: 99%

See 1 more Smart Citation

An Evolutionary Approach to Multiple Traveling Salesman Problem for Efficient Distribution of Pharmaceutical Products

Kocyigit

Şahingöz

Di̇ri̇

2020

2020 International Conference on Electrical Engineering (ICEE)

View full text Add to dashboard Cite

Considerable growth of computer science has created novel solutions for variable problem fields and has increased the efficiency of available solutions. Evolutionary algorithms are quite successful in dealing with real-world problems that require optimization. In this article, we implemented a Genetic Algorithm that is well known evolutionary algorithm in order to provide an efficient solution for the Distribution of Pharmaceutical Products, which is a vital optimization problem, especially in situations such as a pandemic. The Multiple Traveling Salesman Problem approach was used to distribute pharmaceutical products as soon as possible. Moreover, we strengthened our proposal algorithm with 2-Opt Algorithm to get optimal results in earlier iterations. Different datasets from a library were applied to measure the quality of solutions and computation time. At the end of the work, we observed that our proposed algorithm generates successful solutions in an acceptable running time. This study will be extended with a new mutation concept as future work.

show abstract

Section: B Literature Reviewmentioning

confidence: 99%

“…Point 0 represents one depot of paths using the "byg29" dataset. The chromosome sequence of a successful solution after acceptable iteration = [0, 1,28,2,25,4,8,11,5,20,9,19,3,14,17,16,21,13,10,18,23,12,27,7,26,22,6,24,15,9,19]. The path plot of this chromosome is shown in Figure 7.…”

Section: Figure 5 Solution Costs Based On Generationmentioning

confidence: 99%

An Evolutionary Approach to Multiple Traveling Salesman Problem for Efficient Distribution of Pharmaceutical Products

Kocyigit

Şahingöz

Di̇ri̇

2020

2020 International Conference on Electrical Engineering (ICEE)

View full text Add to dashboard Cite

show abstract

“…Recently, swarm intelligence has paid more attention in academia. 10 The typical swarm intelligent algorithms include artificial colony ant, 11 cuckoo search algorithm, 12 artificial bee colony, 13,14 bat algorithm, [15][16][17] and so on, which have widely used to all kinds of fields such as continuous optimization, [18][19][20] engineering optimization, [21][22][23][24] project management, 25 system optimization, 26 software design, 27,28 and so on. In addition, swarm intelligences have also applied to multi-objective problems.…”

Section: Andmentioning

confidence: 99%

Construction of extended ant colony labor division model for traffic signal timing and its application in mixed traffic flow model of single intersection

Jiang

Chen

et al. 2019

Concurrency and Computation

View full text Add to dashboard Cite

Summary The ant colony labor division model can be used to solve the dynamic and variable traffic signal timing problem because of its adaptive and self‐adjusting characteristics. Based on the basic model, this paper proposes a new extended ant colony labor division model for traffic signal timing. This model is combined with the vehicle characteristics to modify the calculation method of environmental stimulus values. Using the vehicle delay in the unit period, the original fixed response threshold is modified to the dynamic response threshold, and the state transition equation is reconstructed. Based on the mixed traffic flow model of two‐phase single‐point intersection cellular automata, through comparative experiments and discussion and analysis, it is found that the extended ant colony labor division model can effectively improve road traffic capacity according to road conditions and reasonable traffic signal timing.

show abstract

“…The combination of approach algorithms guarantees that the group of tasks belonging to each drone port is within its range and that the drone can carry out the maximum number of tasks before returning to port to recharge. Dong et al (2019) propose an artificial bee colony algorithm (ABC) to solve a combined optimization problem modelled as a colored traveling salesman problem (CTSP) applied to real-world planning problems, specifically a Multi-Machine Engineering System (MES). Zhou et al (2019) indicate that the TSP belongs to the NP-hard type.…”

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

Artificial bee colony algorithm with generating neighbourhood solution for large scale coloured traveling salesman problem

Cited by 40 publications

References 25 publications

An Evolutionary Approach to Multiple Traveling Salesman Problem for Efficient Distribution of Pharmaceutical Products

An Evolutionary Approach to Multiple Traveling Salesman Problem for Efficient Distribution of Pharmaceutical Products

Construction of extended ant colony labor division model for traffic signal timing and its application in mixed traffic flow model of single intersection

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

Contact Info

Product

Resources

About