A Multi-objective Optimization for Multi-period Planning in Multi-item Cooperative Manufacturing Supply Chain

Yahia, Wafa Ben; Cheikhrouhou, Naoufel; Ayadi, Omar; Masmoudi, Faouzi

doi:10.1007/978-3-642-37143-1_75

Cited by 6 publications

(3 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In fact, the applications of evolutionary algorithms for solving LSPs have attracted great interest from researchers. Ben yahia et al 8 used nondominated sorting genetic algorithm (NSGA-II) to optimize multilevel capacitated LSP. Hajipour et al 9 proposed two novel Pareto-based multiobjective meta-heuristic algorithms namely a multiobjective harmony search algorithm (MOHSA) and multiobjective vibration damping optimization (MOVDO) to solve CLSP.…”

Section: Literature Reviewmentioning

confidence: 99%

“…In fact, in the last decades, PSO algorithm is applied for solving mono-objective LSPs, 6,7 but still limited for CLSP. Moreover, based on recent research, [8][9][10][11] the application of PSO algorithm, to solve multiobjective LSP has not been well investigated. Thus, the main purpose of this paper is to design the PSO algorithm for solving the MICLSP_SB, effectively, in a multiobjective framework.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Design of efficient multiobjective binary PSO algorithms for solving multi‐item capacitated lot‐sizing problem

Ammar

Yahia

Ayadi

et al. 2021

Int J of Intelligent Sys

Self Cite

View full text Add to dashboard Cite

In this paper, a multi-item capacitated lot-sizing problem with setup times and backlogging (MICLSP_SB) is addressed with respect to two conflicting objective functions. This nondeterministic polynomial time (NP)-hard problem consists of finding optimal production plans while minimizing, simultaneously, the total cost and the total inventory level. To effectively solve the considered problem, two new versions of multiobjective binary particle swarm optimization are designed. In the first proposed version "standard multiobjective particle swarm optimization" (S-MOBPSO) algorithm, two main contributions are introduced. First, a new particle encoding and decoding method is developed to treat the MICLSP_SB decision variables. Second, the overall violation minimization method and the constraint handling method are combined to effectively handle the problem constraints. To further enhance the overall performance, an improvement procedure that minimizes the capacity constraints violations is developed and embedded into the S-MOBPSO algorithm. This second version is named improved MOBPSO (I-MOBPSO). An illustrative example is presented to explain the application of the proposed algorithms. Five performance metrics are considered to measure and evaluate the effectiveness of the proposed algorithms. Experimental results demonstrate the

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Design of efficient multiobjective binary PSO algorithms for solving multi‐item capacitated lot‐sizing problem

Ammar

Yahia

Ayadi

et al. 2021

Int J of Intelligent Sys

Self Cite

View full text Add to dashboard Cite

show abstract

“…Bhattacharya and Bandyopadhyay [2] presented NSGA II [3] to choose facility location for achieving two contradictory objectives. Also, there are several types of research applied NSGA II to solve MOO for supply chain [4][5][6][7][8][9][10][11][12][13][14][15][16][17].…”

Section: Introductionmentioning

confidence: 99%

Cuckoo search algorithm for multi-objective supply chain problem

Elkazzaz¹,

Mahmoud

Maher

2018

MATEC Web Conf.

View full text Add to dashboard Cite

A meta-heuristic algorithm called, the cuckoo search algorithm is proposed in dealing with the multi-objective supply chain model to find the optimum configuration of a given supply chain problem which minimizes the total cost and the total lead-time. The supply chain problem utilized in this study is taken from literature to show the performance of the proposed model; in addition, the results have been compared to those achieved by the bee colony optimization algorithm and genetic algorithm. Those obtained results indicate that the proposed cuckoo search algorithm is able to get better Pareto solutions (non-dominated set) for the supply chain problem.

show abstract

A Sensitivity Analysis of Multi-objective Cooperative Planning Optimization Using NSGA-II

Yahia

Ayadi

Masmoudi

2015

Applied Condition Monitoring

View full text Add to dashboard Cite

A Multi-objective Optimization for Multi-period Planning in Multi-item Cooperative Manufacturing Supply Chain

Cited by 6 publications

References 26 publications

Design of efficient multiobjective binary PSO algorithms for solving multi‐item capacitated lot‐sizing problem

Design of efficient multiobjective binary PSO algorithms for solving multi‐item capacitated lot‐sizing problem

Cuckoo search algorithm for multi-objective supply chain problem

A Sensitivity Analysis of Multi-objective Cooperative Planning Optimization Using NSGA-II

Contact Info

Product

Resources

About