The one-period bus touring problem: Solved by an effective heuristic for the orienteering tour problem and improvement algorithm

DOI10.1016/S0377-2217(99)00323-9MaRDI QIDQ1590800zbMATH OpenFDO

Authors Ray Deitch, Shaul P. Ladany

Publication date 3 September 2002

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0377-2217(99)00323-9

zbMATH Keywords

bus touring probleminteger linear-programming model

Mathematics Subject Classification ID

Traffic problems in operations research (90B20) Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• scientific article; zbMATH DE number 836777
• The orienteering problem: a survey
• A fast and effective heuristic for the orienteering problem
• An Optimal Algorithm for the Orienteering Tour Problem
• On the tour planning problem

Cites work

• An Optimal Algorithm for the Orienteering Tour Problem
• scientific article; zbMATH DE number 4061010 (Why is no real title available?)
• scientific article; zbMATH DE number 836777 (Why is no real title available?)
• The one-period bus touring problem: Solved by an effective heuristic for the orienteering tour problem and improvement algorithm
• The orienteering problem
• The Orienteering Problem with Time Windows
• Using artificial neural networks to solve the orienteering problem

Cited in

(17)

• Solving the prize-collecting rural postman problem
• The one-period bus touring problem: Solved by an effective heuristic for the orienteering tour problem and improvement algorithm
• Efficient metaheuristics for the mixed team orienteering problem with time windows
• The undirected capacitated general routing problem with profits
• The directed profitable rural postman problem with incompatibility constraints
• Attractive orienteering problem with proximity and timing interactions
• Tourist trip design with heterogeneous preferences, transport mode selection and environmental considerations
• Profitable mixed capacitated arc routing and related problems
• The traveling group problem
• A new accessibility based team orienteering approach for urban tourism routes optimization (a real life case)
• New results for the directed profitable rural postman problem
• An ILP-refined tabu search for the directed profitable rural postman problem
• Hybridized evolutionary local search algorithm for the team orienteering problem with time windows
• Approximation algorithms for the arc orienteering problem
• Modeling recreational systems using optimization techniques and information technologies
• A mixed-integer linear programming approach to the optimization of event-bus schedules: a scheduling application in the tourism sector
• On the tour planning 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)