Non-abusiveness Helps: An % MathType!MTEF!2!1!+- % feaafiart1ev1aaatCvAUfKttLearuqr1ngBPrgarmWu51MyVXgatC % vAUfeBSjuyZL2yd9gzLbvyNv2CaeHbuLwBLnhiov2DGi1BTfMBaeHb % d9wDYLwzYbItLDharqqtubsr4rNCHbGeaGqiVu0Je9sqqrpepC0xbb % L8F4rqqrFfpeea0xe9Lq-Jc9vqaqpepm0xbba9pwe9Q8fs0-yqaqpe % pae9pg0FirpepeKkFr0xfr-xfr-xb9adbaqaaeGaciGaaiaadeWaaq % aadaqbaaGcbaGaaGOmamaaCaaaleqabaGagiiBaWMaei4Ba8Maei4z % aCgaaOWaaWbaaSqabeaadaahaaadbeqaamaaBaaabaWaaWbaaeqaba % GaaGymaiabgkHiTiabgIGiodaaaeqaaaaaaaGcdaahaaWcbeqaaiab % d6gaUbaaaaa!4546! \[ 2^{\log } ^{^{_{^{1 - \in } } } } ^n \] (1)-Competitive Algorithm for Minimizing the Maximum Flow Time in the Online Traveling Salesman Problem

Traveling Salesman Problem (TSP) which is proved as an NP-Complete problem is solved by many algorithms. In this paper, we propose online TSP which is based on general discrete metric space. A Waiting-If-Necessary (WIN) algorithm is proposed that involves with increasing cost caused by zealous algorithms and unnecessary waiting caused by cautious algorithms. We measure the performance of the WIN algorithm using competitive analysis and found that it is a 2-competitive algorithm. The competitive ratio of theWIN algorithm can be improved by setting parameterT0.

Download Full-text

Imperial competitive algorithm with policy learning for the traveling salesman problem

Soft Computing ◽

10.1007/s00500-015-1886-z ◽

2015 ◽

Vol 21 (7) ◽

pp. 1863-1875 ◽

Cited By ~ 9

Author(s):

Meng-Hui Chen ◽

Shih-Hsin Chen ◽

Pei-Chann Chang

Keyword(s):

Traveling Salesman Problem ◽

Traveling Salesman ◽

Policy Learning ◽

Competitive Algorithm ◽

The Traveling Salesman Problem ◽

Imperial Competitive Algorithm

Download Full-text

A Model for Multiple Traveling Salesman Problem with Mixed Type Vehicles

Korean Journal of Logistics ◽

10.15735/kls.2018.26.4.008 ◽

2018 ◽

Vol 26 (4) ◽

pp. 115-130

Author(s):

Jin-Wook Kim ◽

채준재

Keyword(s):

Traveling Salesman Problem ◽

Mixed Type ◽

Traveling Salesman ◽

Multiple Traveling Salesman Problem

Download Full-text

Grafos hamiltonianos aplicado al turismo de Panamá

Investigación y Pensamiento Crítico ◽

10.37387/ipc.v7i1.12 ◽

2019 ◽

Vol 7 (1) ◽

pp. 109-113

Author(s):

Julio Trujillo

Keyword(s):

Traveling Salesman Problem ◽

Traveling Salesman

Un problema clásico de Teoría de Grafos es encontrar un camino que pase por varios puntos, sólo una vez, empezando y terminando en un lugar (camino hamiltoniano). Al agregar la condición de que sea la ruta más corta, el problema se convierte uno de tipo TSP (Traveling Salesman Problem). En este trabajo nos centraremos en un problema de tour turístico por la ciudad de Panamá, transformándolo a un problema de grafo de tal manera que represente la situación planteada.

Download Full-text