Advanced search
Start date
Betweenand
(Reference retrieved automatically from Web of Science through information on FAPESP grant and its corresponding number as mentioned in the publication by the authors.)

A multi-objective matheuristic for designing and planning sustainable supply chains

Full text
Author(s):
Tautenhain, Camila P. S. [1] ; Barbosa-Povoa, Ana Paula [2] ; Nascimento, V, Maria C.
Total Authors: 3
Affiliation:
[1] V, Univ Fed Sao Paulo UNIFESP, Inst Ciencia & Tecnol, Av Cesare Lattes 1201, BR-12247014 Sao Jose Dos Campos, SP - Brazil
[2] Univ Tecn Lisboa, Ctr Estudos Gestao, Inst Super Tecn, P-1049101 Lisbon - Portugal
Total Affiliations: 2
Document type: Journal article
Source: COMPUTERS & INDUSTRIAL ENGINEERING; v. 135, p. 1203-1223, SEP 2019.
Web of Science Citations: 2
Abstract

Supply chains express the sequence of steps related to the production process, from procurement of raw materials to deliver final products to the customer market. The complexity of the impacts caused by supply chains has given rise to the problem of planning sustainable supply chains (SSCs). SSCs are commonly formulated as multi-objective optimization problems to better approach the trade-offs among economic, environmental and social criteria. Nevertheless, most studies consider only the environmental and economic objective functions, ignoring the social criterion. Moreover, they are usually case-specific and lack in defining parameters and constraints that may be present in other SSCs. This paper attempts to describe a generic SSC by introducing a multi-objective formulation that includes the three pillars of sustainability: the economic, the social and the environmental criteria. Additionally, as optimizing multi-objective SSC problems by exact-based methods is time-consuming and often impracticable in realistic scenarios, this paper proposes a matheuristic to obtain approximations of the Pareto frontier within a reasonable time. The computational experience indicated that the proposed matheuristic was from 3.54 to 21.70 faster than the exact-based method for large instances and was on average within 2% of the ideal point. (AU)

FAPESP's process: 13/07375-0 - CeMEAI - Center for Mathematical Sciences Applied to Industry
Grantee:Francisco Louzada Neto
Support Opportunities: Research Grants - Research, Innovation and Dissemination Centers - RIDC
FAPESP's process: 14/27334-9 - A study of sustainable supply chain management problems
Grantee:Camila Pereira dos Santos Tautenhain
Support Opportunities: Scholarships in Brazil - Master
FAPESP's process: 16/02203-4 - A study of sustainable supply chain management problems
Grantee:Camila Pereira dos Santos Tautenhain
Support Opportunities: Scholarships abroad - Research Internship - Master's degree
FAPESP's process: 15/21660-4 - Hibridizing heuristic and exact methods to approach combinatorial optimization problems
Grantee:Mariá Cristina Vasconcelos Nascimento Rosset
Support Opportunities: Regular Research Grants