Local search based metaheuristics for the robust vehicle routing problem with discrete scenarios
- 1 July 2015
- journal article
- Published by Elsevier in Applied Soft Computing
- Vol. 32, 518-531
Abstract
No abstract availableKeywords
Funding Information
- Champagne-Ardenne Regional Council
This publication has 45 references indexed in Scilit:
- The robust vehicle routing problem with time windowsComputers & Operations Research, 2013
- Minmax regret combinatorial optimization problems: an Algorithmic PerspectiveRAIRO - Operations Research, 2011
- Theory and Applications of Robust OptimizationSIAM Review, 2011
- An exact solution framework for a broad class of vehicle routing problemsComputational Management Science, 2010
- Min–max and min–max regret versions of combinatorial optimization problems: A surveyEuropean Journal of Operational Research, 2009
- A survey on metaheuristics for stochastic combinatorial optimizationNatural Computing, 2008
- Complexity of the min–max and min–max regret assignment problemsOperations Research Letters, 2005
- Robust discrete optimization and network flowsMathematical Programming, 2003
- Robust solutions of uncertain linear programsOperations Research Letters, 1999
- Route first—Cluster second methods for vehicle routingOmega, 1983