The museum visitor routing problem
From MaRDI portal
Publication:969135
DOI10.1016/j.amc.2010.01.066zbMath1186.90058OpenAlexW2040552073MaRDI QIDQ969135
Shuo-Yan Chou, Shih-Wei Lin, Vincent F. Yu
Publication date: 11 May 2010
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2010.01.066
simulated annealingmuseum visitor routing problemopen shop scheduling problemsequence dependent setup time
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (15)
New efficient heuristics for scheduling open shops with makespan minimization ⋮ Two-machine routing open shop on a tree: instance reduction and efficiently solvable subclass ⋮ A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times ⋮ A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions ⋮ A constraint programming-based iterated greedy algorithm for the open shop with sequence-dependent processing times and makespan minimization ⋮ A Memetic-GRASP Algorithm for the Solution of the Orienteering Problem ⋮ Reducing network and computation complexities in neural based real-time scheduling scheme ⋮ A simulated annealing heuristic for the team orienteering problem with time windows ⋮ An efficient particle swarm optimizer with application to man-day project scheduling problems ⋮ A mixed-integer linear programming approach to the optimization of event-bus schedules: a scheduling application in the tourism sector ⋮ Four decades of research on the open-shop scheduling problem to minimize the makespan ⋮ Irreducible bin packing and normality in routing open shop ⋮ Block layout for attraction-based enterprises ⋮ A new algorithm for the two-machine open shop and the polynomial solvability of a scheduling problem with routing ⋮ O(log m)-approximation for the routing open shop problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
- Two hybrid meta-heuristics for the finite horizon ELSP in flexible flow lines with unrelated parallel machines
- Hybrid ant colony optimization and visibility studies applied to a job-shop scheduling problem
- Solving the truck and trailer routing problem based on a simulated annealing heuristic
- The generalized shifting bottleneck procedure
- Classical and new heuristics for the open-shop problem: A computational evaluation
- A tabu search algorithm for the open shop scheduling problem
- Constructive heuristic algorithms for the open shop problem
- A branch \(\&\) bound algorithm for the open-shop problem
- A tabu search algorithm for the open shop problem
- Competitive genetic algorithms for the open-shop scheduling problem
- A hybrid genetic algorithm for the open shop scheduling problem
- Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling
- Insertion techniques for the heuristic solution of the job shop problem
- An iterative improvement approach for the nonpreemptive open shop scheduling problem
- Benchmarks for basic scheduling problems
- A simulated annealing approach to the solution of job rotation scheduling problems
- A new particle swarm optimization for the open shop scheduling problem
- Simulated annealing heuristics for the dynamic facility layout problem
- A hybrid simulated annealing for capacitated vehicle routing problems with the independent route length
- A simulated annealing and hill-climbing algorithm for the traveling tournament problem
- A hybrid method for solving stochastic job shop scheduling problems
- Open-shop scheduling problems with dominated machines
- Open Shop Scheduling to Minimize Finish Time
- An Algorithm for the Open-Shop Problem
- Equation of State Calculations by Fast Computing Machines
- Modeling and Using Context
- Solving the open shop scheduling problem
This page was built for publication: The museum visitor routing problem
