In this paper, we introduce a new approach for solving the traveling salesman problems (TSP) and provide a solution algorithm for a variant of this problem. The concept of the proposed method is based on the Hungarian algorithm, which has been used to solve an assignment problem for reaching an optimal solution. We introduced a new fittest criterion for crossing over such problems, and illu...

We elucidate the relationship between space-llling curves and the Euclidean Traveling 2 Salesman Problem (TSP) by reference to a particular space-lling curve whose scaling behaviour is strongly related to the conjectured scaling behaviour of the optimal TSP tour. We suggest that space-lling curves can be used to generate testbed TSPs: sets of points which in the limit cover a planar surface and...

The efficiency of centralized delivery services over a backbone network in comparison to that of localized or multiple individual trips from the perspective of the overall carbon footprint is a fundamental subject of the analysis of logistical systems. In this paper, we quantify the changes in overall efficiency due to such services by looking at “household-level” economies of scale in transpor...

The aim of this study is to improve searching capability of simulated annealing (SA) heuristic through integration of two new neighborhood mechanisms. Due to its ease of formulation, difficulty to solve and various real life applications several Travelling Salesman Problems (TSP) were selected from the literature for the testing of the proposed methods. The proposed methods were also compared t...

The Generalized Traveling Salesman Problem (GTSP) is an extension of the well-known Traveling Salesman Problem (TSP), where the node set is partitioned into clusters, and the objective is to find the shortest cycle visiting each cluster exactly once. In this paper, we present a new hybrid Ant Colony System (ACS) algorithm for the symmetric GTSP. The proposed algorithm is a modification of a sim...

This paper presents a new method based on the artificial ecosystem optimization (AEO) algorithm for finding shortest tour of travelling salesman problem (TSP). Wherein, AEO is newly developed idea energy flow living organisms in consisting production, consumption and decomposition mechanisms. In order to improve efficiency TSP problem, 2-opt movement technique equipped enhance quality solutions...

The Travelling Salesman Problem (TSP) is one of the most famous optimization problems. The Genetic Algorithm (GA) is one of metaheuristics that have been applied to TSP. The Crossover and mutation operators are two important elements of GA. There are many TSP solver crossover operators. In this paper, we state implementation of some recent TSP solver crossovers at first and then we use each of ...

The Generalized Travelling Salesman Problem, denoted by GTSP, is a variant of the classical travelling salesman problem (TSP), in which the nodes of an undirected graph are partitioned into node sets (clusters) and the salesman has to visit exactly one node from every cluster. In this paper we described six distinct formulations of the GTSP as an integer programming. Apart from the standard for...

This paper deals with a special case of the Euclidean Travelling Salesman Problem known as the x-and-y-axes TSP. In this special case, all cities are situated on the x-axis and on the y-axis of an orthogonal coordinate system for the Euclidean plane. We show that the problem can be solved in O(n) time.