Team Orienteering with Time-Varying Profit

DOI10.1287/IJOC.2020.1026MaRDI QIDQ5084650zbMATH OpenOpenAlexFDO

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

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

Benders branch-and-cuthybrid heuristicmixed integer nonconvex programmingrouting and schedulingteam orienteering

Mathematics Subject Classification ID

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

Recommendations

• Robust Team Orienteering Problem with Decreasing Profits
• The team orienteering problem
• The orienteering problem with variable profits
• The capacitated team orienteering and profitable tour problems
• An iterated local search algorithm for the team orienteering problem with variable profits
• On a model and optimization algorithms for a dynamic team orienteering problem
• The multi-district team orienteering problem
• Time dependent orienteering problem with time windows and service time dependent profits
• An exact algorithm for team orienteering problems

Cites work

• A class of globally convergent optimization methods based on conservative convex separable approximations
• A convex optimization approach for solving the single-vehicle cyclic inventory routing problem
• A matheuristic approach to the orienteering problem with service time dependent profits
• A two-phase algorithm for the cyclic inventory routing problem
• Algorithm 733: TOMP–Fortran modules for optimal control calculations
• Algorithm 909: NOMAD: nonlinear optimization with the MADS algorithm
• An exact branch-and-price algorithm for scheduling rescue units during disaster response
• An iterated local search algorithm for the team orienteering problem with variable profits
• Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
• DC programming: overview.
• Derivative-free and blackbox optimization
• Emergency response in natural disaster management: allocation and scheduling of rescue units
• Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems
• Generalized orienteering problem with resource dependent rewards
• Glider routing and trajectory optimisation in disaster assessment
• scientific article; zbMATH DE number 653035 (Why is no real title available?)
• scientific article; zbMATH DE number 2084694 (Why is no real title available?)
• 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
• Production scheduling and vehicle routing with time windows for perishable food products
• SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
• Solving the Orienteering Problem through Branch-and-Cut
• The Benders decomposition algorithm: a literature review
• The demand weighted vehicle routing problem
• The integer \(L\)-shaped method for stochastic integer programs with complete recourse
• The maximum collection problem with time-dependent rewards
• The orienteering problem
• The orienteering problem with variable profits
• The orienteering problem: a survey
• The team orienteering problem
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

Cited in

(9)

• An exact branch-and-price algorithm for scheduling rescue units during disaster response
• Analysis of the selective traveling salesman problem with time-dependent profits
• Robust Team Orienteering Problem with Decreasing Profits
• 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
• Branch-price-and-cut algorithms for the team orienteering problem with interval-varying profits
• The two-visit team orienteering problem considering time-interval-dependent profits and service consistency
• The orienteering problem with heterogeneous drones
• A novel robust decomposition algorithm for a profit-oriented production routing problem with backordering, uncertain prices, and service level constraints

Describes a project that uses

Uses Software

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

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

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