Please use this identifier to cite or link to this item:
Title: A hybrid heuristic for a stochastic production-inventory-routing problem
Author: Agra, Agostinho
Requejo, Cristina
Rodrigues, Filipe
Keywords: Inventory routing
Stochastic programming
Sample approximation algorithm
Hybrid heuristic
Issue Date: 2018
Publisher: Elsevier
Abstract: 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.
Peer review: yes
DOI: 10.1016/j.endm.2018.02.009
ISSN: 1571-0653
Publisher Version:
Appears in Collections:CIDMA - Artigos

Files in This Item:
File Description SizeFormat 
AgraRequejoRodrigues_ElectronicNotesINDiscreteMathematics_authorsPostPrint.pdf269.38 kBAdobe PDF    Request a copy

FacebookTwitterDeliciousLinkedInDiggGoogle BookmarksMySpace
Formato BibTex MendeleyEndnote Degois 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.