Minimum makespan vehicle routing problem with compatibility constraints

DOI10.1007/978-3-319-59776-8_20zbMath1492.90098OpenAlexW2618144004MaRDI QIDQ2011596

Siqian Shen, Miao Yu, Viswanath Nagarajan

Publication date: 4 August 2017

Full work available at URL: https://doi.org/10.1007/978-3-319-59776-8_20

zbMATH Keywords

vehicle routingapproximation algorithmbranch-cut-and-pricecompatibility constraints

Mathematics Subject Classification ID

Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06)

Related Items (2)

An approximation algorithm for vehicle routing with compatibility constraints ⋮ Time window optimization for attended home service delivery under multiple sources of uncertainties

Uses Software

• Gurobi
• CVRPSP

Cites Work

• Unnamed Item
• A tutorial on column generation and branch-and-price for vehicle routing problems
• Min-max tree covers of graphs.
• The vehicle routing problem. Latest advances and new challenges.
• Multistars, partial multistars and the capacitated vehicle routing problem
• On the capacitated vehicle routing problem
• A new branch-and-cut algorithm for the capacitated vehicle routing problem
• Robust branch-and-cut-and-price for the capacitated vehicle routing problem
• The Truck Dispatching Problem
• New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
• Solution of a Min-Max Vehicle Routing Problem
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
• An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
• Improved Branch-Cut-and-Price for Capacitated Vehicle Routing
• Approximations for minimum and min-max vehicle routing problems
• Vehicle Routing Problem with Time Windows

This page was built for publication: Minimum makespan vehicle routing problem with compatibility constraints