A Unified Decomposition Matheuristic for Assembly, Production, and Inventory Routing

Masoud Chitsaz (), Jean-François Cordeau () and Raf Jans ()
Additional contact information
Masoud Chitsaz: HEC Montréal and GERAD, 3000 Chemin de la Côte-Sainte-Catherine, Montréal H3T 2A7, Canada
Jean-François Cordeau: HEC Montréal and GERAD, 3000 Chemin de la Côte-Sainte-Catherine, Montréal H3T 2A7, Canada
Raf Jans: HEC Montréal and GERAD, 3000 Chemin de la Côte-Sainte-Catherine, Montréal H3T 2A7, Canada

INFORMS Journal on Computing, 2019, vol. 31, issue 1, 134-152

Abstract: While the joint optimization of production and outbound distribution decisions in a manufacturing context have been intensively studied in the past decade, the integration of production, inventory, and inbound transportation from suppliers have received much less attention despite its practical relevance. This paper aims to fill the gap by introducing a general model for the assembly routing problem (ARP), which consists of simultaneously planning the assembly of a finished product at a plant and the routing of vehicles collecting materials from suppliers to meet the inventory requirements imposed by the production. We formulate the problem as a mixed-integer linear program and we propose a three-phase decomposition matheuristic that relies on the iterative solution of different subproblems. The first phase determines a setup schedule while the second phase optimizes production quantities, supplier visit schedules and shipment quantities. The third phase solves a vehicle routing problem for each period in the planning horizon. The algorithm is flexible, and we show how it can also be used to solve two well-known outbound distribution problems related to the ARP: the production routing problem and the inventory routing problem. Using the same parameter setting for all problems and instances, we obtain 781 new best-known solutions out of 2,628 standard IRP and PRP test instances. In particular, on large-scale multivehicle instances, the new algorithm outperforms specialized state-of-the-art heuristics for these two problems.

Keywords: production; inventory; routing; assembly; decomposition matheuristic; iterative heuristic (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (25)

Downloads: (external link)
https://doi.org/10.1287/ijoc.2018.0817 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:orijoc:v:31:y:2019:i:1:p:134-152

Access Statistics for this article

More articles in INFORMS Journal on Computing from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().