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-9zbMath0991.90031MaRDI QIDQ1590800

Shaul P. Ladany, Ray Deitch

Publication date: 3 September 2002

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

zbMATH Keywords

bus touring probleminteger linear-programming model

Mathematics Subject Classification ID

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

Related Items (13)

New results for the directed profitable rural postman problem ⋮ The traveling group 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 ⋮ Efficient metaheuristics for the mixed team orienteering problem with time windows ⋮ Tourist trip design with heterogeneous preferences, transport mode selection and environmental considerations ⋮ The undirected capacitated general routing problem with profits ⋮ The directed profitable rural postman problem with incompatibility constraints ⋮ 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 ⋮ Profitable mixed capacitated arc routing and related problems

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• The orienteering problem
• The Orienteering Problem with Time Windows
• An Optimal Algorithm for the Orienteering Tour 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