Solution methods for an integrated lot-scheduling and routing problem in furniture industry

• Grant number: 15/24916-0
• Support Opportunities: Scholarships abroad - Research Internship - Doctorate
• Start date: May 09, 2016
• End date: May 08, 2017
• Field of knowledge: Engineering - Production Engineering - Operational Research
• Principal Investigator: Reinaldo Morabito Neto
• Grantee: Pedro Luis Miranda Lugo
• Supervisor: Raf Jans
• Host Institution: Centro de Ciências Exatas e de Tecnologia (CCET). Universidade Federal de São Carlos (UFSCAR). São Carlos , SP, Brazil
• Institution abroad: École des Hautes Études Commerciales (HEC Montréal), Canada
• Associated to the scholarship: 14/10565-8 - Mathematical models and solutions method for the integrated lot-sizing, scheduling and distribution problem with split delivery, BP.DR

Abstract

This research project aims to develop solution methods for solving an integrated lot-scheduling and routing problem in furniture industry. We proposed two mixed integer programs (MIP), one establishing the relationship between routes and vehicles allocation using a single set of variables, and another that separates routing and vehicle allocation decisions in order to reduce the number of binary variables. A set of medium size instances were generated based on real data provided by a steel furniture company located at São Paulo (Brazil) and solved using CPLEX 12.5.1. Results shows that CPLEX takes a long computational time even to return a feasible solution and, in some instances, it does not return a solution after 10.800seconds of computational time. This encourages us to study and propose specific solution methods for solving the models. The focus is on developing solution strategies combining mathematical programming and heuristics methods in order to find high quality solutions for the integrated lot-scheduling and routing problem on hands. (AU)

Scientific publications

(References retrieved automatically from Web of Science and SciELO through information on FAPESP grants and their corresponding numbers as mentioned in the publications by the authors)

MIRANDA, PEDRO L.; CORDEAU, JEAN-FRANCOIS; FERREIRA, DEISEMERA; JANS, RAF; MORABITO, REINALDO. A decomposition heuristic for a rich production routing problem. Computers & Operations Research, v. 98, p. 211-230, OCT 2018. (14/10565-8, 15/24916-0)