Exact methods for mono-objective and bi-objective multi-vehicle covering tour problems

DOI10.1016/j.ejor.2019.11.045zbMath1441.90031OpenAlexW2991095351WikidataQ126663667 ScholiaQ126663667MaRDI QIDQ2294623

Nicolas Jozefowiez, Estèle Glize, Roberto Roberti, Sandra Ulrich Ngueveu

Publication date: 11 February 2020

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://research.vu.nl/en/publications/0061f9a9-aa5a-417b-a247-7f5e9d499cf0

zbMATH Keywords

column generationcombinatorial optimizationvehicle routing problemsbi-objective optimizationmulti-vehicle covering 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 (2)

A multi‐vehicle covering tour problem with speed optimization ⋮ Spatial coverage in routing and path planning problems

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• The bi-objective covering tour problem
• An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
• Combined route capacity and route length models for unit demand vehicle routing problems
• Stabilized column generation
• The median tour and maximal covering tour problems: Formulations and heuristics
• Column generation algorithms for bi-objective combinatorial optimization problems with a min-max objective
• Solving the multi-vehicle multi-covering tour problem
• The multi-vehicle cumulative covering tour problem
• 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
• New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
• A Bi-objective Metaheuristic for Disaster Relief Operation Planning
• An Integer Linear Programming Local Search for Capacitated Vehicle Routing Problems
• Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW
• The Covering Tour Problem
• Iterative Column Generation Algorithm for Generalized Multi-Vehicle Covering Tour Problem
• The Covering Salesman Problem
• A Heuristic Algorithm for the Vehicle-Dispatch Problem
• An integration of mixed VND and VNS: the case of the multivehicle covering tour problem
• Column Generation for Bi-Objective Vehicle Routing Problems with a Min-Max Objective
• On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization

This page was built for publication: Exact methods for mono-objective and bi-objective multi-vehicle covering tour problems