Analytic centre stabilization of column generation algorithm for the capacitated vehicle routing problem

DOI10.1080/10556788.2015.1025134zbMath1338.90268OpenAlexW2028886191MaRDI QIDQ3458834

Hadi Karimi, Abbas Seifi

Publication date: 28 December 2015

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556788.2015.1025134

zbMATH Keywords

Lagrangian relaxationDantzig-Wolfe decompositioncapacitated vehicle routing problemanalytic centre cutting plane methodstabilized column generationanalytic centre stabilization

Mathematics Subject Classification ID

Integer programming (90C10) Transportation, logistics and supply chain management (90B06) Extreme-point and pivoting methods (90C49)

Related Items (1)

Branch and price for covering shipments in a logistic distribution network with a fleet of aircraft

Cites Work

• A second-order cone cutting surface method: Complexity and application
• An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
• Exact algorithms for routing problems under vehicle capacity constraints
• An exact solution framework for a broad class of vehicle routing problems
• On the choice of explicit stabilizing terms in column generation
• Newton's method for convex programming and Tschebyscheff approximation
• On a primal-dual analytic center cutting plane method for variational inequalities
• Stabilized column generation
• An analytic center quadratic cut method for the convex quadratic feasibility problem
• On the capacitated vehicle routing problem
• Heuristic procedures for the capacitated vehicle routing problem
• Lagrangean relaxation. (With comments and rejoinder).
• The integration of an interior-point cutting plane method within a branch-and-price algorithm
• A new branch-and-cut algorithm for the capacitated vehicle routing problem
• A new exact algorithm for the vehicle routing problem based on \(q\)-paths and \(k\)-shortest paths relaxations
• Comparison of bundle and classical column generation
• Robust branch-and-cut-and-price for the capacitated vehicle routing problem
• Projection results for vehicle routing
• A bundle-type algorithm for routing in telecommunication data networks
• 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
• An Analytic Center Cutting Plane Approach for Conic Programming
• Decomposition Principle for Linear Programs
• The Cutting-Plane Method for Solving Convex Programs
• Decomposition and Nondifferentiable Optimization with the Projective Algorithm
• A Nonlinear Analytic Center Cutting Plane Method for a Class of Convex Programming Problems
• Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW
• The Analytic Center Cutting Plane Method with Semidefinite Cuts
• An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
• Polynomial Interior Point Cutting Plane Methods
• A set‐partitioning‐based exact algorithm for the vehicle routing problem
• Column Generation
• An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation
• Selected Topics in Column Generation
• Exact solution of the centralized network design problem on directed graphs

This page was built for publication: Analytic centre stabilization of column generation algorithm for the capacitated vehicle routing problem