A matheuristic solution for efficient scheduling in dynamic truck–drone collaboration
- 24 December 2024
- journal article
- research article
- Published by Elsevier in Expert Systems with Applications
- Vol. 267
Abstract
No abstract availableKeywords
This publication has 45 references indexed in Scilit:
- Multiple traveling salesman problem with drones: Mathematical model and heuristic approachComputers & Industrial Engineering, 2019
- Dynamic programming approaches for the traveling salesman problem with droneNetworks, 2018
- The vehicle routing problem with drones: several worst-case resultsOptimization Letters, 2016
- Branch‐and‐price‐and‐cut for the manpower routing problem with synchronization constraintsNaval Research Logistics (NRL), 2016
- Heuristic solutions for the vehicle routing problem with time windows and synchronized visitsOptimization Letters, 2015
- A survey on matheuristics for routing problemsEURO Journal on Computational Optimization, 2014
- Branch‐and‐cut algorithms for the vehicle routing problem with trailers and transshipmentsNetworks, 2013
- Synchronized routing of active and passive means of transportOR Spectrum, 2012
- The manpower allocation problem with time windows and job-teaming constraints: A branch-and-price approachComputers & Operations Research, 2009
- Manpower allocation with time windows and job‐teaming constraintsNaval Research Logistics (NRL), 2005