The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “Pickup and delivery problem with split demand and transfers”

Discriminating between causal structures in Bayesian Networks given partial observations

Philipp Moritz, Jörg Reichardt, Nihat Ay (2014)

Kybernetika

Similarity:

Given a fixed dependency graph G that describes a Bayesian network of binary variables X 1 , ⋯ , X n , our main result is a tight bound on the mutual information I c ( Y 1 , ⋯ , Y k ) = ∑ j = 1 k H ( Y j ) / c - H ( Y 1 , ⋯ , Y k ) of an observed subset Y 1 , ⋯ , Y k of the variables X 1 , ⋯ , X n . Our bound depends on certain quantities that can be computed from the connective structure of the nodes in G . Thus it allows to discriminate between different dependency graphs for a probability distribution, as we show from numerical experiments.

A comparison of evidential networks and compositional models

Jiřina Vejnarová (2014)

Kybernetika

Similarity:

Several counterparts of Bayesian networks based on different paradigms have been proposed in evidence theory. Nevertheless, none of them is completely satisfactory. In this paper we will present a new one, based on a recently introduced concept of conditional independence. We define a conditioning rule for variables, and the relationship between conditional independence and irrelevance is studied with the aim of constructing a Bayesian-network-like model. Then, through a simple example,...

Chance constrained bottleneck transportation problem with preference of routes

Yue Ge, Minghao Chen, Hiroaki Ishii (2012)

Kybernetika

Similarity:

This paper considers a variant of the bottleneck transportation problem. For each supply-demand point pair, the transportation time is an independent random variable. Preference of each route is attached. Our model has two criteria, namely: minimize the transportation time target subject to a chance constraint and maximize the minimal preference among the used routes. Since usually a transportation pattern optimizing two objectives simultaneously does not exist, we define non-domination...

Dynamic approach to optimum synthesis of a four-bar mechanism using a swarm intelligence algorithm

Edgar A. Portilla-Flores, Maria B. Calva-Yáñez, Miguel G. Villarreal-Cervantes, Paola A. Niño Suárez, Gabriel Sepúlveda-Cervantes (2014)

Kybernetika

Similarity:

This paper presents a dynamic approach to the synthesis of a crank-rocker four-bar mechanism, that is obtained by an optimization problem and its solution using the swarm intelligence algorithm called Modified-Artificial Bee Colony (M-ABC). The proposed dynamic approach states a mono-objective dynamic optimization problem (MODOP), in order to obtain a set of optimal parameters of the system. In this MODOP, the kinematic and dynamic models of the whole system are consider as well as a...

Algorithm for turnpike policies in the dynamic lot size model

Stanisław Bylka (1996)

Applicationes Mathematicae

Similarity:

This article considers optimization problems in a capacitated lot sizing model with limited backlogging. Nothing is assumed about the cost function in the case of finite restrictions of the size on the stock and backlogs. The holding and backlogging costs are functions assumed to be stationary or nearly stationary in time. In both cases, it is shown that there exists an optimal infinite inverse policy and a periodical turnpike policy. Some forward and backward procedures are adopted...

Model Checking. Part III

Kazuhisa Ishida, Yasunari Shidama (2008)

Formalized Mathematics

Similarity:

This text includes verification of the basic algorithm in Simple On-the-fly Automatic Verification of Linear Temporal Logic (LTL). LTL formula can be transformed to Buchi automaton, and this transforming algorithm is mainly used at Simple On-the-fly Automatic Verification. In this article, we verified the transforming algorithm itself. At first, we prepared some definitions and operations for transforming. And then, we defined the Buchi automaton and verified the transforming algorithm.MML...