Lower and upper bounds for location-arc routing problems with vehicle capacity constraints
Authors:
- Seyed Hossein Hashemi DoulabiSDSeyed Hossein Hashemi Doulabi
- Abbas SeifiASAbbas Seifi
- 1 January 2013
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 224 (1) , 189-208
Abstract
No abstract availableKeywords
This publication has 29 references indexed in Scilit:
- A hybrid evolutionary algorithm for the periodic location-routing problemEuropean Journal of Operational Research, 2011
- Lower bounds for the mixed capacitated arc routing problemComputers & Operations Research, 2010
- An Approximation Algorithm for the Capacitated Arc Routing ProblemThe Open Operational Research Journal, 2008
- Heuristic and lower bound for a stochastic location-routing problemEuropean Journal of Operational Research, 2007
- Waste collection in Southern Italy: solution of a real-life arc routing problemInternational Transactions in Operational Research, 2005
- A guided local search heuristic for the capacitated arc routing problemEuropean Journal of Operational Research, 2003
- A cutting plane algorithm for the capacitated arc routing problemComputers & Operations Research, 2003
- The Capacitated Arc Routing Problem: Lower boundsNetworks, 1992
- The fleet size and mix problem for capacitated arc routingEuropean Journal of Operational Research, 1985
- Capacitated arc routing problemsNetworks, 1981