A decomposition heuristic for a rich production routing problem
Authors:
- Pedro L. MirandaPMPedro L. Miranda
- Jean-François CordeauJCJean-François Cordeau
- Deisemera FerreiraDFDeisemera Ferreira
- Raf JansRJRaf Jans
- Reinaldo MorabitoRMReinaldo Morabito
- 1 October 2018
- journal article
- research article
- Published by Elsevier in Computers & Operations Research
- Vol. 98, 211-230
Abstract
No abstract availableKeywords
Funding Information
- Fundação de Amparo à Pesquisa do Estado de São Paulo (2014/10565-8, 2015/24916-0)
- Conselho Nacional de Desenvolvimento Científico e Tecnológico (140179/2014-3, 312569/2013-0; and the Coordination for the Improvement of Higher Education Personnel (CAPES))
This publication has 28 references indexed in Scilit:
- Analysis of the maximum level policy in a production-distribution systemComputers & Operations Research, 2011
- Tabu search with path relinking for an integrated production–distribution problemComputers & Operations Research, 2011
- On the use of Monte Carlo simulation, cache and splitting techniques to improve the Clarke and Wright savings heuristicsJournal of the Operational Research Society, 2011
- A branch-and-price algorithm for an integrated production and inventory routing problemComputers & Operations Research, 2010
- A tabu search procedure for coordinating production, inventory and distribution routing problemsInternational Transactions in Operational Research, 2010
- Heuristics for a multiperiod inventory routing problem with production decisionsComputers & Industrial Engineering, 2009
- A Lagrangian relaxation approach to a coupled lot-sizing and cutting stock problemInternational Journal of Production Economics, 2009
- Modeling industrial lot sizing problems: a reviewInternational Journal of Production Research, 2007
- On the integrated production, inventory, and distribution routing problemIIE Transactions, 2006
- Local branchingMathematical Programming, 2003