Exact solution of the soft-clustered vehicle-routing problem

DOI10.1016/j.ejor.2019.07.019zbMath1430.90090OpenAlexW2916932176WikidataQ127470162 ScholiaQ127470162MaRDI QIDQ2272311

Timo Hintsch, Stefan Irnich

Publication date: 9 September 2019

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

Full work available at URL: https://download.uni-mainz.de/RePEc/pdf/Discussion_Paper_1813.pdf

zbMATH Keywords

branch-and-cutbranch-and-priceroutingshortest-path problem with resource constraintsdynamic-programming labeling

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Dynamic programming (90C39)

Related Items (6)

Large multiple neighborhood search for the soft-clustered vehicle-routing problem ⋮ The joint order batching and picker routing problem: modelled and solved as a clustered vehicle routing problem ⋮ A branch‐and‐price approach to the multitasking scheduling with batch control on parallel machines ⋮ The multi‐depot family traveling salesman problem and clustered variants: Mathematical formulations and branch‐&‐cut based methods ⋮ Community logistics and dynamic community partitioning: a new approach for solving e-commerce last mile delivery ⋮ A branch-and-cut algorithm for the soft-clustered vehicle-routing problem

Uses Software

• VRP
• MAXFLOW

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hybrid metaheuristics for the clustered vehicle routing problem
• A class of algorithms which require nonlinear time to maintain disjoint sets
• The pickup and delivery problem with time windows
• Variable neighborhood search
• A fast two-level variable neighborhood search for the clustered vehicle routing problem
• Asymmetry matters: dynamic half-way points in bidirectional labeling for solving shortest path problems with resource constraints faster
• Bidirectional labeling in column-generation algorithms for pickup-and-delivery problems
• Large multiple neighborhood search for the clustered vehicle-routing problem
• The traveling salesman problem and its variations.
• Upper and lower bounds for the vehicle-routing problem with private fleet and common carrier
• Solving elementary shortest-path problems as mixed-integer programs
• Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
• Sequential search and its application to vehicle-routing problems
• New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
• The Shortest-Path Problem with Resource Constraints and k-Cycle Elimination for k ≥ 3
• Vehicle Routing
• Districting for Arc Routing
• New dynamic programming algorithms for the resource constrained elementary shortest path problem
• The prize collecting traveling salesman problem
• Fast Algorithms for Geometric Traveling Salesman Problems
• Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW
• A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
• An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
• Cut-First Branch-and-Price-Second for the Capacitated Arc-Routing Problem
• Exact Algorithms for the Clustered Vehicle Routing Problem
• Column Generation
• Selected Topics in Column Generation
• Shortest Path Problems with Resource Constraints

This page was built for publication: Exact solution of the soft-clustered vehicle-routing problem