The one-period bus touring problem: Solved by an effective heuristic for the orienteering tour problem and improvement algorithm
From MaRDI portal
Publication:1590800
DOI10.1016/S0377-2217(99)00323-9zbMATH Open0991.90031MaRDI QIDQ1590800FDOQ1590800
Authors: Ray Deitch, Shaul P. Ladany 
Publication date: 3 September 2002
Published in: European Journal of Operational Research (Search for Journal in Brave)
Recommendations
Approximation methods and heuristics in mathematical programming (90C59) Integer programming (90C10) Traffic problems in operations research (90B20)
Cites Work
- The orienteering problem
- The Orienteering Problem with Time Windows
- The one-period bus touring problem: Solved by an effective heuristic for the orienteering tour problem and improvement algorithm
- Using artificial neural networks to solve the orienteering problem
- Title not available (Why is that?)
- An Optimal Algorithm for the Orienteering Tour Problem
- Title not available (Why is that?)
Cited In (17)
- Tourist trip design with heterogeneous preferences, transport mode selection and environmental considerations
- Attractive orienteering problem with proximity and timing interactions
- The directed profitable rural postman problem with incompatibility constraints
- New results for the directed profitable rural postman problem
- An ILP-refined tabu search for the directed profitable rural postman problem
- Efficient metaheuristics for the mixed team orienteering problem with time windows
- Approximation algorithms for the arc orienteering problem
- Solving the prize-collecting rural postman problem
- The undirected capacitated general routing problem with profits
- Hybridized evolutionary local search algorithm for the team orienteering problem with time windows
- The one-period bus touring problem: Solved by an effective heuristic for the orienteering tour problem and improvement algorithm
- Modeling recreational systems using optimization techniques and information technologies
- A new accessibility based team orienteering approach for urban tourism routes optimization (a real life case)
- On the tour planning problem
- A mixed-integer linear programming approach to the optimization of event-bus schedules: a scheduling application in the tourism sector
- Profitable mixed capacitated arc routing and related problems
- The traveling group problem
This page was built for publication: The one-period bus touring problem: Solved by an effective heuristic for the orienteering tour problem and improvement algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1590800)
