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

DOI10.1016/j.ejor.2018.08.007zbMath1403.90660OpenAlexW2886851374WikidataQ129379872 ScholiaQ129379872MaRDI QIDQ1622800

Kan Fang, Ning Zhu, Qinxiao Yu, 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

nonlinear programmingroutingorienteering problemmatheuristic algorithmservice time dependent profits

Mathematics Subject Classification ID

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

Related Items (7)

Time dependent orienteering problem with time windows and service time dependent profits ⋮ Team Orienteering with Time-Varying Profit ⋮ 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) ⋮ Home healthcare staff dimensioning problem for temporary caregivers: a matheuristic solution approach ⋮ Analysis of the selective traveling salesman problem with time-dependent profits ⋮ A matheuristic algorithm for stochastic home health care planning

Uses Software

• TSPLIB
• Ipopt

Cites Work

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

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