 Mathematical programming heuristics for the production routing problemRobert A. Russell International Journal of Production Economics, 2017, vol. 193, issue C, 40-49 Abstract: This paper develops a framework and solution methodology for optimizing the integration of production, inventory, and distribution for supplying retail demand locations from a production facility. Two mathematical programming-based heuristics are developed which use a relaxed mixed integer model to determine an initial solution. One approach uses set partitioning and another approach employs the concept of seed routes to determine an approximate solution and a vehicle routing metaheuristic is used to sequence routes for each time period in the planning horizon. A multi-iteration improvement procedure determines the final solution. The proposed multi-phase approach achieves many new best known solutions to test problems for this challenging supply chain optimization problem. Additionally, experiments are conducted to assess the inclusion of fixed vehicle costs and the impact on fleet size and solution quality. Keywords: Production routing; Lot sizing; Distribution; MIP formulation; Metaheuristics (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:eee:proeco:v:193:y:2017:i:c:p:40-49 DOI: 10.1016/j.ijpe.2017.06.033 Access Statistics for this article International Journal of Production Economics is currently edited by Stefan Minner More articles in International Journal of Production Economics from Elsevier |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.