Solution to travelling salesman problem by clusters and a modified multi-restart iterated local search metaheuristic

Anaya-Fuentes, Gustavo Erick; Gress, Eva Selene Hernández; Seck-Tuoh-Mora, Juan Carlos; Marín, Joselito Medina

doi:10.1371/journal.pone.0201868

Cited by 27 publications

(13 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…During these emergency situations Travelling Salesman Problem may be applied in small instances of resource routing with heterogeneous vehicles and demand points [10,11,12]. Cluster analysis can also be combined with Travelling Salesman Problem during this kind of emergency, where TSP is applied in each cluster of categorized customers with most similarities [13,14]. Disconnected disaster affected regions can be combined with single distribution center and TSP can be applied to each of these disconnected regions locally; satisfied by more than one vehicle in-terms of Vehicle Route Planning (VRP) [15,16].…”

Section: Related Workmentioning

confidence: 99%

Evaluation of TSP for Emergency Routing

Zaman¹,

Hasan²,

Ulla³

2021

IJITCS

View full text Add to dashboard Cite

The paper considers the symmetric traveling salesman problem and applies it to sixty-four (64) districts of Bangladesh (with geographic coordinates) as a new instance of the problem of finding an optimized route in need of emergency. It approached three different algorithms namely Integer Linear Programming, Nearest-neighbor, and Metric TSP as exact, heuristic, or approximate methods of solving the NP-hard class of problem to model the emergency route planning. These algorithms have been implanted using computer codes, used IBM ILOG CPLEX parallel optimization, visualized using Geographic Information System tools. The performance of these algorithms also has been evaluated in terms of computational complexity, their run-time, and resulted tour distance using exact, approximate, and heuristic methods to find the best fit of route optimization in emergence thus contributing to the field of combinatorial optimization.

show abstract

Section: Related Workmentioning

confidence: 99%

Evaluation of TSP for Emergency Routing

Zaman¹,

Hasan²,

Ulla³

2021

IJITCS

View full text Add to dashboard Cite

show abstract

“…Many Local Search (LS) meta-heuristics are studied for the VRP, such as the ALNS proposed by Ropke [59]. The VND, a kind of local search in which wider and wider neighborhoods are successively explored, is studied by Salehipour et al [60].…”

Section: Algorithmmentioning

confidence: 99%

Multi-start heuristic approaches for one-to-one pickup and delivery problems with shortest-path transport along real-life paths

Zhuo

Xiong

et al. 2020

PLoS ONE

View full text Add to dashboard Cite

The One-to-one Pickup and Delivery Problem with Shortest-path Transport along Real-life Paths (OPDPSTRP) is presented in this opaper. It is a variation of the One-to-one Pickup and Delivery Problem (OPDP), which is common in daily life, such as the Passenger Train Operation Plans (PTOP) and partial Taxi-sharing Problem. Unlike the classical OPDP, in the OPDPSTRP, (1) each demand must be transported along the shortest path according to passengers/shippers requirements, and (2) each vehicle should travel along a real-life path. First, six route structure rules are proposed for the OPDPSTRP, and a kind of Mixed-Integer Programming (MIP) models is formulated for it. Second, A Variable Neighborhood Descent (VND), a Variable Neighborhood Research (VNS), a Multi-Start VND (MS_VND) and a Multi-Start VNS (MS_VNS) with five neighborhood operators has been developed to solve the problem. Finally, The Gurobi solver, the VND, the VNS, the MS_VND and the MS_VNS have been compared with each other by 84 random instances partitioned in small size connected graphs, medium size connected graphs and large size connected graphs. From the test results we found that solutions generated by these approaches are often comparable with those found by the Gurobi solver, and the solutions found by these approaches are better than the solutions found by the Gurobi solver when solving instances with larger numbers of demands. In almost all instances, the MS_VND significantly outperforms the VND and the VNS in terms of solution quality, and outperforms the MS_VNS both in terms of solution quality and CPU time. In the instances with large numbers of demands, the MS_VND is still able to generate good feasible solutions in a reasonable CPU time, which is of vital practical significance for real-life instances. OPEN ACCESSCitation: Qi X, Fu Z, Xiong J, Zha W (2020) Multistart heuristic approaches for one-to-one pickup and delivery problems with shortest-path transport along real-life paths. PLoS ONE 15(2): e0227702.

show abstract

“…In fig. 10, the cities which inherit from the alive solution to the offspring solution is cities: [5,3]. The parent solution 1 (D2) and the parent solution 2 (D8) is randomly selected from cluster 2 and cluster 4 respectively.…”

Section: The Cluster Crossover Operationmentioning

confidence: 99%

“…This paper proposed 2-Opt for short moves, and the 3-Opt as large moves. Gustavo Erick Anaya Fuentes et al [3] present the new metaheuristic algorithm called the CTSPMRILS. In the article, they combine the cluster technique , the NEH heuristic and the Multi Restart Iterated Local Search.…”

Section: Introductionmentioning

confidence: 99%

The Cluster Crossover Operation for The Symmetric Travelling Salesman Problem

Phu-ang

Jitkongchuen

2019

ECTI-CIT

View full text Add to dashboard Cite

This paper proposed the new algorithm intended to solve a specific real-world problem, the symmetric travelling salesman problem. The proposed algorithm is based on the concept of the galaxy based search algorithm (GbSA) and embedded the new ideas called the clockwise search process and the cluster crossover operation. In the first step, the nearest neighbor algorithm introduces to generate the initial population. Then, the tabu list local search is employed to search for the new solution in surrounding areas of the initial population in the second step. The clockwise search process and the cluster crossover operation are employed to create more diversity of the new solution. Then, the final step, the hill climbing local search is utilized to increase the local search capabilities. The experiments with the standard benchmark test sets show that the proposed algorithm can be found the best average percentage deviation from the lower bound.

show abstract

Solution to travelling salesman problem by clusters and a modified multi-restart iterated local search metaheuristic

Cited by 27 publications

References 26 publications

Evaluation of TSP for Emergency Routing

Evaluation of TSP for Emergency Routing

Multi-start heuristic approaches for one-to-one pickup and delivery problems with shortest-path transport along real-life paths

The Cluster Crossover Operation for The Symmetric Travelling Salesman Problem

Contact Info

Product

Resources

About