Solving the multi-vehicle multi-covering tour problem

DOI10.1016/j.cor.2017.07.009zbMath1391.90664OpenAlexW2735988070MaRDI QIDQ1651551

Minh Hoàng Hà, Tuan Anh Pham, Xuan-Hoai Thi Nguyen

Publication date: 12 July 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2017.07.009

zbMATH Keywords

genetic algorithmvehicle routing problemmetaheuristicbranch-and-cutcovering tour problemmulti-covering

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Traffic problems in operations research (90B20)

Related Items (6)

The two‐echelon routing problem with truck and drones ⋮ A data-driven optimization framework for routing mobile medical facilities ⋮ The multi-vehicle probabilistic covering tour problem ⋮ Exact methods for mono-objective and bi-objective multi-vehicle covering tour problems ⋮ Spatial coverage in routing and path planning problems ⋮ A location-or-routing problem with partial and decaying coverage

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• An exact algorithm and a metaheuristic for the generalized vehicle routing problem with flexible fleet size
• On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\)
• The multi-vehicle cumulative covering tour problem
• An integer programming-based local search for the covering salesman problem
• Heuristics for the multi-vehicle covering tour problem
• A simple and effective evolutionary algorithm for the vehicle routing problem
• An exact algorithm and a metaheuristic for the multi-vehicle covering tour problem with a constraint on the number of vertices
• A unified solution framework for multi-attribute vehicle routing problems
• A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem
• The Generalized Covering Salesman Problem
• Vehicle Routing
• Tour splitting algorithms for vehicle routing problems
• A two-commodity flow formulation for the traveling salesman and the makespan problems with time windows
• The capacitated team orienteering and profitable tour problems
• Health Care Logistics, Emergency Preparedness, and Disaster Relief: New Challenges for Routing Problems with a Focus on the Austrian Situation
• The Covering Tour Problem
• A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
• A Heuristic Algorithm for the Vehicle-Dispatch Problem
• An integration of mixed VND and VNS: the case of the multivehicle covering tour problem
• An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation

This page was built for publication: Solving the multi-vehicle multi-covering tour problem