scholarly journals Research on Fish Slicing Method Based on Simulated Annealing Algorithm

2021 ◽  
Vol 11 (14) ◽  
pp. 6503
Author(s):  
Shuo Liu ◽  
Hao Wang ◽  
Yong Cai

Multiobjective optimization is a common problem in the field of industrial cutting. In actual production settings, it is necessary to rely on the experience of skilled workers to achieve multiobjective collaborative optimization. The process of industrial intelligence is to perceive the parameters of a cut object through sensors and use machines instead of manual decision making. However, the traditional sequential algorithm cannot satisfy multiobjective optimization problems. This paper studies the multiobjective optimization problem of irregular objects in the field of aquatic product processing and uses the information guidance strategy to develop a simulated annealing algorithm to solve the problem according to the characteristics of the object itself. By optimizing the mutation strategy, the ability of the simulated annealing algorithm to jump out of the local optimal solution is improved. The project team developed an experimental prototype to verify the algorithm. The experimental results show that compared with the traditional sequential algorithm method, the simulated degradation algorithm designed in this paper effectively improves the quality of the target solution and greatly enhances the economic value of the product by addressing the multiobjective optimization problem of squid cutting. At the end of the article, the cutting error is analyzed.

2000 ◽  
Vol 33 (1) ◽  
pp. 59-85 ◽  
Author(s):  
A. SUPPAPITNARM ◽  
K. A. SEFFEN ◽  
G. T. PARKS ◽  
P. J. CLARKSON

2013 ◽  
Vol 2013 ◽  
pp. 1-7 ◽  
Author(s):  
Da-Wei Jin ◽  
Li-Ning Xing

The multiple satellites mission planning is a complex combination optimization problem. A knowledge-based simulated annealing algorithm is proposed to the multiple satellites mission planning problems. The experimental results suggest that the proposed algorithm is effective to the given problem. The knowledge-based simulated annealing method will provide a useful reference for the improvement of existing optimization approaches.


Author(s):  
Jonathan Cagan ◽  
Thomas R. Kurfess

Abstract We introduce a methodology for concurrent design that considers the allocation of tolerances and manufacturing processes for minimum cost. Cost is approximated as a hyperbolic function over tolerance, and worst-case stack-up tolerance is assumed. Two simulated annealing techniques are introduced to solve the optimization problem. The first assumes independent, unordered, manufacturing processes and uses a Monte-Carlo simulation; the second assumes well known individual process cost functions which can be manipulated to create a single continuous function of cost versus tolerance with discontinuous derivatives solved with a continuous simulated annealing algorithm. An example utilizing a system of friction wheels over the manufacturing processes of turning, grinding, and saw cutting bar stock demonstrates excellent results.


2014 ◽  
Vol 644-650 ◽  
pp. 2890-2897
Author(s):  
Wen Juan Xiao ◽  
Sheng Zhong

This paper proposes a distributed integrated quality of service (QoS) multicast routing algorithm, which based on genetic simulated annealing algorithm, for the wireless sensor networks (WSNs).The basic idea is to grade the huge and complicated network, and decentralize resource requirements and the computational overhead of source routing algorithm to the various nodes. In this way, each node just needs to know partial information and make local decisions. In addition, simulated annealing algorithm is introduced into genetic algorithm (GA), whose cooling schedules will be more sophisticated through adjustment of temperature attenuation function, combined with improved adaptive crossover and mutation probability though and heuristic crossover and mutation strategy, which can overcome premature convergence and low searching efficiency in late evolution of the genetic algorithm, also improve evolution speed of the simulated annealing algorithm. The algorithm can meet different QoS requirements of services, and have better performance than the original algorithm.


2014 ◽  
Vol 2014 ◽  
pp. 1-13 ◽  
Author(s):  
Bili Chen ◽  
Wenhua Zeng ◽  
Yangbin Lin ◽  
Qi Zhong

An enhanced differential evolution based algorithm, named multi-objective differential evolution with simulated annealing algorithm (MODESA), is presented for solving multiobjective optimization problems (MOPs). The proposed algorithm utilizes the advantage of simulated annealing for guiding the algorithm to explore more regions of the search space for a better convergence to the true Pareto-optimal front. In the proposed simulated annealing approach, a new acceptance probability computation function based on domination is proposed and some potential solutions are assigned a life cycle to have a priority to be selected entering the next generation. Moreover, it incorporates an efficient diversity maintenance approach, which is used to prune the obtained nondominated solutions for a good distributed Pareto front. The feasibility of the proposed algorithm is investigated on a set of five biobjective and two triobjective optimization problems and the results are compared with three other algorithms. The experimental results illustrate the effectiveness of the proposed algorithm.


2015 ◽  
Vol 744-746 ◽  
pp. 1919-1923
Author(s):  
Zhan Zhong Wang ◽  
Jing Fu ◽  
Lan Fang Liu ◽  
Rui Rui Liu

In this paper, we try to solve 3D offline packing optimization problem by combining two methods-genetic algorithm’ global performance and simulated annealing algorithm’ local performance. Given Heuristic rules in loading conditions, we use the optimal preservation strategy and the roulette wheel method to choose selection operator, integrating simulated annealing algorithm into genetic algorithm , and achieving code programming and algorithms by Matlab.This paper carries out an actual loading in a vehicle company in Changchun City, then makes a contrast between the final optimization results and each suppliers’ current packing data.The experimental results show that the algorithm has a certain validity and practicability in multiple container packing problem.


Sign in / Sign up

Export Citation Format

Share Document