Daftar Pustaka Skripsi Algoritma Genetik untuk Pemecahan Traveling Salesman Problem

DAFTAR PUSTAKA

1. Black, E, Paul, “Dictionary of Algorithms, Data Structures, and Problems”, internet dictionary, http://www.nist.gov/dads/html,
   Email: paul.black@nist.gov, 2001.
2. Boese, K, D, “Models for Iterative Global Optimization”, PhD thesis, UCLA, Computer Science Department, 1996.
   Available at : http://nexus6.cs.ucla.edu/~boese/thesiscont.html
3. Bronson, Richard, PhD, “Teori dan Soal-Soal Operations Research”, Seri buku Schaum’s, terjemahan, Erlangga, 1993.
4. Dimyati, Tjutju, Tarliyah dan Dimyati, Ahmad, “Operations Research, Model- Model Pengambilan Keputusan”, Edisi Kedua, Sinar Baru, Bandung, 1992.
5. Eko, Wiyanto, “Simulasi Seleksi Untuk Meningkatkan Produktivitas Ternak Sapi”, Master Thesis, Program Pascasarjana, Institut Pertanian Bogor, 1996.
6. Faris, N, AbuAli, Wainwright, Roger, L, “Solving The Subset Interconnection Design Problem Using Genetic Algorithms”, ACM / SIGAPP Symposium on Applied Computing, February 18-20, 1996, Philadelphia, PA, Pages 299-304, ACM Press.
7. Fredman, M. L., Johnson, D. S, et. al. “Data Structures for Traveling Salesmen”, 1995.
   Available at : http://www.research.att.com/~dsj/papers/
8. Freisleben, Bernd, Merz, Peter. “A Genetic Local Search Algorithm for Solving Symmetric and Asymmetric Traveling Salesman Problems”, Department of Electrical Engineering and Computer Science (FB 12) University of Siegen Hölderlinstr. 3, D-57068 Siegen, Germany, 1996.
   Available at : ftp://ftp.informatik.uni-siegen.de/pub/papers/pmerz/
   E-mail: ffreisleb,pmerzg@informatik.uni-siegen.de
9. Freisleben, Bernd, Merz, Peter. “New Genetic Local Search Operators for the Traveling Salesman Problem ”, Department of Electrical Engineering and Computer Science (FB 12) University of Siegen Hölderlinstr. 3, D-57068 Siegen, Germany, 1996.
   Available at : ftp://ftp.informatik.uni-siegen.de/pub/papers/pmerz/
10. Freisleben, Bernd, Merz, Peter. “Genetic Local Search for the TSP: New Results”, Department of Electrical Engineering and Computer Science (FB 12) University of Siegen Hölderlinstr. 3, D-57068 Siegen, Germany, 1997.
    Available at : ftp://ftp.informatik.uni-siegen.de/pub/papers/pmerz/
    E-mail: ffreisleb,pmerzg@informatik.uni-siegen.de
11. Johnson, David, S and McGeoch, Lyle, A, “Local Search in Combinatorial Optimization, The Traveling Salesman Problem: A Case Study in Local Optimization”, preliminary version, John Wiley and Sons, London, 1997.
    Available at : http://www.research.att.com/~dsj/papers/
12. Kruse, L, Robert, “Data Structure and Program Design”, Prentice Hall of India, New Delhi, 1987.
13. LaLena, Michael. “Travelling Salesman Problem Using Genetic Algorithms”. 1998. Available at : http://www.lalena.com/ai/tsp/

 


 


14. Moscato Pablo, “On Evolution, Search, Optimization Genetic Algorithms and Martial Arts : Towards Memetic Algorithms”. California Institute of Technology. Pasadena, CA 91125, U.S.A.1989.
    Available at : ftp://ftp.ing.unlp.edu.ar/pub/papers/memetic/
15. Moscato, Pablo, Tinetti, Fernando. “Blending Heuristics with a Population-Based Approach: A Memetic Algorithm for the Traveling Salesman Problem”, Centro de Técnicas Analógico – Digitales, Universidad Nacional de La Plata, Argentina, 1992.
    Available at : ftp://ftp.ing.unlp.edu.ar/pub/papers/memetic/
16. Mühlenbein, Heinz. “How genetic algorithms really work : Mutation and Hillclimbing”, GMD Schloss Birlinghoven, D-5205 Sankt Augustin1, 1992.
    Available at : ftp://borneo.gmd.de/pub/as/ga/
    E-mail: muehlenbein@gmd.de
    Mühlenbein, Heinz. “Parallel Genetic Algorithm In Combinatorial Optimization” GMD Schloss Birlinghoven. D-5205 Sankt Augustin 1. 1992.
    Available at : ftp://borneo.gmd.de/pub/as/ga/gmd_as_ga-92_01.ps
    E-mail: muehlenbein@gmd.de
17. Muller, H, J, “Studies In Genetics, the Selected Papers”, Indian Edition, Oxford & IBH Publishing, New Delhi, 1974.
18. Pressman, Roger, S, PhD, “Software Engineering, A Practitioner’s Approach, Fifth Edition”, International Edition, McGraw Hill, Singapore, 2001.
19. Radcliffe, Nicholas J., Surry, Patrick D. “Formal Memetic Algorithms”, Edinburgh Parallel Computing Centre, King’s Buildings, University of Edinburgh Scotland, EH9 3JZ, 1994.
    Available at : ftp://ftp.epcc.ed.ac.uk/pub/tr/94/
    E-mail : njr@epcc.ed.ac.uk, pds@epcc.ed.ac.uk
20. Rinaldi Munir, MT, “Buku Teks Ilmu Komputer Matematika Diskrit”, Informatika, CV, Bandung, 2001
21. Schlierkamp-Voosen, Dirk, Mühlenbein, Heinz. “Strategy Adaptation by Competing Subpopulations”, GMD Schloß Birlinghoven. D-53754 Sankt Augustin, Germany, 1994.
    Available at : ftp://borneo.gmd.de/pub/as/ga/
22. Taha, A, Hamdy, “Riset Operasi: Suatu Pengantar”, Jilid 1, terjemahan, Binarupa Aksara, Jakarta, 1996.
23. Wartomo, Hardjosubroto, MSA “Aplikasi Pemuliabiakan Ternak di Lapangan”, Grasindo, Jakarta, 1994.
24. Warwick, E, J, “Pemuliaan Ternak”, Cetakan Kelima, Gadjah Mada University Press, Yogyakarta, 1995.
25. Wildan, Yatim, Drs, “Genetika”, Edisi Ketiga, Tarsito, Bandung, 1980.
26. Yourdon, Edward, “Modern Structured Analisys”, Yourdon Press, Prentice Hall, New Jersey, 1989.

 
.

Artikel yang berkaitan :

• Terminologi Genetik Dalam Penelitian Traveling Salesman Problem
• Sekilas Mengenai Path, Cycle dan Hamiltonian Cycle
• Sekilas Mengenai Graph Problem
• Penggunaan Algoritma Genetik Pencarian Lokal (Genetic Local Search) Untuk Penyelesaian Traveling Salesman Problem (TSP)
• Operator Algoritma Genetik: Mutasi
• Operator Algoritma Genetik: Crossover
• Mengenal Algoritma Genetik
• Maksud, Tujuan, dan Kegunaan Penelitian Traveling Salesman Problem (TSP)
• Lebih Lanjut Mengenai Symmetric dan Asymmetric Traveling Salesman Problem (TSP)
• Kenapa Menggunakan Metode Genetik Local Search untuk Traveling Salesman Problem?