Similarity Search Algorithm over Data Supply Chain Based on Key Points

Author(s):  
Peng Li ◽  
Hong Luo ◽  
Yan Sun ◽  
Xin-Ming Li
Author(s):  
ANEURIN M. EASWARAN ◽  
JEREMY PITT

Efficient allocation of services to form a supply chain to solve complex tasks is a crucial problem. Optimal service allocation based on a single criterion is NP-Complete. Furthermore, complex tasks in general have multiple criteria that may be conflicting and non-commensurable. This paper presents a two-stage brokering algorithm for optimal anytime service allocation based on multiple criteria. In the first stage, a hierarchical task network planner is used to identify the services required to solve a task. In the second stage, a genetic algorithm (GA) determines service providers based on multiple criteria to provide the services identified by the planner. We present our algorithm and results from various experiments conducted to analyze the effect of various parameters that influence the complexity of the problem. In general, the results show the GA finds optimal solutions much quicker than a standard search algorithm. The empirical results also indicate the performance of the algorithm is sub-linear or polynomial time for various parameters. The algorithm has the ability to deal with any number of criteria. By addressing this problem, we expand the range of problems being addressed to any that require simultaneous optimization of multiple criteria and/or planning.


2012 ◽  
Vol 02 (04) ◽  
pp. 12-19
Author(s):  
Huei-Huang Chen ◽  
Kuo-Shean Liu ◽  
Shih-Chih Chen ◽  
Chan-Yen Chang ◽  
Kai-Shih Hsieh

Supply chain is an inter-enterprise process that connects upstream and downstream companies closely. In order to accelerate the information flow in supply chain, therefore, we need an inter-enterprise and integrated information sharing method. The information sharing among enterprises can be transparency. Upstream and downstream companies access virtual data warehouse. That makes enterprise can achieve customer quick response by supply chain management. This study mainly proposed a reference model to adopt fast information flow mechanism and transfer information from customer demand to the manufacturing facilities. Besides, this study reviewed some key points for supporting business process collaborations when organizations implemented the work flow management system. Finally, we proposed our major findings and future directions


2000 ◽  
Vol 75 (1-2) ◽  
pp. 35-42 ◽  
Author(s):  
Ju-Hong Lee ◽  
Deok-Hwan Kim ◽  
Seok-Lyong Lee ◽  
Chin-Wan Chung ◽  
Guang-Ho Cha

2018 ◽  
Vol 189 ◽  
pp. 06001 ◽  
Author(s):  
Fathy Elkazzaz ◽  
Abdelmageed Mahmoud ◽  
Ali Maher

A meta-heuristic algorithm called, the cuckoo search algorithm is proposed in dealing with the multi-objective supply chain model to find the optimum configuration of a given supply chain problem which minimizes the total cost and the total lead-time. The supply chain problem utilized in this study is taken from literature to show the performance of the proposed model; in addition, the results have been compared to those achieved by the bee colony optimization algorithm and genetic algorithm. Those obtained results indicate that the proposed cuckoo search algorithm is able to get better Pareto solutions (non-dominated set) for the supply chain problem.


Molecules ◽  
2019 ◽  
Vol 24 (12) ◽  
pp. 2233 ◽  
Author(s):  
Michele Montaruli ◽  
Domenico Alberga ◽  
Fulvio Ciriaco ◽  
Daniela Trisciuzzi ◽  
Anna Rita Tondo ◽  
...  

In this continuing work, we have updated our recently proposed Multi-fingerprint Similarity Search algorithm (MuSSel) by enabling the generation of dominant ionized species at a physiological pH and the exploration of a larger data domain, which included more than half a million high-quality small molecules extracted from the latest release of ChEMBL (version 24.1, at the time of writing). Provided with a high biological assay confidence score, these selected compounds explored up to 2822 protein drug targets. To improve the data accuracy, samples marked as prodrugs or with equivocal biological annotations were not considered. Notably, MuSSel performances were overall improved by using an object-relational database management system based on PostgreSQL. In order to challenge the real effectiveness of MuSSel in predicting relevant therapeutic drug targets, we analyzed a pool of 36 external bioactive compounds published in the Journal of Medicinal Chemistry from October to December 2018. This study demonstrates that the use of highly curated chemical and biological experimental data on one side, and a powerful multi-fingerprint search algorithm on the other, can be of the utmost importance in addressing the fate of newly conceived small molecules, by strongly reducing the attrition of early phases of drug discovery programs.


Sign in / Sign up

Export Citation Format

Share Document