A flow-based model for the multivehicle covering tour problem with route balancing

DOI10.1111/ITOR.13399MaRDI QIDQ6495377zbMATH OpenFDO

Authors Cristina Teruko Ota, Diego Jacinto Fiorotto, Carla Taviane Lucke da Silva Ghidini, Washington Alves de Oliveira

Publication date 30 April 2024

Published in International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1111/ITOR.13399

zbMATH Keywords

biased random-key genetic algorithmbranch-and-cutcovering tour problemvehicle routing

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites work

• A branch-and-cut algorithm for the team orienteering problem
• A lexicographic minimax approach to the vehicle routing problem with route balancing
• An exact algorithm and a metaheuristic for the multi-vehicle covering tour problem with a constraint on the number of vertices
• An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation
• An integration of mixed VND and VNS: the case of the multivehicle covering tour problem
• Balanced vehicle routing: polyhedral analysis and branch-and-cut algorithm
• Exact methods for mono-objective and bi-objective multi-vehicle covering tour problems
• Formulations and Benders decomposition algorithms for multidepot salesmen problems with load balancing
• Genetic Algorithms and Random Keys for Sequencing and Optimization
• Health care logistics, emergency preparedness, and disaster relief: new challenges for routing problems with a focus on the austrian situation
• Heuristics for the multi-vehicle covering tour problem
• scientific article; zbMATH DE number 2209648 (Why is no real title available?)
• On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\)
• Optimal Routing under Capacity and Distance Restrictions
• Safe and secure vehicle routing: a survey on minimization of risk exposure
• Solving the multi-vehicle multi-covering tour problem
• The bi-objective covering tour problem
• The bi-objective stochastic covering tour problem
• The collaborative consistent vehicle routing problem with workload balance
• The Covering Salesman Problem
• The Covering Tour Problem
• The median tour and maximal covering tour problems: Formulations and heuristics
• The multi-vehicle cumulative covering tour problem
• The multi-vehicle probabilistic covering tour problem
• Using \(\ell^p\)-norms for fairness in combinatorial optimisation
• Vehicle Routing
• Workload equity in vehicle routing: the impact of alternative workload resources

Cited in

(3)

• Modeling a humanitarian-aid covering tour problem with location selection and vehicle assignment decisions
• Conflict-free tow train routing in just-in-time assembly lines
• The covering tour problem with path upgrades

This page was built for publication: A flow-based model for the multivehicle covering tour problem with route balancing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6495377)