Nothing Special   »   [go: up one dir, main page]

You seem to have javascript disabled. Please note that many of the page functionalities won't work as expected without javascript enabled.
 
 
Sign in to use this feature.

Years

Between: -

Subjects

remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline

Journals

remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline

Article Types

Countries / Regions

remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline

Search Results (903)

Search Parameters:
Keywords = scheduling mechanism

Order results
Result details
Results per page
Select all
Export citation of selected articles as:
22 pages, 2753 KiB  
Article
Two-Stage Satellite Combined-Task Scheduling Based on Task Merging Mechanism
by Jing Yu, Jiawei Guo, Lining Xing, Yanjie Song and Zhaohui Liu
Mathematics 2024, 12(19), 3107; https://doi.org/10.3390/math12193107 - 4 Oct 2024
Viewed by 276
Abstract
Satellites adopt a single-task observation mode in traditional patterns. Although this mode boasts high imaging accuracy, it is accompanied by a limited number of observed tasks and a low utilization rate of satellite resources. This limitation becomes particularly pronounced when dealing with extensive [...] Read more.
Satellites adopt a single-task observation mode in traditional patterns. Although this mode boasts high imaging accuracy, it is accompanied by a limited number of observed tasks and a low utilization rate of satellite resources. This limitation becomes particularly pronounced when dealing with extensive and densely populated observation task sets because the inherent mobility of satellites often leads to conflicts among numerous tasks. To address this issue, this paper introduces a novel multi-task merging mechanism aimed at enhancing the observation rate of satellites by resolving task conflicts. Initially, this paper presents a task merging method based on the proposed multitask merging mechanism, referred to as the constrained graph (CG) task merging approach. This method can merge tasks while adhering to the minimal requirements specified by users. Subsequently, a multi-satellite merging scheduling model is established based on the combined task set. Considering the satellite combined-task scheduling problem (SCTSP), an enhanced fireworks algorithm (EFWA) is proposed that incorporates the CG task synthesis mechanism. This algorithm incorporates local search strategies and a population disturbance mechanism to enhance both the solution quality and convergence speed. Finally, the efficacy of the CG algorithm was validated through a multitude of simulation experiments. Moreover, the effectiveness of the EFWA is confirmed via extensive comparisons with other algorithms, including the basic ant colony optimization (ACO) algorithm, enhanced ant colony optimization (EACO) algorithm, fireworks algorithm (FWA), and EFWA. When the number of tasks in the observation area are dense, such as in the case where the number of tasks is 700, the CG + EFWA (CG is adopted in the task merging stage and EFWA is adopted in the satellite combined-task scheduling stage) method improves observation benefits by 70.35% (compared to CG + EACO, CG is adopted in the task merging stage and EACO is adopted in the satellite combined-task scheduling stage), 78.93% (compared to MS + EFWA, MS is adopted in the task merging stage and EFWA is adopted in the satellite combined-task scheduling stage), and 39.03% (compared to MS + EACO, MS is adopted in the task merging stage and EACO is adopted in the satellite combined-task scheduling stage). Full article
(This article belongs to the Special Issue The Application of Optimization Algorithm in Mathematical Model)
Show Figures

Figure 1

Figure 1
<p>The illustration of satellite sensor transition time.</p>
Full article ">Figure 2
<p>Satellite observation with task merging.</p>
Full article ">Figure 3
<p>The diagram of transforming single-task sequences into a CG model.</p>
Full article ">Figure 4
<p>The framework of the two-stage satellite combined-task scheduling algorithm.</p>
Full article ">Figure 5
<p>Observation benefit value of satellites under different task merging modes: (<b>a</b>) observation benefit value obtained by ACO; (<b>b</b>) observation benefit value obtained by FWA.</p>
Full article ">Figure 6
<p>Observation benefit value of satellites under different algorithms: (<b>a</b>) the observation area contains 100 single tasks; (<b>b</b>) the observation area contains 200 single tasks; (<b>c</b>) the observation area contains 300 single tasks; (<b>d</b>) the observation area contains 400 single tasks; (<b>e</b>) the observation area contains 500 single tasks; (<b>f</b>) the observation area contains 700 single tasks.</p>
Full article ">Figure 6 Cont.
<p>Observation benefit value of satellites under different algorithms: (<b>a</b>) the observation area contains 100 single tasks; (<b>b</b>) the observation area contains 200 single tasks; (<b>c</b>) the observation area contains 300 single tasks; (<b>d</b>) the observation area contains 400 single tasks; (<b>e</b>) the observation area contains 500 single tasks; (<b>f</b>) the observation area contains 700 single tasks.</p>
Full article ">
27 pages, 10669 KiB  
Article
Deep Reinforcement Learning with Local Attention for Single Agile Optical Satellite Scheduling Problem
by Zheng Liu, Wei Xiong, Chi Han and Xiaolan Yu
Sensors 2024, 24(19), 6396; https://doi.org/10.3390/s24196396 - 2 Oct 2024
Viewed by 199
Abstract
This paper investigates the single agile optical satellite scheduling problem, which has received increasing attention due to the rapid growth in earth observation requirements. Owing to the complicated constraints and considerable solution space of this problem, the conventional exact methods and heuristic methods, [...] Read more.
This paper investigates the single agile optical satellite scheduling problem, which has received increasing attention due to the rapid growth in earth observation requirements. Owing to the complicated constraints and considerable solution space of this problem, the conventional exact methods and heuristic methods, which are sensitive to the problem scale, demand high computational expenses. Thus, an efficient approach is demanded to solve this problem, and this paper proposes a deep reinforcement learning algorithm with a local attention mechanism. A mathematical model is first established to describe this problem, which considers a series of complex constraints and takes the profit ratio of completed tasks as the optimization objective. Then, a neural network framework with an encoder–decoder structure is adopted to generate high-quality solutions, and a local attention mechanism is designed to improve the generation of solutions. In addition, an adaptive learning rate strategy is proposed to guide the actor–critic training algorithm to dynamically adjust the learning rate in the training process to enhance the training effectiveness of the proposed network. Finally, extensive experiments verify that the proposed algorithm outperforms the comparison algorithms in terms of solution quality, generalization performance, and computation efficiency. Full article
(This article belongs to the Section Optical Sensors)
Show Figures

Figure 1

Figure 1
<p>Observation process of the traditional optical satellite and AOS.</p>
Full article ">Figure 2
<p>Architecture of the proposed neural network. For task <math display="inline"><semantics> <msub> <mi>t</mi> <mi>i</mi> </msub> </semantics></math>, <math display="inline"><semantics> <msub> <mrow> <mi>s</mi> <mi>e</mi> </mrow> <mi>i</mi> </msub> </semantics></math> is its static embedding form, and <math display="inline"><semantics> <msub> <mrow> <mi>s</mi> <mi>c</mi> </mrow> <mi>i</mi> </msub> </semantics></math> is its static encoding form. At step <span class="html-italic">n</span>, <math display="inline"><semantics> <msub> <mrow> <mi>d</mi> <mi>e</mi> </mrow> <mi>n</mi> </msub> </semantics></math> is the dynamic embedding form mapped by <math display="inline"><semantics> <msub> <mi>s</mi> <mi>n</mi> </msub> </semantics></math>, and <math display="inline"><semantics> <msub> <mrow> <mi>d</mi> <mi>c</mi> </mrow> <mi>n</mi> </msub> </semantics></math> is its dynamic encoding form. <math display="inline"><semantics> <msub> <mi>c</mi> <mi>n</mi> </msub> </semantics></math> is the output of the dynamic encoder. <math display="inline"><semantics> <msub> <mi>h</mi> <mi>n</mi> </msub> </semantics></math> is the hidden state of the LSTM cell in the decoder.</p>
Full article ">Figure 3
<p>VTWs of five tasks in the four orbits.</p>
Full article ">Figure 4
<p>Comparison between global attention and local attention. Under the same circumstances, the global attention mechanism needs more computation. However, it tends to generate unreasonable task orders, leading some tasks to be abandoned, so its decoding step number is less. (<b>a</b>) Global attention. At the first step, <math display="inline"><semantics> <msub> <mi>t</mi> <mn>4</mn> </msub> </semantics></math> is selected from all the tasks to be executed. <math display="inline"><semantics> <msub> <mi>t</mi> <mn>1</mn> </msub> </semantics></math> and <math display="inline"><semantics> <msub> <mi>t</mi> <mn>2</mn> </msub> </semantics></math> are deleted since they have no VTWs in the following orbits, and <math display="inline"><semantics> <msub> <mi>t</mi> <mn>3</mn> </msub> </semantics></math> and <math display="inline"><semantics> <msub> <mi>t</mi> <mn>5</mn> </msub> </semantics></math> are the remaining tasks. At the second step, <math display="inline"><semantics> <msub> <mi>t</mi> <mn>5</mn> </msub> </semantics></math> is selected, and <math display="inline"><semantics> <msub> <mi>t</mi> <mn>3</mn> </msub> </semantics></math> is deleted. The total step number is 2. (<b>b</b>) Local attention. At the first step, <math display="inline"><semantics> <msub> <mi>t</mi> <mn>1</mn> </msub> </semantics></math>, <math display="inline"><semantics> <msub> <mi>t</mi> <mn>2</mn> </msub> </semantics></math>, <math display="inline"><semantics> <msub> <mi>t</mi> <mn>3</mn> </msub> </semantics></math>, and <math display="inline"><semantics> <msub> <mi>t</mi> <mn>5</mn> </msub> </semantics></math> have VTWs in the orbits <math display="inline"><semantics> <msub> <mi>o</mi> <mn>1</mn> </msub> </semantics></math> and <math display="inline"><semantics> <msub> <mi>o</mi> <mn>3</mn> </msub> </semantics></math>, and <math display="inline"><semantics> <msub> <mi>t</mi> <mn>2</mn> </msub> </semantics></math> is selected from them to be executed. At the second step, <math display="inline"><semantics> <msub> <mi>t</mi> <mn>1</mn> </msub> </semantics></math>, <math display="inline"><semantics> <msub> <mi>t</mi> <mn>3</mn> </msub> </semantics></math>, and <math display="inline"><semantics> <msub> <mi>t</mi> <mn>5</mn> </msub> </semantics></math> are still available in these two orbits, and <math display="inline"><semantics> <msub> <mi>t</mi> <mn>3</mn> </msub> </semantics></math> is selected from them, causing the scheduling in <math display="inline"><semantics> <msub> <mi>o</mi> <mn>1</mn> </msub> </semantics></math> to be finished. At the third step, <math display="inline"><semantics> <msub> <mi>t</mi> <mn>1</mn> </msub> </semantics></math>, <math display="inline"><semantics> <msub> <mi>t</mi> <mn>4</mn> </msub> </semantics></math>, and <math display="inline"><semantics> <msub> <mi>t</mi> <mn>5</mn> </msub> </semantics></math> with VTWs in the next two orbits need to be scheduled, and <math display="inline"><semantics> <msub> <mi>t</mi> <mn>1</mn> </msub> </semantics></math> is selected. At the last step, only <math display="inline"><semantics> <msub> <mi>t</mi> <mn>4</mn> </msub> </semantics></math> and <math display="inline"><semantics> <msub> <mi>t</mi> <mn>5</mn> </msub> </semantics></math> have VTWs in the last orbit <math display="inline"><semantics> <msub> <mi>o</mi> <mn>4</mn> </msub> </semantics></math>. <math display="inline"><semantics> <msub> <mi>t</mi> <mn>5</mn> </msub> </semantics></math> is selected, and <math display="inline"><semantics> <msub> <mi>t</mi> <mn>4</mn> </msub> </semantics></math> is deleted. The total step number is 4.</p>
Full article ">Figure 5
<p>Structure of the static embedding layer.</p>
Full article ">Figure 6
<p>Diagram of the reward curve and the reference cosine curves. In this diagram, a fold line is used to represent the reward curve. However, the actual reward curve is a fluctuating curve. The appropriate increase in the learning rate can accelerate the rise of the reward curve in the mid-term of training. A new cosine curve is set as the reference cosine curve whenever the learning rate increases.</p>
Full article ">Figure 7
<p>Training process of DRLLA. (<b>a</b>) The reward curve and the learning rate curve in the whole training process. (<b>b</b>) The reward curve and the learning rate curve in the second training epoch.</p>
Full article ">Figure 8
<p>Profit ratio distributions of different algorithms on the dataset <math display="inline"><semantics> <mrow> <mi>T</mi> <mi>e</mi> <mi>s</mi> <mi>t</mi> <mi>i</mi> <mi>n</mi> <mi>g</mi> <mo>_</mo> <mi>R</mi> <mn>1</mn> </mrow> </semantics></math>.</p>
Full article ">Figure 9
<p>Curves of mean profit and mean completion number. (<b>a</b>) Mean profit. (<b>b</b>) Mean completion number.</p>
Full article ">Figure 10
<p>Training process of DRLLA-a, DRLLA-f, and DRLLA-e. (<b>a</b>) Profit ratio curves of DRLLA-a, DRLLA-f, and DRLLA-e in the training process. (<b>b</b>) Learning rate curves of DRLLA-a, DRLLA-f, and DRLLA-e in the training process.</p>
Full article ">Figure 10 Cont.
<p>Training process of DRLLA-a, DRLLA-f, and DRLLA-e. (<b>a</b>) Profit ratio curves of DRLLA-a, DRLLA-f, and DRLLA-e in the training process. (<b>b</b>) Learning rate curves of DRLLA-a, DRLLA-f, and DRLLA-e in the training process.</p>
Full article ">
21 pages, 2799 KiB  
Article
Behavioral and Amygdala Biochemical Damage Induced by Alternating Mild Stress and Ethanol Intoxication in Adolescent Rats: Reversal by Argan Oil Treatment?
by Hicham El Mostafi, Aboubaker Elhessni, Hanane Doumar, Tarik Touil and Abdelhalem Mesfioui
Int. J. Mol. Sci. 2024, 25(19), 10529; https://doi.org/10.3390/ijms251910529 - 30 Sep 2024
Viewed by 240
Abstract
Adolescence is a critical period when the effects of ethanol and stress exposure are particularly pronounced. Argan oil (AO), a natural vegetable oil known for its diverse pharmacological benefits, was investigated for its potential to mitigate addictive-like behaviors and brain damage induced by [...] Read more.
Adolescence is a critical period when the effects of ethanol and stress exposure are particularly pronounced. Argan oil (AO), a natural vegetable oil known for its diverse pharmacological benefits, was investigated for its potential to mitigate addictive-like behaviors and brain damage induced by adolescent intermittent ethanol intoxication (IEI) and unpredictable mild stress (UMS). From P30 to P43, IEI rats received a daily ip ethanol (3 g/kg) on a two-day on/two-day off schedule. On alternate days, the rats were submitted to UMS protocol. Next, a two-bottle free access paradigm was performed over 10 weeks to assess intermittent 20% ethanol voluntary consumption. During the same period, the rats were gavaged daily with AO (15 mL/kg). Our results show that IEI/UMS significantly increased voluntary alcohol consumption (from 3.9 g/kg/24 h to 5.8 g/kg/24 h) and exacerbated withdrawal signs and relapse-like drinking in adulthood. Although AO treatment slightly reduced ethanol intake, it notably alleviated withdrawal signs during abstinence and relapse-like drinking in adulthood. AO’s effects were associated with its modulation of the HPA axis (elevated serum corticosterone), restoration of amygdala oxidative balance, BDNF levels, and attenuation of neurodegeneration. These findings suggest that AO’s neuroprotective properties could offer a potential therapeutic avenue for reducing ethanol/stress-induced brain damage and addiction. Further research is needed to explore its mechanisms and therapeutic potential in alcohol use disorders. Full article
(This article belongs to the Special Issue The Roles of Phytochemicals in Neuroprotective Mechanism)
Show Figures

Graphical abstract

Graphical abstract
Full article ">Figure 1
<p>Home-cage voluntary ethanol consumption in a 2-bottle free choice test. (<b>A</b>,<b>B</b>) Weekly intermittent 20% ethanol intake in water and AO-treated cohorts, respectively. (<b>C</b>) Average ethanol intake over the last 4 weeks of the experiment. (<b>D</b>) Average preference ratio over the last week of the experiment of Ctrl (<span class="html-italic">n</span> = 12), IEI (<span class="html-italic">n</span> = 12), UMS (<span class="html-italic">n</span> = 12) and IEI/UMS (<span class="html-italic">n</span> = 12) with/without AO treatment. Results were expressed as mean ± SEM. (<b>A</b>,<b>B</b>): <sup>aaa</sup> <span class="html-italic">p</span> &lt; 0.001, IEI vs. Ctrl; <sup>ccc</sup> <span class="html-italic">p</span> &lt; 0.001, Ctrl vs. IEI/UMS. (<b>C</b>,<b>D</b>): <sup>aaa</sup> <span class="html-italic">p</span> &lt; 0.001 compared with Ctrl; <sup>bbb</sup> <span class="html-italic">p</span> &lt; 0.001 compared with IEI; <sup>ccc</sup> <span class="html-italic">p</span> &lt; 0.001 compared with UMS, according to RM 3-way or 2-way ANOVA, followed by a Tukey’s test.</p>
Full article ">Figure 2
<p>Ethanol withdrawal signs and binge-like ethanol drinking in the dark after 72 h of abstinence. (<b>A</b>,<b>B</b>) Global EWS (sum of somatic withdrawal scores across the five behavioral signs) measured between 2 and 72 h after the removal of the 20% <span class="html-italic">v</span>/<span class="html-italic">v</span> ethanol solution, in water and AO-treated rats, respectively. (<b>C</b>) Average of global EWS scores measured at the 6th and the 24th hours of ethanol removal. (<b>D</b>) 20% <span class="html-italic">v</span>/<span class="html-italic">v</span> ethanol consumption (g/kg/2 h) on the 4th day of the drinking in the dark test in water- and AO-treated Ctrl (<span class="html-italic">n</span> = 10), UMS (<span class="html-italic">n</span> = 11), IEI (<span class="html-italic">n</span> = 11), and IEI/UMS (<span class="html-italic">n</span> = 11) groups. The values represent the mean ± SEM. (<b>A</b>,<b>B</b>): <sup>a</sup> <span class="html-italic">p</span> &lt; 0.05, <sup>aaa</sup> <span class="html-italic">p</span> &lt; 0.001, IEI vs. Ctrl; <sup>bbb</sup> <span class="html-italic">p</span> &lt; 0.001, Ctrl vs. IEI/UMS; <sup>ccc</sup> <span class="html-italic">p</span> &lt; 0.001, UMS vs. IEI/UMS. (<b>C</b>,<b>D</b>): <sup>a</sup> <span class="html-italic">p</span> &lt; 0.05, <sup>aa</sup> <span class="html-italic">p</span> &lt; 0.01, <sup>aaa</sup> <span class="html-italic">p</span> &lt; 0.001 compared with Ctrl; <sup>bb</sup> <span class="html-italic">p</span> &lt; 0.01, <sup>bbb</sup> <span class="html-italic">p</span> &lt; 0.001 compared with IEI; <sup>c</sup> <span class="html-italic">p</span> &lt; 0.05, <sup>cc</sup> <span class="html-italic">p</span> &lt; 0.01, <sup>ccc</sup> <span class="html-italic">p</span> &lt; 0.001 compared with UMS. <sup>δδδ</sup> <span class="html-italic">p</span> &lt; 0.001 AO effect, according to RM 3-way or 2-way ANOVA, followed by Tukey’s test. AO: Argan oil, EWS: Ethanol withdrawal signs.</p>
Full article ">Figure 3
<p>Histologic neurodegeneration and BDNF immunoreactivity analysis in the CeA. (<b>A</b>) Brain anatomical positions of the CeA, relative to Bregma −1.88 mm from the rat brain atlas [<a href="#B30-ijms-25-10529" class="html-bibr">30</a>]. (<b>B</b>) Representative images of Nissl-stained forebrain CeA sections. (<b>C</b>) Number of neurons per mm<sup>2</sup> assessed by cell counting and (<b>D</b>) Semi-quantitative analysis of neurodegeneration (score) in rats CeA sections. (<b>E</b>) Representative images showing BDNF—immunolabelling observed in the CeA sections. (<b>F</b>) Positive BDNF-IR cell counts in the CeA sections in Ctrl (<span class="html-italic">n</span> = 5), IEI (<span class="html-italic">n</span> = 4), UMS (<span class="html-italic">n</span> = 5) and IEI/UMS (<span class="html-italic">n</span> = 5) groups under water or AO treatment. Results are expressed as mean ± SEM from 5 animals per group. <sup>a</sup> <span class="html-italic">p</span> &lt; 0.05, <sup>aa</sup> <span class="html-italic">p</span> &lt; 0.001 and <sup>aaa</sup> <span class="html-italic">p</span> &lt; 0.001 compared to Ctrl group; <sup>b</sup> <span class="html-italic">p</span> &lt; 0.05 compared to the IEI group; <sup>ccc</sup> <span class="html-italic">p</span> &lt; 0.001 compared to the UMS group; <sup>δδδ</sup> <span class="html-italic">p</span> &lt; 0.001 AO effect (water-treated IEI/UMS vs. AO-treated IEI/UMS). The data of neuron counting are illustrated as box-and-whisker plots. Scale bar = 50 µm. CeA: the central nucleus of the amygdala, AO: Argan oil, BDNF-IR cells: brain-derived neurotrophic factor—immunoreactive cells.</p>
Full article ">Figure 4
<p>Experimental timeline and daily schedules for the intermittent ethanol intoxications (IEI) and the unpredictable mild stress (UMS). From post-natal day (PND) 30 to PND 43, IEI animals received a single daily intraperitoneal (ip) administration of ethanol (3 g/kg, 20% ethanol <span class="html-italic">w</span>/<span class="html-italic">v</span>) in the AM on a 2-days-on/2-days-off schedule and Ctrl subjects received comparable volumes of 0.9% saline. On alternate days, the rats were submitted to UMS protocol. The home-cage voluntary intermittent 20% ethanol consumption was measured on a two-bottle choice procedure (from PND 44 to PND 120). During the same period, the rats were treated daily by intragastric gavage with Argan oil (AO, 15 mL/kg–bw). Next, plasma corticosterone (CORT) levels were measured from tail bloods samples in all rats during the last day of AO treatment (between 6:00 p.m. and 7:00 p.m.). One day later, separate groups of each experimentally conditioned rats were used to measure ethanol withdrawal signs (EWS) and binge-like drinking (on the drinking in the dark paradigm (DID)) (2), or were euthanized for histochemical and the biochemical analyses, to measure the neurodegeneration (NeuroD) levels, the brain-derived neurotrophic factor (BDNF) levels and the oxidative stress (OS) in the amygdala (1).</p>
Full article ">Figure 5
<p>Possible mechanisms proposed for the “therapeutic” effects of AO against adolescent binge-like/mild stress exposure. Our study suggests that virgin AO supplementation during voluntary ethanol consumption, exerted addictolytic-like effects in IEI/UMS rats, mediated in part by normalizing plasma CORT levels, reducing brain neuronal loss while upregulating BDNF levels and oxidative stress imbalance in the amygdala.</p>
Full article ">
20 pages, 4032 KiB  
Review
The Operation Strategy of a Multi-Microgrid Considering the Interaction of Different Subjects’ Interests
by Siwen Wang, Hui Chen, Chunyang Gong, Yanfei Shang and Zhixin Wang
Energies 2024, 17(19), 4883; https://doi.org/10.3390/en17194883 - 29 Sep 2024
Viewed by 427
Abstract
As the share of renewable energy generation continues to increase, the new-type power system exhibits the characteristics of coordinated operation between the main grid, distribution networks, and microgrids. The microgrid is primarily concerned with achieving self-balancing between power sources, the network, loads, and [...] Read more.
As the share of renewable energy generation continues to increase, the new-type power system exhibits the characteristics of coordinated operation between the main grid, distribution networks, and microgrids. The microgrid is primarily concerned with achieving self-balancing between power sources, the network, loads, and storage. In decentralized multi-microgrid (MMG) access scenarios, the aggregation of distributed energy within a region enables the unified optimization of scheduling, which improves regional energy self-sufficiency while mitigating the impact and risks of distributed energy on grid operations. However, the cooperative operation of MMGs involves interactions among various stakeholders, and the absence of a reasonable operational mechanism can result in low energy utilization, uneven resource allocation, and other issues. Thus, designing an effective MMG operation strategy that balances the interests of all stakeholders has become a key area of focus in the industry. This paper examines the definition and structure of MMGs, analyzes their current operational challenges, compiles existing research methods and practical experiences, explores synergistic operational mechanisms and strategies for MMGs under different transaction models, and puts forward prospects for future research directions. Full article
(This article belongs to the Section F: Electrical Engineering)
Show Figures

Figure 1

Figure 1
<p>Microgrid operation framework diagram.</p>
Full article ">Figure 2
<p>Centralized collaborative operation framework.</p>
Full article ">Figure 3
<p>Distributed collaborative operation framework.</p>
Full article ">Figure 4
<p>Shared energy storage cooperative operation mode.</p>
Full article ">Figure 5
<p>Third-party operation mode for shared energy storage.</p>
Full article ">Figure 6
<p>Centralized pricing model for P2P transactions.</p>
Full article ">Figure 7
<p>Fully market-oriented P2P transaction model.</p>
Full article ">
13 pages, 774 KiB  
Article
Routine ICU Surveillance after Brain Tumor Surgery: Patient Selection Using Machine Learning
by Jan-Oliver Neumann, Stephanie Schmidt, Amin Nohman, Paul Naser, Martin Jakobs and Andreas Unterberg
J. Clin. Med. 2024, 13(19), 5747; https://doi.org/10.3390/jcm13195747 - 26 Sep 2024
Viewed by 323
Abstract
Background/Objectives: Routine postoperative ICU admission following brain tumor surgery may not benefit selected patients. The objective of this study was to develop a risk prediction instrument for early (within 24 h) postoperative adverse events using machine learning techniques. Methods: Retrospective cohort of 1000 [...] Read more.
Background/Objectives: Routine postoperative ICU admission following brain tumor surgery may not benefit selected patients. The objective of this study was to develop a risk prediction instrument for early (within 24 h) postoperative adverse events using machine learning techniques. Methods: Retrospective cohort of 1000 consecutive adult patients undergoing elective brain tumor resection. Nine events/interventions (CPR, reintubation, return to OR, mechanical ventilation, vasopressors, impaired consciousness, intracranial hypertension, swallowing disorders, and death) were chosen as target variables. Potential prognostic features (n = 27) from five categories were chosen and a gradient boosting algorithm (XGBoost) was trained and cross-validated in a 5 × 5 fashion. Prognostic performance, potential clinical impact, and relative feature importance were analyzed. Results: Adverse events requiring ICU intervention occurred in 9.2% of cases. Other events not requiring ICU treatment were more frequent (35% of cases). The boosted decision trees yielded a cross-validated ROC-AUC of 0.81 ± 0.02 (mean ± CI95) when using pre- and post-op data. Using only pre-op data (scheduling decisions), ROC-AUC was 0.76 ± 0.02. PR-AUC was 0.38 ± 0.04 and 0.27 ± 0.03 for pre- and post-op data, respectively, compared to a baseline value (random classifier) of 0.092. Targeting a NPV of at least 95% would require ICU admission in just 15% (pre- and post-op data) or 30% (only pre-op data) of cases when using the prediction algorithm. Conclusions: Adoption of a risk prediction instrument based on boosted trees can support decision-makers to optimize ICU resource utilization while maintaining adequate patient safety. This may lead to a relevant reduction in ICU admissions for surveillance purposes. Full article
(This article belongs to the Special Issue Neurocritical Care: New Insights and Challenges)
Show Figures

Figure 1

Figure 1
<p>Prognostic performance. Pre- and post-op features yield a ROC-AUC 0.81 ± 0.02 (mean ± CI<sub>95</sub>) in 5-times repeated 5-fold cross-validation (<span class="html-italic">p</span> &lt; 0.01). Using only pre-op features, ROC-AUC still scores at 0.76 ± 0.02 (<span class="html-italic">p</span> &lt; 0.001, (<b>A</b>)). As the underlying class distribution is clearly skewed towards the negative class (1:9), the AUC of the precision-recall curve was expected to be lower than AUC-ROC. In the case of pre- and post-op data, AUC-PR was 0.38 ± 0.04, and 0.27 ± 0.03 for pre-op data only (both <span class="html-italic">p</span> &lt; 0.001, (<b>B</b>)). Compared to the baseline value of a random classifier (0.09), these numbers represent a 3-fold increase in the baseline value and represent a good classification performance.</p>
Full article ">Figure 2
<p>Relationship between negative predictive value (NPV) and ICU admission rate as a function of the selected threshold. With pre- and post-op data, targeting an NPV of at least 95% requires ICU admission in 15% of cases. Using only preoperative data, approximately 30% of cases were selected for surveillance at the ICU. Higher target NPVs lead to continuously rising ICU admission rates.</p>
Full article ">Figure 3
<p>Relative contribution of features to the model output.</p>
Full article ">
28 pages, 5925 KiB  
Article
Multi-Objective Optimization of Energy-Efficient Multi-Stage, Multi-Level Assembly Job Shop Scheduling
by Yingqian Dong, Weizhi Liao and Guodong Xu
Appl. Sci. 2024, 14(19), 8712; https://doi.org/10.3390/app14198712 - 26 Sep 2024
Viewed by 430
Abstract
The multi-stage, multi-level assembly job shop scheduling problem (MsMlAJSP) is commonly encountered in the manufacturing of complex customized products. Ensuring production efficiency while effectively improving energy utilization is a key focus in the industry. For the energy-efficient MsMlAJSP (EEMsMlAJSP), an improved imperialist competitive [...] Read more.
The multi-stage, multi-level assembly job shop scheduling problem (MsMlAJSP) is commonly encountered in the manufacturing of complex customized products. Ensuring production efficiency while effectively improving energy utilization is a key focus in the industry. For the energy-efficient MsMlAJSP (EEMsMlAJSP), an improved imperialist competitive algorithm based on Q-learning (IICA-QL) is proposed to minimize the maximum completion time and total energy consumption. In IICA-QL, a decoding strategy with energy-efficient triggers based on problem characteristics is designed to ensure solution quality while effectively enhancing search efficiency. Additionally, an assimilation operation with operator parameter self-adaptation based on Q-learning is devised to overcome the challenge of balancing exploration and exploitation with fixed parameters; thus, the convergence and diversity of the algorithmic search are enhanced. Finally, the effectiveness of the energy-efficient strategy decoding trigger mechanism and the operator parameter self-adaptation operation based on Q-learning is demonstrated through experimental results, and the effectiveness of IICA-QL for solving the EEMsMlAJSP is verified by comparing it with other algorithms. Full article
Show Figures

Figure 1

Figure 1
<p>A schematic diagram of the EEMsMlAJSP.</p>
Full article ">Figure 2
<p>Schematic diagram of encoding.</p>
Full article ">Figure 3
<p>Illustration of trigger mechanism for decoding energy-efficient strategy.</p>
Full article ">Figure 4
<p>Q-table update diagram.</p>
Full article ">Figure 5
<p>Schematic diagram of neighborhood structure.</p>
Full article ">Figure 6
<p>Framework of IICA-QL.</p>
Full article ">Figure 7
<p>Box plots of three metrics between IICA-QL and IICA-QL-PFE/IICA-QL-AE.</p>
Full article ">Figure 8
<p>Box and line plots of CPU time between IICA-QL and IICA-QL-PFE/IICA-QL-AE.</p>
Full article ">Figure 9
<p>Box plots of three metrics between IICA-QL and IICA-nQL.</p>
Full article ">Figure 10
<p>Box plots of two metrics between IICA-QL and BPBMO/PSO-GA/ KBOA.</p>
Full article ">Figure 11
<p>The Pareto fronts obtained by IICA-QL, BPBMO, PSO-GA, and KBOA with different scales.</p>
Full article ">
8 pages, 243 KiB  
Article
Anesthesiological Preoperative Interview with a Palliative Care Patient: A Simulation-Based Experiment Using Standardized Patients
by Christoph L. Lassen, Fabian Jaschinsky, Elena Stamouli, Nicole Lindenberg and Christoph H. R. Wiese
Medicina 2024, 60(10), 1577; https://doi.org/10.3390/medicina60101577 - 26 Sep 2024
Viewed by 344
Abstract
Background and Objectives: Anesthesiologists come into contact with patients under palliative care in different clinical settings. They also routinely encounter these patients in their primary field of work, the operating room. Patients receiving palliative care who are scheduled for surgery will pose [...] Read more.
Background and Objectives: Anesthesiologists come into contact with patients under palliative care in different clinical settings. They also routinely encounter these patients in their primary field of work, the operating room. Patients receiving palliative care who are scheduled for surgery will pose unique challenges in perioperative management, often presenting with advanced disease and with different psychosocial and ethical issues. This study aims to evaluate whether anesthesiologists without specialty training in palliative medicine will spot perioperative challenges presented by patients under palliative care and address them adequately. Materials and Methods: In this study, we simulated a preoperative anesthesiological interview using standardized patients and anesthesiologists (specialists as well as trainees). The standardized patients were asked to represent a patient under palliative care in need of surgery because of a mechanical ileus. We conducted 32 interviews, dividing the anesthesiologists into two groups. In one group, the standardized patients were instructed to address four problems, i.e., use of a port catheter for anesthesia, nausea and vomiting, pain medication, and an advance directive including a limitation of treatment (DNR-order). In the other group, these problems were also present, but were not actively addressed by the standardized patients if not asked for. The interviews were recorded, transcribed, and then analyzed. Results: In most cases, the medical problems were spontaneously identified and discussed. In only a few cases, however, was a therapy recommendation made for improved symptom control. The advance directive was spontaneously discussed by only 3 of the 32 (9%) anesthesiologists. In another 16 cases, the advance directive was discussed at the request of the standardized patients. The limitation of treatment stayed in place in all cases, and the discussion of the advance directives remained short, with an average duration of just over 5 min. Conclusions: In this study, the complex problems of patients under palliative care are not sufficiently taken into account in a preoperative anesthesiological interview. To improve treatment of the medical problems, therapists who have palliative medicine expertise, should be involved in the perioperative medical care, ideally as a multi-professional team. The discussion about perioperative limitations of treatment should be held beforehand, for example, as part of a structured advanced care planning discussion. Full article
(This article belongs to the Special Issue Updates on Perioperative Anesthetic Management: 2nd Edition)
30 pages, 8086 KiB  
Article
Ship Chain Navigation Co-Scheduling of Three Gorges-Gezhouba Dam under Serial-Lock Scenario
by Hongwei Tian, Qianqian Zheng, Yu Zhang, Lijun He, Shun Liu and Ran Li
J. Mar. Sci. Eng. 2024, 12(10), 1700; https://doi.org/10.3390/jmse12101700 - 25 Sep 2024
Viewed by 316
Abstract
Motivated by the operational scenarios of lock scheduling, we propose a serial-lock chain navigation problem (SLCNP) modeled on the Three Gorges-Gezhouba Dam (TGGD) for the first time. Ship grouping, synchronized moving, and grouped waiting operations are integrated into the ship navigation process. A [...] Read more.
Motivated by the operational scenarios of lock scheduling, we propose a serial-lock chain navigation problem (SLCNP) modeled on the Three Gorges-Gezhouba Dam (TGGD) for the first time. Ship grouping, synchronized moving, and grouped waiting operations are integrated into the ship navigation process. A mixed integer programming (MIP) model that incorporates real-world constraints such as ship priority, service fairness, traffic flow equilibrium, and phased ship placement is presented to optimize ship throughput and ship stay time. To solve the SLCNP, a sort-pick strategy-based swarm intelligence algorithm (SPSSIA) framework is developed that integrates the characteristics of SLCNP through a hybrid multi-section encoding method and a two-stage heuristic decoding approach. A swarm intelligence evolution mechanism is used to improve the search ability and robustness of the framework. Several instances are generated based on real data to verify the correctness and effectiveness of the model and algorithm. Computational results demonstrate the applicability and effectiveness of the proposed SPSSIA. Further analysis of the experimental results indicates that the key impact factors significantly influence the navigational performance of the TGGD system. The results of this study will provide practical guidance for the operational processes of inland river hubs with comparable characteristics. Full article
(This article belongs to the Section Ocean Engineering)
Show Figures

Figure 1

Figure 1
<p>The aerial perspective of Three Gorges Dam and Gezhouba Dam: (<b>a</b>) TGD; (<b>b</b>) GD [<a href="#B2-jmse-12-01700" class="html-bibr">2</a>].</p>
Full article ">Figure 2
<p>Navigation structure of the TGGD.</p>
Full article ">Figure 3
<p>Serial-lock chain navigation process in TGGD.</p>
Full article ">Figure 4
<p>Illustration of lockage schedule development for two adjacent cycles: (<b>a</b>) Original lockage schedule; (<b>b</b>) Lockage schedule after adjustment of ship sequences; (<b>c</b>) Infeasible lockage schedule. Blue rectangles represent sortable ships, and yellow rectangles represent pickable ships.</p>
Full article ">Figure 5
<p>A framework of SPSSIA.</p>
Full article ">Figure 6
<p>An example of an encoding scheme.</p>
Full article ">Figure 7
<p>The trend of the previous remaining ships in the TGGD system.</p>
Full article ">Figure 8
<p>Illustration of two-stage ship placement.</p>
Full article ">Figure 9
<p>The trend of factor levels for key parameters.</p>
Full article ">Figure 10
<p>The average computing time of the three algorithms in all instances.</p>
Full article ">Figure 11
<p>Kruskal-Wallis ANOVA significance test results on all instances for the three algorithms: (<b>a</b>) <span class="html-italic">F</span>; (<b>b</b>) <span class="html-italic">Q</span>; and (<b>c</b>) <span class="html-italic">T</span>.</p>
Full article ">Figure 12
<p>The average computing time of the three algorithms for actual cases.</p>
Full article ">Figure 13
<p>The trend of the objective value for the three algorithms as <span class="html-italic">sp</span> varies: (<b>a</b>) <span class="html-italic">cp</span> = 0; (<b>b</b>) <span class="html-italic">cp</span> = 0.3; (<b>c</b>) <span class="html-italic">cp</span> = 0.6; and (<b>d</b>) <span class="html-italic">cp</span> = 0.9.</p>
Full article ">Figure 14
<p>The trend of cargo throughput as <span class="html-italic">cp</span> varies: (<b>a</b>) <span class="html-italic">d</span> = 12; (<b>b</b>) <span class="html-italic">d</span> = 24.</p>
Full article ">Figure 15
<p>Comparison of algorithmic solution results with case data.</p>
Full article ">
20 pages, 1989 KiB  
Article
EstuarySAT Database Development of Harmonized Remote Sensing and Water Quality Data for Tidal and Estuarine Systems
by Steven A. Rego, Naomi E. Detenbeck and Xiao Shen
Water 2024, 16(19), 2721; https://doi.org/10.3390/w16192721 - 25 Sep 2024
Viewed by 560
Abstract
Researchers and environmental managers need big datasets spanning long time periods to accurately assess current and historical water quality conditions in fresh and estuarine waters. Using remote sensing data, we can survey many water bodies simultaneously and evaluate water quality conditions with greater [...] Read more.
Researchers and environmental managers need big datasets spanning long time periods to accurately assess current and historical water quality conditions in fresh and estuarine waters. Using remote sensing data, we can survey many water bodies simultaneously and evaluate water quality conditions with greater frequency. The combination of existing and historical water quality data with remote sensing imagery into a unified database allows researchers to improve remote sensing algorithms and improves understanding of mechanisms causing blooms. We report on the development of a water quality database “EstuarySAT” which combines data from the Sentinel-2 multi-spectral instrument (MSI) remote sensing platform and water quality data throughout the coastal USA. EstuarySAT builds upon an existing database and set of methods developed by the creators of AquaSat, whose region of interest is primarily larger freshwater lakes in the USA. Following the same basic methods, EstuarySAT utilizes open-source tools: R v. 3.24+ (statistical software), Python (dynamic programming environment), and Google Earth Engine (GEE) to develop a combined water quality data and remote sensing imagery database (EstuarySAT) for smaller coastal estuarine and freshwater tidal riverine systems. EstuarySAT fills a data gap that exists between freshwater and estuarine water bodies. We are able to evaluate smaller systems due to the higher spatial resolution of Sentinel-2 (10 m pixel image resolution) vs. the Landsat platform used by AquaSat (30 m pixel resolution). Sentinel-2 also has a more frequent revisit (overpass) schedule of every 5 to 10 days vs. Landsat 7 which is every 17 days. EstuarySAT incorporates publicly available water quality data from 23 individual water quality data sources spanning 1984–2021 and spatially matches them with Sentinel-2 imagery from 2015–2021. EstuarySAT currently contains 299,851 matched observations distributed across the coastal USA. EstuarySAT’s primary focus is on collecting chlorophyll data; however, it also contains other ancillary water quality data, including temperature, salinity, pH, dissolved oxygen, dissolved organic carbon, and turbidity (where available). As compared to other ocean color databases used for developing predictive chlorophyll algorithms, this coastal database contains spectral profiles more typical of CDOM-dominated systems. This database can assist researchers and managers in evaluating algal bloom causes and predicting the occurrence of future blooms. Full article
(This article belongs to the Section Water Quality and Contamination)
Show Figures

Figure 1

Figure 1
<p>Figure depicts the distribution of sampling stations and observations by marine ecoregion in EstuarySAT. Magenta boundaries denote ecoregions, and circles represent sample observation frequencies. There are 9028 individual water quality sampling stations matched with Sentinel-2 Level 1C and 1818 water quality sampling stations matched with Sentinel Level 2A image tiles.</p>
Full article ">Figure 2
<p>Spectral bandwidth of Sentinel-2 (A/B) with relative resolution. Source: <a href="https://www.satimagingcorp.com/satellite-sensors/other-satellite-sensors/sentinel-2a/" target="_blank">https://www.satimagingcorp.com/satellite-sensors/other-satellite-sensors/sentinel-2a/</a>, accessed on 19 September 2024.</p>
Full article ">Figure 3
<p>EstuarySAT database development workflow.</p>
Full article ">Figure 4
<p>Frequency distribution of Bricker et al.’s trophic categories [<a href="#B31-water-16-02721" class="html-bibr">31</a>]. Trophic State Classes (Sentinel Level 1C and 2A).</p>
Full article ">Figure 5
<p>(<b>a</b>) Results from fuzzy cluster analysis (si-max) showing minimum (optimum) index value at four resolvable clusters for optical water classes. (<b>b</b>) Optical spectrum patterns for centroids of four fuzzy clusters showing reflectance peaks at 560 and 705 nm and magnitude differences across clusters.</p>
Full article ">Figure 6
<p>Optical clusters plotted in 3D water quality space. (<b>a</b>) Clusters 1–4 plotted as function of temperature (degrees C), chlorophyll (µg/L), and salinity (ppt). (<b>b</b>) Clusters 1–3 plotted as function of temperature (degrees C), chlorophyll (µg/L), and salinity (ppt). (<b>c</b>) Clusters 1–4 plotted as function of temperature (degrees C), dissolved oxygen (mg/L), and salinity (ppt). (<b>d</b>) Clusters 1–3 plotted as function of temperature (degrees C), dissolved oxygen (mg/L), and salinity (ppt). Clear circle represents axis origin, not a cluster.</p>
Full article ">
21 pages, 1662 KiB  
Review
Electric Vehicle Integration in Coupled Power Distribution and Transportation Networks: A Review
by Jingzhe Hu, Xu Wang and Shengmin Tan
Energies 2024, 17(19), 4775; https://doi.org/10.3390/en17194775 - 24 Sep 2024
Viewed by 340
Abstract
Integrating electric vehicles (EVs) into the coupled power distribution network (PDN) and transportation network (TN) presents substantial challenges. This paper explores three key areas in EV integration: charging/discharging scheduling, charging navigation, and charging station planning. First, the paper discusses the features and importance [...] Read more.
Integrating electric vehicles (EVs) into the coupled power distribution network (PDN) and transportation network (TN) presents substantial challenges. This paper explores three key areas in EV integration: charging/discharging scheduling, charging navigation, and charging station planning. First, the paper discusses the features and importance of EV integrated traffic–power networks. Then, it examines key factors influencing EV strategy, such as user behavior, charging preferences, and battery performance. Next, the study establishes an EV charging and discharging model, with particular emphasis on the complexities introduced by factors such as pricing mechanisms and integration approaches. Furthermore, the charging navigation model and the role of real-time traffic information are discussed. Additionally, the paper highlights the importance of multi-type charging stations and the impact of uncertainty on charging station planning. The paper concludes by identifying significant challenges and potential opportunities for EV integration. Future research should focus on enhancing coupled network modeling, refining user behavior models, developing incentive pricing mechanisms, and advancing autonomous driving and automated charging technologies. Such efforts will be essential for achieving a sustainable and efficient EV ecosystem. Full article
Show Figures

Figure 1

Figure 1
<p>Factors considered in EV control strategy.</p>
Full article ">Figure 2
<p>EV charging model.</p>
Full article ">Figure 3
<p>EV navigation model.</p>
Full article ">Figure 4
<p>Uncertainties considered in EV charging scheduling, navigation, and station planning.</p>
Full article ">
7 pages, 696 KiB  
Proceeding Paper
Using SABC Algorithm for Scheduling Unrelated Parallel Batch Processing Machines Considering Deterioration Effects and Variable Maintenance
by Ziyang Ji, Jabir Mumtaz and Ke Ke
Eng. Proc. 2024, 75(1), 20; https://doi.org/10.3390/engproc2024075020 - 24 Sep 2024
Viewed by 121
Abstract
This paper investigates the problem of processing jobs on unrelated parallel batch machines, taking into account job arrival times, machine deterioration effects, and variable preventive maintenance (VPM). To address this complex scheduling problem, this paper proposes a Self-Adaptive Artificial Bee Colony (SABC) algorithm, [...] Read more.
This paper investigates the problem of processing jobs on unrelated parallel batch machines, taking into account job arrival times, machine deterioration effects, and variable preventive maintenance (VPM). To address this complex scheduling problem, this paper proposes a Self-Adaptive Artificial Bee Colony (SABC) algorithm, incorporating an adaptive variable neighborhood search mechanism into the algorithm. To verify the effectiveness of the proposed algorithm, we designed comparative experiments, comparing the SABC algorithm with the NSGA-III algorithm on problem instances of different scales. The results indicate that the SABC algorithm outperforms the NSGA-III algorithm in terms of solution quality and diversity, and this advantage becomes more pronounced as the problem scale increases. Full article
Show Figures

Figure 1

Figure 1
<p>Flow chart of the proposed SABC.</p>
Full article ">Figure 2
<p>Example of neighborhood structure.</p>
Full article ">
33 pages, 5556 KiB  
Article
Multi-Layer Objective Model and Progressive Optimization Mechanism for Multi-Satellite Imaging Mission Planning in Large-Scale Target Scenarios
by Xueying Yang, Min Hu, Gang Huang and Feiyao Huang
Appl. Sci. 2024, 14(19), 8597; https://doi.org/10.3390/app14198597 - 24 Sep 2024
Viewed by 323
Abstract
With the continuous increase in the number of in-orbit satellites and the explosive growth in the demand for observation targets, satellite resource allocation and mission scheduling are faced with the problems of declining benefits and stagnant algorithm performance. This work proposes a progressive [...] Read more.
With the continuous increase in the number of in-orbit satellites and the explosive growth in the demand for observation targets, satellite resource allocation and mission scheduling are faced with the problems of declining benefits and stagnant algorithm performance. This work proposes a progressive optimization mechanism and population size adaptive strategy for an improved differential evolution algorithm (POM-PSASIDEA) in large-scale multi-satellite imaging mission planning to address the above challenges. (1) MSIMPLTS based on Multi-layer Objective Optimization is constructed, and the MSIMPLTS is processed hierarchically by setting up three sub-models (superstructure, mesostructure, and understructure) to achieve a diversity of resource selection and step-by-step refinement of optimization objectives to improve the task benefits. (2) Construct the progressive optimization mechanism, which contains the allocation optimization, time window optimization, and global optimization phases, to reduce task conflicts through the progressive decision-making of the task planning scheme in stages. (3) A population size adaptive strategy for an improved differential evolution algorithm is proposed to dynamically adjust the population size according to the evolution of the population to avoid the algorithm falling into the local optimum. The experimental results show that POM-PSASIDEA has outstanding advantages over other algorithms, such as high task benefits and a high task allocation rate when solved in a shorter time. Full article
Show Figures

Figure 1

Figure 1
<p>MSIMP basic mission scenarios: (<b>a</b>) The sequence of multi-satellite imaging mission assignments. (<b>b</b>) The visible time window allocation scheme for each satellite and the target task.</p>
Full article ">Figure 2
<p>Observation time window conflict diagram.</p>
Full article ">Figure 3
<p>Progressive optimization mechanism.</p>
Full article ">Figure 4
<p>Allocation optimization phase process.</p>
Full article ">Figure 5
<p>Time window optimization phase.</p>
Full article ">Figure 6
<p>Geographic distribution of the 100 target tasks.</p>
Full article ">Figure 7
<p>Initial task planning scheme.</p>
Full article ">Figure 8
<p>Schematic of the distribution of the final MSIMPLTS-MLOO mission planning scheme.</p>
Full article ">Figure 9
<p>Performance analysis of the MSIMPLTS-MLOO model for solving different instances of MSIMPLTS in a large-scale target task scenario: (<b>a</b>) MSIMPLTS-MLOO model when solving different instances of MSIMPLTS; (<b>b</b>) mission benefits in the local region and the global region.</p>
Full article ">Figure 10
<p>Benefit analysis of the POM-PSASIDEA algorithm for solving different instances of MSIMPLTS in a large-scale target task scenario. (<b>a</b>) Task benefit convergence for task number 100. (<b>b</b>) Task benefit convergence for task number 150. (<b>c</b>) Task benefit convergence for task number 200. (<b>d</b>) Task benefit convergence for task number 250. (<b>e</b>) Task benefit convergence for task number 300. (<b>f</b>) Task benefit convergence for task number 350.</p>
Full article ">Figure 10 Cont.
<p>Benefit analysis of the POM-PSASIDEA algorithm for solving different instances of MSIMPLTS in a large-scale target task scenario. (<b>a</b>) Task benefit convergence for task number 100. (<b>b</b>) Task benefit convergence for task number 150. (<b>c</b>) Task benefit convergence for task number 200. (<b>d</b>) Task benefit convergence for task number 250. (<b>e</b>) Task benefit convergence for task number 300. (<b>f</b>) Task benefit convergence for task number 350.</p>
Full article ">Figure 11
<p>Experiments comparing the performance of the POM-PSASIDEA algorithm with other algorithms. (<b>a</b>) Max fitness of different algorithms in the local area scenario. (<b>b</b>) Max fitness of different algorithms in the global area scenario. (<b>c</b>) Average fitness of different algorithms in the local area scenario. (<b>d</b>) Average fitness of different algorithms in the global area scenario. (<b>e</b>) Min fitness of different algorithms in the local area scenario. (<b>f</b>) Min fitness of different algorithms in the global area scenario.</p>
Full article ">
19 pages, 575 KiB  
Article
Jointly Optimization of Delay and Energy Consumption for Multi-Device FDMA in WPT-MEC System
by Danxia Qiao, Lu Sun, Dianju Li, Huajie Xiong, Rina Liang, Zhenyuan Han and Liangtian Wan
Sensors 2024, 24(18), 6123; https://doi.org/10.3390/s24186123 - 22 Sep 2024
Viewed by 572
Abstract
With the rapid development of mobile edge computing (MEC) and wireless power transfer (WPT) technologies, the MEC-WPT system makes it possible to provide high-quality data processing services for end users. However, in a real-world WPT-MEC system, the channel gain decreases with the transmission [...] Read more.
With the rapid development of mobile edge computing (MEC) and wireless power transfer (WPT) technologies, the MEC-WPT system makes it possible to provide high-quality data processing services for end users. However, in a real-world WPT-MEC system, the channel gain decreases with the transmission distance, leading to “double near and far effect” in the joint transmission of wireless energy and data, which affects the quality of the data processing service for end users. Consequently, it is essential to design a reasonable system model to overcome the “double near and far effect” and make reasonable scheduling of multi-dimensional resources such as energy, communication and computing to guarantee high-quality data processing services. First, this paper designs a relay collaboration WPT-MEC resource scheduling model to improve wireless energy utilization efficiency. The optimization goal is to minimize the normalization of the total communication delay and total energy consumption while meeting multiple resource constraints. Second, this paper imports a BK-means algorithm to complete the end terminals cluster to guarantee effective energy reception and adapts the whale optimization algorithm with adaptive mechanism (AWOA) for mobile vehicle path-planning to reduce energy waste. Third, this paper proposes an immune differential enhanced deep deterministic policy gradient (IDDPG) algorithm to realize efficient resource scheduling of multiple resources and minimize the optimization goal. Finally, simulation experiments are carried out on different data, and the simulation results prove the validity of the designed scheduling model and proposed IDDPG. Full article
Show Figures

Figure 1

Figure 1
<p>The overview of the system model.</p>
Full article ">Figure 2
<p>The first time slot allocation within the time block <span class="html-italic">T</span>.</p>
Full article ">Figure 3
<p>The second time slots allocation within the time block <span class="html-italic">T</span>.</p>
Full article ">Figure 4
<p>The flowchart of the hybrid whale–bat optimization algorithm.</p>
Full article ">Figure 5
<p>The impact of task data volume.</p>
Full article ">Figure 6
<p>The impact of system bandwidth.</p>
Full article ">Figure 7
<p>The impact of facing angle.</p>
Full article ">Figure 8
<p>The impact of the number of terminals.</p>
Full article ">Figure 9
<p>The impact of the <math display="inline"><semantics> <mi>β</mi> </semantics></math> value.</p>
Full article ">
21 pages, 1970 KiB  
Article
Integrated Energy System Dispatch Considering Carbon Trading Mechanisms and Refined Demand Response for Electricity, Heat, and Gas
by Lihui Gao, Shuanghao Yang, Nan Chen and Junheng Gao
Energies 2024, 17(18), 4705; https://doi.org/10.3390/en17184705 - 21 Sep 2024
Viewed by 411
Abstract
To realize a carbon-efficient and economically optimized dispatch of the integrated energy system (IES), this paper introduces a highly efficient dispatch strategy that integrates demand response within a tiered carbon trading mechanism. Firstly, an efficient dispatch model making use of CHP and P2G [...] Read more.
To realize a carbon-efficient and economically optimized dispatch of the integrated energy system (IES), this paper introduces a highly efficient dispatch strategy that integrates demand response within a tiered carbon trading mechanism. Firstly, an efficient dispatch model making use of CHP and P2G technologies is developed to strengthen the flexibility of the IES. Secondly, an improved demand response model based on the price elasticity matrix and the capacity for the substitution of energy supply modes is constructed, taking into account three different kinds of loads: heat, gas, and electricity. Subsequently, the implementation of a reward and penalty-based tiered carbon trading mechanism regulates the system’s carbon trading costs and emissions. Ultimately, the goal of the objective function is to minimize the overall costs, encompassing energy purchase, operation and maintenance, carbon trading, and compensation. The original problem is reformulated into a mixed-integer linear programming problem, which is solved using CPLEX. The simulation results from four example scenarios demonstrate that, compared with the conventional carbon trading approach, the aggregate system costs are reduced by 2.44% and carbon emissions are reduced by 3.93% when incorporating the tiered carbon trading mechanism. Subsequent to the adoption of demand response, there is a 2.47% decrease in the total system cost. The proposed scheduling strategy is validated as valuable to ensure the low-carbon and economically efficient functioning of the integrated energy system. Full article
(This article belongs to the Section C: Energy Economics and Policy)
Show Figures

Figure 1

Figure 1
<p>Structure of the IES.</p>
Full article ">Figure 2
<p>Comprehensive structure of the constraints.</p>
Full article ">Figure 3
<p>IES program flow chart.</p>
Full article ">Figure 4
<p>The power generated by different load in the IES.</p>
Full article ">Figure 5
<p>Prices for energy purchased from the upper grid and gas grid: (<b>a</b>) electricity prices, (<b>b</b>) gas prices.</p>
Full article ">Figure 6
<p>Initial and time-of-use tariffs for three loads: (<b>a</b>) gas prices, (<b>b</b>) heat prices, and (<b>c</b>) electricity prices.</p>
Full article ">Figure 7
<p>Change in load before and after DR in Scenario 4: (<b>a</b>) change in gas load, (<b>b</b>) change in heat load, and (<b>c</b>) change in electric load.</p>
Full article ">Figure 8
<p>Balance of each power under Scenario 4: (<b>a</b>) gas power balance, (<b>b</b>) heat power balance, and (<b>c</b>) electric power balance.</p>
Full article ">Figure 9
<p>Balance of each power under Scenario 3: (<b>a</b>) gas power balance, (<b>b</b>) heat power balance, and (<b>c</b>) electric power balance.</p>
Full article ">
22 pages, 1097 KiB  
Article
Virtual Simulation-Based Optimization for Assembly Flow Shop Scheduling Using Migratory Bird Algorithm
by Wen-Bin Zhao, Jun-Han Hu and Zi-Qiao Tang
Biomimetics 2024, 9(9), 571; https://doi.org/10.3390/biomimetics9090571 - 21 Sep 2024
Viewed by 377
Abstract
As industrial informatization progresses, virtual simulation technologies are increasingly demonstrating their potential in industrial applications. These systems utilize various sensors to capture real-time factory data, which are then transmitted to servers via communication interfaces to construct corresponding digital models. This integration facilitates tasks [...] Read more.
As industrial informatization progresses, virtual simulation technologies are increasingly demonstrating their potential in industrial applications. These systems utilize various sensors to capture real-time factory data, which are then transmitted to servers via communication interfaces to construct corresponding digital models. This integration facilitates tasks such as monitoring and prediction, enabling more accurate and convenient production scheduling and forecasting. This is particularly significant for flexible or mixed-flow production modes. Bionic optimization algorithms have demonstrated strong performance in factory scheduling and operations. Centered around these algorithms, researchers have explored various strategies to enhance efficiency and optimize processes within manufacturing environments.This study introduces an efficient migratory bird optimization algorithm designed to address production scheduling challenges in an assembly shop with mold quantity constraints. The research aims to minimize the maximum completion time in a batch flow mixed assembly flow shop scheduling problem, incorporating variable batch partitioning strategies. A tailored virtual simulation framework supports this objective. The algorithm employs a two-stage encoding mechanism for batch partitioning and sequencing, adapted to the unique constraints of each production stage. To enhance the search performance of the neighborhood structure, the study identifies and analyzes optimization strategies for batch partitioning and sequencing, and incorporates an adaptive neighborhood structure adjustment strategy. A competition mechanism is also designed to enhance the algorithm’s optimization efficiency. Simulation experiments of varying scales demonstrate the effectiveness of the variable batch partitioning strategy, showing a 5–6% improvement over equal batch strategies. Results across different scales and parameters confirm the robustness of the algorithm. Full article
Show Figures

Figure 1

Figure 1
<p>Construction of virtual simulation framework.</p>
Full article ">Figure 2
<p>Simplified product process diagram of household appliances.</p>
Full article ">Figure 3
<p>Simplified model diagram of assembly workshop.</p>
Full article ">Figure 4
<p>Product three-stage process diagram.</p>
Full article ">Figure 5
<p>Batch division code generation.</p>
Full article ">Figure 6
<p>Initial arrangement code generation.</p>
Full article ">Figure 7
<p>Domain structure transformation of two-segment coding.</p>
Full article ">Figure 8
<p>Flow chart of EMBO algorithm.</p>
Full article ">Figure 9
<p>Process drawing of various products.</p>
Full article ">Figure 10
<p>Influence of parameters on performance of EMBO algorithm.</p>
Full article ">Figure 11
<p>Results of two studies under different batch strategies.</p>
Full article ">Figure 12
<p>Convergence effect diagram of three algorithms.</p>
Full article ">Figure 13
<p>Convergence effect diagram of three algorithms.</p>
Full article ">
Back to TopTop