The multi-vehicle cumulative covering tour problem
DOI10.1007/S10479-015-2062-7zbMATH Open1381.90019OpenAlexW2269687184MaRDI QIDQ1686527FDOQ1686527
David A. Flores-Garza, M. Angélica Salazar-Aguilar, Sandra Ulrich Ngueveu, G. Laporte
Publication date: 15 December 2017
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-015-2062-7
Recommendations
- Solving the multi-vehicle multi-covering tour problem
- The multi-vehicle probabilistic covering tour problem
- A multi‐vehicle covering tour problem with speed optimization
- Heuristics for the multi-vehicle covering tour problem
- The multi-trip vehicle routing problem
- Exact methods for mono-objective and bi-objective multi-vehicle covering tour problems
- A variable neighborhood search for solving the multi-vehicle covering tour problem
- scientific article; zbMATH DE number 1149858
- An integration of mixed VND and VNS: the case of the multivehicle covering tour problem
minimum latency problemhumanitarian logisticscumulative vehicle routing problemmulti-vehicle covering tour problem
Linear programming (90C05) Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06)
Cites Work
- A unified solution framework for multi-attribute vehicle routing problems
- Relief distribution networks: a systematic review
- An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem
- Heuristics for the multi-vehicle covering tour problem
- Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints
- A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem
- The minimum latency problem
- The Covering Tour Problem
- Polynomial time approximation schemes for the traveling repairman and other minimum latency problems.
- OR/MS research in disaster operations management
- An annotated bibliography of GRASP-Part II: Applications
- A two-phase metaheuristic for the cumulative capacitated vehicle routing problem
- An effective memetic algorithm for the cumulative capacitated vehicle routing problem
- An exact algorithm and a metaheuristic for the multi-vehicle covering tour problem with a constraint on the number of vertices
- Title not available (Why is that?)
- Heuristic solution approaches for the cumulative capacitated vehicle routing problem
- Polynomial formulation and heuristic based approach for the \(k\)-travelling repairman problem
- A variable neighborhood search for solving the multi-vehicle covering tour problem
- The k -traveling repairmen problem
Cited In (8)
- An integration of mixed VND and VNS: the case of the multivehicle covering tour problem
- Online covering salesman problem
- The multi-vehicle probabilistic covering tour problem
- Solving the multi-vehicle multi-covering tour problem
- A flow-based model for the multivehicle covering tour problem with route balancing
- Iterative Column Generation Algorithm for Generalized Multi-Vehicle Covering Tour Problem
- Exact methods for mono-objective and bi-objective multi-vehicle covering tour problems
- Spatial coverage in routing and path planning problems
Uses Software
This page was built for publication: The multi-vehicle cumulative covering tour problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1686527)
