Daily aircraft routing for amphibious ready groups
type: Item
instance of: scholarly article
title: Daily aircraft routing for amphibious ready groups
zbMATH Open document ID: 1390.90087
author: Ertan Yakıcı
author: Robert Dell
author: Travis Hartman
author: Connor McLemore
published in: Annals of Operations Research
publication date: 2018-06-12T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6886507
zbMATH Keywords: vehicle routing
zbMATH Keywords: integer linear programming
zbMATH Keywords: ant colony optimization
zbMATH Keywords: local search
zbMATH Keywords: military
MaRDI profile type: Publication
full work available at URL: s10479-017-2740-8
OpenAlex ID: W2779294482
cites work: An interactive approach for hierarchical analysis of helicopter logistics in disaster relief operations
cites work: Periodic airline fleet assignment with time windows, spacing constraints, and time dependent revenues
cites work: A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows
cites work: Combined vehicle routing and scheduling with temporal precedence and synchronization constraints
cites work: Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks
cites work: A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
cites work: The dial-a-ride problem (DARP): variants, modeling issues and algorithms
cites work: The dial-a-ride problem: Models and algorithms
cites work: The truck dispatching problem
cites work: The Arc Routing and Scheduling Problem with Transshipment
cites work: A variable neighborhood descent algorithm for a real waste collection problem with mobile depots
cites work: Q4532231
cites work: A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows
cites work: An adaptive large neighborhood search for the full truckload pickup and delivery problem with resource synchronization
cites work: Branch-and-cut algorithms for the vehicle routing problem with trailers and transshipments
cites work: The pickup and delivery problem with time windows
cites work: A comparison of column-generation approaches to the synchronized pickup and delivery problem
cites work: Fleet assignment and routing with schedule synchronization constraints
cites work: Manpower allocation with time windows and job-teaming constraints
cites work: Manpower allocation with time windows
cites work: A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives
cites work: A hybrid genetic algorithm for the heterogeneous dial-a-ride problem
cites work: Multi-trip pickup and delivery problem with time windows and synchronization
cites work: Planning helicopter logistics in disaster relief
cites work: Models and algorithms for reliability-oriented dial-a-ride with autonomous electric vehicles
cites work: Dynamic programming based metaheuristics for the dial-a-ride problem
cites work: Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
cites work: DRIVE: Dynamic routing of independent vehicles
cites work: Hybridization of very large neighborhood search for ready-mixed concrete delivery problems
cites work: Q4350083
DOI: 10.1007/S10479-017-2740-8
description: scientific article; zbMATH DE number 6886507