Iterative column generation algorithm for generalized multi-vehicle covering tour problem

DOI10.1142/S0217595918500215MaRDI QIDQ4689379zbMATH OpenOpenAlexWikidataFDO

Authors Keisuke Murakami

Publication date 16 October 2018

Published in Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0217595918500215

zbMATH Keywords

column generationcovering tour problemheuristic algorithmset-covering problemtraveling salesman problem

Mathematics Subject Classification ID

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

Recommendations

• An exact algorithm and a metaheuristic for the multi-vehicle covering tour problem with a constraint on the number of vertices
• Heuristics for the multi-vehicle covering tour problem
• Solving the multi-vehicle multi-covering tour problem
• An integration of mixed VND and VNS: the case of the multivehicle covering tour problem
• Reduction rules for the covering tour problem

Cites work

• A branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routes
• A branch-and-price algorithm for the multi-depot heterogeneous-fleet pickup and delivery problem with soft time windows
• A column generation approach for a school bus routing problem with resource constraints
• A column generation approach for the split delivery vehicle routing problem
• A column generation approach to extend lifetime in wireless sensor networks with coverage and connectivity constraints
• A generalized model and a heuristic algorithm for the large-scale covering tour problem
• A Greedy Heuristic for the Set-Covering Problem
• A hybrid algorithm for the heterogeneous fleet vehicle routing problem
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• An exact algorithm and a metaheuristic for the multi-vehicle covering tour problem with a constraint on the number of vertices
• An integer programming-based local search for the covering salesman problem
• Heuristics for the multi-vehicle covering tour problem
• New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
• Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
• The Covering Salesman Problem
• The Covering Tour Problem
• The generalized covering salesman problem
• The multi-vehicle cumulative covering tour problem

Cited in

(10)

• Solving the multi-vehicle multi-covering tour problem
• Iterated local search and column generation to solve arc-routing as a permutation set-covering 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
• Exact methods for mono-objective and bi-objective multi-vehicle covering tour problems
• Reduction rules for the covering tour problem
• A multi‐vehicle covering tour problem with speed optimization
• Modeling a humanitarian-aid covering tour problem with location selection and vehicle assignment decisions
• The multi-vehicle probabilistic covering tour problem
• The bi-objective covering tour problem

Describes a project that uses

Uses Software

• CPLEX

This page was built for publication: Iterative column generation algorithm for generalized multi-vehicle covering tour problem

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