Performance Evaluation of Ant Colony Systems for the Single-Depot Multiple Traveling Salesman Problem

Necula, Raluca; Breaban, Mihaela; Raschip, Madalina

doi:10.1007/978-3-319-19644-2_22

Cited by 26 publications

(32 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As already explained in our previous study [1], but also highlighted in the experimental section in this paper, these are contradictory objectives. Fortunately, both objectives are covered by the MinMax formulation which is referred in Section II.…”

Section: Introductionmentioning

confidence: 78%

“…Given the specified constraints imposed by this formulation (each location must be visited exactly once and all the salesmen leave and return to the same depot), the objective to be optimized is, in most of the papers addressing SD-MTSP, the one met in the standard TSP: the total distance traveled by the salesmen must be minimized. However, as we have shown in previous studies [1], this objective is not appropriate under the settings imposed by SD-MTSP: minimizing the total distance traveled by the salesmen, that is the sum of the lengths/costs of the subtours traveled by all salesmen, leads to highly imbalanced solutions. If no restriction is imposed on the number of cities to be visited by each salesman, SD-MTSP is an ill-posed problem: the optimal solution is obtained when one salesman visits all the cities.…”

Section: Introductionmentioning

confidence: 90%

“…In [1] we have investigated the first approach -bounded SD-MTSP, which constrains the number of cities a salesman is allowed to visit. A benchmark containing problem instances and optimal solutions was created and made publicly available, and the performance of several Ant Colony algorithms was investigated.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Tackling the Bi-criteria Facet of Multiple Traveling Salesman Problem with Ant Colony Systems

Necula

Breaban

Raschip

2015

2015 IEEE 27th International Conference on Tools With Artificial Intelligence (ICTAI)

Self Cite

View full text Add to dashboard Cite

The single-depot multiple TSP (SD-MTSP) is a simple extension of the standard TSP, in which more than one salesman is allowed to visit the set of interconnected cities, such that each city is visited exactly once (by a single salesman) and the total cost of the traveled subtours is minimized. Although Ant Colony Systems (ACSs) are a natural choice for shortest-path problems, with TSP at its core, the application of ACS on this straightforward extension is not properly explored. The reasons may lie in the bi-criteria nature of the problem (shortest cost versus balanced subtours) and the lack of dedicated benchmarks exposing optimal solutions. This paper attempts at proposing and evaluating from a bi-criteria perspective several multiobjective ACSs to tackle SD-MTSP when two objectives need to be simultaneously optimized: minimizing the total cost of traveled subtours while achieving balanced subtours. Experiments are conducted towards investigating the efficiency of the algorithms in a multi-objective setting.

show abstract

Section: Introductionmentioning

confidence: 78%

Section: Introductionmentioning

confidence: 90%

See 1 more Smart Citation

Tackling the Bi-criteria Facet of Multiple Traveling Salesman Problem with Ant Colony Systems

Necula

Breaban

Raschip

2015

2015 IEEE 27th International Conference on Tools With Artificial Intelligence (ICTAI)

Self Cite

View full text Add to dashboard Cite

show abstract

“…In this section, a comparative study is conducted between the proposed approach results and the reference optimal results presented in [35,36]. The optimal results are obtained for the four well-known benchmarks, which are described in the scenarios subsection.…”

Section: Resultsmentioning

confidence: 99%

“…Each scenario consists of a different number of cities, which are distributed over the environment in various locations. Figure 4 shows the four selected scenarios, where the top left one is Christofides/Eilon with 51 cities, top right one is Berlin (Groetschel) with 52 locations, bottom left one is Christofides/Eilon with 76 cities, and bottom right one is Rattled Grid (Pulleyblank) with 99 cities [35,36]. Each scenario has only one depot, represented by the red marker in the graphs.…”

Section: Selected Scenariosmentioning

confidence: 99%

Hybrid Optimization-Based Approach for Multiple Intelligent Vehicles Requests Allocation

Hussein

Marín-Plaza

García

et al. 2018

Journal of Advanced Transportation

View full text Add to dashboard Cite

Self-driving cars are attracting significant attention during the last few years, which makes the technology advances jump fast and reach a point of having a number of automated vehicles on the roads. Therefore, the necessity of cooperative driving for these automated vehicles is exponentially increasing. One of the main issues in the cooperative driving world is the Multirobot Task Allocation (MRTA) problem. This paper addresses the MRTA problem, specifically for the problem of vehicles and requests allocation. The objective is to introduce a hybrid optimization-based approach to solve the problem of multiple intelligent vehicles requests allocation as an instance of MRTA problem, to find not only a feasible solution, but also an optimized one as per the objective function. Several test scenarios were implemented in order to evaluate the efficiency of the proposed approach. These scenarios are based on well-known benchmarks; thus a comparative study is conducted between the obtained results and the suboptimal results. The analysis of the experimental results shows that the proposed approach was successful in handling various scenarios, especially with the increasing number of vehicles and requests, which displays the proposed approach efficiency and performance.

show abstract

An Effective Parallel Approach to Solve Multiple Traveling Salesmen Problem

Othman

Haimoudi

Mouhssine

et al. 2019

Advances in Intelligent Systems and Computing

View full text Add to dashboard Cite

Performance Evaluation of Ant Colony Systems for the Single-Depot Multiple Traveling Salesman Problem

Cited by 26 publications

References 14 publications

Tackling the Bi-criteria Facet of Multiple Traveling Salesman Problem with Ant Colony Systems

Tackling the Bi-criteria Facet of Multiple Traveling Salesman Problem with Ant Colony Systems

Hybrid Optimization-Based Approach for Multiple Intelligent Vehicles Requests Allocation

An Effective Parallel Approach to Solve Multiple Traveling Salesmen Problem

Contact Info

Product

Resources

About