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

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

Yongliang Lu, Una Benlic, Qinghua Wu

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

heuristicsmemetic algorithmorienteering probleminfeasible local search

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)

Related Items (5)

Branch-and-check approaches for the tourist trip design problem with rich constraints ⋮ A flow based formulation and a reinforcement learning based strategic oscillation for cross-dock door assignment ⋮ Planning robust drone-truck delivery routes under road traffic uncertainty ⋮ Hybrid evolutionary search for the traveling repairman problem with profits ⋮ A memetic algorithm based on reformulation local search for minimum sum-of-squares clustering in networks

Uses Software

• CPLEX
• SPOT
• irace

Cites Work

• Unnamed Item
• Unnamed Item
• A hybrid metaheuristic approach for the capacitated arc routing problem
• Efficient meta-heuristics for the multi-objective time-dependent orienteering problem
• A memetic algorithm for the travelling salesperson problem with hotel selection
• The multi-district team orienteering problem
• Heuristics for the multi-period orienteering problem with multiple time windows
• The selective travelling salesman problem
• A hybrid variable neighborhood search for the orienteering problem with mandatory visits and exclusionary constraints
• Formulations for the orienteering problem with additional constraints
• A hybrid metaheuristic method for the maximum diversity problem
• Advanced Scatter Search for the Max-Cut Problem
• The orienteering problem
• AN ALGORITHM FOR SINGLE CONSTRAINT MAXIMUM COLLECTION PROBLEM
• Solving the Orienteering Problem through Branch-and-Cut
• A Tabu Search Heuristic for the Vehicle Routing Problem

This page was built for publication: A memetic algorithm for the orienteering problem with mandatory visits and exclusionary constraints