A branch-and-cut algorithm for the orienteering arc routing problem

DOI10.1016/j.cor.2015.08.003zbMath1349.90155OpenAlexW1429305557MaRDI QIDQ342166

Mohammad Hasan, M. Dambrine

Publication date: 17 November 2016

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

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

zbMATH Keywords

branch-and-cutrouting problems with profitsorienteering arc routing problem

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)

Related Items (13)

Integer programming formulation and polyhedral results for windy collaborative arc routing problem ⋮ Boosting ant colony optimization via solution prediction and machine learning ⋮ Orienteering problem: a survey of recent variants, solution approaches and applications ⋮ An efficient evolutionary algorithm for the orienteering problem ⋮ A hybrid adaptive large neighborhood search heuristic for the team orienteering problem ⋮ Constraint relaxation for the discrete ordered median problem ⋮ Arc routing problems: A review of the past, present, and future ⋮ A revisited branch-and-cut algorithm for large-scale orienteering problems ⋮ The periodic rural postman problem with irregular services on mixed graphs ⋮ On path-bridge inequalities for the orienteering arc routing problems ⋮ 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 ⋮ Robust drone selective routing in humanitarian transportation network assessment

Uses Software

• VRP

Cites Work

• A matheuristic for the team orienteering arc routing problem
• New inequalities for the general routing problem
• A polyhedral approach to the rural postman problem
• A survey on matheuristics for routing problems
• The stacker crane problem and the directed general routing problem

This page was built for publication: A branch-and-cut algorithm for the orienteering arc routing problem