Enhanced branch-cut-and-price algorithm for heterogeneous fleet vehicle routing problems
type: Item
instance of: scholarly article
title: Enhanced branch-cut-and-price algorithm for heterogeneous fleet vehicle routing problems
zbMATH Open document ID: 1403.90157
author: Ruslan Sadykov
author: Eduardo Uchoa
author: Artur Alves Pessoa
published in: European Journal of Operational Research
publication date: 2018-07-12T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 6902952
zbMATH Keywords: routing
zbMATH Keywords: column generation
zbMATH Keywords: cutting planes
describes a project that uses: METSlib
describes a project that uses: VRP
describes a project that uses: BaPCod
describes a project that uses: CVRPSEP
MaRDI profile type: Publication
full work available at URL: j.ejor.2018.04.009
OpenAlex ID: W2796733585
cites work: Q5241193
cites work: Routing a Heterogeneous Fleet of Vehicles
cites work: An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
cites work: A unified exact method for solving different classes of vehicle routing problems
cites work: New route relaxation and pricing strategies for the vehicle routing problem
cites work: A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem
cites work: A Computational Study Of A New Heuristic For The Site-Dependent Vehicle Routing Problem
cites work: A column generation approach to the heterogeneous fleet vehicle routing problem
cites work: Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
cites work: A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints
cites work: A tabu search heuristic for periodic and multi-depot vehicle routing problems
cites work: Robust branch-and-cut-and-price for the capacitated vehicle routing problem
cites work: The fleet size and mix vehicle routing problem
cites work: Industrial aspects and literature survey: fleet composition and routing
cites work: Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
cites work: A branch and bound algorithm for the capacitated vehicle routing problem
cites work: Q4039765
cites work: New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows
cites work: Improved branch-cut-and-price for capacitated vehicle routing
cites work: Limited memory rank-1 cuts for vehicle routing problems
cites work: A Robust Branch-Cut-and-Price Algorithm for the Heterogeneous Fleet Vehicle Routing Problem
cites work: A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem
cites work: Chvátal-Gomory Rank-1 Cuts Used in a Dantzig-Wolfe Decomposition of the Vehicle Routing Problem with Time Windows
cites work: A hybrid algorithm for the heterogeneous fleet vehicle routing problem
cites work: A heuristic column generation method for the heterogeneous fleet VRP
cites work: Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation
cites work: New benchmark instances for the capacitated vehicle routing problem
cites work: Formulations and valid inequalities for the heterogeneous vehicle routing problem
DOI: 10.1016/J.EJOR.2018.04.009
description: scientific article; zbMATH DE number 6902952