Lower and upper bounds for location-arc routing problems with vehicle capacity constraints

DOI10.1016/J.EJOR.2012.06.015zbMath1292.90167OpenAlexW2002804923MaRDI QIDQ2253416

Seyed Hossein Hashemi Doulabi, Abbas Seifi

Publication date: 27 July 2014

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2012.06.015

zbMATH Keywords

heuristicsmixed integer programmingarc routingintegrated logisticslocation-arc routing

Mathematics Subject Classification ID

Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Related Items (12)

A survey of recent research on location-routing problems ⋮ Solving the dynamic capacitated location-routing problem with fuzzy demands by hybrid heuristic algorithm ⋮ Evaluating two new heuristics for constructing customer clusters in a VRPTW with multiple service workers ⋮ A survey of variants and extensions of the location-routing problem ⋮ Constructive heuristics for the mixed capacity arc routing problem under time restrictions with intermediate facilities ⋮ Arc routing problems: A review of the past, present, and future ⋮ The vehicle flow formulation and savings-based algorithm for the rollon-rolloff vehicle routing problem ⋮ A robust location-arc routing problem under uncertainty: mathematical model with lower and upper bounds ⋮ Two-echelon vehicle routing problem with satellite bi-synchronization ⋮ The effects of the tractor and semitrailer routing problem on mitigation of carbon dioxide emissions ⋮ A taxonomical analysis, current methods and objectives on location-routing problems ⋮ Using greedy clustering method to solve capacitated location-routing problem with fuzzy demands

This page was built for publication: Lower and upper bounds for location-arc routing problems with vehicle capacity constraints