The split delivery capacitated team orienteering problem

DOI10.1002/net.21519zbMath1338.90041OpenAlexW1965979685MaRDI QIDQ2811321

Alain Hertz, Nicola Bianchessi, Claudia Archetti, Maria Grazia Speranza

Publication date: 10 June 2016

Published in: Networks (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2434/609829

zbMATH Keywords

heuristicworst-case analysisbranch-and-pricesplit deliveriescapacitated team orienteering problem

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)

Related Items

An iterated local search algorithm for the team orienteering problem with variable profits, Orienteering problem: a survey of recent variants, solution approaches and applications, Solving the orienteering problem with time windows via the pulse framework, The capacitated team orienteering problem with incomplete service, A worst-case analysis for the split delivery capacitated team orienteering problem with minimum delivery amounts, The capacitated orienteering problem, The vehicle routing problem with profits and consistency constraints, Directed weighted improper coloring for cellular channel allocation, A survey on matheuristics for routing problems, An effective PSO-inspired algorithm for the team orienteering problem

Cites Work

• Unnamed Item
• The orienteering problem: a survey
• The team orienteering problem
• A heuristic for the multiple tour maximum collection problem
• A TABU search heuristic for the team orienteering problem
• Optimal solutions for routing problems with profits
• Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
• An exact algorithm for team orienteering problems
• Column Generation based Primal Heuristics
• Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows
• The capacitated team orienteering and profitable tour problems
• Savings by Split Delivery Routing
• A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
• A Lower Bound for the Split Delivery Vehicle Routing Problem
• Computer Solutions of the Traveling Salesman Problem
• A column generation approach for the split delivery vehicle routing problem
• A column generation approach for the split delivery vehicle routing problem