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

DOI10.1016/J.COR.2015.08.003MaRDI QIDQ342166zbMATH OpenOpenAlexFDO

Authors C. Archetti, Ángel Corberán, Isaac Plana, José M. Sanchis, Maria Grazia Speranza

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-cutorienteering arc routing problemrouting problems with profits

Mathematics Subject Classification ID

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

Recommendations

• Solving the team orienteering arc routing problem with a column generation approach
• Solving the Orienteering Problem through Branch-and-Cut
• A matheuristic for the team orienteering arc routing problem
• A Branch-and-Cut Algorithm for Solving the Team Orienteering Problem
• A branch-and-cut algorithm for the team orienteering problem

Cites work

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

Cited in

(20)

• An efficient evolutionary algorithm for the orienteering problem
• The periodic rural postman problem with irregular services on mixed graphs
• 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
• Integer programming formulation and polyhedral results for windy collaborative arc routing problem
• Boosting ant colony optimization via solution prediction and machine learning
• A hybrid adaptive large neighborhood search heuristic for the team orienteering problem
• A matheuristic for the team orienteering arc routing problem
• Orienteering problem: a survey of recent variants, solution approaches and applications
• Solving the Orienteering Problem through Branch-and-Cut
• Approximation algorithms for the arc orienteering problem
• A Branch-and-Cut Algorithm for Solving the Team Orienteering Problem
• On path-bridge inequalities for the orienteering arc routing problems
• 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
• An updated annotated bibliography on arc routing problems
• The hiking tourist problem
• A branch-and-cut algorithm for the windy profitable location rural postman problem

Describes a project that uses

Uses Software

• VRP

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

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