Daily aircraft routing for amphibious ready groups
From MaRDI portal
Publication:1639311
DOI10.1007/s10479-017-2740-8zbMath1390.90087OpenAlexW2779294482MaRDI QIDQ1639311
Travis Hartman, Robert F. Dell, Ertan Yakıcı, Connor McLemore
Publication date: 12 June 2018
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-017-2740-8
Integer programming (90C10) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (1)
Cites Work
- A comparison of column-generation approaches to the synchronized pickup and delivery problem
- Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks
- Planning helicopter logistics in disaster relief
- Combined vehicle routing and scheduling with temporal precedence and synchronization constraints
- Hybridization of very large neighborhood search for ready-mixed concrete delivery problems
- The pickup and delivery problem with time windows
- The dial-a-ride problem (DARP): variants, modeling issues and algorithms
- An interactive approach for hierarchical analysis of helicopter logistics in disaster relief operations
- An adaptive large neighborhood search for the full truckload pickup and delivery problem with resource synchronization
- A hybrid genetic algorithm for the heterogeneous dial-a-ride problem
- Multi-trip pickup and delivery problem with time windows and synchronization
- Models and algorithms for reliability-oriented dial-a-ride with autonomous electric vehicles
- Fleet assignment and routing with schedule synchronization constraints
- A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives
- Periodic airline fleet assignment with time windows, spacing constraints, and time dependent revenues
- The dial-a-ride problem: Models and algorithms
- A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows
- The Truck Dispatching Problem
- Drive: Dynamic Routing of Independent Vehicles
- Branch-and-cut algorithms for the vehicle routing problem with trailers and transshipments
- A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
- A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows
- The Arc Routing and Scheduling Problem with Transshipment
- Manpower allocation with time windows and job-teaming constraints
- Manpower allocation with time windows
- Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
- A variable neighborhood descent algorithm for a real waste collection problem with mobile depots
- Dynamic programming based metaheuristics for the dial-a-ride problem
- Unnamed Item
- Unnamed Item
This page was built for publication: Daily aircraft routing for amphibious ready groups
