scholarly journals Confusion Analysis and Detection for Workflow Nets

2014 ◽  
Vol 2014 ◽  
pp. 1-14 ◽  
Author(s):  
Xiao-liang Chen ◽  
Zhong-yuan Jiang ◽  
Jian-hong Ye
Keyword(s):  
Linear Programming ◽  
Integer Linear Programming ◽  
High Performance ◽  
Resource Competition ◽  
Reachability Graph ◽  
Decision Behavior ◽  
Workflow Nets ◽  
Detection Approach ◽  
The Impact ◽  
Workflow Net

Option processes often occur in a business procedure with respect to resource competition. In a business procedure modeled with a workflow net (WF-net), all decision behavior and option operations for business tasks are modeled and performed by the conflicts in corresponding WF-net. Concurrency in WF-nets is applied to keep a high-performance operation of business procedures. However, the firing of concurrent transitions in a WF-net may lead to the disappearance of conflicts in the WF-net. The phenomenon is usually called confusions that produces difficulties for the resolution of conflicts. This paper investigates confusion detection problems in WF-nets. First, confusions are formalized as a class of marked subnets with special conflicting and concurrent features. Second, a detection approach based on the characteristics of confusion subnets and the integer linear programming (ILP) is developed, which is not required to compute the reachability graph of a WF-net. Examples of the confusion detection in WF-nets are presented. Finally, the impact of confusions on the properties of WF-nets is specified.

scholarly journals A Mixed Integer Linear Programming Method for Simultaneous Multi-Periodic Train Timetabling and Routing on a High-Speed Rail Network

2020 ◽  
Vol 12 (3) ◽  
pp. 1131
Author(s):  
Wenliang Zhou ◽  
Xiaorong You ◽  
Wenzhuang Fan
Keyword(s):  
Linear Programming ◽  
Integer Linear Programming ◽  
Mixed Integer Linear Programming ◽  
High Speed ◽  
Programming Model ◽  
Mixed Integer ◽  
High Speed Rail ◽  
Train Timetabling ◽  
Train Timetable ◽  
The Impact

To avoid conflicts among trains at stations and provide passengers with a periodic train timetable to improve service level, this paper mainly focuses on the problem of multi-periodic train timetabling and routing by optimizing the routes of trains at stations and their entering time and leaving time on each chosen arrival–departure track at each visited station. Based on the constructed directed graph, including unidirectional and bidirectional tracks at stations and in sections, a mixed integer linear programming model with the goal of minimizing the total travel time of trains is formulated. Then, a strategy is introduced to reduce the number of constraints for improving the solved efficiency of the model. Finally, the performance, stability and practicability of the proposed method, as well as the impact of some main factors on the model are analyzed by numerous instances on both a constructed railway network and Guang-Zhu inter-city railway; they are solved using the commercial solver WebSphere ILOG CPLEX (International Business Machines Corporation, New York, NY, USA). Experimental results show that integrating multi-periodic train timetabling and routing can be conducive to improving the quality of a train timetable. Hence, good economic and social benefits for high-speed rail can be achieved, thus, further contributing to the sustained development of both high-speed railway systems and society.

scholarly journals Association rule hiding using integer linear programming

2021 ◽  
Vol 11 (4) ◽  
pp. 3451
Author(s):  
Suma B. ◽  
Shobha G.
Keyword(s):  
Data Mining ◽  
Linear Programming ◽  
Integer Linear Programming ◽  
Association Rule ◽  
Real Life ◽  
Linear Program ◽  
Integer Linear Program ◽  
Optimization Approach ◽  
Integer Linear Program Formulation ◽  
The Impact

<span>Privacy preserving data mining has become the focus of attention of government statistical agencies and database security research community who are concerned with preventing privacy disclosure during data mining. Repositories of large datasets include sensitive rules that need to be concealed from unauthorized access. Hence, association rule hiding emerged as one of the powerful techniques for hiding sensitive knowledge that exists in data before it is published. In this paper, we present a constraint-based optimization approach for hiding a set of sensitive association rules, using a well-structured integer linear program formulation. The proposed approach reduces the database sanitization problem to an instance of the integer linear programming problem. The solution of the integer linear program determines the transactions that need to be sanitized in order to conceal the sensitive rules while minimizing the impact of sanitization on the non-sensitive rules. We also present a heuristic sanitization algorithm that performs hiding by reducing the support or the confidence of the sensitive rules. The results of the experimental evaluation of the proposed approach on real-life datasets indicate the promising performance of the approach in terms of side effects on the original database.</span>

scholarly journals EFEITO DAS RESTRIÇÕES ESPACIAIS DE ADJACÊNCIA NO PLANEJAMENTO FLORESTAL OTIMIZADO

FLORESTA ◽  
2010 ◽  
Vol 40 (3) ◽  
Author(s):  
Lucas Rezende Gomide ◽  
Julio Eduardo Arce ◽  
Arinei Lindbeck da Silva
Keyword(s):  
Linear Programming ◽  
Integer Linear Programming ◽  
Net Present Value ◽  
Forest Planning ◽  
Type I ◽  
Harvest Scheduling ◽  
Forest Harvest ◽  
Horizon Planning ◽  
Management Alternatives ◽  
The Impact

O objetivo do estudo foi aplicar restrições espaciais de adjacência no agendamento da colheita florestal em um modelo tradicional de planejamento florestal. Foi analisado e comparado o impacto no VPL (valor presente líquido) e na produção volumétrica de madeira. A área de estudo foi composta por 52 talhões de eucalipto. Foram simuladas 254 alternativas de manejo, sendo então criados 4 cenários de agendamento da colheita florestal envolvendo o uso da programação linear inteira, seguindo a formulação pelo modelo tipo I com maximização do VPL e um horizonte de planejamento de 7 anos. O cenário 1 não considerou a adjacência, enquanto que os cenários 2 (URM), 3 (ARM50) e 4 (ARM70) continham restrições de adjacência. Os resultados demonstraram que as restrições de adjacência reduzem o VPL em 3,74%, 2,24% e 2,10%, e a produção volumétrica em 2,92%, 1,79% e 1,73%, nos cenários 2, 3 e 4 respectivamente. Porém, os cenários 2, 3 e 4 obtiveram sucesso no controle de corte de talhões adjacentes, segundo suas restrições, e impedindo a formação de extensas áreas contiguas como encontrado no cenário 1 (153,25 ha).Palavras-chave: Programação linear inteira; restrição URM; restrição ARM. AbstractSpatial adjacency constraints effect in optimized forest planning. The objective of the study was to apply the spatial adjacency constraints in the forest harvest scheduling when using the traditional forest planning model. It was analyzed and compared the impact on NPV (Net Present Value) and the volumetric production of wood. The area of study was formed by 52 stands of eucalyptus. A total of 254 forest management alternatives were simulated, where 4 forest harvest scheduling scenarios contained the integer linear programming were created, following the model type I and the maximization of the NPV for 7 years of the horizon planning. Spatial adjacency constraints were applied to scenarios 2 (URM), 3 (ARM50) and 4 (ARM70) but not to scenario 1. The results showed that the spatial adjacency constraints reduced NPV in 3,74%, 2,24% and 2,10%, and the volumetric production in 2,92%, 1,79% e 1,73% through the scenarios 2, 3, and 4, respectively. Therefore, the scenarios 2, 3, and 4 obtained success in controlling the adjacent harvested stands, according to their restrictions, and avoiding the creation of large and continuous areas such as observed in the scenario 1 (153,25ha).Keywords: Integer linear programming; URM constraint; ARM constraint.

scholarly journals Transportation Optimization Models for Intermodal Networks with Fuzzy Node Capacity, Detour Factor, and Vehicle Utilization Constraints

Mathematics ◽  
2020 ◽  
Vol 8 (12) ◽  
pp. 2109
Author(s):  
Chia-Nan Wang ◽  
Thanh-Tuan Dang ◽  
Tran Quynh Le ◽  
Panitan Kewcharoenwong
Keyword(s):  
Linear Programming ◽  
Objective Function ◽  
Integer Linear Programming ◽  
Mixed Integer Linear Programming ◽  
Deterministic Model ◽  
Mixed Integer ◽  
Model Parameters ◽  
Total Cost ◽  
The Impact ◽  
Node Capacity

This paper develops a mathematical model for intermodal freight transportation. It focuses on determining the flow of goods, the number of vehicles, and the transferred volume of goods transported from origin points to destination points. The model of this article is to minimize the total cost, which consists of fixed costs, transportation costs, intermodal transfer costs, and CO2 emission costs. It presents a mixed integer linear programming (MILP) model that minimizes total costs, and a fuzzy mixed integer linear programming (FMILP) model that minimizes imprecise total costs under conditions of uncertain data. In the models, node capacity, detour, and vehicle utilization are incorporated to estimate the performance impact. Additionally, a computational experiment is carried out to evaluate the impact of each constraint and to analyze the characteristics of the models under different scenarios. Developed models are tested using real data from a case study in Southern Vietnam in order to demonstrate their effectiveness. The results indicate that, although the objective function (total cost) increased by 20%, the problem became more realistic to address when the model was utilized to solve the constraints of node capacity, detour, and vehicle utilization. In addition, on the basis of the FMILP model, fuzziness is considered in order to investigate the impact of uncertainty in important model parameters. The optimal robust solution shows that the total cost of the FMILP model is enhanced by 4% compared with the total cost of the deterministic model. Another key measurement related to the achievement of global sustainable development goals is considered, reducing the additional intermodal transfer cost and the cost of CO2 emissions in the objective function.

scholarly journals Evaluating the impact of AND/OR search on 0-1 integer linear programming

Constraints ◽  
2009 ◽  
Vol 15 (1) ◽  
pp. 29-63 ◽  
Author(s):  
Radu Marinescu ◽  
Rina Dechter
Keyword(s):  
Linear Programming ◽  
Integer Linear Programming ◽  
The Impact

scholarly journals Discovering workflow nets using integer linear programming

Computing ◽  
2017 ◽  
Vol 100 (5) ◽  
pp. 529-556 ◽  
Author(s):  
S. J. van Zelst ◽  
B. F. van Dongen ◽  
W. M. P. van der Aalst ◽  
H. M. W. Verbeek
Keyword(s):  
Linear Programming ◽  
Integer Linear Programming ◽  
Workflow Nets

Dietary Vitamin and Stability of Oral Anticoagulation: Proposal of a Diet with Constant Vitamin K1 Content

1997 ◽  
Vol 77 (03) ◽  
pp. 504-509 ◽  
Author(s):  
Sarah L Booth ◽  
Jacqueline M Charnley ◽  
James A Sadowski ◽  
Edward Saltzman ◽  
Edwin G Bovill ◽  
...  
Keyword(s):  
Dietary Intake ◽  
Vitamin K ◽  
High Performance ◽  
Case Reports ◽  
Food Composition ◽  
Dietary Guidelines ◽  
Dietary Vitamin ◽  
Vitamin K1 ◽  
The Stability ◽  
The Impact

SummaryCase reports cited in Medline or Biological Abstracts (1966-1996) were reviewed to evaluate the impact of vitamin K1 dietary intake on the stability of anticoagulant control in patients using coumarin derivatives. Reported nutrient-drug interactions cannot always be explained by the vitamin K1 content of the food items. However, metabolic data indicate that a consistent dietary intake of vitamin K is important to attain a daily equilibrium in vitamin K status. We report a diet that provides a stable intake of vitamin K1, equivalent to the current U.S. Recommended Dietary Allowance, using food composition data derived from high-performance liquid chromatography. Inconsistencies in the published literature indicate that prospective clinical studies should be undertaken to clarify the putative dietary vitamin K1-coumarin interaction. The dietary guidelines reported here may be used in such studies.

Sign in / Sign up

Export Citation Format

Share Document