A hybrid genetic algorithm for a dynamic logistics network with multi-commodities and components

Peng-Sheng You; Yi-Chih Hsieh; Hisn-Hung Chen

RAIRO - Operations Research (2011)

  • Volume: 45, Issue: 2, page 153-178
  • ISSN: 0399-0559

Abstract

top
Various topics related to reverse logistics have been discussed over the years. Most of them have assumed that facilities are kept open once they are established, and no returned products or recovery parts are stocked in intermediate recycling stations. However, firms may have the right to repeatedly open or close their facilities according to their economic benefits if they can acquire their facilities by lease. It also turns out that intermediate recycling stations like collection centers and disassembly centers usually stock returned products or parts in their facilities. By simultaneously relaxing these two assumptions, this study explores a logistics system with multiple items, each of which consists of some components among a variety of spare parts. The purpose is to maximize the total logistics costs by establishing a production schedule and reverse logistics framework over finite time periods for a logistics system. The mathematical model established in this study is a constrained linear integer programming problem. A genetic based algorithm is developed with the help of linear programming to find solutions to this problem. Limited computational experiments show that the proposed approach can produce better feasible solutions than the well-known CPLEX 10.0 software.

How to cite

top

You, Peng-Sheng, Hsieh, Yi-Chih, and Chen, Hisn-Hung. "A hybrid genetic algorithm for a dynamic logistics network with multi-commodities and components." RAIRO - Operations Research 45.2 (2011): 153-178. <http://eudml.org/doc/276360>.

@article{You2011,
abstract = { Various topics related to reverse logistics have been discussed over the years. Most of them have assumed that facilities are kept open once they are established, and no returned products or recovery parts are stocked in intermediate recycling stations. However, firms may have the right to repeatedly open or close their facilities according to their economic benefits if they can acquire their facilities by lease. It also turns out that intermediate recycling stations like collection centers and disassembly centers usually stock returned products or parts in their facilities. By simultaneously relaxing these two assumptions, this study explores a logistics system with multiple items, each of which consists of some components among a variety of spare parts. The purpose is to maximize the total logistics costs by establishing a production schedule and reverse logistics framework over finite time periods for a logistics system. The mathematical model established in this study is a constrained linear integer programming problem. A genetic based algorithm is developed with the help of linear programming to find solutions to this problem. Limited computational experiments show that the proposed approach can produce better feasible solutions than the well-known CPLEX 10.0 software. },
author = {You, Peng-Sheng, Hsieh, Yi-Chih, Chen, Hisn-Hung},
journal = {RAIRO - Operations Research},
keywords = {Reverse logistics; genetic algorithm; constrained integer programming; production schedule; inventory; reverse logistics; production schedule},
language = {eng},
month = {9},
number = {2},
pages = {153-178},
publisher = {EDP Sciences},
title = {A hybrid genetic algorithm for a dynamic logistics network with multi-commodities and components},
url = {http://eudml.org/doc/276360},
volume = {45},
year = {2011},
}

TY - JOUR
AU - You, Peng-Sheng
AU - Hsieh, Yi-Chih
AU - Chen, Hisn-Hung
TI - A hybrid genetic algorithm for a dynamic logistics network with multi-commodities and components
JO - RAIRO - Operations Research
DA - 2011/9//
PB - EDP Sciences
VL - 45
IS - 2
SP - 153
EP - 178
AB - Various topics related to reverse logistics have been discussed over the years. Most of them have assumed that facilities are kept open once they are established, and no returned products or recovery parts are stocked in intermediate recycling stations. However, firms may have the right to repeatedly open or close their facilities according to their economic benefits if they can acquire their facilities by lease. It also turns out that intermediate recycling stations like collection centers and disassembly centers usually stock returned products or parts in their facilities. By simultaneously relaxing these two assumptions, this study explores a logistics system with multiple items, each of which consists of some components among a variety of spare parts. The purpose is to maximize the total logistics costs by establishing a production schedule and reverse logistics framework over finite time periods for a logistics system. The mathematical model established in this study is a constrained linear integer programming problem. A genetic based algorithm is developed with the help of linear programming to find solutions to this problem. Limited computational experiments show that the proposed approach can produce better feasible solutions than the well-known CPLEX 10.0 software.
LA - eng
KW - Reverse logistics; genetic algorithm; constrained integer programming; production schedule; inventory; reverse logistics; production schedule
UR - http://eudml.org/doc/276360
ER -

References

top
  1. N. Brahimi, S. Dauzere-Peres, N.M. Najid and A. Nordli, Single item lot sizing problems. Eur. J. Oper. Res.168 (2006) 1–16.  
  2. C. Canel, B.M. Khumawala, J. Law and A. Loh, An algorithm for the capacitated, multi-commodity multi-period location problem. Comput. Oper. Res.28 (2001) 411–427.  
  3. K.W. Chau, A two-stage dynamic model on allocation of construction facilities with genetic algorithm. Automat. Constr.13 (2004) 481–490.  
  4. J. Dias, M.E. Captivo and J. Climaco, Efficient primal-dual heuristic for a dynamic location problem. Comput. Oper. Res.34 (2007) 1800–1823.  
  5. S.D. Ekşioğlu, Optimizing integrated production, inventory and distibution problems in supply chains. Ph. D. thesis, University of Florida, USA (2002) (fcla.edu/fcla/etd/UFE0000529).  
  6. M. Fleischmann, P. Beullens and J.M. Bloemhof-Ruwaard, The impact of product recovery on logistics network design. Prod. Oper. Manage.10 (2001) 156–173.  
  7. Y. Hinojosa, J. Kalcsics, S. Nickel, J. Puerto and S. Velten, Dynamic supply chain design with inventory. Comput. Oper. Res.35 (2008) 373–391.  
  8. R. Jans and Z. Degraeve, Meta-heuristics for dynamic lot sizing: A review and comparison of solution approaches. Eur. J. Oper. Res.177 (2007) 1855–1875.  
  9. V. Jayaraman, R.A. Patterson and E. Rolland, The design of reverse distribution network: Model and solution procedures. Eur. J. Oper. Res.150 (2003) 128–149.  
  10. J. Krarup and P.M. Pruzan, The simple plant location problem: survey and synthesis. Eur. J. Oper. Res.12 (1983) 36–81.  
  11. H.J. Ko and G.W. Evans, A genetic algorithm-based heuristic for dynamic integrated forward/reverse logistics network for 3PLs. Comput. Oper. Res.34 (2007) 346–366.  
  12. H.J. Ko, C.S. Ko and T. Kim, A hybrid optimization/simulation approach for a distribution network design of 3PLS. Comput. Ind. Eng.50 (2006) 440–449.  
  13. J. Krarup and P.M. Pruzan, The simple plant location problem: Survey and synthesis. Eur. J. Oper. Res.12 (1983) 36–57.  
  14. R.D. Kusumastuti, R. Piplani and G.H. Lim, Redesigning closed-loop service network at a computer manufacturer: A case study. Int. J. Prod. Econ.111 (2008) 244–260.  
  15. I.M. Langella, Heuristics for demand-driven disassembly planning. Comput. Oper. Res.34 (2007) 552–577.  
  16. H. Lee and M. Dong, A heuristic approach to logistics network design for end-of-lease computer products recovery. Transport. Res. E.44 (2008) 455–474.  
  17. K. Lieckens and N. Vandaele, Reverse logistics network design with stochastic lead times. Comput. Oper. Res. 34 (2007) 395–416.  
  18. Z. Lu and N. Bostel, A facility location model for logistics systems including reverse flows: The case of remanufacturing activities. Comput. Oper. Res.34 (2007) 299–323.  
  19. E. Melachrinoudis, H. Min and X. Wu, A multiobjective model for the dynamic location of landfills. Location Science3 (1995) 143–166.  
  20. M.T. Melo, S. Nickel and F.S. Gama, Dynamic multi-commodity capacitated facility location: a mathematical modeling framework for strategic supply chain planning. Comput. Oper. Res.33 (2005) 181–208.  
  21. Z. Michalewicz, Genetic Algorithms + Data Structures = Evolution Programs. 3rd edition, Springer-Verlag, London, UK (1996).  
  22. H. Min and H.J. Ko, The dynamic design of a reverse logistics network from the perspective of third-party logistics service providers. Int. J. Prod. Econ.113 (2008) 176–192.  
  23. H. Min, C.S. Ko and H.J. Ko, The spatial and temporal consolidation of returned products in a closed-loop supply chain network. Comput. Ind. Eng.51 (2006) 309–320.  
  24. G.C. Onwubolu and B.V. Babu, New optimization techniques in engineering. Springer-Verlag, Berlin, Heidelberg (2004) Chap. 2.  
  25. M.S. Pishvaee, R.Z. Farahani and W. Dullaert, A memetical gorithm for bi-objective integrated forward/reverse logistics network design. Comput. Oper. Res.37 (2005) 181–208.  
  26. C. Prahinski and C. Kocabasoglu, Empirical research opportunities in reverse supply chains. Omega-Int. J. Manage. Sci.34 (2006) 519–532.  
  27. M.I.G. Salema, A.P. Barbosa-Povoa and A.Q. Novais, An optimization model for the design of a capacitated multi-product reverse logistics network with uncertainty. Eur. J. Oper. Res.179 (2007) 1063–1077.  
  28. E.A. Silver, D.F. Pyke and R. Peterson, Inventory management and production planning and scheduling. 3rd edition, John Wiley & Sons, USA (1998).  
  29. M. Sodhi and B. Reimer, Models for recycling end-of-life products. OR-Spectrum23 (2001) 97–115.  
  30. T. Spengler, H. Püchert, T. Penkuhn and O. Rentz, Environmental integrated production and recycling management. Eur. J. Oper. Res.97 (1997) 308–326.  
  31. Z. Yongsheng and W. Shouyang, Generic Model of Reverse Logistics Network Design. J. Transport. Syst. Eng. Inf. Tech.8 (2008) 71–78.  
  32.  URIhttp://www.lindo.com/index.php

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.