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

DOI10.1016/J.EJOR.2017.03.027zbMATH Open1403.90164OpenAlexW2597290710MaRDI QIDQ1754007FDOQ1754007

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

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

Recommendations

• A branch-and-cut algorithm for the orienteering arc routing problem
• The team orienteering problem: formulations and branch-cut and price
• A matheuristic for the team orienteering arc routing problem
• An exact algorithm for team orienteering problems
• Solving the team orienteering problem with cutting planes

zbMATH Keywords

vehicle routing problemorienteering problemtravelling salesmanbranch-and-price-and-cut

Mathematics Subject Classification ID

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

Cites Work

• The shortest-path problem with resource constraints and \(k\)-cycle elimination for \(k\geq 3\)
• The orienteering problem
• Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
• Shortest Path Problems with Resource Constraints
• The orienteering problem: a survey
• Stabilized column generation
• The team orienteering problem
• Decomposition Principle for Linear Programs
• Robust branch-and-cut-and-price for the capacitated vehicle routing problem
• Solving the Orienteering Problem through Branch-and-Cut
• The selective travelling salesman problem
• A TABU search heuristic for the team orienteering problem
• An exact algorithm for team orienteering problems
• The team orienteering problem: formulations and branch-cut and price
• Vehicle Routing
• A matheuristic for the team orienteering arc routing problem
• A branch-and-cut algorithm for the orienteering arc routing problem
• Improvement Procedures for the Undirected Rural Postman Problem
• Title not available (Why is that?)
• A heuristic for the multiple tour maximum collection problem
• A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem
• Orienteering problem: a survey of recent variants, solution approaches and applications
• An optimal solution procedure for the multiple tour maximum collection problem using column generation
• Title not available (Why is that?)

Cited In (14)

• The hiking tourist problem
• The team orienteering problem: formulations and branch-cut and price
• Iterated local search and column generation to solve arc-routing as a permutation set-covering problem
• An updated annotated bibliography on arc routing problems
• Arc routing problems: A review of the past, present, and future
• Coupling feasibility pump and large neighborhood search to solve the Steiner team orienteering problem
• A matheuristic for the team orienteering arc routing problem
• A branch-and-cut algorithm for the orienteering arc routing problem
• A new mathematical model and a heuristic algorithm for the tourist trip design problem under new constraints: a real-world application
• A revisited branch-and-cut algorithm for large-scale orienteering problems
• Scheduling heterogeneous delivery tasks on a mixed logistics platform
• Robust drone selective routing in humanitarian transportation network assessment
• An exact algorithm for team orienteering problems
• Design of diversified package tours for the digital travel industry: a branch-cut-and-price approach

Uses Software

• VRP

This page was built for publication: Solving the team orienteering arc routing problem with a column generation approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1754007)