An integration of mixed VND and VNS: the case of the multivehicle covering tour problem

DOI10.1111/itor.12355zbMath1366.90179OpenAlexW2538162005MaRDI QIDQ5278232

Manel Kammoun, Bassem Jarboui, Houda Derbel, Mostapha Ratli

Publication date: 13 July 2017

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

Full work available at URL: https://doi.org/10.1111/itor.12355

zbMATH Keywords

heuristic algorithmsvariable neighborhood searchcovering tour problem

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (7)

Solving the multi-vehicle multi-covering tour problem ⋮ The two‐echelon routing problem with truck and drones ⋮ VNS methods for home care routing and scheduling problem with temporal dependencies, and multiple structures and specialties ⋮ Solving the bi‐objective capacitated p‐median problem with multilevel capacities using compromise programming and VNS ⋮ A decision method on yard cranes transformation and deployment in green ports ⋮ Exact methods for mono-objective and bi-objective multi-vehicle covering tour problems ⋮ Spatial coverage in routing and path planning problems

Uses Software

• VRP

Cites Work

• Variable neighborhood search for location routing
• The bi-objective covering tour problem
• An effective VNS for the capacitated \(p\)-median problem
• Variable neighbourhood search: methods and applications
• Variable neighbourhood search: Methods and applications
• The vehicle routing problem: An overview of exact and approximate algorithms
• The median tour and maximal covering tour problems: Formulations and heuristics
• Variable neighborhood search
• The bi-objective stochastic covering tour problem
• Heuristics for the multi-vehicle covering tour problem
• An exact algorithm and a metaheuristic for the multi-vehicle covering tour problem with a constraint on the number of vertices
• Dynamic vehicle routing using an improved variable neighborhood search algorithm
• Health Care Logistics, Emergency Preparedness, and Disaster Relief: New Challenges for Routing Problems with a Focus on the Austrian Situation
• The Covering Tour Problem
• The Covering Salesman Problem
• A Heuristic Algorithm for the Vehicle-Dispatch Problem
• Variable neighborhood search: Principles and applications

This page was built for publication: An integration of mixed VND and VNS: the case of the multivehicle covering tour problem