On the tour planning problem
From MaRDI portal
Publication:763203
DOI10.1007/S10479-010-0763-5zbMATH Open1233.90103OpenAlexW1987111740MaRDI QIDQ763203FDOQ763203
Chenbo Zhu, Jianqiang Hu, Yifan Xu, Fengchun Wang, Rongzeng Cao
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
Approximation methods and heuristics in mathematical programming (90C59) Mixed integer programming (90C11) Traffic problems in operations research (90B20)
Cites Work
Cited In (11)
- Efficient sequential decision-making algorithms for container inspection operations
- Solving Large-Scale Tour Scheduling Problems
- Title not available (Why is that?)
- Rough approximation-based approach for designing a personalized tour route under a fuzzy environment
- Title not available (Why is that?)
- Survey, categorization, and comparison of recent tour scheduling literature
- The one-period bus touring problem: Solved by an effective heuristic for the orienteering tour problem and improvement algorithm
- Evolution-inspired local improvement algorithm solving orienteering problem
- Splitting a giant tour using integer linear programming
- Optimal duty rostering for toll enforcement inspectors
- Tourenplanung fรผr zwei Depots bei offenen Touren
Recommendations
- Title not available (Why is that?) ๐ ๐
- Heuristics for the time dependent team orienteering problem: application to tourist route planning ๐ ๐
- The one-period bus touring problem: Solved by an effective heuristic for the orienteering tour problem and improvement algorithm ๐ ๐
- Title not available (Why is that?) ๐ ๐
- A LP-based heuristic for a time-constrained routing problem ๐ ๐
This page was built for publication: On the tour planning problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q763203)