The multiple traveling salesman problem: an overview of formulations and solution procedures

Bektaş, Tolga

doi:10.1016/j.omega.2004.10.004

Cited by 936 publications

(535 citation statements)

References 52 publications

Supporting

Mentioning

509

Contrasting

Unclassified

Order By: Relevance

“…Travelling salesmen problem [5] has capacity restriction and mutual restriction. Unlike VLSI or TSP problem, this case is a 2D vehicle routing problem [6] with confliction and capacity restriction.…”

Section: Improved Greedy Algorithm Based Matrix Cable Connection Optimentioning

confidence: 99%

Improved Greedy Algorithm Based Matrix Satellite Cable Connection Optimal Design

Wang

Zong

et al. 2017

MATEC Web Conf.

View full text Add to dashboard Cite

Abstract. An improved greedy algorithm based matrix satellite cable optimal design method is presented in this paper aim to overcome the difficulties including designing complexity, designing cycle and iterative designing process. An optimal algorithm model is built to help designer not only to accomplish design correctly and efficiently, but also to obtain better designing outcomes. Firstly, matrix cable designing model is pre-translated by turning electrical interface to equivalent digital model. Then the digital model is turned into computer language. At last, optimal design rules and method are extracted according to improved greedy algorithm. Real project data are used to prove the feasibility and validity of the proposed method.

show abstract

Section: Improved Greedy Algorithm Based Matrix Cable Connection Optimentioning

confidence: 99%

Improved Greedy Algorithm Based Matrix Satellite Cable Connection Optimal Design

Wang

Zong

et al. 2017

MATEC Web Conf.

View full text Add to dashboard Cite

show abstract

“…The multiple traveling salesman problem (MTSP) is a generalization of the TSP, where more than one salesman is allowed to be used in the solution [14]. MTSP extends the problem to a wide variety of vehicle routing problems (VRPs) by incorporating some additional side constraints such as vehicle capacity limits, delivery time windows, as well as time dependent speeds in metropolitan area [14].…”

Section: B Traveling Salesman Problem (Tsp)mentioning

confidence: 99%

“…MTSP extends the problem to a wide variety of vehicle routing problems (VRPs) by incorporating some additional side constraints such as vehicle capacity limits, delivery time windows, as well as time dependent speeds in metropolitan area [14].…”

Section: B Traveling Salesman Problem (Tsp)mentioning

confidence: 99%

Design of the Integrated Logistics Information System Based on Cloud Computing

Minjeong¹,

Lee²

2015

LNSE

View full text Add to dashboard Cite

Abstract-This study presents the practical approach for designing the integrated logistic information system (ILIS) in cloud computing environment. It is intended to optimize resources (vehicles, human resources, oil, etc.) required to logistics management. This system is targeted at the small and medium-sized third-party logistics (3PL) companies which are difficult to establish IT system by providing a remote service environment like SaaS (Software as a Service). In this study, the concepts traveling salesman problem (TSP) and Dynamic Programming (DP) are used for route optimization. We intend to contribute to minimize the operational cost of the logistics system by designing remote service.

show abstract

“…Some reported applications are presented in [10]. The main applications include print press scheduling [21], crew scheduling [22], school bus routing [23], mission planning [24], and the de-…”

mentioning

confidence: 99%

“…Bektas [10] introduced comprehensive formulations and solution procedures for the MTSP, and indicated that exact algorithms [11,12] could always obtain degenerated results when solving the MTSP. Heuristic algorithms, neural network-based methods, and ant systems have all been proposed to solve the MTSP.…”

mentioning

confidence: 99%

A novel method for solving the multiple traveling salesmen problem with multiple depots

Hou

Liu

2012

Chin. Sci. Bull.

View full text Add to dashboard Cite

Multi-traveling salesman problem (MTSP) is an extension of traveling salesman problem, which is a famous NP hard problem, and can be used to solve many real world problems, such as railway transportation, routing and pipeline laying. In this paper, we analyze the general properties of MTSP, and find that the multiple depots and closed paths in the graph is a big issue for MTSP. Thus, a novel method is presented to solve it. We transform a complicated graph into a simplified one firstly, then an effective algorithm is proposed to solve the MTSP based on the simplified results. In addition, we also propose a method to optimize the general results by using 2-OPT. Simulation results show that our method can find the global solution for MTSP efficiently. The traveling salesman problem (TSP) is a typical combinatorial optimization problem. A generalization of the TSP is the multiple traveling salesmen problem (MTSP), which determines a set of routes enabling multiple salesmen to start at and return to depots. [17] used a competition-based neural network to solve a minmax MTSP. Thus far, GAs have been applied to a wide range of application areas, including solving the MTSP. Liaw et al. [18] proposed a hybrid genetic algorithm, which is based on tabu search, to solve the MTSP. Carter et al. [19] researched chromosome representation and related genetic operators to find an applicable method for solving the MTSP. Additionally, the ant system, which was proved by [7], is a perfectly acceptable meta-heuristic for a number of NP-hard problems. In [20], an ant system is applied to the MTSP.The MTSP seems to be more appropriate than the TSP for practical applications and can be used to simulate many everyday applications such as transportation logistics, job planning, vehicle scheduling, and so on. Some reported applications are presented in [10]. The main applications include print press scheduling [21], crew scheduling [22], school bus routing [23], mission planning [24], and the de-

show abstract

The multiple traveling salesman problem: an overview of formulations and solution procedures

Cited by 936 publications

References 52 publications

Improved Greedy Algorithm Based Matrix Satellite Cable Connection Optimal Design

Improved Greedy Algorithm Based Matrix Satellite Cable Connection Optimal Design

Design of the Integrated Logistics Information System Based on Cloud Computing

A novel method for solving the multiple traveling salesmen problem with multiple depots

Contact Info

Product

Resources

About