A comparison of algorithms for finding an efficient theme park tour

DOI10.1155/2018/2453185zbMath1437.90028OpenAlexW2897016264MaRDI QIDQ1741683

Rahul Isaac, Danny Rivers, James Midkiff, Leonard J. Testa, Kevin R. Hutson, Elizabeth L. Bouzarth, Richard J. Forrester

Publication date: 7 May 2019

Published in: Journal of Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2018/2453185

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06)

Uses Software

• Scatter Search
• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The traveling salesman problem with time-dependent service times
• Time-dependent routing problems: a review
• A tabu search heuristic for a sequence-dependent and time-dependent scheduling problem on a single machine
• Scheduling examinations to reduce second-order conflicts
• A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem
• An integer programming approach for the time-dependent traveling salesman problem with time windows
• A combined multistart random constructive heuristic and set partitioning based formulation for the vehicle routing problem with time dependent travel times
• The traveling purchaser problem with time-dependent quantities
• Scheduling with time-dependent discrepancy times
• A dynamic vehicle routing problem with time-dependent travel times
• Future paths for integer programming and links to artificial intelligence
• The time-dependent traveling salesman problem
• Vehicle dispatching with time-dependent travel times
• A branch-and-cut algorithm for a production scheduling problem with sequence-dependent and time-dependent setup times
• Vehicle routing and scheduling with dynamic travel times
• Integer Programming Formulation of Traveling Salesman Problems
• Tabu Search—Part I
• Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms
• The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
• Parallel iterative search methods for vehicle routing problems
• A simple min-cut algorithm
• Time‐dependent traveling salesman problem–the deliveryman case
• Solution of a Large-Scale Traveling-Salesman Problem
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Heuristic Bounds and Test Problem Generation for the Time-Dependent Traveling Salesman Problem