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

DOI10.1111/ITOR.12355zbMATH Open1366.90179OpenAlexW2538162005MaRDI QIDQ5278232FDOQ5278232

Authors: Manel Kammoun, Houda Derbel, Mostapha Ratli, Bassem Jarboui 

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

Recommendations

• A variable neighborhood search for solving the multi-vehicle covering tour problem
• The multi-vehicle cumulative covering tour problem
• Solving the multi-vehicle multi-covering tour problem
• The multi-vehicle probabilistic covering tour problem
• A multi‐vehicle covering tour problem with speed optimization
• Exact methods for mono-objective and bi-objective multi-vehicle covering tour problems
• 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
• An integration of Lagrangian split and VNS: the case of the capacitated vehicle routing problem

zbMATH Keywords

variable neighborhood searchheuristic algorithmscovering tour problem

Mathematics Subject Classification ID

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

Cites Work

• Variable neighbourhood search: Methods and applications
• The vehicle routing problem: An overview of exact and approximate algorithms
• Variable neighborhood search
• Variable neighborhood search: Principles and applications
• Variable neighbourhood search: methods and applications
• The median tour and maximal covering tour problems: Formulations and heuristics
• The bi-objective stochastic covering tour problem
• Heuristics for the multi-vehicle covering tour problem
• Variable neighborhood search for location routing
• The Covering Tour Problem
• The Covering Salesman Problem
• A Heuristic Algorithm for the Vehicle-Dispatch Problem
• Health care logistics, emergency preparedness, and disaster relief: new challenges for routing problems with a focus on the austrian situation
• The bi-objective covering tour problem
• An effective VNS for the capacitated \(p\)-median 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

Cited In (15)

• A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem
• Reactive GRASP for the prize-collecting covering tour problem
• The multi-vehicle probabilistic covering tour problem
• Iterative column generation algorithm for generalized multi-vehicle covering tour problem
• The two‐echelon routing problem with truck and drones
• Solving the bi‐objective capacitated p‐median problem with multilevel capacities using compromise programming and VNS
• VNS methods for home care routing and scheduling problem with temporal dependencies, and multiple structures and specialties
• Solving the multi-vehicle multi-covering tour problem
• The multi-vehicle cumulative covering tour problem
• Title not available (Why is that?)
• A decision method on yard cranes transformation and deployment in green ports
• A flow-based model for the multivehicle covering tour problem with route balancing
• Exact methods for mono-objective and bi-objective multi-vehicle covering tour problems
• Spatial coverage in routing and path planning problems
• A variable neighborhood search algorithm for the multimode set covering problem

Uses Software

• VRP

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

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