A hybrid heuristic for a stochastic production-inventory-routing problem

• Published in: Electronic notes in discrete mathematics Vol. 64; pp. 345 - 354
• Main Authors: Agra, Agostinho, Requejo, Cristina, Rodrigues, Filipe
• Format: Journal Article
• Language: English
• Published: Elsevier B.V 01.02.2018
• Subjects: hybrid heuristic; Inventory routing; sample approximation algorithm; stochastic programming; Inventory routing; sample approximation algorithm; hybrid heuristic; stochastic programming
• ISSN: 1571-0653; 1571-0653
• DOI: 10.1016/j.endm.2018.02.009

We consider a stochastic single item production-inventory-routing problem with a single producer and multiple clients. At the clients, demand is allowed to be backlogged incurring a penalty cost. Demands are considered uncertain. A recourse model is presented where the production and routing decisions are taken before the scenario is known, and the quantities to deliver to the clients and the inventory levels are adjustable to the scenario. Valid inequalities are introduced and a hybrid heuristic that combines ideas from the sample average approximation method and from relax-and-fix approaches is proposed. Preliminary tests based on randomly generated instances are reported showing that the hybrid heuristic performs better than the classical sample approximation algorithm for hard instances.