MOE-DGSCND: Multi-Objective Enterprise Green Supply Chain Network Design
Abstract
This paper introduces and studies the Multi-Objective Enterprise Doubly-Green Supply Chain Network Design (MOE-DGSCND) problem, an extension of Multi-Objective Supply Chain Network Design. The problem studied here is a three-objective combinatorial optimization problem that simultaneously minimizes total cost f1, carbon dioxide emissions f2 and customer dissatisfaction f3 over binary decisions regarding which distribution centers to open and how to assign customer zones to open facilities. The problem generalizes the capacitated facility location problem (CFLP) and is known to be NP-hard (Garey and Johnson, 1979). This paper formally specifies the decision variables, objective functions and constraints and investigates three solution approaches using a single numerical instance: (A) an exact weighted-sum integer linear programming (ILP) formulation solved with Python combinatorially and via PuLP, (B) three Fully Polynomial-Time Approximation Schemes (FPTAS) providing (1 + ε)-approximate solutions for ε := 0.15 and (C) two baseline heuristics for comparison. On an instance with eight customers and five candidate distribution centers, the exact solver certifies the optimal (sampled) supported solutions across eight weight combinations, while the FPTAS-based approaches complete within milliseconds, compared to centiseconds for the exact ILP on this tiny non-stochastic instance.
Related
- A Multi-Objective Optimization Framework for Cross-Supply-Chain Integration: An Empirical Application to Tea and Ceramics
- Portfolio-Based Constrained Multi-Objective Bayesian Optimization for Materials Design
- Multi-Objective Fractional-Order Control Design for Solar Collector Systems Under Parameter Perturbations and Stability Constraints
- Surrogate-assisted multi-objective topology optimization design method for prefabricated large-span Suspen-Dome based on structural-mapping-method and improved-PGSA
- When the implementation matters more than the algorithm: NSGA-II and other multi-objective optimizers in engineering design tools
BibTeX
@misc{reichel2026moedgscnd,
title = {{MOE-DGSCND: Multi-Objective Enterprise Green Supply Chain Network Design}},
author = {Felix Reichel},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2609.11971},
eprint = {2609.11971},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.11971},
note = {CC BY-NC-ND 4.0},
}
RIS
TY - UNPB
TI - MOE-DGSCND: Multi-Objective Enterprise Green Supply Chain Network Design
AU - Felix Reichel
PY - 2026
DA - 2026/10/28
PB - arXiv
DO - 10.48550/arxiv.2609.11971
UR - https://arxiv.org/abs/2609.11971
AB - This paper introduces and studies the Multi-Objective Enterprise Doubly-Green Supply Chain Network Design (MOE-DGSCND) problem, an extension of Multi-Objective Supply Chain Network Design. The problem studied here is a three-objective combinatorial optimization problem that simultaneously minimizes total cost f1, carbon dioxide emissions f2 and customer dissatisfaction f3 over binary decisions regarding which distribution centers to open and how to assign customer zones to open facilities. The problem generalizes the capacitated facility location problem (CFLP) and is known to be NP-hard (Garey and Johnson, 1979). This paper formally specifies the decision variables, objective functions and constraints and investigates three solution approaches using a single numerical instance: (A) an exact weighted-sum integer linear programming (ILP) formulation solved with Python combinatorially and via PuLP, (B) three Fully Polynomial-Time Approximation Schemes (FPTAS) providing (1 + ε)-approximate solutions for ε := 0.15 and (C) two baseline heuristics for comparison. On an instance with eight customers and five candidate distribution centers, the exact solver certifies the optimal (sampled) supported solutions across eight weight combinations, while the FPTAS-based approaches complete within milliseconds, compared to centiseconds for the exact ILP on this tiny non-stochastic instance.
ER -