Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints

DOI10.1016/j.ejor.2013.09.014zbMath1305.90408MaRDI QIDQ2256169

Andrew E. B. Lim, Hu Qin, Zhi-Xing Luo

Publication date: 19 February 2015

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

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

zbMATH Keywords

branch-and-price; branch-and-price-and-cut; distance constraint; traveling repairmen problem

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90C11: Mixed integer programming

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90C27: Combinatorial optimization

Related Items

A Branch-and-Price-and-Cut Algorithm for the Cable-Routing Problem in Solar Power Plants, Multirobot search for a stationary object placed in a known environment with a combination of GRASP and VND, Minimizing total weighted latency in home healthcare routing and scheduling with patient prioritization, Two exact algorithms for the traveling umpire problem, Solving the traveling repairman problem on a line with general processing times and deadlines, The multi-vehicle cumulative covering tour problem, Minimizing latency in post-disaster road clearance operations, Minimizing customers' waiting time in a vehicle routing problem with unit demands, Optimisation of maintenance routing and scheduling for offshore wind farms, Vehicle routing with endogenous learning: application to offshore plug and abandonment campaign planning, Weighted network search games with multiple hidden objects and multiple search teams, The multi-depot \(k\)-traveling repairman problem, Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network, Hybrid evolutionary search for the traveling repairman problem with profits, Weighted online minimum latency problem with edge uncertainty, An adaptive large neighborhood search approach for multiple traveling repairman problem with profits, An online optimization approach for post-disaster relief distribution with online blocked edges, Routing multiple work teams to minimize latency in post-disaster road network restoration

Uses Software

• TSPLIB

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A branch-price-and-cut algorithm for the workover rig routing problem
• Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem
• The delivery man problem on a tree network
• An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
• An effective memetic algorithm for the cumulative capacitated vehicle routing problem
• A branch-and-price algorithm for the vehicle routing problem with deliveries, selective pickups and time windows
• A new formulation for the traveling deliveryman problem
• The school bus routing problem: a review
• An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles
• An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem
• A comparison of three metaheuristics for the workover rig routing problem
• The single vehicle routing problem with toll-by-weight scheme: a branch-and-bound approach
• Branch and price for the vehicle routing problem with discrete Split deliveries and time windows
• Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
• Scheduling workover rigs for onshore oil production
• Robust branch-and-cut-and-price for the capacitated vehicle routing problem
• A \(2+\varepsilon\) approximation algorithm for the \(k\)-MST problem
• Accelerated label setting algorithms for the elementary resource constrained shortest path problem
• The Vehicle Routing Problem
• 2-Path Cuts for the Vehicle Routing Problem with Time Windows
• The minimum latency problem
• An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem
• A SCATTER SEARCH FOR MULTI-DEPOT VEHICLE ROUTING PROBLEM WITH WEIGHT-RELATED COST
• A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem
• Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows
• Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
• New dynamic programming algorithms for the resource constrained elementary shortest path problem
• A Faster, Better Approximation Algorithm for the Minimum Latency Problem
• Optimal Routing under Capacity and Distance Restrictions
• The complexity of the travelling repairman problem
• State-space relaxation procedures for the computation of bounds to routing problems
• A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
• TSPLIB—A Traveling Salesman Problem Library
• On the Distance Constrained Vehicle Routing Problem
• The Delivery Man Problem and Cumulative Matroids
• Approximation Schemes for Minimum Latency Problems
• A dynamic programming algorithm for the shortest path problem with time windows and linear node costs
• An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
• The school bus routing problem: a case study
• A note on the traveling repairman problem
• The k -traveling repairmen problem
• The traveling salesman problem with cumulative costs
• Column Generation
• Shortest Path Problems with Resource Constraints
• Computational Experience with an M-Salesman Traveling Salesman Algorithm