A Mathematical Programming Model with Equilibrium Constraints for Competitive Closed-Loop Supply Chain Network Design

Yuxiang Yang, Zuqing Huang, Qiang Qiang, Gengui Zhou

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

A firm sets up his facilities including manufacturing/remanufacturing plants and distribution/collection centers, incorporating an existing closed-loop supply chain (CLSC) network. The entering firm has to compete with the existing firms in the existing network. The entering firm behaves as the leader of a Stackelberg game while the existing firms in the existing network are followers. We assume that the entering firm can anticipate the existing firms' reaction to his potential location decision before choosing his optimal policy. We use a CLSC network equilibrium model in which the decision makers are faced with multiple objectives to capture the existing firms' reaction. A mathematical programming model with equilibrium constraints is developed for this competitive CLSC network design problem by taking into account the market competition existing in the decentralized CLSC network. A solution method is developed by integrating Genetic algorithm with an inexact logarithmic-quadratic proximal augmented Lagrangian method. Finally, numerical examples and the related results are studied for illustration purpose.

Original languageEnglish (US)
Article number1750026
JournalAsia-Pacific Journal of Operational Research
Volume34
Issue number5
DOIs
StatePublished - Oct 1 2017

Fingerprint

Mathematical programming
Network design
Closed-loop supply chain
Supply chain network
Location decision
Manufacturing
Decision maker
Market competition
Network equilibrium
Stackelberg game
Optimal policy
Remanufacturing
Genetic algorithm
Multiple objectives
Follower

All Science Journal Classification (ASJC) codes

  • Management Science and Operations Research

Cite this

@article{7a215b45a43d46548c60be3b2a611413,
title = "A Mathematical Programming Model with Equilibrium Constraints for Competitive Closed-Loop Supply Chain Network Design",
abstract = "A firm sets up his facilities including manufacturing/remanufacturing plants and distribution/collection centers, incorporating an existing closed-loop supply chain (CLSC) network. The entering firm has to compete with the existing firms in the existing network. The entering firm behaves as the leader of a Stackelberg game while the existing firms in the existing network are followers. We assume that the entering firm can anticipate the existing firms' reaction to his potential location decision before choosing his optimal policy. We use a CLSC network equilibrium model in which the decision makers are faced with multiple objectives to capture the existing firms' reaction. A mathematical programming model with equilibrium constraints is developed for this competitive CLSC network design problem by taking into account the market competition existing in the decentralized CLSC network. A solution method is developed by integrating Genetic algorithm with an inexact logarithmic-quadratic proximal augmented Lagrangian method. Finally, numerical examples and the related results are studied for illustration purpose.",
author = "Yuxiang Yang and Zuqing Huang and Qiang Qiang and Gengui Zhou",
year = "2017",
month = "10",
day = "1",
doi = "10.1142/S0217595917500269",
language = "English (US)",
volume = "34",
journal = "Asia-Pacific Journal of Operational Research",
issn = "0217-5959",
publisher = "World Scientific Publishing Co. Pte Ltd",
number = "5",

}

A Mathematical Programming Model with Equilibrium Constraints for Competitive Closed-Loop Supply Chain Network Design. / Yang, Yuxiang; Huang, Zuqing; Qiang, Qiang; Zhou, Gengui.

In: Asia-Pacific Journal of Operational Research, Vol. 34, No. 5, 1750026, 01.10.2017.

Research output: Contribution to journalArticle

TY - JOUR

T1 - A Mathematical Programming Model with Equilibrium Constraints for Competitive Closed-Loop Supply Chain Network Design

AU - Yang, Yuxiang

AU - Huang, Zuqing

AU - Qiang, Qiang

AU - Zhou, Gengui

PY - 2017/10/1

Y1 - 2017/10/1

N2 - A firm sets up his facilities including manufacturing/remanufacturing plants and distribution/collection centers, incorporating an existing closed-loop supply chain (CLSC) network. The entering firm has to compete with the existing firms in the existing network. The entering firm behaves as the leader of a Stackelberg game while the existing firms in the existing network are followers. We assume that the entering firm can anticipate the existing firms' reaction to his potential location decision before choosing his optimal policy. We use a CLSC network equilibrium model in which the decision makers are faced with multiple objectives to capture the existing firms' reaction. A mathematical programming model with equilibrium constraints is developed for this competitive CLSC network design problem by taking into account the market competition existing in the decentralized CLSC network. A solution method is developed by integrating Genetic algorithm with an inexact logarithmic-quadratic proximal augmented Lagrangian method. Finally, numerical examples and the related results are studied for illustration purpose.

AB - A firm sets up his facilities including manufacturing/remanufacturing plants and distribution/collection centers, incorporating an existing closed-loop supply chain (CLSC) network. The entering firm has to compete with the existing firms in the existing network. The entering firm behaves as the leader of a Stackelberg game while the existing firms in the existing network are followers. We assume that the entering firm can anticipate the existing firms' reaction to his potential location decision before choosing his optimal policy. We use a CLSC network equilibrium model in which the decision makers are faced with multiple objectives to capture the existing firms' reaction. A mathematical programming model with equilibrium constraints is developed for this competitive CLSC network design problem by taking into account the market competition existing in the decentralized CLSC network. A solution method is developed by integrating Genetic algorithm with an inexact logarithmic-quadratic proximal augmented Lagrangian method. Finally, numerical examples and the related results are studied for illustration purpose.

UR - http://www.scopus.com/inward/record.url?scp=85029545459&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85029545459&partnerID=8YFLogxK

U2 - 10.1142/S0217595917500269

DO - 10.1142/S0217595917500269

M3 - Article

AN - SCOPUS:85029545459

VL - 34

JO - Asia-Pacific Journal of Operational Research

JF - Asia-Pacific Journal of Operational Research

SN - 0217-5959

IS - 5

M1 - 1750026

ER -