MILP for the Inventory and Routing for Replenishment Problem in the Car Assembly Line.


  • Raul Pulido Universidad Politecnica de Madrid (UPM) Politecnico di MIlano
  • Álvaro Garcia-Sánchez Universidad Politecnica de Madrid (UPM)
  • Miguel Ortega-Mier Universidad Politecnica de Madrid (UPM)
  • Asessandro Brun Politecnico di Milano



Integer Programming, Routing, Inventory, Assembly line


The inbound logistic for feeding the workstation inside the factory represents a critical issue in the car manufacturing industry. Nowadays, this issue is even more critical than in the past since more types of car are being produced in the assembly lines. Consequently, as workstations have to install many types of components, they also need to have an inventory of different types of the component in a compact space.

The replenishment is a critical issue since a lack of inventory could cause line stoppage or reworking. On the other hand, an excess of inventory could increase the holding cost or even block the replenishment paths. The decision of the replenishment routes cannot be made without taking into consideration the inventory needed by each station during the production time which will depend on the production sequence. This problem deals with medium-sized instances and it is solved using online solvers. The contribution of this paper is a MILP for the replenishment and inventory of the components in a car assembly line.


Download data is not yet available.

Author Biographies

Raul Pulido, Universidad Politecnica de Madrid (UPM) Politecnico di MIlano

EDIM PhD candidate

Álvaro Garcia-Sánchez, Universidad Politecnica de Madrid (UPM)

Professor at Dept de Ingenieria de Organización, Adm. de Empresas y Estadistica. U.D. Organizacion de la Producción.

Miguel Ortega-Mier, Universidad Politecnica de Madrid (UPM)

Professor at Dept de Ingenieria de Organización, Adm. de Empresas y Estadistica. U.D. Organizacion de la Producción.

Asessandro Brun, Politecnico di Milano

Professor at Dipartimento di Ingegneria Gestionale


Archetti, C., Bertazzi, L., Hertz, A., & Speranza, M. G. (2012). A hybrid heuristic for an inventory routing problem. INFORMS Journal on Computing, 24(1), 101-116.

Becker C (2006), Scholl A, A survey on problems and methods in generalized assembly line balancing, EUR J OPER RES 168 (3) 694–715.

Campbell A (1998), Clarke L, Kleywegt A, Savelsbergh M, The inventory routing problem, Fleet management and logistics 1 95–113.

Czyzyk, J., Mesnier, M. P., & Moré, J. J. (1998). The NEOS server. Computational Science & Engineering, IEEE, 5(3), 68-75.

Dolan, E. D. (2001). NEOS Server 4.0 administrative guide. arXiv preprint cs/0107034.

Eskigun E (2005), Uzsoy R, Preckel P, Beaujon G, Krishnan S, Tew J, Outbound supply chain network design with mode selection, lead times and capacitated vehicle distribution centers, EUR J OPER RES 165 (1) 182– 206.

Ghosh S (1989), Roger J, A comprehensive lit. review and analysis of the design, balancing and scheduling of assem-bly systems, INT J PROD RES 27 (4) 637–670.

Grønhaug, R., Christiansen, M., Desaulniers, G., & Desrosiers, J. (2010). A branch-and-price method for a liquefied natural gas inventory routing problem. Transportation Science, 44(3), 400-415.

Gropp, W., & Moré, J. (1997). Optimization environments and the NEOS server. Approximation theory and optimization, 167-182.

Hall, R. W., & American Production and Inventory Control Society. (1983). Zero inventories (pp. 120-35). Homewood, IL: Dow Jones-Irwin.

Jin M (2008), Luo Y, Eksioglu S, Integration of production sequencing and outbound logistics in the automotive industry, INT J PROD ECON 113 (2) 766– 774.

Kaminsky P (2003), Simchi-Levi D, Production and distribution lot sizing in a two stage sup-ply chain, IIE Transactions 35 1065–1075.

Kazemi, S. M., Ghodsi, R., Rabbani, M., & Tavakkoli-Moghaddam, R. (2011). A novel two-stage genetic algorithm for a mixed-model U-line balancing problem with duplicated tasks. The International Journal of Advanced Manufacturing Technology, 55(9-12), 1111-1122.

Laporte, G. (1992). The vehicle routing problem: An overview of exact and approximate algorithms. European Journal of Operational Research, 59(3), 345-358.

Moin, N. H., Salhi, S., & Aziz, N. A. B. (2011). An efficient hybrid genetic algorithm for the multi-product multi-period inventory routing problem. International Journal of Production Economics, 133(1), 334-343.

Monden Y (1983), Toyota production system: practical approach to production management, Industrial Engineering and Management Press, Institute of Industrial Engineers Norcross, GA.

Prajogo D (2012), Olhager J, Supply chain integration and performance: The effect of long-term relationships, IT and sharing, and logistics integration, INT J PROD ECON 135 (1) 514-522.

Pulido, R, García-Sánchez, A., & Ortega-Mier, M. (2013) The Inventory Routing Problema for the Mixed Car Model Assem-bly Line. Book of preceedings 7th International Conference on Industrial Engineering and Industrial Management (pp 398-406).

Régin, J. C., & Puget, J. F. (1997). A filtering algorithm for global sequencing constraints. In Principles and Practice of Constraint Programming-CP97 (pp. 32-46). Springer Berlin Heidelberg.

Volling T (2013), Matzke A, Grunewald M, Spengler T, Planning of capacities and orders in build-to-order automobile production: A review, EUR J OPER RES, 224 (2) 240-260.




How to Cite

Pulido, R., Garcia-Sánchez, Álvaro, Ortega-Mier, M., & Brun, A. (2014). MILP for the Inventory and Routing for Replenishment Problem in the Car Assembly Line. International Journal of Production Management and Engineering, 2(1), 37–45.