- Các tác tửOneDCSP SSolver thực hiện việc giải các bài tốn
Tài liệu tiếng Anh [4|
324.
Phan Thị Hồi Phương, Lương Chi Mai, Nguyễn Văn Hùng (2009) ,
“Một thuật tốn lai ghép giải bài tốn cắt vật tư một chiều với nhiều kích
thước vật liệu thơ”, Tạp chí Tin học và Điểu khiển học, 25(3), pp.214-
230.
Phan Thị Hồi Phương, Lương Chi Mai (2010), “GMAS-1IDMCSP: Hệ
thống đa tác tử gen giải bài tốn cắt vật tư một chiều với nh iều kích thước
vật liệu thơ ”, Tạp chí Khoa học và Cơng nghệ, 48(6). pp.37-58.
Tài liệu tiếng Anh [4| [4| [5] [6] L7] [8] [9]
Back T. (1996), Evolutionary Algorithms in Theory and Praciice, Oxford University Press, Oxford, UK.
Back T. et all (2000), káas. Evwolufionary ComputaHon l: Basic Algortthtms and @perafors, Institute of Phisics Publishing, Bristol.
Back T. et all (2000), kás. EvoluHonary Computation 2: Advanced Algorithms and Operafors, Institute of Phisics Publishing, Bristol.
Banzhaf W. et all (1998), kás. Genetic Programming: An Introducfion, Morgan Kaufmamn, San FrancIsco.
Barbucha Dariusz and Je,drzejowicz Plotr (2007), “An Agent-Based Approach to Vehicle Routing Problem”, World Academy oƒ Science, kngineering and Technology, 26.
Bellifemine Fablio, Caire GŒ., Greenwood D. (2007), “DevelopIing multi- agent systems wIth JADE”, Wiiley Series in Ágent Technology, [SBN 978- 0-470-05747-6.
72
[10] Bellifemine Fabio et all (2008), “JADE: A software framework for developing multi-agent applicatlons. Lessons learned”, ?nƒformafion and Sofiware Technology 50, pp.10-21.
[11] Belov Gleb and Scheithauer GŒ. (2002), “A cutting plane algorithm for the one-dimensional cutfting stock problenm with multiple stock lengths”, kuropean Journal oƒ OQperational Research 141(2), pp.274-294, Speclal 15sue on cutting and packing.
[12] Belov Gleb and Scheithauer G. (2003), “A branch-and-cut-and-price algorithm for one-dimenslonal stock cutting and two-dimensional two- stape cutting”, TechmcalÐ reporí, Dresden Ủniversity, URL: www.math.tu-dresden.de/“capad.
[I3jl Belov Gleb and Scheithauer G. (2003), “Setup and open stacks m1mmm1izaton 1n one-dimensional stock cutting”, Techmcal report, Dresden Un1versity.
[14] Belov Gleb (2004), Problems, Models and A4igorithms in One- and Two- Dimensional Cuffing, DIssertation, TÙ Dresden.
[15] Chra C., M. Pintea C., Dumitrescu D. (2008), “An Agent-Bascd Approach to Combinatorial (Optimizaton”, . J. of Compufers, CommumicaHons @& Comtroi Vol lll SuDpDÌL issue: Proceedings oƒ T!CCCC 2006, pp.212-217
[16] Corkml D. D. (1991), “Blackboard systems”, 4T Experr, 6(9), pp.40_-47. [17] De Jong K.A. (1975), 4n Analysis oƒa class oƒ Genetic Ádaptive Systerms,
PhD thesis, University of Michigan.
[18] Eiben A.E. et all (1998), Eas. Evolufionary Compufafion, IOS Press. [19] Engelmore R. §. and Morgan A. (1988), editors. Biackboard Systems.
Addison-Wesley.
[20] Eshghi K., Javanshr H. (2005), “An ACO algorithm for one- dimensional cutting stock problem”, Jourznal oƒ Industrial Engineering
lnternaHonal, Islamic Azad ỦnIverstty, Tehran South Branch, 1(1), pp.10- 9.
[21] Falkenauer E. (1996) “A hybrid grouping genetic algorithim for bím packIng”, Journal oƒ Heurisfics, 2(1), pp.5-30.
[22] Fogel D.B. (1998), đ. Evolutionary Computation: the Fossil Record, IEEE Press, PIscataway, NI.
[23] Fogel L.J. et all (1965), “Artificial Intelligence through a Simulation of evolution”, In: A. Callahan et all, Eás. Biophisics and Cybernefic Sysfems, Spartan, Washington DC, pp.131-15ĩ6.
[24] Fogel L.J. et all (1966), 4zrficial Inteligence through Simulated kbyoiufon, Wlley, Chichester, ỨK.
[25] GawineckIl MacleJ, Frackowlak Grzegorz (2008), “Multi-Agent Systems with JADE: A Guide with Extensive Study”, Disfributed Systems Online, ILEE, 9 (3).
[26] Gilimore, P. C., R. E. Gomory (1961), “A linear programming approach to the cutting-stock problem”, @Qperafional Research, 9, pp.849-859. [27] Giimore, P. C., R. E. Gomory (1963), “A linear programming approach
to the cutting stock problem——Part II”, @perafional Research, l1] pp.863— 888.
[28] Holland J.H. (1973), “Genetic Algorithms and the optimal Allocatlon of trials”, SAMJ. ofcomputing 2, pp.88-105.
[29] Holland J.H. (1992), 4daptation ín Natural and Artificial Systems, MLI Press, Cambridge, MA.
[30] Holthaus O. (2002), “Decomposition approaches for solving the Infeger one dimensilonal cufting stock problem with different types of standard lengths ”, European Journal oƒ Qperational Research 141, pp.295—3 12. [31] Jagannathan V., Dodhiawala R., and Baum L. S. (1989), editors.
74
[32] Jahromi M.H.M.A.., Tavakkoli-Moghaddam R., GrivakI E., Rezapour-Z1Iba A. (2011), “A simulated annealng approach for a standard one- dimenslonal cutting stock problem”, „ernafional Journal oƒ Ácademic Research, 3(1).
[33] Javanshir H. , Shadalooee M. (2007), “The trim loss concentratlon 1n one- dimensional cutting stock problem (1D-CSP) by defining a virtual cosf”, Journal oƒ Industrial Engineering International, [slamic Azad ỨnIversity,
South Tehran Branch, 3(4), pp.51-58.
[34] JẹdrzeJowlcz Piotr and Wlerzbowska Izabela (2006), “JADE-Based A- Team Environment”, Lecfure Nofes in Compufer Science, 3993/2006, pp.719-726.
[35J Kantorovich L. (1960), “Mathematical methods im the organ1zation and planning of production”, M4anagemermf Science, 6, pp.550-559
[36] Kazemi A. and Zarandi M.H. Fazel (2008), “An Agent-Based Framework for Building Decision Support System 1n Supply Chain Managementf”, Journal oƒ Appied Sciences, 8(7), pp.1125-1137.
[37] Koza J.R., Genetic Programming (1992), MIT Press, Cambridge, MA. [38] Koza J.R. Genetic Programmnng II (1994), MIT Press, Cambridge, MA. [39] Liang K. H..,, Yao X., Newton C., Hoffman D. (2002), “A new
evolutionary approach to cufting stock problems with and without contigulity”, Cømpwufers & (@perafions Research 29(12), pp.1641-59. [40] Michalewicz Z. (1996), Genetic Algorithms+Data Structure=EvoluHon
Programs, Šptinger, Berlin, Heidenberg, New York, 3" ed.
[41] Phan Thị Hoai Phuong (2008), “The limit behavior and convergence of genetic algorithm on a class of functlons”, 2006 IEEE International Conƒference on Research, InnovaHon and PVision ƒor the Future im Computing and Communications Technologies (RIVF), Ho Chỉ Minh City, Vietnam (Short paper), pp.76-79.
[42] Phan Thị Hoai Phuong (2011), “Hybridization of genetic algorithm and branch-and-price framework for solving The One Dimensional Cutting Stock Problem with Multiple Stock S1zes”, accepted for 2012 IEEE International Conference on Research, InnovaHon and Vision ƒor the kKuture in Computing qnả Communications Technologies (RIVF), Ho Chì Minh City, Vietnam (Long paper).
[43] Raymond Chiong, Ool Koon Beng (2007), “A Comparlson between Genetic Algorithms and Evolutionary Programming based on Cutting Stock Problem”, Engineerimg Leffers, 14:1, EL 14 1 14 (Advance online publication).
[44] Rietz J. and Dempe §. (2008), “Large Gaps In One-dimensional Cutting Stock Problems”, Discrete Ápplied Mathemafics, 156 (10).
[45] Rudolph Gunter (1994), “Convergence Analysis of Canonical Genetic Algorithms”, IkbkkE Transactions on Neurai Nefworks, 5(1), pp.96-101. [4ĩ] Rudolph Gunter (1997), “Convergence propertles of evolutlonary
algorithms”, Hamburg, Gemany: Verlag Kovac, ISBN 3-86064-554-4. [47] Schwefel H.P., Manner R. (1995), Eás. Evolutfion and Optimum Seeking,
Wiley, New York.
[48] Sivio A.ArauJo, Ademir A. Constantino, Kelly C. Poldi (2011), “An evolutionary algorithm for the one-dimensional cutting stock problem”, Tmternational Transaction in Operation Research,18(1), pp.115-127.
[49] Talukdar §. (1993), “Asynchronous Teams”, Pzoceedings oƒ The 4”
lmternaHonal Symposiumn on Expert Systemns Applications f0 Power Sysfems, LaTrobe University, Melbourne, Australia.
[50] Talukdar §. et all (1996), “Asynchronous Teams: Co-operation Schemas for autonomous”, Compufer-Based agemts, Technical Report EDRC I§- 29-96, Engineering Design Research Center, Carnegie Mellon University. [5l] Toyoda Johsuke , Takeyasu Kazuhrro (2007), “Extended elitism method
76
Mmịormalion SWstems ƒor Logisics qnd Management (UISLM), 3(1), pp.47-59.
[52] Toyoda J., Takeyasu K. (2008), “A revised first fit algorithmfor timber precutting”, Iníernational Journal oƒ Computational Science, 2(1), pp.92-
107.
[53] Toyoda Johsuke , Takeyasu Kazuhiro (2010),”A Genetic Algorithm sing Tournament( Crossover Operation for Cutting Stock Problem”, ImternaHonal Journal oƒ the InƒormaHon Systems ƒor Logisics qnd Management (1JISLM), 5(2).
[54] Irappey Charles V. et all (2009), “The design of a JADE-based autonomous workflow management system for collaboratve SoC design”, Expert Systems with Ápplications, 36, pp.2659-2669.
[5Š] Valério de Carvalho J.M.(1999), "Exact solution of bin-packing problems using column generatlon and branch-and-bound”, 4nnwais oƒ Qperafions Research, 86, pp. 629-659.
[56] Valério de Carvalho J.M., Cláudio Alves (2008), "A Stabilized Branch- and-Price-and-Cut Algorithm for the Multiple Length Cutting Stock Problem”", Computers and Operations Research, 35 (4) pp. 1315-1328. [Š7] Waescher G., HauBner H., and Schumann Holger (2007), “An Improved
topology of cutting and packing problems”, Ewzopean Journal oƒ Operafional Research, 183, pp.I109-1130.
[58] Wongprakornkul Sirmat (2008), “Round Down Technique for Solving an Integer Linear Programming”, KKU Science Journal, 36, pp.18§7-198. [59] Yakawa Tetsuya, Iima Hitoshi, Sannomiya Nobuo (2005), “Proposition
of Genetic Algorithm for Bin Packing Problems”, Transacfions oƒ the Society 0ƒ lnstrument and Contfrol Engineers, 41(3), pp.274-282.
[60] Yang Chien-Tung, Sung Tso-Chung, Weng WeiChu (2006), “An Improved tabu search approach with rmixed obJective function for one-
dimensional cutting stock problems”, 4dwances in Engineering Soƒfiware, 37(8), pp.502-513.
78
PHỤ LỤC
Giả mã đặc tả chức năng của từng I oại tác tử trong hệ thống GMAS-OneDCSP_M