4.7 Article

An efficient Lagrangian-based heuristic to solve a multi-objective sustainable supply chain problem

Journal

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Volume 294, Issue 1, Pages 70-90

Publisher

ELSEVIER
DOI: 10.1016/j.ejor.2021.01.008

Keywords

Heuristics; Sustainable Supply Chain management; Multi-objective optimization; Lagrangian relaxation; AUGMECON2

Funding

  1. Sao Paulo Research Foundation (FAPESP) [14/27334-9, 15/216604, 16/02203-4]
  2. Conselho Nacional de Desenvolvimento Cientfico e Tecnolgico (CNPq) [306036/2018-5]
  3. Coordenacao de Aperfeicoamento de Pessoal de N-vel Superior Brazil (CAPES) [001]
  4. FCT
  5. Portugal 2020 FCT [PTDC/EGEOGE/28071/2017, Lisboa - 01.0145-Feder-28071]
  6. FAPESP [2013/07375-0]
  7. Fundacao de Amparo a Pesquisa do Estado de Sao Paulo (FAPESP) [14/27334-9, 16/02203-4] Funding Source: FAPESP

Ask authors/readers for more resources

Sustainable Supply Chain management integrates economic, environmental, and social goals, but there is no consensus on the compatibility of social and environmental responsibilities with profitability. Multi-objective optimization is a method to address the conflicting nature of these goals effectively.
Sustainable Supply Chain (SSC) management aims at integrating economic, environmental and social goals to assist in the long-term planning of a company and its supply chains. There is no consensus in the literature as to whether social and environmental responsibilities are profit-compatible. However, the conflicting nature of these goals is explicit when considering specific assessment measures and, in this scenario, multi-objective optimization is a way to represent problems that simultaneously optimize the goals. This paper proposes a Lagrangian matheuristic method, called AugMathLagr, to solve a hard and relevant multi-objective problem found in the literature. AugMathLagr was extensively tested using artificial instances defined by a generator presented in this paper. The results show a competitive performance of AugMathLagr when compared with an exact multi-objective method limited by time and a matheuristic recently proposed in the literature and adapted here to address the studied problem. In addition, computational results on a case study are presented and analyzed, and demonstrate the outstanding performance of AugMathLagr. (c) 2021 Elsevier B.V. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available