Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "Li, Ce" wg kryterium: Autor


Wyświetlanie 1-2 z 2
Tytuł:
Research on optimization of unrelated parallel machine scheduling based on IG-TS algorithm
Autorzy:
Chi, Xinfu
Liu, Shijing
Li, Ce
Powiązania:
https://bibliotekanauki.pl/articles/2173693.pdf
Data publikacji:
2022
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
warp knitting machine
parallel machine scheduling
iterative greedy algorithm
tabu search
osnowarka
planowanie maszyn równoległych
algorytm zachłanny iteracyjny
przeszukiwanie tabu
Opis:
This issue is a typical NP-hard problem for an unrelated parallel machine scheduling problem with makespan minimization as the goal and no sequence-related preparation time. Based on the idea of tabu search (TS), this paper improves the iterative greedy algorithm (IG) and proposes an IG-TS algorithm with deconstruction, reconstruction, and neighborhood search operations as the main optimization process. This algorithm has the characteristics of the strong capability of global search and fast speed of convergence. The warp knitting workshop scheduling problem in the textile industry, which has the complex characteristics of a large scale, nonlinearity, uncertainty, and strong coupling, is a typical unrelated parallel machine scheduling problem. The IG-TS algorithm is applied to solve it, and three commonly used scheduling algorithms are set as a comparison, namely the GA-TS algorithm, ABC-TS algorithm, and PSO-TS algorithm. The outcome shows that the scheduling results of the IG-TS algorithm have the shortest manufacturing time and good robustness. In addition, the production comparison between the IG-TS algorithm scheduling scheme and the artificial experience scheduling scheme for the small-scale example problem shows that the IG-TS algorithm scheduling is slightly superior to the artificial experience scheduling in both planning and actual production. Experiments show that the IG-TS algorithm is feasible in warp knitting workshop scheduling problems, effectively realizing the reduction of energy and the increase in efficiency of a digital workshop in the textile industry.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2022, 70, 4; art. no. e141724
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The vertical screw conveying characteristics of cohesive particle and optimization of design parameters
Autorzy:
Chen, Suifan
Zhang, Xiaomeng
Li, Qipeng
Shen, Ce
Shi, Yongchang
Powiązania:
https://bibliotekanauki.pl/articles/24200814.pdf
Data publikacji:
2023
Wydawca:
Polska Akademia Nauk. Polskie Naukowo-Techniczne Towarzystwo Eksploatacyjne PAN
Tematy:
discrete element method
conveying characteristics
NSGA-II
comprehensive evaluation
Opis:
The purpose of this paper is to solve the problem of low conveying efficiency and serious blade wear during vertical screw conveying of cohesive particles. Firstly, the reliability of DEM simulation was verified by comparing the simulated and theoretical values and the influence regularity of different design parameters (rotational speed, pitch, and clearance) on screw conveying characteristics were analyzed based on DEM. In addition, the effect of design parameters on the screw conveying characteristics is identified by ANOVA. Then, the multi-objective optimization model with the both of maximizing the average mass flow rate and minimizing the maximum wear depth of the blade was established using the polynomial fitting regression, which was solved by the non-dominated sorting genetic algorithm (NSGA-II). Finally, the comprehensive evaluation was used to determine the best design parameters. The above research results provide a certain reference for the study of cohesive particle’s vertical screw conveying characteristics and equipment optimization design.
Źródło:
Eksploatacja i Niezawodność; 2023, 25, 1; art. no. 13
1507-2711
Pojawia się w:
Eksploatacja i Niezawodność
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-2 z 2

    Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies