The orienteering problem with variable profits

DOI10.1002/NET.21496MaRDI QIDQ5326782zbMATH OpenOpenAlexFDO

Authors Güneş Erdogăn, G. Laporte

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

branch-and-cutinteger programminglinearizationorienteering problem

Mathematics Subject Classification ID

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

Recommendations

• An iterated local search algorithm for the team orienteering problem with variable profits
• A matheuristic approach to the orienteering problem with service time dependent profits
• The clustered orienteering problem
• The orienteering problem: a survey
• Variable neighborhood search for the set orienteering problem and its application to other orienteering problem variants

Cites work

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

Cited in

(33)

• Algorithms to solve the orienteering problem: A comparison
• A matheuristic approach to the orienteering problem with service time dependent profits
• Variable neighborhood search for the set orienteering problem and its application to other orienteering problem variants
• Prioritized single nurse routing and scheduling for home healthcare services
• Fairness in ambulance routing for post disaster management
• Time dependent orienteering problem with time windows and service time dependent profits
• Hybrid dynamic programming with bounding algorithm for the multi-profit orienteering problem
• Hybrid evolutionary search for the traveling repairman problem with profits
• Sustainable management of tourist flow networks: a mean field model
• Analysis of the selective traveling salesman problem with time-dependent profits
• A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem
• Orienteering problem: a survey of recent variants, solution approaches and applications
• Heuristics for the time dependent team orienteering problem: application to tourist route planning
• AN ALGORITHM FOR SINGLE CONSTRAINT MAXIMUM COLLECTION PROBLEM
• The Orienteering Problem with Time Windows
• On finding a cyclic tour and a vehicle loading plan yielding maximum profit
• A periodic traveling politician problem with time-dependent rewards
• Generalized orienteering problem with resource dependent rewards
• An iterated local search algorithm for the team orienteering problem with variable profits
• 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
• Solving the stochastic team orienteering problem: comparing simheuristics with the sample average approximation method
• The daily swab test collection problem
• Arrival and service time dependencies in the single- and multi-visit selective traveling salesman problem
• The team orienteering problem with service times and mandatory \& incompatible nodes
• A variant of multi-task \(n\)-vehicle exploration problem: maximizing every processor's average profit
• Cruise onboard itinerary planning for multi passengers with service venue capacity and time-window constraints
• A unifying framework for selective routing problems
• Branch-price-and-cut algorithms for the team orienteering problem with interval-varying profits
• Vehicle routing problem with drones and variable service times for agricultural virus monitoring
• Distributed or integrated stochastic ALNS? -- Two-stage stochastic team orienteering problem
• The multi-vehicle probabilistic covering tour problem

Describes a project that uses

Uses Software

• TSPLIB

This page was built for publication: The orienteering problem with variable profits

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