A novel algorithm combining finite state method and genetic algorithm for solving crude oil scheduling problem.
Ontology highlight
ABSTRACT:
SUBMITTER: Duan QQ
PROVIDER: S-EPMC3948204 | biostudies-other | 2014
REPOSITORIES: biostudies-other
Similar Datasets
Project description:One of the great challenges of unconfined seepage through a dam lies in the accurate determination of free surface that depends on the complexity of the seepage model, especially if the model is characterized with complex geometry and sharp variations in permeability distribution. This study presents a practical methodology that combines the adaptive moving-mesh algorithm and the Galerkin finite element method (FEM) to solve an unconfined seepage problem with high efficiency and precision. The methodology employs a set of improvement terms, such as remainder factor, step-size parameter and termination condition, all of which guarantee that the simulation and the refinement fitting can be implemented efficiently until the free surface converges within a given allowable error. In particular, a specialized discussion is presented for the significant relation between the location of the exit point and the corresponding grid fineness. To validate the practicability of the proposed method, a series of examples are performed. Comparing the result with those of other numerical approaches, we conclude that even though the unconfined seepage model may be complicated with arbitrary complex geometry and sharp variations in permeability distribution, the proposed algorithm provides a great improvement in efficiency and accuracy in free-surface searching.
| S-EPMC6502791 | biostudies-literature
Project description:This paper is devoted to develop an approximation method for scheduling refinery crude oil operations by taking into consideration the demand uncertainty. In the stochastic model the demand uncertainty is modeled as random variables which follow a joint multivariate distribution with a specific correlation structure. Compared to deterministic models in existing works, the stochastic model can be more practical for optimizing crude oil operations. Using joint chance constraints, the demand uncertainty is treated by specifying proximity level on the satisfaction of product demands. However, the joint chance constraints usually hold strong nonlinearity and consequently, it is still hard to handle it directly. In this paper, an approximation method combines a relax-and-tight technique to approximately transform the joint chance constraints to a serial of parameterized linear constraints so that the complicated problem can be attacked iteratively. The basic idea behind this approach is to approximate, as much as possible, nonlinear constraints by a lot of easily handled linear constraints which will lead to a well balance between the problem complexity and tractability. Case studies are conducted to demonstrate the proposed methods. Results show that the operation cost can be reduced effectively compared with the case without considering the demand correlation.
| S-EPMC3976839 | biostudies-other
Project description:Rather than replacing human labor, there is growing evidence that networked computers create opportunities for collaborations of people and algorithms to solve problems beyond either of them. In this study, we demonstrate the conditions under which such synergy can arise. We show that, for a design task, three elements are sufficient: humans apply intuitions to the problem, algorithms automatically determine and report back on the quality of designs, and humans observe and innovate on others' designs to focus creative and computational effort on good designs. This study suggests how such collaborations should be composed for other domains, as well as how social and computational dynamics mutually influence one another during collaborative problem solving.
| S-EPMC4636355 | biostudies-literature
Project description:MotivationBinary (or Boolean) matrices provide a common effective data representation adopted in several domains of computational biology, especially for investigating cancer and other human diseases. For instance, they are used to summarize genetic aberrations-copy number alterations or mutations-observed in cancer patient cohorts, effectively highlighting combinatorial relations among them. One of these is the tendency for two or more genes not to be co-mutated in the same sample or patient, i.e. a mutual-exclusivity trend. Exploiting this principle has allowed identifying new cancer driver protein-interaction networks and has been proposed to design effective combinatorial anti-cancer therapies rationally. Several tools exist to identify and statistically assess mutual-exclusive cancer-driver genomic events. However, these tools need to be equipped with robust/efficient methods to sort rows and columns of a binary matrix to visually highlight possible mutual-exclusivity trends.ResultsHere, we formalize the mutual-exclusivity-sorting problem and present MutExMatSorting: an R package implementing a computationally efficient algorithm able to sort rows and columns of a binary matrix to highlight mutual-exclusivity patterns. Particularly, our algorithm minimizes the extent of collective vertical overlap between consecutive non-zero entries across rows while maximizing the number of adjacent non-zero entries in the same row. Here, we demonstrate that existing tools for mutual-exclusivity analysis are suboptimal according to these criteria and are outperformed by MutExMatSorting.Availability and implementationhttps://github.com/AleVin1995/MutExMatSorting.Supplementary informationSupplementary data are available at Bioinformatics online.
| S-EPMC9857977 | biostudies-literature
Project description:The text clustering is considered as one of the most effective text document analysis methods, which is applied to cluster documents as a consequence of the expanded big data and online information. Based on the review of the related work of the text clustering algorithms, these algorithms achieved reasonable clustering results for some datasets, while they failed on a wide variety of benchmark datasets. Furthermore, the performance of these algorithms was not robust due to the inefficient balance between the exploitation and exploration capabilities of the clustering algorithm. Accordingly, this research proposes a Memetic Differential Evolution algorithm (MDETC) to solve the text clustering problem, which aims to address the effect of the hybridization between the differential evolution (DE) mutation strategy with the memetic algorithm (MA). This hybridization intends to enhance the quality of text clustering and improve the exploitation and exploration capabilities of the algorithm. Our experimental results based on six standard text clustering benchmark datasets (i.e. the Laboratory of Computational Intelligence (LABIC)) have shown that the MDETC algorithm outperformed other compared clustering algorithms based on AUC metric, F-measure, and the statistical analysis. Furthermore, the MDETC is compared with the state of art text clustering algorithms and obtained almost the best results for the standard benchmark datasets.
| S-EPMC7289410 | biostudies-literature
Project description:To overcome the disadvantages of premature convergence and easy trapping into local optimum solutions, this paper proposes an improved particle swarm optimization algorithm (named NDWPSO algorithm) based on multiple hybrid strategies. Firstly, the elite opposition-based learning method is utilized to initialize the particle position matrix. Secondly, the dynamic inertial weight parameters are given to improve the global search speed in the early iterative phase. Thirdly, a new local optimal jump-out strategy is proposed to overcome the "premature" problem. Finally, the algorithm applies the spiral shrinkage search strategy from the whale optimization algorithm (WOA) and the Differential Evolution (DE) mutation strategy in the later iteration to accelerate the convergence speed. The NDWPSO is further compared with other 8 well-known nature-inspired algorithms (3 PSO variants and 5 other intelligent algorithms) on 23 benchmark test functions and three practical engineering problems. Simulation results prove that the NDWPSO algorithm obtains better results for all 49 sets of data than the other 3 PSO variants. Compared with 5 other intelligent algorithms, the NDWPSO obtains 69.2%, 84.6%, and 84.6% of the best results for the benchmark function ( f1-f13 ) with 3 kinds of dimensional spaces (Dim = 30,50,100) and 80% of the best optimal solutions for 10 fixed-multimodal benchmark functions. Also, the best design solutions are obtained by NDWPSO for all 3 classical practical engineering problems.
| S-EPMC11375002 | biostudies-literature
Project description:This data article describes datasets from a home improvement retail store located in Santiago, Chile. The datasets have been developed to simultaneously solve a staffing and tour scheduling problem that incorporates flexible contracts and multiskilled staff. This Data in Brief article is related to the published article "Hybrid flexibility strategy on personnel scheduling: Retail case study" [1]. The datasets contain real, processed, and simulated data. Regarding the real and processed datasets, they are presented for three different store sizes (4, 5 or 6 departments). Real datasets include information about the employment-contract characteristics, cost parameters, and a forecast of the number of employees required in each department for each day of the week and each time period into which the operating day is divided. As regards the data processed for the case study, they include the set of skill sets considering that the employees can be trained in a maximum of two store departments. Regarding the simulated datasets, they include information about the random parameter of staff demand in each store department. The simulated data are presented in 90 text files classified by: (i) Store size (4, 5 or 6 departments). (ii) Coefficient of variation (10, 20, 30%). (iii) Instance identification number (10 instances per scenario that resulted from combining the store sizes and coefficients of variation). Researchers can use the datasets for benchmarking the performance of different approaches with the one presented by Porto et al. [1], and in consequence, they can find solutions to the same (or similar) type of personnel scheduling problem. The dataset includes an Excel workbook that can be used to randomly generate staff demand instances according to a chosen coefficient of variation.
| S-EPMC7394855 | biostudies-literature
Project description:Nowadays and due to the pandemic of COVID-19, nurses are working under the highest pressure benevolently all over the world. This urgent situation can cause more fatigue for nurses who are responsible for taking care of COVID-19 patients 24 hours a day. Therefore, nurse scheduling should be modified with respect to this new situation. The purpose of the present research is to propose a new mathematical model for Nurse Scheduling Problem (NSP) considering the fatigue factor. To solve the proposed model, a hybrid Genetic Algorithm (GA) has been developed to provide a nurse schedule for all three shifts of a day. To validate the proposed approach, a randomly generated problem has been solved. In addition, to show the applicability of the proposed approach in real situations, the model has been solved for a real case study, a department in one of the hospitals in Esfahan, Iran, where COVID-19 patients are hospitalized. Consequently, a nurse schedule for May has been provided applying the proposed model, and the results approve its superiority in comparison with the manual schedule that is currently used in the department. To the best of our knowledge, it is the first study in which the proposed model takes the fatigue of nurses into account and provides a schedule based on it.
| S-EPMC8034424 | biostudies-literature
Project description:Finding the location of sensors in wireless sensor networks (WSNs) is a major test, particularly in a wide region. A salient clustering approach is laid out to achieve better performance in such a network using an evolutional algorithm. This paper developed a clustered network called neighborhood grid cluster which has a node assuming the part of a cluster center focused in every grid. Grid-based clustering is less difficult and possesses a lot of benefits compared to other clustering techniques. Besides, we proposed a localization algorithm that centers around assessing the target area by considering the least estimated distance embedded with the genetic algorithm. Performance standards incorporate the energy representation, connectivity stratagem, and distance measure as fitness functions that assess our localization problem to demonstrate its viability. Simulation results confirm that our approach further improves localization accuracy, energy utilization, node lifetime, and localization coverage.
| S-EPMC9256383 | biostudies-literature
Project description:A genetic algorithm (GA) cannot always avoid premature convergence, and multi-population is usually used to overcome this limitation by dividing the population into several sub-populations (sub-population number) with the same number of individuals (sub-population size). In previous research, the questions of how a network structure composed of sub-populations affects the propagation rate of advantageous genes among sub-populations and how it affects the performance of GA have always been ignored. Therefore, we first propose a multi-population GA with an ER network (MPGA-ER). Then, by using the flexible job shop scheduling problem (FJSP) as an example and considering the total individual number (TIN), we study how the sub-population number and size and the propagation rate of advantageous genes affect the performance of MPGA-ER, wherein the performance is evaluated by the average optimal value and success rate based on TIN. The simulation results indicate the following regarding the performance of MPGA-ER: (i) performance shows considerable improvement compared with that of traditional GA; (ii) for an increase in the sub-population number for a certain TIN, the performance first increases slowly, and then decreases rapidly; (iii) for an increase in the sub-population size for a certain TIN, the performance of MPGA-ER first increases rapidly and then tends to remain stable; and (iv) with an increase in the propagation rate of advantageous genes, the performance first increases rapidly and then decreases slowly. Finally, we use a parameter-optimized MPGA-ER to solve for more FJSP instances and demonstrate its effectiveness by comparing it with that of other algorithms proposed in other studies.
| S-EPMC7259647 | biostudies-literature