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

DOI10.1016/J.EJOR.2013.09.014zbMATH Open1305.90408OpenAlexW2068403188MaRDI QIDQ2256169FDOQ2256169

Authors: Zhixing Luo, Hu Qin, Andrew Lim 

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

Recommendations

• An effective metaheuristic for multiple traveling repairman problem with distance constraints
• Two exact algorithms for the distance-constrained vehicle routing problem
• The multi-depot \(k\)-traveling repairman problem
• Branch-and-price algorithms for the solution of the multi-trip vehicle routing problem with time windows
• The distance constrained multiple vehicle traveling purchaser problem

zbMATH Keywords

branch-and-pricebranch-and-price-and-cutdistance constrainttraveling repairmen problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Mixed integer programming (90C11)

Cites Work

• Network flows. Theory, algorithms, and applications.
• TSPLIB—A Traveling Salesman Problem Library
• Title not available (Why is that?)
• A dynamic programming algorithm for the shortest path problem with time windows and linear node costs
• Title not available (Why is that?)
• New dynamic programming algorithms for the resource constrained elementary shortest path problem
• An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
• Shortest Path Problems with Resource Constraints
• Computational Experience with an M-Salesman Traveling Salesman Algorithm
• The vehicle routing problem
• An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem
• Branch and price for the vehicle routing problem with discrete Split deliveries and time windows
• A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
• Column Generation
• An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles
• Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
• Robust branch-and-cut-and-price for the capacitated vehicle routing problem
• Accelerated label setting algorithms for the elementary resource constrained shortest path problem
• 2-path cuts for the vehicle routing problem with time windows
• The minimum latency 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
• A Faster, Better Approximation Algorithm for the Minimum Latency Problem
• The complexity of the travelling repairman problem
• Approximation Schemes for Minimum Latency Problems
• 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
• A comparison of three metaheuristics for the workover rig routing problem
• An exact algorithm based on cut-and-column generation for the capacitated location-routing problem
• A branch-price-and-cut algorithm for the workover rig routing problem
• On the Distance Constrained Vehicle Routing Problem
• The Delivery Man Problem and Cumulative Matroids
• The school bus routing problem: a case study
• A note on the traveling repairman problem
• The single vehicle routing problem with toll-by-weight scheme: a branch-and-bound approach
• A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem
• State-space relaxation procedures for the computation of bounds to routing problems
• The traveling salesman problem with cumulative costs
• 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
• Scheduling workover rigs for onshore oil production
• A scatter search for multi-depot vehicle routing problem with weight-related cost
• Optimal Routing under Capacity and Distance Restrictions
• Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem
• The school bus routing problem: a review
• A new formulation for the traveling deliveryman problem
• A \(2+\varepsilon\) approximation algorithm for the \(k\)-MST problem
• The \(k\)-traveling repairmen problem
• Title not available (Why is that?)

Cited In (22)

• The multi-terminal vertex separator problem: branch-and-cut-and-price
• Optimisation of maintenance routing and scheduling for offshore wind farms
• A branch-and-price-and-cut algorithm for the cable-routing problem in solar power plants
• Minimizing customers' waiting time in a vehicle routing problem with unit demands
• Routing multiple work teams to minimize latency in post-disaster road network restoration
• An effective metaheuristic for multiple traveling repairman problem with distance constraints
• Minimizing total weighted latency in home healthcare routing and scheduling with patient prioritization
• Branch-and-price and constraint programming for solving a real-life technician dispatching problem
• Two exact algorithms for the traveling umpire problem
• 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
• Weighted online minimum latency problem with edge uncertainty
• Solving the traveling repairman problem on a line with general processing times and deadlines
• An effective hybrid search algorithm for the multiple traveling repairman problem with profits
• The multi-vehicle cumulative covering tour problem
• Hybrid evolutionary search for the traveling repairman problem with profits
• Multirobot search for a stationary object placed in a known environment with a combination of GRASP and VND
• 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
• Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network
• Minimizing latency in post-disaster road clearance operations
• The multi-depot \(k\)-traveling repairman problem

Uses Software

• TSPLIB

This page was built for publication: Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints

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