Browse
Submit Data
Databases
API
Help

Dataset Information

18 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

A novel algorithm combining finite state method and genetic algorithm for solving crude oil scheduling problem.

ABSTRACT: A hybrid optimization algorithm combining finite state method (FSM) and genetic algorithm (GA) is proposed to solve the crude oil scheduling problem. The FSM and GA are combined to take the advantage of each method and compensate deficiencies of individual methods. In the proposed algorithm, the finite state method makes up for the weakness of GA which is poor at local searching ability. The heuristic returned by the FSM can guide the GA algorithm towards good solutions. The idea behind this is that we can generate promising substructure or partial solution by using FSM. Furthermore, the FSM can guarantee that the entire solution space is uniformly covered. Therefore, the combination of the two algorithms has better global performance than the existing GA or FSM which is operated individually. Finally, a real-life crude oil scheduling problem from the literature is used for conducting simulation. The experimental results validate that the proposed method outperforms the state-of-art GA method.

SUBMITTER: Duan QQ

PROVIDER: S-EPMC3948204 | biostudies-other | 2014

REPOSITORIES: biostudies-other

ACCESS DATA

Json Xml

Similar Datasets

A practical adaptive moving-mesh algorithm for solving unconfined seepage problem with Galerkin finite element method.

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

An approximation solution to refinery crude oil scheduling problem with demand uncertainty using joint constrained programming.

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

Combining Computational and Social Effort for Collaborative Problem Solving.

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

Solving text clustering problem using a memetic differential evolution algorithm.

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

Dataset for solving a hybrid flexibility strategy on personnel scheduling problem in the retail industry.

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

Multi-population genetic algorithm with ER network for solving flexible job shop scheduling problems.

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

A Neighborhood Grid Clustering Algorithm for Solving Localization Problem in WSN Using Genetic Algorithm.

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

Finite temperature quantum annealing solving exponentially small gap problem with non-monotonic success probability.

Project description:Closed-system quantum annealing is expected to sometimes fail spectacularly in solving simple problems for which the gap becomes exponentially small in the problem size. Much less is known about whether this gap scaling also impedes open-system quantum annealing. Here, we study the performance of a quantum annealing processor in solving such a problem: a ferromagnetic chain with sectors of alternating coupling strength that is classically trivial but exhibits an exponentially decreasing gap in the sector size. The gap is several orders of magnitude smaller than the device temperature. Contrary to the closed-system expectation, the success probability rises for sufficiently large sector sizes. The success probability is strongly correlated with the number of thermally accessible excited states at the critical point. We demonstrate that this behavior is consistent with a quantum open-system description that is unrelated to thermal relaxation, and is instead dominated by the system's properties at the critical point.

| S-EPMC6060131 | biostudies-literature

Discrete bat algorithm for optimal problem of permutation flow shop scheduling.

Project description:A discrete bat algorithm (DBA) is proposed for optimal permutation flow shop scheduling problem (PFSP). Firstly, the discrete bat algorithm is constructed based on the idea of basic bat algorithm, which divide whole scheduling problem into many subscheduling problems and then NEH heuristic be introduced to solve subscheduling problem. Secondly, some subsequences are operated with certain probability in the pulse emission and loudness phases. An intensive virtual population neighborhood search is integrated into the discrete bat algorithm to further improve the performance. Finally, the experimental results show the suitability and efficiency of the present discrete bat algorithm for optimal permutation flow shop scheduling problem.

| S-EPMC4163327 | biostudies-other

Preconditioned alternating projection algorithm for solving the penalized-likelihood SPECT reconstruction problem.

Project description:PURPOSE:The authors recently developed a preconditioned alternating projection algorithm (PAPA) for solving the penalized-likelihood SPECT reconstruction problem. The proposed algorithm can solve a wide variety of non-differentiable optimization models. This work is dedicated to comparing the performance of PAPA with total variation (TV) regularization (TV-PAPA) and a novel forward-backward algorithm with nested expectation maximization (EM)-TV iteration scheme (FB-EM-TV). METHODS:Monte Carlo technique was used to simulate multiple noise realizations of the fan-beam collimated SPECT data for a piecewise constant phantom with warm background, and hot and cold spheres with uniform activities at two noise levels. They were reconstructed using the aforementioned algorithms with attenuation, scatter, distance-dependent collimator blurring and sensitivity corrections. Noise suppressing performance, lesion detectability, lesion contrast, contrast recovery coefficient, convergence speed and selection of optimal parameters were evaluated. The conventional EM algorithms with TV post-filter (TVPF-EM) and Gaussian post-filter (GPF-EM) were used as benchmarks. RESULTS:The TV-PAPA and FB-EM-TV demonstrated similar performance in all investigated categories. Both algorithms outperformed TVPF-EM in terms of image noise suppression, lesion detectability, lesion contrast and convergence speed. We established that the optimal parameters versus information density approximately followed power laws, which offers a guidance in parameter selection for reconstruction methods. CONCLUSIONS:For the simulated SPECT data, TV-PAPA and FB-EM-TV produced qualitatively and quantitatively similar images. They performed better than the benchmark TVPF-EM and GPF-EM, with only limited loss of lesion contrast.

| S-EPMC5573596 | biostudies-literature

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data