Empirical working time distribution-based line balancing with integrated simulated annealing and dynamic programming

Leitold, Dániel; Vathy-Fogarassy, Ágnes; Abonyi, János

doi:10.1007/s10100-018-0570-7

Cited by 10 publications

(4 citation statements)

References 36 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The third offers a cooling scheme that mimics the physical annealing process to get a stable state for the problem. The SA performance can be augmented by adjusting various parameters and operators [ 25 ], such as initial temperature, descent gradient of temperature, and termination rule, which have to be adjusted manually. This paper mainly improves the search efficiency (timeliness) of the SA, without sacrificing the optimization quality.…”

Section: Improved Simulated Annealing Algorithmmentioning

confidence: 99%

An Improved Simulated Annealing-Based Decision Model for the Hybrid Flow Shop Scheduling of Aviation Ordnance Handling

Meng

Wang

Liu

et al. 2022

Computational Intelligence and Neuroscience

View full text Add to dashboard Cite

Aviation ordnance handling is critical to the firepower projection of the time-critical cyclic flight operation on aircraft carriers. The complexity of the problem depends on the supply and demand features of ordnance. This paper examines the scheduling of aviation ordnance handling of an operational aircraft carrier under the framework of hybrid flow shop scheduling (HFS) and derives a method based on the simulated annealing (SA) algorithm to get the HFS problem’s solution. The proposed method achieves the minimum possible flow time by optimizing the ordnance assignment through different stages. The traditional SA algorithm depends heavily on the heuristic scheme and consumes too much time to compute the optimal solution. To solve the problem, this paper improves the SA by embedding a task-based encoding method and a matrix perturbation method. The improved SA remains independent of the heuristic scheme and effectively propagates the local search process. Since the performance of SA is also influenced by its embedded parameters, orthogonal tests were carried out to carefully compare and select these parameters. Finally, different ordnance loading plans were simulated to reveal the advantage of the improved SA. The simulation results show that the improved SA (ISA) can generate better and faster solution than the traditional SA. This research provides a practical solution to stochastic HFS problems.

show abstract

Section: Improved Simulated Annealing Algorithmmentioning

confidence: 99%

An Improved Simulated Annealing-Based Decision Model for the Hybrid Flow Shop Scheduling of Aviation Ordnance Handling

Meng

Wang

Liu

et al. 2022

Computational Intelligence and Neuroscience

View full text Add to dashboard Cite

show abstract

“…Efficiency refers to the extent to which time, effort, or cost is used to carry out a planned activity to achieve the desired objective efficiently, meaning with a minimum generation of waste, expense, or unnecessary effort (Leitold et al, 2019). Therefore, efficiency is a measurable, quantitative concept determined by the input output ratio.…”

Section: Literature Reviewmentioning

confidence: 99%

Factors Influencing the Organization of Work in a Fish Processing Industrial Enterprise

Olkiewicz¹,

Okliewicz²,

Wolniak³

et al. 2020

ERSJ

View full text Add to dashboard Cite

“…Various hybrid approaches including SA are still being developed. Recently, for instance, Leitold et al (2018) proposed an algorithm integrating SA and dynamic programming for working time line balancing.…”

Section: Hybrid Approaches and Initial Solutionsmentioning

confidence: 99%

Effects of scatter plot initial solutions on regular grid facility layout algorithms in typical production models

Grobelny

Michalski

2019

Cent Eur J Oper Res

View full text Add to dashboard Cite

Two simulation experiments were conducted to verify whether the idea of virtual force scatter plot algorithm, used for searching solutions of the facility layout problems, may be used as an input to the classical CRAFT and simulated annealing (SA) algorithms. The proposed approach employs a regular grid for specifying possible locations of objects. Three independent variables were investigated in the first experiment, namely, (1) the size of the problem: 16, 36 and 64 objects, (2) the type of links between objects: grid, line, and loop, and (3) the shape of the possible places in which the objects can be situated: circle, row and square. The patterns of possible location places were also adapted to the analysis of examples taken from literature, included in the second experiment. The gathered data were statistically analyzed. The results shows substantial decrease in goal function means for all of the examined experimental conditions, if the proposed starting solutions are applied to the CRAFT algorithm. The application of the approach to SA is profitable in specific tasks. The presented comparative numerical results show, in which circumstances the proposed method is superior over various genetic algorithms and other hybrid approaches. Overall, the experimental data investigation demonstrates the usefulness of the proposed method and encourages further research in this direction.

show abstract

Empirical working time distribution-based line balancing with integrated simulated annealing and dynamic programming

Cited by 10 publications

References 36 publications

An Improved Simulated Annealing-Based Decision Model for the Hybrid Flow Shop Scheduling of Aviation Ordnance Handling

An Improved Simulated Annealing-Based Decision Model for the Hybrid Flow Shop Scheduling of Aviation Ordnance Handling

Factors Influencing the Organization of Work in a Fish Processing Industrial Enterprise

Effects of scatter plot initial solutions on regular grid facility layout algorithms in typical production models

Contact Info

Product

Resources

About