The traveling salesman problem with time-dependent service times

Taş, Duygu; Gendreau, Michel; Jabali, Ola; Laporte, Gilbert

doi:10.1016/j.ejor.2015.07.048

Cited by 42 publications

(20 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Finally, a widely studied problem that falls under VRP is the Travelling Salesman Problem (TSP) which is concerned with finding the best possible way for a salesman to visit several cities and return to his starting point with minimum distance and/or cost. Lots of studies highlighted this problem and some of them, to name a few, can be seen in [87][88][89][90][91][92][93][94][95][96]. TSP has been studied with many variations; for instance, [90] added time windows within which customers must be visited and [91] considered timedependent service time.…”

Section: Vehicle Routing Problemmentioning

confidence: 99%

“…Lots of studies highlighted this problem and some of them, to name a few, can be seen in [87][88][89][90][91][92][93][94][95][96]. TSP has been studied with many variations; for instance, [90] added time windows within which customers must be visited and [91] considered timedependent service time. Taş et al [91] believe that in practice service times depends on several factors during the day such as the availability of parking in customers' area.…”

Section: Vehicle Routing Problemmentioning

confidence: 99%

See 1 more Smart Citation

Optimal routing and scheduling in E-commerce logistics using crowdsourcing strategies

Mohamed

Ndiaye

2018

2018 7th International Conference on Industrial Technology and Management (ICITM)

View full text Add to dashboard Cite

Section: Vehicle Routing Problemmentioning

confidence: 99%

Section: Vehicle Routing Problemmentioning

confidence: 99%

Optimal routing and scheduling in E-commerce logistics using crowdsourcing strategies

Mohamed

Ndiaye

2018

2018 7th International Conference on Industrial Technology and Management (ICITM)

View full text Add to dashboard Cite

“…Pentingnya permasalahan ini untuk diselesaikan karena bukan hanya perihal pencarian rute terpendek namun juga mempertimbangkan batasan yag ada. Beberapa penelitian sebelumnya menyelesaikan TSP dengan batasan antara lain handling cost [2], deadline and advanced information [3], dependent service time [4], fuzzy constraint [5] dan time window [6]- [10] juga termasuk fuzzy dalam time window tersebut [11].…”

Section: Pendahuluanunclassified

Penanganan Fuzzy Time Window pada Travelling Salesman Problem (TSP) dengan Penerapan Algoritma Genetika

Yuliastuti

Mahmudy

Rizki

2017

View full text Add to dashboard Cite

The route of the travel tour packages offered by travel agents is not considered optimum, so the level of satisfaction the tourist is not maximal. Selection of the route of the travel packages included in the traveling salesman problem (TSP). The problem that occurs is uncertain tourists visiting destinations at the best destinations timing hereinafter be referred to as the fuzzy time window problem. Therefore, the authors apply the genetic algorithm to solve the problem. Based on test results obtained optimum solution with the fitness value of 1.3291, a population size of 100, the number of generations of 1000, a combination of CR=0,4 and MR=0.6.

show abstract

“…Also, different problems can be converted to TSP with a lot of nodes, one of them is the Vehicle Routing Problem [ 6 ], and other is the Job Shop Scheduling Problem [ 7 ]; in the the last case a problem with 30 jobs and 10 machines is a TSP with 300 cities. Other applications are in Tas, Gendreau, Jabali and Laporte [ 8 ] and in Veenstra, Roodbergen, Vis and Coelho [ 9 ]. In a different topic, different clustering techniques have been used to solve problems with many nodes, such as clusters based in prototypes, centers, graphs and densities [ 10 ].…”

Section: Introductionmentioning

confidence: 99%

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

et al. 2018

View full text Add to dashboard Cite

This article finds feasible solutions to the travelling salesman problem, obtaining the route with the shortest distance to visit n cities just once, returning to the starting city. The problem addressed is clustering the cities, then using the NEH heuristic, which provides an initial solution that is refined using a modification of the metaheuristic Multi-Restart Iterated Local Search MRSILS; finally, clusters are joined to end the route with the minimum distance to the travelling salesman problem. The contribution of this research is the use of the metaheuristic MRSILS, that in our knowledge had not been used to solve the travelling salesman problem using clusters. The main objective of this article is to demonstrate that the proposed algorithm is more efficient than Genetic Algorithms when clusters are used. To demonstrate the above, both algorithms are compared with some cases taken from the literature, also a comparison with the best-known results is done. In addition, statistical studies are made in the same conditions to demonstrate this fact. Our method obtains better results in all the 10 cases compared.

show abstract

The traveling salesman problem with time-dependent service times

Cited by 42 publications

References 18 publications

Optimal routing and scheduling in E-commerce logistics using crowdsourcing strategies

Optimal routing and scheduling in E-commerce logistics using crowdsourcing strategies

Penanganan Fuzzy Time Window pada Travelling Salesman Problem (TSP) dengan Penerapan Algoritma Genetika

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

Contact Info

Product

Resources

About