Solving the team orienteering arc routing problem with a column generation approach

DOI10.1016/j.ejor.2017.03.027zbMath1403.90164OpenAlexW2597290710MaRDI QIDQ1754007

Juan-José Salazar-González, Jorge Riera-Ledesma

Publication date: 30 May 2018

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2017.03.027

zbMATH Keywords

vehicle routing problemtravelling salesmanorienteering problembranch-and-price-and-cut

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)

Related Items

Design of diversified package tours for the digital travel industry: a branch-cut-and-price approach ⋮ Arc routing problems: A review of the past, present, and future ⋮ A revisited branch-and-cut algorithm for large-scale orienteering problems ⋮ A new mathematical model and a heuristic algorithm for the tourist trip design problem under new constraints: a real-world application ⋮ Coupling feasibility pump and large neighborhood search to solve the Steiner team orienteering problem ⋮ Scheduling heterogeneous delivery tasks on a mixed logistics platform ⋮ Robust drone selective routing in humanitarian transportation network assessment

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• A matheuristic for the team orienteering arc routing problem
• Orienteering problem: a survey of recent variants, solution approaches and applications
• A branch-and-cut algorithm for the orienteering arc routing problem
• The orienteering problem: a survey
• The selective travelling salesman problem
• The team orienteering problem
• Stabilized column generation
• An optimal solution procedure for the multiple tour maximum collection problem using column generation
• A heuristic for the multiple tour maximum collection problem
• A TABU search heuristic for the team orienteering problem
• An exact algorithm for team orienteering problems
• Robust branch-and-cut-and-price for the capacitated vehicle routing problem
• The Shortest-Path Problem with Resource Constraints and k-Cycle Elimination for k ≥ 3
• The Team Orienteering Problem: Formulations and Branch-Cut and Price
• Vehicle Routing
• A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem
• Decomposition Principle for Linear Programs
• The orienteering problem
• Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
• Solving the Orienteering Problem through Branch-and-Cut
• Improvement Procedures for the Undirected Rural Postman Problem
• Shortest Path Problems with Resource Constraints