Closed-loop logistics (forward and reverse logistics) has received increased attention of late due to customer expectations, greater environmental concerns, and economic aspects. Unlike previous works, which consider single products or single periods in multi-objective function problems, this paper considers a multi-product multi-period closed-loop logistics network with regard to facility expansion as a facility location-allocation problem, which is closer to real-world scenarios. A multi-objective mixed integer nonlinear programming formulation is developed to minimize the total cost, the product delivery time, and the used product collection time. The model is linearized by defining new variables and adding new constraints to the model. Then, to solve the model, a priority-based genetic algorithm is proposed that uses straight encoding and decoding methods. To assess the performance of the above algorithm, its final solutions and CPU times are compared to those generated by an initial priority-based genetic algorithm from the recent literature and the lower bound obtained by CPLEX. The numerical results show that the straight priority-based genetic algorithm outperforms the initial priority-based genetic algorithm at least in terms of obtaining a reasonable quality of final solutions for closed-loop logistics problems.
Accepté le :
DOI : 10.1051/ro/2014032
Mots-clés : Closed-loop logistics, multi-objective decision making, genetic algorithm, forward and reverse logistics
@article{RO_2015__49_2_243_0,
author = {Mehrbod, Mehrdad and Xue, Zhaojie and Miao, Lixin and Lin, Wei-Hua},
editor = {Blazewicz, Jacek and Pesch, Erwin and Philipps, Cynthia and Trystram, Denis and Zhang, Guochuan},
title = {A {Straight} {Priority-Based} {Genetic} {Algorithm} for a {Logistics} {Network}},
journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
pages = {243--264},
publisher = {EDP-Sciences},
volume = {49},
number = {2},
year = {2015},
doi = {10.1051/ro/2014032},
zbl = {1310.90015},
language = {en},
url = {http://www.numdam.org/articles/10.1051/ro/2014032/}
}
TY - JOUR AU - Mehrbod, Mehrdad AU - Xue, Zhaojie AU - Miao, Lixin AU - Lin, Wei-Hua ED - Blazewicz, Jacek ED - Pesch, Erwin ED - Philipps, Cynthia ED - Trystram, Denis ED - Zhang, Guochuan TI - A Straight Priority-Based Genetic Algorithm for a Logistics Network JO - RAIRO - Operations Research - Recherche Opérationnelle PY - 2015 SP - 243 EP - 264 VL - 49 IS - 2 PB - EDP-Sciences UR - http://www.numdam.org/articles/10.1051/ro/2014032/ DO - 10.1051/ro/2014032 LA - en ID - RO_2015__49_2_243_0 ER -
%0 Journal Article %A Mehrbod, Mehrdad %A Xue, Zhaojie %A Miao, Lixin %A Lin, Wei-Hua %E Blazewicz, Jacek %E Pesch, Erwin %E Philipps, Cynthia %E Trystram, Denis %E Zhang, Guochuan %T A Straight Priority-Based Genetic Algorithm for a Logistics Network %J RAIRO - Operations Research - Recherche Opérationnelle %D 2015 %P 243-264 %V 49 %N 2 %I EDP-Sciences %U http://www.numdam.org/articles/10.1051/ro/2014032/ %R 10.1051/ro/2014032 %G en %F RO_2015__49_2_243_0
Mehrbod, Mehrdad; Xue, Zhaojie; Miao, Lixin; Lin, Wei-Hua. A Straight Priority-Based Genetic Algorithm for a Logistics Network. RAIRO - Operations Research - Recherche Opérationnelle, New challenges in scheduling theory, Tome 49 (2015) no. 2, pp. 243-264. doi : 10.1051/ro/2014032. http://www.numdam.org/articles/10.1051/ro/2014032/
, , and , A steady-state genetic algorithm for multi-product supply chain network design. Comput. Ind. Engrg. 56 (2009) 521–537. | DOI
, , and , A genetic algorithm approach for multi-objective optimization of supply chain networks. Comput. Ind. Engrg. 51 (2006) 196–215. | DOI
K. Deb et al. Multi-objective optimization using evolutionary algorithms, Vol. 2012. John Wiley & Sons Chichester (2001). 0970.90091
, and , A stochastic model for forward–reverse logistics network design under risk. Comput. Ind. Engrg. 58 (2010) 423–431. | DOI
, and , A genetic algorithm for two-stage transportation problem using priority-based encoding. Or Spectrum 28 (2006) 337–354. | DOI | Zbl
M. Gen and R. Cheng, Genetic algorithms and engineering optimization, Vol. 7. John Wiley & Sons (2000).
M. Gen and Y. Li, Spanning tree-based genetic algorithm for the bicriteria fixed charge transportation problem, in Evolutionary Computation, 1999. CEC 99. Proceedings of the 1999 Congress on, Vol. 3. IEEE (1999).
, and , A closed-loop logistics model for remanufacturing. J. Oper. Res. Soc. (1999) 497–508. | DOI | Zbl
and . The simple plant location problem: survey and synthesis. Eur. J. Oper. Res. 12 (1983) 36–81. | DOI | Zbl
, and , Multiobjective model and solution method for integrated forward and reverse logistics network design for third-party logistics providers. Transp. Res. Record: Journal of the Transportation Research Board 2032 (2007) 43–52. | DOI
, A generic stochastic model for supply-and-return network design. Comput. Oper. Res. 34 (2007) 417–442. | DOI | Zbl
and , The return plant location problem: Modelling and resolution. Eur. J. Oper. Res. 104 (1998) 375–392. | DOI | Zbl
, and , A nonstandard genetic algorithm for the nonlinear transportation problem. ORSA J. Comput. 3 (1991) 307–316. | DOI | Zbl
, and . Multi-objective genetic algorithm and its applications to flowshop scheduling. Comput. Ind. Engrg. 30 (1996) 957–968. | DOI
, and , A memetic algorithm for bi-objective integrated forward/reverse logistics network design. Comput. Oper. Res. 37 (2010) 1100–1112. | DOI | Zbl
, and , A robust optimization approach to closed-loop supply chain network design under uncertainty. Appl. Math. Modell. 35 (2011) 637–649. | DOI | Zbl
and , A possibilistic programming approach for closed-loop supply chain network design under uncertainty. Fuzzy Sets Syst. 161 (2010) 2668–2683. | DOI | Zbl
Cité par Sources :
