A Probabilistic Algorithm for Calculating Structure: Borrowing from Simulated Annealing

Simulated annealing is a probabilistic algorithm for approximately solving large combinatorial optimization problems. The algorithm can mathematically be described as the generation of a series of Markov chains, in which each Markov chain can be viewed as the outcome of a random experiment with unknown parameters (the probability of sampling a cost function value). Assuming a probability distribution on the values of the unknown parameters (the prior distribution) and given the sequence of configurations resulting from the generation of a Markov chain, we use Bayes's theorem to derive the posterior distribution on the values of the parameters. Numerical experiments are described which show that the posterior distribution can be used to predict accurately the behavior of the algorithm corresponding to the next Markov chain. This information is also used to derive optimal rules for choosing some of the parameters governing the convergence of the algorithm.

Download Full-text

Penjadwalan Produksi Menggunakan Metode Simulated Annealing pada Unit Produksi Daun Pintu di PT. ML

Talenta Conference Series Energy and Engineering (EE) ◽

10.32734/ee.v2i2.445 ◽

2019 ◽

Vol 2 (2) ◽

Author(s):

Rosnani Ginting ◽

Chairul Rahmadsyah Manik

Keyword(s):

Simulated Annealing ◽

Problem Solving ◽

Production Scheduling ◽

Production Control ◽

Delivery Time ◽

Production Schedule ◽

A Company ◽

Predetermined Time ◽

Factory Floor

Penjadwalan merupakan aspek yang sangat penting karena didalamnya terdapat elemen perencanaan dan pengendalian produksi bagi suatu perusahaan yang dapat mengirim barang sesuai dengan waktu yang telah ditentukan, untuk memperoleh waktu total penyelesaian yang minimum. Masalah utama yang dihadapi oleh PT. ML adalah keterlambatan penyelesaian order yang mempengaruhi delivery time ke tangan costumer karena pelaksanaan penjadwalan produksi dilantai pabrik belum menghasilkan makespan yang sesuai dengan order yang ada. Oleh kaena itu dituntut untuk mencari solusi pemecahan masalah optimal dalam penentuan jadwal produksi untuk meminimisasi total waktu penyelessaian (makespan) semua order. Dalam penelitian ini, penjadwalan menggunakan metode Simulated Annealing (SA) diharapkan dapat menghasilkan waktu total penyelesaian lebih cepat dari penjadwalan yang ada pada perusahaan. Scheduling is a very important aspect because in it there are elements of planning and production control for a company that can send goods in accordance with a predetermined time, to obtain a minimum total time of completion. The main problem faced by PT. ML is the delay in completing orders that affect delivery time to customer because the implementation of production scheduling on the factory floor has not produced the makespan that matches the existing order. Therefore, it is required to find optimal problem solving solutions in determining the production schedule to minimize the total time of elimination (makespan) of all orders. In this study, scheduling using the Simulated Annealing (SA) method is expected to produce a total time of completion faster than the existing scheduling in the company.

Download Full-text