Abstract: This paper addresses a production and distribution problem in a supply chain. The supply chain consists of a plant with no storage capacity that produces only one type of product. The manufactured products are then transported to a depot for storage. Customers demand is met by a homogeneous fleet of vehicles that begins and ends their trips at the depot. The objective of the study is to minimize the overall cost of production, inventory and transport throughout the supply chain. A Branch-and-Cut and a hybrid Two Phases Decomposition Heuristic using a Mixed Integer Programming and a Genetic Algorithm have been developed to solve the problem.

Bi Kouaï Bertin Kayé, Moustapha Diaby, Tchimou N’Takpé and Souleymane Oumtanaga, “Managing an External Depot in a Production Routing Problem” International Journal of Advanced Computer Science and Applications(IJACSA), 11(2), 2020. http://dx.doi.org/10.14569/IJACSA.2020.0110242

@article{Kayé2020,
title = {Managing an External Depot in a Production Routing Problem},
journal = {International Journal of Advanced Computer Science and Applications},
doi = {10.14569/IJACSA.2020.0110242},
url = {http://dx.doi.org/10.14569/IJACSA.2020.0110242},
year = {2020},
publisher = {The Science and Information Organization},
volume = {11},
number = {2},
author = {Bi Kouaï Bertin Kayé and Moustapha Diaby and Tchimou N’Takpé and Souleymane Oumtanaga}
}