Team Orienteering with Time-Varying Profit

DOI10.1287/ijoc.2020.1026zbMath1492.90023OpenAlexW3133492686MaRDI QIDQ5084650

Ning Zhu, Shoufeng Ma, Yossiri Adulyasak, Louis-Martin Rousseau, Qinxiao Yu

Publication date: 28 June 2022

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.2020.1026

zbMATH Keywords

team orienteeringhybrid heuristicrouting and schedulingmixed integer nonconvex programmingBenders branch-and-cut

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (2)

Robust Team Orienteering Problem with Decreasing Profits ⋮ Analysis of the selective traveling salesman problem with time-dependent profits

Uses Software

• TOMP
• SCIP
• NOMAD
• Ipopt
• NLopt
• GitHub

Cites Work

• Unnamed Item
• Unnamed Item
• A two-phase algorithm for the cyclic inventory routing problem
• Orienteering problem: a survey of recent variants, solution approaches and applications
• A convex optimization approach for solving the single-vehicle cyclic inventory routing problem
• The orienteering problem: a survey
• The integer \(L\)-shaped method for stochastic integer programs with complete recourse
• Production scheduling and vehicle routing with time windows for perishable food products
• The team orienteering problem
• A matheuristic approach to the orienteering problem with service time dependent profits
• The Benders decomposition algorithm: a literature review
• The demand weighted vehicle routing problem
• Glider routing and trajectory optimisation in disaster assessment
• DC programming: overview.
• An exact branch-and-price algorithm for scheduling rescue units during disaster response
• Emergency response in natural disaster management: allocation and scheduling of rescue units
• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
• A Class of Globally Convergent Optimization Methods Based on Conservative Convex Separable Approximations
• Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems
• Algorithm 909
• Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
• The orienteering problem
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Algorithm 733: TOMP–Fortran modules for optimal control calculations
• Solving the Orienteering Problem through Branch-and-Cut
• Derivative-Free and Blackbox Optimization
• Generalized orienteering problem with resource dependent rewards
• SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
• An iterated local search algorithm for the team orienteering problem with variable profits
• The orienteering problem with variable profits
• The maximum collection problem with time-dependent rewards

This page was built for publication: Team Orienteering with Time-Varying Profit