A matheuristic approach to the orienteering problem with service time dependent profits

DOI10.1016/J.EJOR.2018.08.007MaRDI QIDQ1622800zbMATH OpenOpenAlexWikidataFDO

Authors Qinxiao Yu, Kan Fang, Ning Zhu, Shoufeng Ma

Publication date 19 November 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.08.007

zbMATH Keywords

matheuristic algorithmnonlinear programmingorienteering problemroutingservice time dependent profits

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Nonlinear programming (90C30) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Time dependent orienteering problem with time windows and service time dependent profits
• The orienteering problem with variable profits
• An iterated local search algorithm for the team orienteering problem with variable profits
• The Orienteering Problem with Time Windows
• The orienteering problem with stochastic travel and service times

Cites work

• A fast solution method for the time-dependent orienteering problem
• A survey on matheuristics for routing problems
• A TABU search heuristic for the team orienteering problem
• A tabu search heuristic for the undirected selective travelling salesman problem
• A two-stage approach to the orienteering problem with stochastic weights
• Algorithms for a stochastic selective travelling salesperson problem
• An adaptive large neighborhood search heuristic for the pollution-routing problem
• An exact algorithm for team orienteering problems
• An ILS-based algorithm to solve a large-scale real heterogeneous fleet VRP with multi-trips and docking constraints
• An iterative three-component heuristic for the team orienteering problem with time windows
• Approximation algorithms for time-dependent orienteering.
• Computer Solutions of the Traveling Salesman Problem
• Discrete-variable extremum problems
• Efficient meta-heuristics for the multi-objective time-dependent orienteering problem
• Generalized orienteering problem with resource dependent rewards
• Handbook of metaheuristics
• Integer Programming Formulation of Traveling Salesman Problems
• Iterated local search for the team orienteering problem with time windows
• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
• Orienteering problem: a survey of recent variants, solution approaches and applications
• Routing and scheduling in a liquefied natural gas shipping problem with inventory and berth constraints
• The capacitated team orienteering and profitable tour problems
• The effective application of a new approach to the generalized orienteering problem
• The maximum collection problem with time-dependent rewards
• The orienteering problem
• The orienteering problem with stochastic travel and service times
• The orienteering problem with variable profits
• The orienteering problem: a survey
• The selective travelling salesman problem
• The team orienteering problem
• Using a genetic algorithm to solve the generalized orienteering problem

Cited in

(18)

• A matheuristic algorithm for stochastic home health care planning
• Time dependent orienteering problem with time windows and service time dependent profits
• Hybrid dynamic programming with bounding algorithm for the multi-profit orienteering problem
• A reinforcement learning approach to the orienteering problem with time windows
• A new accessibility based team orienteering approach for urban tourism routes optimization (a real life case)
• Analysis of the selective traveling salesman problem with time-dependent profits
• The Orienteering Problem with Time Windows
• Team Orienteering with Time-Varying Profit
• The orienteering problem with variable profits
• Home healthcare staff dimensioning problem for temporary caregivers: a matheuristic solution approach
• An effective hybrid evolutionary algorithm for the clustered orienteering problem
• Arrival and service time dependencies in the single- and multi-visit selective traveling salesman problem
• A matheuristic for the split delivery capacitated profitable tour problem with incomplete service
• The team orienteering problem with variable time windows
• The team orienteering problem with service times and mandatory \& incompatible nodes
• Branch-price-and-cut algorithms for the team orienteering problem with interval-varying profits
• An effective multi-level memetic search with neighborhood reduction for the clustered team orienteering problem
• The two-visit team orienteering problem considering time-interval-dependent profits and service consistency

Describes a project that uses

Uses Software

• TSPLIB
• Ipopt

This page was built for publication: A matheuristic approach to the orienteering problem with service time dependent profits

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