Traveling Salesman Problem, Theory and Applications

Davendra, Donald

doi:10.5772/547

Cited by 99 publications

(6 citation statements)

References 149 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Several works in the literature propose methods to recommend a list of PoIs based on the actual location of the user (location-based services) (Huang & Bian, 2009;Monreale, Pinelli, Trasarti, & Giannotti, 2009;Yoon, Zheng, Xie, & Woo, 2010Lucchese, Perego, Silvestri, Vahabi, & Venturini, 2012). However, in this paper we focus on a method for suggesting ''sightseeing tours'' based on time-budgeted itineraries matching the user preferences.…”

Section: Related Workmentioning

confidence: 98%

On planning sightseeing tours with TripBuilder

Brilhante

Macêdo

Nardini

et al. 2015

Information Processing & Management

111

View full text Add to dashboard Cite

Section: Related Workmentioning

confidence: 98%

On planning sightseeing tours with TripBuilder

Brilhante

Macêdo

Nardini

et al. 2015

Information Processing & Management

111

View full text Add to dashboard Cite

“…The proposed scheduling problem in this work is formulated using Mixed-Integer Programming (MIP) optimization, which is known to be NP-hard [32,33]. Thus, to reduce the complexity, the problem was decomposed into two sub-problems.…”

Section: Problem Solvingmentioning

confidence: 99%

Optimal Management of Mobile Energy Generation and Storage Systems

2020

View full text Add to dashboard Cite

“…Several local search approximation algorithms have been studied for the TSP. The most successful include: 2-opt, 3-opt, -ops and Lin-Kernighan (LK) [2]. -opt algorithms involve iteratively removing edges, and replacing these with different edges in reconnecting the tour.…”

Section: Previous Researchmentioning

confidence: 99%

The enhanced best performance algorithm for the travelling salesman problem

Chetty¹,

Adewumi²

2017

ces

View full text Add to dashboard Cite

The Travelling Salesman Problem (TSP) is a largely studied discrete optimization problem, which is-Hard. This study compares the performances of three local search metaheuristic algorithms, in determining solutions to seven benchmark instances of symmetric TSP's. The algorithms investigated include the enhanced Best Performance Algorithm (eBPA), Tabu Search (TS) and Simulated Annealing (SA). This study is the first on the eBPA for the TSP. eBPA is a newly introduced metaheuristic in the literature. The results demonstrate the effectiveness of eBPA as an alternative optimization technique for difficult optimization problems.

show abstract

Traveling Salesman Problem, Theory and Applications

Cited by 99 publications

References 149 publications

On planning sightseeing tours with TripBuilder

On planning sightseeing tours with TripBuilder

Optimal Management of Mobile Energy Generation and Storage Systems

The enhanced best performance algorithm for the travelling salesman problem

Contact Info

Product

Resources

About