The orienteering problem with variable profits

DOI10.1002/net.21496zbMath1269.90123OpenAlexW2118555996MaRDI QIDQ5326782

Gilbert Laporte, Güneş Erdoğan

Publication date: 6 August 2013

Published in: Networks (Search for Journal in Brave)

Full work available at URL: http://opus.bath.ac.uk/41196/1/opvp_golden_with_keywords.pdf

zbMATH Keywords

integer programminglinearizationbranch-and-cutorienteering problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Convex programming (90C25) Integer programming (90C10)

Related Items

A matheuristic approach to the orienteering problem with service time dependent profits, A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem, An iterated local search algorithm for the team orienteering problem with variable profits, Time dependent orienteering problem with time windows and service time dependent profits, Orienteering problem: a survey of recent variants, solution approaches and applications, Heuristics for the time dependent team orienteering problem: application to tourist route planning, Hybrid dynamic programming with bounding algorithm for the multi-profit orienteering problem, Team Orienteering with Time-Varying Profit, Rough approximation-based approach for designing a personalized tour route under a fuzzy environment, Making opportunity sales in attended home delivery, Sustainable management of tourist flow networks: a mean field model, Analysis of the selective traveling salesman problem with time-dependent profits, Hybrid evolutionary search for the traveling repairman problem with profits, Prioritized single nurse routing and scheduling for home healthcare services, The multi-vehicle probabilistic covering tour problem, Fairness in ambulance routing for post disaster management

Uses Software

• TSPLIB

Cites Work

• Unnamed Item
• The orienteering problem: a survey
• The selective travelling salesman problem
• An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits
• A path relinking approach for the team orienteering problem
• A fast and effective heuristic for the orienteering problem
• A TABU search heuristic for the team orienteering problem
• The concave cost supply problem.
• A guided local search metaheuristic for the team orienteering problem
• A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem
• The capacitated team orienteering and profitable tour problems
• The orienteering problem
• AN ALGORITHM FOR SINGLE CONSTRAINT MAXIMUM COLLECTION PROBLEM
• TSPLIB—A Traveling Salesman Problem Library
• The Covering Tour Problem