The multi-vehicle cumulative covering tour problem

DOI10.1007/S10479-015-2062-7MaRDI QIDQ1686527zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

minimum latency problemhumanitarian logisticscumulative vehicle routing problemmulti-vehicle covering tour problem

Mathematics Subject Classification ID

Linear programming (90C05) Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06)

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

Cites work

• scientific article; zbMATH DE number 6297719 (Why is no real title available?)
• A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem
• A two-phase metaheuristic for the cumulative capacitated vehicle routing problem
• A unified solution framework for multi-attribute vehicle routing problems
• A variable neighborhood search for solving the multi-vehicle covering tour problem
• An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem
• An annotated bibliography of GRASP-Part II: Applications
• 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
• Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints
• Heuristic solution approaches for the cumulative capacitated vehicle routing problem
• Heuristics for the multi-vehicle covering tour problem
• OR/MS research in disaster operations management
• Polynomial formulation and heuristic based approach for the \(k\)-travelling repairman problem
• Polynomial time approximation schemes for the traveling repairman and other minimum latency problems.
• Relief distribution networks: a systematic review
• The Covering Tour Problem
• The \(k\)-traveling repairmen problem
• The minimum latency problem

Cited in

(12)

• Exact methods for mono-objective and bi-objective multi-vehicle covering tour problems
• A cumulative unmanned aerial vehicle routing problem approach for humanitarian coverage path planning
• A flow-based model for the multivehicle covering tour problem with route balancing
• Spatial coverage in routing and path planning problems
• A cumulative multi-depot vehicle routing problem in emergency logistics
• Solving the multi-vehicle multi-covering tour problem
• The bi-objective stochastic covering tour problem
• The multi-vehicle probabilistic covering tour problem
• An integration of mixed VND and VNS: the case of the multivehicle covering tour problem
• Online covering salesman problem
• Mathematical formulations and exact algorithm for the multitrip cumulative capacitated single-vehicle routing problem
• Iterative column generation algorithm for generalized multi-vehicle covering tour problem

Describes a project that uses

Uses Software

• GRASP

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)