Analysis of the selective traveling salesman problem with time-dependent profits

DOI10.1007/s11750-022-00632-6OpenAlexW4224271542MaRDI QIDQ2701177

David Canca, Gilbert Laporte, Leandro C. Coelho, Eva Barrena

Publication date: 27 April 2023

Published in: Top (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11750-022-00632-6

zbMATH Keywords

multiple visitsselective traveling salesman problemtime-dependent profits

Mathematics Subject Classification ID

Integer programming (90C10) Linear programming (90C05) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)

Uses Software

• VRP

Cites Work

• Orienteering problem: a survey of recent variants, solution approaches and applications
• The orienteering problem: a survey
• General solutions to the single vehicle routing problem with pickups and deliveries
• The selective travelling salesman problem
• Lasso solution strategies for the vehicle routing problem with pickups and deliveries
• A matheuristic approach to the orienteering problem with service time dependent profits
• Vehicle Routing
• Using a Genetic Algorithm to Solve the Generalized Orienteering Problem
• The orienteering problem
• Non-Elementary Formulations for Single Vehicle Routing Problems with Pickups and Deliveries
• Team Orienteering with Time-Varying Profit
• The orienteering problem with variable profits
• The maximum collection problem with time-dependent rewards
• Clustered coverage orienteering problem of unmanned surface vehicles for water sampling
• The parking warden tour problem