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

DOI10.1016/J.EJOR.2013.09.014MaRDI QIDQ2256169zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

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

Cited in

(23)

• 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
• Branch-and-price and constraint programming for solving a real-life technician dispatching problem
• An effective metaheuristic for multiple traveling repairman problem with distance constraints
• Two exact algorithms for the traveling umpire problem
• Minimizing total weighted latency in home healthcare routing and scheduling with patient prioritization
• Optimal scheduling on unrelated parallel machines with combinatorial auction
• 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
• An adaptive large neighborhood search approach for multiple traveling repairman problem with profits
• Multirobot search for a stationary object placed in a known environment with a combination of GRASP and VND
• 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

Describes a project that uses

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)