An exact algorithm and a metaheuristic for the multi-vehicle covering tour problem with a constraint on the number of vertices

DOI10.1016/J.EJOR.2012.11.012MaRDI QIDQ2253558zbMATH OpenOpenAlexFDO

Authors Minh Hoàng Hà, Nathalie Bostel, Louis-Martin Rousseau, André Langevin

Publication date 27 July 2014

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

Full work available at URL https://doi.org/10.1016/j.ejor.2012.11.012

zbMATH Keywords

branch-and-cutcovering tourmetaheuristictwo-commodity flow model

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Iterative column generation algorithm for generalized multi-vehicle covering tour problem
• Heuristics for the multi-vehicle covering tour problem
• Solving the multi-vehicle multi-covering tour problem
• The Covering Tour Problem
• A variable neighborhood search for solving the multi-vehicle covering tour problem

Cited in

(28)

• Column generation algorithms for bi-objective combinatorial optimization problems with a min-max objective
• Solving the multi-vehicle multi-covering tour problem
• The vehicle routing problem with service level constraints
• A multi-depot two-echelon vehicle routing problem with delivery options arising in the last mile distribution
• The multi-vehicle cumulative covering tour problem
• The capacitated mobile facility location problem
• Online covering salesman problem
• A simultaneous facility location and vehicle routing problem arising in health care logistics in the Netherlands
• Heuristics for the multi-vehicle covering tour problem
• Spatial coverage in routing and path planning problems
• A location-or-routing problem with partial and decaying coverage
• A branch-and-price algorithm for location-routing problems with pick-up stations in the last-mile distribution system
• A data-driven optimization framework for routing mobile medical facilities
• Exact methods for mono-objective and bi-objective multi-vehicle covering tour problems
• A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem
• A variable neighborhood search for solving the multi-vehicle covering tour problem
• Reduction rules for the covering tour problem
• A generalized model and a heuristic algorithm for the large-scale covering tour problem
• Iterative column generation algorithm for generalized multi-vehicle covering tour problem
• An integration of mixed VND and VNS: the case of the multivehicle covering tour problem
• A multi‐vehicle covering tour problem with speed optimization
• The two‐echelon routing problem with truck and drones
• A flow-based model for the multivehicle covering tour problem with route balancing
• Modeling a humanitarian-aid covering tour problem with location selection and vehicle assignment decisions
• Exact algorithms and heuristics for the capacitated covering salesman problem
• New cuts and a branch-cut-and-price model for the multi-vehicle covering tour problem
• The multi-vehicle probabilistic covering tour problem
• The bi-objective covering tour problem

Describes a project that uses

Uses Software

• TSPLIB
• CVRPSP

This page was built for publication: An exact algorithm and a metaheuristic for the multi-vehicle covering tour problem with a constraint on the number of vertices

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