2021
DOI: 10.3390/axioms10010019
|View full text |Cite
|
Sign up to set email alerts
|

Comparison of the Sub-Tour Elimination Methods for the Asymmetric Traveling Salesman Problem Applying the SECA Method

Abstract: There are many sub-tour elimination constraint (SEC) formulations for the traveling salesman problem (TSP). Among the different methods found in articles, usually three apply more than others. This study examines the Danzig–Fulkerson–Johnson (DFJ), Miller–Tucker–Zemlin (MTZ), and Gavish–Graves (GG) formulations to select the best asymmetric traveling salesman problem (ATSP) formulation. The study introduces five criteria as the number of constraints, number of variables, type of variables, time of solving, and… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
7
1
1

Relationship

0
9

Authors

Journals

citations
Cited by 19 publications
(4 citation statements)
references
References 19 publications
0
4
0
Order By: Relevance
“…In order to solve the problems (27 instances), CPLEX 20.1.0 [22] software was used, with a maximum computational time of one hour per instance. CPLEX has been successfully used to optimally solve and to compare different formulations of routing problems, such as TSP [23]. Variants of TTDP were solved using this solver as well [7,9,14,16,21].…”
Section: Description Of Computational Experimentsmentioning
confidence: 99%
“…In order to solve the problems (27 instances), CPLEX 20.1.0 [22] software was used, with a maximum computational time of one hour per instance. CPLEX has been successfully used to optimally solve and to compare different formulations of routing problems, such as TSP [23]. Variants of TTDP were solved using this solver as well [7,9,14,16,21].…”
Section: Description Of Computational Experimentsmentioning
confidence: 99%
“…𝑥 , ∈ 0,1 , ∀𝑖, 𝑗 ∈ 𝑉 where x i,j =1 means going from city i to city j; x i,j = 0 means otherwise. We introduce the decision variable μ i , ∀i∈V, μ i ≥ 0 and add the following MTZ constraints [4]:…”
Section: The Path Planning Modelmentioning
confidence: 99%
“…Among the different MCDM techniques employed to solve the supplier selection problem, some of the most applied are the analytic hierarchy process (AHP), the analytic network process (ANP), the technique for order of preference by similarity to ideal solution (TOPSIS), the VIseKriterijumska Optimizacija I Kompromisno Resenje (VIKOR), preference ranking organization method for enrichment evaluations (PROMOTHEE), the decision-making trial and evaluation laboratory (DEMATEL), and the best-worst method (BWM) [4,11,16,21,[29][30][31][32][33]. A new generation of MCDM techniques has been developed in recent decades and has also been successfully applied to solve supplier selection problems, such as the simultaneous evaluation of criteria and alternatives (SECA) [34], the weighted aggregated sum product assessment (WASPAS) [35,36], the evaluation based on distance from average solution (EDAS) [37,38], the pivot pairwise relative criteria importance assessment (PIPRECIA) [39], the additive ratio assessment (ARAS) [40,41], the weighted implementation of suboptimal paths (WISP) [42] and the MULTIMOOSRAL method [43]. Some authors have also proposed the application of hybrid models, which are combined MCDM techniques, to mitigate the weaknesses presented by them when used in isolation, such as AHP and VIKOR [26], ANP and TOPSIS [44], AHP and TOPSIS [45], and AHP and DEA [46].…”
Section: Literature Reviewmentioning
confidence: 99%