On the tour planning problem

DOI10.1007/s10479-010-0763-5zbMath1233.90103OpenAlexW1987111740MaRDI QIDQ763203

Chenbo Zhu, Fengchun Wang, Rongzeng Cao, Jianqiang Hu, Yi-Fan Xu

Publication date: 9 March 2012

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-010-0763-5

zbMATH Keywords

local searchheuristicmixed integer linear programmingteam orienteering problemtour planning problem

Mathematics Subject Classification ID

Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Traffic problems in operations research (90B20)

Related Items

Efficient sequential decision-making algorithms for container inspection operations ⋮ Optimal duty rostering for toll enforcement inspectors ⋮ Evolution-inspired local improvement algorithm solving orienteering problem ⋮ Rough approximation-based approach for designing a personalized tour route under a fuzzy environment

Cites Work

• The team orienteering problem
• A guided local search metaheuristic for the team orienteering problem
• An Exchange Heuristic for Routeing Problems with Time Windows
• The Vehicle Routing Problem with Time Windows Part I: Tabu Search
• Computer Solutions of the Traveling Salesman Problem

This page was built for publication: On the tour planning problem