Algoritma Ant Colony Optimization pada Quadratic Assignment Problem
Abstract
Keywords
Full Text:
PDF (Bahasa Indonesia)References
Hillier, S.F., & Lieberman, 2004, Introduction to Operations Research, Eighth Edition, New York: Mc Graw-Hil
Erlanda, C., 1998, The Quadratic Assignment Problem, Springer Science and Business Media Dordrecht
Dorigo, M. & Stutzle, T., 2004, Ant Colony Optimization, Massachusetts Institute of Technology
Hahn, P. & Grant, T., 1998, Lower Bounds for the Quadratic Assignment Problem Based Upon a Dual Formulation, Operation Research, Vol. 46, No. 6
Bidyarthy, S.A. & Vivek, G., 2013, Ant Colony Optimization for Quadratic Assignment Problem and School Bus Routing Problem. Departement of Mathematics Indian Institute of Technology Guwahati
Davendra, D. & Zelinka, I., 2009, Optimization of Quadratic Assignment Problem Using Self Organising Migrating Algorithm, Computing and Informatics, Vol. 28: 1001–1012
Christopher, N.E, 1967, An Experimental Comparison of Tech-Niques for the Assignment of Facilities to Locations INFORMS
Axel, N., 2014, Some Reformulations for the Quadratic Assignment Problem, Department of Chemical Engineering Åbo Akademi University http://www.qaplib/inst.html
DOI: https://doi.org/10.34312/jjom.v1i2.2353
Copyright (c) 2019 Jambura Journal of Mathematics
EDITORIAL OFFICE OF JAMBURA JOURNAL OF MATHEMATICS |
Department of Mathematics, Universitas Negeri Gorontalo Jl. Jenderal Sudirman No.6, Kota Gorontalo, Provinsi Gorontalo 96128, Indonesia |
Email: info.jjom@ung.ac.id |
+62-852-55230451 (Call/SMS/WA) |
Jambura Journal of Mathematics (p-ISSN: 2654-5616 | e-ISSN: 2656-1344) by Department of Mathematics Universitas Negeri Gorontalo is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License. Powered by Public Knowledge Project OJS. |