A matheuristic for the team orienteering arc routing problem

DOI10.1016/j.ejor.2015.03.022zbMath1346.90071OpenAlexW2012987812MaRDI QIDQ319589

Mohammad Hasan, M. Dambrine

Publication date: 6 October 2016

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

Full work available at URL: http://hdl.handle.net/10251/70783

zbMATH Keywords

matheuristicarc routing problemrouting problems with profitsteam orienteering problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (14)

A branch-and-cut algorithm for the profitable windy rural postman problem ⋮ Orienteering problem: a survey of recent variants, solution approaches and applications ⋮ A branch-and-cut algorithm for the orienteering arc routing problem ⋮ A hybrid adaptive large neighborhood search heuristic for the team orienteering problem ⋮ 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 new mathematical model and a heuristic algorithm for the tourist trip design problem under new constraints: a real-world application ⋮ Approximation algorithms for the arc orienteering problem ⋮ Efficient metaheuristics for the mixed team orienteering problem with time windows ⋮ Solving the team orienteering arc routing problem with a column generation approach ⋮ Coupling feasibility pump and large neighborhood search to solve the Steiner team orienteering problem ⋮ A survey on matheuristics for routing problems ⋮ Robust drone selective routing in humanitarian transportation network assessment ⋮ Profitable mixed capacitated arc routing and related problems

Cites Work

• Unnamed Item
• Unnamed Item
• Local search for the undirected capacitated arc routing problem with profits
• The orienteering problem: a survey
• The undirected capacitated arc routing problem with profits
• A survey on matheuristics for routing problems
• Vehicle Routing
• New facets and an enhanced branch-and-cut for the min-max K -vehicles windy rural postman problem
• The capacitated team orienteering and profitable tour problems
• Integer Programming Formulation of Traveling Salesman Problems
• Improvement Procedures for the Undirected Rural Postman Problem
• A Tabu Search Heuristic for the Capacitated arc Routing Problem
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem

This page was built for publication: A matheuristic for the team orienteering arc routing problem