A memetic algorithm for the orienteering problem with mandatory visits and exclusionary constraints

DOI10.1016/j.ejor.2018.01.019zbMath1403.90144MaRDI QIDQ1754303

Qinghua Wu, Una Benlic, Yongliang Lu

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.2018.01.019

zbMATH Keywords

heuristics; memetic algorithm; orienteering problem; infeasible local search

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90B06: Transportation, logistics and supply chain management

90C59: Approximation methods and heuristics in mathematical programming

Uses Software

• CPLEX
• SPOT
• irace