Solving the team orienteering problem with cutting planes

DOI10.1016/j.cor.2016.04.008zbMath1349.90811arXiv1604.02934OpenAlexW2314759401MaRDI QIDQ342446

Aziz Moukrim, Duc-Cuong Dang, Racha El-Hajj

Publication date: 17 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1604.02934

zbMATH Keywords

cutting planesincompatibilityteam orienteering problemdominance propertyclique cutindependent-set cut

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Transportation, logistics and supply chain management (90B06)

Related Items (16)

A biased-randomized discrete-event heuristic for coordinated multi-vehicle container transport across interconnected networks ⋮ An iterated local search algorithm for the team orienteering problem with variable profits ⋮ Boosting ant colony optimization via solution prediction and machine learning ⋮ A profit-maximization location-routing-pricing problem: a branch-and-price algorithm ⋮ An effective hybrid search algorithm for the multiple traveling repairman problem with profits ⋮ A hybrid adaptive large neighborhood search heuristic for the team orienteering problem ⋮ The vehicle routing problem with service level constraints ⋮ Trip planning for visitors in a service system with capacity constraints ⋮ Solving the team orienteering problem with nonidentical agents: A Lagrangian approach ⋮ GRASP‐ILS and set cover hybrid heuristic for the synchronized team orienteering problem with time windows ⋮ A PSO based algorithm with an efficient optimal split procedure for the multiperiod vehicle routing problem with profit ⋮ A generic exact solver for vehicle routing and related problems ⋮ Mixed-integer programming approaches for the time-constrained maximal covering routing problem ⋮ The clustered team orienteering problem ⋮ Coupling feasibility pump and large neighborhood search to solve the Steiner team orienteering problem ⋮ The multi-visit team orienteering problem with precedence constraints

Cites Work

• Unnamed Item
• Heuristic solutions for the vehicle routing problem with time windows and synchronized visits
• The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: a branch-and-price approach
• The orienteering problem: a survey
• The selective travelling salesman problem
• A path relinking approach for the team orienteering problem
• The team orienteering problem
• 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
• The team orienteering problem with time windows: an LP-based granular variable neighborhood search
• An effective PSO-inspired algorithm for the team orienteering problem
• Subgraph extraction and metaheuristics for the maximum clique problem
• A guided local search metaheuristic for the team orienteering problem
• An exact algorithm for team orienteering problems
• The Team Orienteering Problem: Formulations and Branch-Cut and Price
• Solving the Orienteering Problem through Branch-and-Cut
• A Branch-and-Cut Algorithm for Solving the Team Orienteering Problem
• Depth-First Search and Linear Graph Algorithms

This page was built for publication: Solving the team orienteering problem with cutting planes