A logic-based Benders decomposition method for the multi-trip traveling repairman problem with drones
From MaRDI portal
Publication:2147137
DOI10.1016/j.cor.2022.105845OpenAlexW4225003238MaRDI QIDQ2147137
Sara Khodaparasti, Mohammad Moshref-Javadi, Maria Elena Bruni
Publication date: 22 June 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2022.105845
latencylogic-based Benders decompositiontraveling repairman problemmulti-trip truck and drone routing problem
Related Items (1)
Cites Work
- Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem
- A convex envelope formula for multilinear functions
- The Benders decomposition algorithm: a literature review
- A simple and effective metaheuristic for the minimum latency problem
- A truck and drones model for last-mile delivery: a mathematical model and heuristic approach
- Solving the traveling repairman problem with profits: a novel variable neighborhood search approach
- An exact solution method for the TSP with drone based on decomposition
- A hybrid reactive GRASP heuristic for the risk-averse \(k\)-traveling repairman problem with profits
- The risk-averse traveling repairman problem with profits
- A study on the traveling salesman problem with a drone
- Combining traveling salesman and traveling repairman problems: a multi-objective approach based on multiple scenarios
- Generalized Benders decomposition
- Approximation algorithms for the a priori traveling repairman
- The minimum latency problem
- Planning and Scheduling by Logic-Based Benders Decomposition
- The complexity of the travelling repairman problem
- Special cases of traveling salesman and repairman problems with time windows
- A variable neighborhood search for flying sidekick traveling salesman problem
This page was built for publication: A logic-based Benders decomposition method for the multi-trip traveling repairman problem with drones
