论文信息 - Mathematical modelling of traveling salesman problem (TSP) by implementing simulated annealing and genetic algorithms - 字舞流文

Mathematical modelling of traveling salesman problem (TSP) by implementing simulated annealing and genetic algorithms

F M Puspita | S Yahdin | A Meitrilova | A. Meitrilova | S. Yahdin | F. Puspita

[1] Sandro Ridella,et al. Minimizing multimodal functions of continuous variables with the “simulated annealing” algorithmCorrigenda for this article is available here , 1987, TOMS.

[2] I Gede Agus Widyadana,et al. PERBANDINGAN KINERJA ALGORITMA GENETIKA DAN SIMULATED ANNEALING UNTUK MASALAH MULTIPLE OBJECTIVE PADA PENJADWALAN FLOWSHOP , 2004 .

[3] Fitri Maya Puspita,et al. Robust Counterpart Open Capacitated Vehicle Routing (RC-OCVRP) Model in Optimization of Garbage Transportation in District Sako and Sukarami, Palembang City , 2018, International Journal of Electrical and Computer Engineering (IJECE).

[4] R. Chibante. Simulated Annealing, Theory with Applications , 2010 .

[5] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.

[6] Bruce E. Rosen,et al. Genetic Algorithms and Very Fast Simulated Reannealing: A comparison , 1992 .

[7] Fitri Maya Puspita,et al. Model of Demand Robust Counterpart Open Capacitated Vehicle Routing Problem (DRC-OCVRP) Simplification by Applying Preprocessing Techniques in Rubbish Controlling in Sematang Borang District, Palembang , 2018 .