RETRACTED: Time-dependent personal tour planning and scheduling in metropolises

Abbaspour, Rahim Ali; Samadzadegan, Farhad

doi:10.1016/j.eswa.2011.04.025

Cited by 110 publications

(59 citation statements)

References 33 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The time-dependent variant of the OP is relatively new and has, to the best of our knowledge, only been studied in (Fomin and Lingas, 2002;Abbaspour and Samadzadegan, 2011;Garcia et al, 2013;Li et al, 2010;Li, 2011;Gavalas et al, 2014Gavalas et al, , 2015. Fomin and Lingas (2002) were the first authors to mention the TD-OP and state that it is NP-hard because the OP is NP-hard.…”

Section: Literature Reviewmentioning

confidence: 99%

The time-dependent orienteering problem with time windows: a fast ant colony system

2017

View full text Add to dashboard Cite

This paper proposes a fast ant colony system based solution method to solve realistic instances of the time-dependent orienteering problem with time windows within a few seconds of computation time. Orienteering problems occur in logistic situations where an optimal combination of locations needs to be selected and the routing between these selected locations needs to be optimized. For the time-dependent problem, the travel time between two locations depends on the departure time at the first location. The main contribution of this paper is the design of a fast and effective algorithm for this problem. Numerous experiments on realistic benchmark instances with varying size confirm the state-of-the-art performance and practical relevance of the algorithm.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

The time-dependent orienteering problem with time windows: a fast ant colony system

2017

View full text Add to dashboard Cite

show abstract

“…The downside with these systems is that they have no live feedback from users, and the associated computation is complicated because they resolve an optimization problem. For example, [12,27,28] use genetic heuristics. Reference [29] utilizes simulated annealing and [13] solves a dynamic programming problem.…”

Section: Related Workmentioning

confidence: 99%

“…Reference [14] uses a clustering algorithm based on location and tourist preferences and then computes the route using a greedy algorithm on those clusters. Other works iteratively construct the tour plan based on successive refinements of the initial user plan [9,15,16,27] and the solution is approximated via metaheuristics. References [15,27] use genetic algorithm whereas [16] uses a local search heuristic and [8] a binary search tree heuristic.…”

Section: Related Workmentioning

confidence: 99%

“…Other works iteratively construct the tour plan based on successive refinements of the initial user plan [9,15,16,27] and the solution is approximated via metaheuristics. References [15,27] use genetic algorithm whereas [16] uses a local search heuristic and [8] a binary search tree heuristic. The common term in the literature for these problems is tourist trip design problem (TTDP) or, simply, Orienting Problem [30].…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

ANT: Agent Stigmergy-Based IoT-Network for Enhanced Tourist Mobility

López-Matencio¹,

Vales‐Alonso²,

Costa-Montenegro³

2017

Mobile Information Systems

View full text Add to dashboard Cite

In this work, we propose ANT, a network of agents which exchange information in a stigmergy-based fashion. In ANT, each system's actor distributes pheromones as a way of indicating places' attractiveness, as well as for building a proper routing path to those sites. The goal of ANT is to improve the chances of discovering points of interest, as well as to reduce the time required for doing so. We have applied ANT to a tourist mobility scenario, where both people and things (events, restaurants, performances, etc.) participate. ANT has achieved notable success in this example case. We find that probability of discovering temporary events and dates improves by more than 35%, while the mean time employed to determine static point decreases by more than a third. We also introduce a mobile-based architecture which performs ANT tasks efficiently and easily for the user.

show abstract

“…They defined multimodal routes as chromosomes with variable length with several parts in a way each part presented a type of transportation. (Abbaspour & Samadzadegan, 2011) used an adapted evolutionary algorithm with variable length chromosomes to find shortest multi-modal route in a complex and large dynamic transportation network. (Borole, Rout, Goel, Vedagiri, & Mathew, 2013) used real-time transportation network data for finding shortest multimodal route.…”

Section: Introductionmentioning

confidence: 99%

A New Multimodal Multi-Criteria Route Planning Model by Integrating a Fuzzy-Ahp Weighting Method and a Simulated Annealing Algorithm

Ghaderi

Pahlavani

2015

Int. Arch. Photogramm. Remote Sens. Spatial Inf. Sci.

View full text Add to dashboard Cite

ABSTRACT:A multimodal multi-criteria route planning (MMRP) system provides an optimal multimodal route from an origin point to a destination point considering two or more criteria in a way this route can be a combination of public and private transportation modes. In this paper, the simulate annealing (SA) and the fuzzy analytical hierarchy process (fuzzy AHP) were combined in order to find this route. In this regard, firstly, the effective criteria that are significant for users in their trip were determined. Then the weight of each criterion was calculated using the fuzzy AHP weighting method. The most important characteristic of this weighting method is the use of fuzzy numbers that aids the users to consider their uncertainty in pairwise comparison of criteria. After determining the criteria weights, the proposed SA algorithm were used for determining an optimal route from an origin to a destination. One of the most important problems in a meta-heuristic algorithm is trapping in local minima. In this study, five transportation modes, including subway, bus rapid transit (BRT), taxi, walking, and bus were considered for moving between nodes. Also, the fare, the time, the user's bother, and the length of the path were considered as effective criteria for solving the problem. The proposed model was implemented in an area in centre of Tehran in a GUI MATLAB programming language. The results showed a high efficiency and speed of the proposed algorithm that support our analyses.

show abstract

RETRACTED: Time-dependent personal tour planning and scheduling in metropolises

Cited by 110 publications

References 33 publications

The time-dependent orienteering problem with time windows: a fast ant colony system

The time-dependent orienteering problem with time windows: a fast ant colony system

ANT: Agent Stigmergy-Based IoT-Network for Enhanced Tourist Mobility

A New Multimodal Multi-Criteria Route Planning Model by Integrating a Fuzzy-Ahp Weighting Method and a Simulated Annealing Algorithm

Contact Info

Product

Resources

About