The Team Orienteering Pick-Up and Delivery Problem with Time Windows and its applications in fleet sizing
From MaRDI portal
Publication:2826662
DOI10.1051/ro/2015030zbMath1352.90014OpenAlexW2403886178MaRDI QIDQ2826662
D. G. Baklagis, G. Dikas, Ioannis Minis
Publication date: 18 October 2016
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1051/ro/2015030
Related Items (2)
Solving a selective dial-a-ride problem with logic-based Benders decomposition ⋮ A branch-and-price approach to the feeder network design problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The orienteering problem: a survey
- A tutorial on column generation and branch-and-price for vehicle routing problems
- The pickup and delivery problem with time windows
- The team orienteering problem
- An exact algorithm for team orienteering problems
- An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- The Vehicle Routing Problem
- The capacitated team orienteering and profitable tour problems
- New dynamic programming algorithms for the resource constrained elementary shortest path problem
- The orienteering problem
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
- Column Generation
- Selected Topics in Column Generation
- Shortest Path Problems with Resource Constraints
This page was built for publication: The Team Orienteering Pick-Up and Delivery Problem with Time Windows and its applications in fleet sizing
