检索结果-内蒙古大学图书馆

6th IIAI International Congress on Advanced Applied Informatics (IIAI-AAI)

作者： Hasuike, Takashi Kashima, Tomoko Matsumoto, Shimpei Waseda Univ Fac Sci & Engn Shinjuku Ku 3-4-1 Okubo Tokyo 1698555 Japan Kinki Univ Fac Engn 1 Takaya Umenobe Higashihiroshima Hiroshima 7392116 Japan Hiroshima Inst Technol Fac Appl Informat Sci Saeki Ku 2-1-1 Miyake Hiroshima 7315193 Japan

ISBN: (纸本)9781538606216

This paper proposes a robust model of multi period agricultural supply chain to consider both maximizing the total profit and minimizing the environmental load with random and fuzzy parameters. Our proposed model is formulated as a fuzzy and stochastic, multiobjective and multiperiod programming problem, and hence, it is hard to solve the formulated problem directly without setting a specific random distribution and a specific membership function. Therefore, a distribution-free approach based on sample mean and variance derived from received data, which does not assume any specific random distributions and membership functions, is introduced to apply our proposed model to various uncertain conditions. In addition, deterministic equivalent transformations are also introduced to obtain the optimal solution efficiently using the scenario-based approach.

关键词： Agricultural supply chain management Randomness Fuzziness mathematical programming problem Distribution-free approach

来源：评论

学校读者我要写书评

暂无评论

A computational comparison of some non-linear programs

引用

mathematical programming 1973年第1期4卷 144-154页

作者： Asaadi, J. Plan Organization Informatics Division Documentation Centre Teheran Iran

This article deals mainly with a comparison of certain computational techniques used for the solution of non-linear constrained mathematical programming problems. © 1973 The mathematical programming Society.

关键词： mathematical Method programming problem mathematical programming Computational Technique mathematical programming problem

来源：评论

学校读者我要写书评

暂无评论

Generalized Benders decomposition

引用

Journal of Optimization Theory and Applications 1972年第4期10卷 237-260页

作者： Geoffrion, A.M. University of California at Los Angeles Los Angeles California United States

J. F. Benders devised a clever approach for exploiting the structure of mathematical programming problems with complicating variables (variables which, when temporarily fixed, render the remaining optimization problem considerably more tractable). For the class of problems specifically considered by Benders, fixing the values of the complicating variables reduces the given problem to an ordinary linear program, parameterized, of course, by the value of the complicating variables vector. The algorithm he proposed for finding the optimal value of this vector employs a cutting-plane approach for building up adequate representations of (i) the extremal value of the linear program as a function of the parameterizing vector and (ii) the set of values of the parameterizing vector for which the linear program is feasible. Linear programming duality theory was employed to derive the natural families of cuts characterizing these representations, and the parameterized linear program itself is used to generate what are usually deepest cuts for building up the representations. In this paper, Benders' approach is generalized to a broader class of programs in which the parametrized subproblem need no longer be a linear program. Nonlinear convex duality theory is employed to derive the natural families of cuts corresponding to those in Benders' case. The conditions under which such a generalization is possible and appropriate are examined in detail. An illustrative specialization is made to the variable factor programming problem introduced by R. Wilson, where it offers an especially attractive approach. Preliminary computational experience is given. © 1972 Plenum Publishing Corporation.

关键词： programming problem Duality Theory Parameterized Linear Bender Decomposition mathematical programming problem

来源：评论

学校读者我要写书评

暂无评论

Determining the optimum stratum boundaries using mathematical programming

引用

Journal of mathematical Modelling and Algorithms 2009年第4期8卷 409-423页

作者： Khan, M.G.M. Ahmad, N. Khan, Sabiha School of Computing Information and Mathematical Sciences The University of the South Pacific Suva Fiji Department of Public Health Fiji School of Medicine Suva Fiji

The method of choosing the best boundaries that make strata internally homogeneous, given some sample allocation, is known as optimum stratification. In order to make the strata internally homogeneous, the strata are constructed in such a way that the strata variances should be as small as possible for the characteristic under study. In this paper the problem of determining optimum strata boundaries (OSB) is discussed when strata are formed based on a single auxiliary variable with a varying measurement cost per units across strata. The auxiliary variable considered in the problem is a size variable that holds a common model for a whole population. The OSB are achieved effectively by assuming a suitable distribution of the auxiliary variable and creating strata by cutting the range of the distribution at optimum points. The problem of finding the OSB, which minimizes the variance of the estimated population mean under a weighted stratified balanced sampling, is formulated as a mathematical programming problem (MPP). Treating the formulated MPP as a multistage decision problem, a solution procedure using dynamic programming technique is developed. A numerical example using a hospital population data is presented to illustrate the computational details of the solution procedure. A software program coded in JAVA is written to carry out the computation. The distribution of the auxiliary variable in this example is considered to be continuous with an exponential density function. © Springer Science + Business Media B.V. 2009.

关键词： Dynamic programming mathematical programming problem Optimum stratification Weighted stratified balanced sampling

来源：评论

学校读者我要写书评

暂无评论

Task scheduling for multiple forklift AGVs in distribution warehouses 19

Task scheduling for multiple forklift AGVs in distribution w...

引用

19th IEEE International Conference on Emerging Technology and Factory Automation (ETFA)

作者： Giglio, Davide Univ Genoa Dept Informat Bioengn Robot & Syst Engn I-16145 Genoa Italy

ISBN: (纸本)9781479948451

Distribution warehouses are considered in this paper with the aim of scheduling the transportation of pallet and roll pallet loads from the storage area to the gates at which the trucks arrive. Transportation activities are carried out by forklift AGVs that can move freely along the warehouse's aisles (guide paths are not considered). In this paper, an optimization procedure is proposed, which is based on three sequential phases. In the first phase, the number of AGVs to be allocated to each arrived truck is determined;in the second phase, an AGV-to-truck assignment problem is solved;in the third phase, the single tasks are assigned to and sequenced on the AGVs. All phases are based on the formalization and solution of a specific mathematical programming problem, and a heuristic procedure is also proposed to solve a part of the third phase.

关键词： automatic guided vehicles mathematical programming scheduling transportation warehouse automation AGV-to-truck assignment problem distribution warehouses mathematical programming problem multiple forklift AGV roll pallet loads task scheduling transportation scheduling Buffer storage Job shop scheduling Loading Logic gates mathematical programming Schedules Transportation

来源：评论

学校读者我要写书评

暂无评论

Multi-Droplet Routing based on a Shape-Dependent Velocity Model on MEDA Biochips

Multi-Droplet Routing based on a Shape-Dependent Velocity Mo...

引用

2023 International Conference on Electronics, Information, and Communication, ICEIC 2023

作者： Shiro, Chiharu Nishikawa, Hiroki Kong, Xiangbo Tomiyama, Hiroyuki Yamashita, Shigeru Ritsumeikan University Graduate School of Science and Engineering Japan Osaka University Graduate School of Information Science and Technology Japan Ritsumeikan University College of Information Science and Engineering Japan

ISBN: (纸本)9798350320213

Digital microfluidic biochips (DMFB) have attracted attention in the biochemical and medical industries. A micro electrode dot array (MEDA) biochip reduces limitations of DMFB which have limitations on droplet size, shape, direction of movement, and sensor. In particular, it is known that the droplet moves at a different velocity model if the shape is changed. However, routing of multiple droplets at the same time with shape-dependent velocities has not been considered in the past. In this paper, we propose a multi-droplet routing technique for MEDA biochips with shape-dependent velocity of droplets. The proposed technique takes the advantage of velocities dependent on the shapes and aim to reduce the overall routing time of droplets from sources to destinations. Simulation results show that the proposed technique shortens the routing time by 90% on average compared to the state-of-the-art technique. © 2023 IEEE.

关键词： Droplet Routing mathematical programming problem MEDA

来源：评论

学校读者我要写书评

暂无评论

Minimization of MEDA Biochip-Size in Droplet Routing

BIOSENSORS-BASEL

引用

BIOSENSORS-BASEL 2022年第5期12卷 277页

作者： Shiro, Chiharu Nishikawa, Hiroki Kong, Xiangbo Tomiyama, Hiroyuki Yamashita, Shigeru Ritsumeikan Univ Grad Sch Sci & Engn Kusatsu 5258577 Japan Japan Soc Promot Sci Res Fellow Tokyo 1020083 Japan Ritsumeikan Univ Coll Informat Sci & Engn Kusatsu 5258577 Japan

With the increasing demand for fast, accurate, and reliable biological sensor systems, miniaturized systems have been aimed at droplet-based sensor systems and have been promising. A micro-electrode dot array (MEDA) biochip, which is one kind of the miniaturized systems for biochemical protocols such as dispensing, dilutions, mixing, and so on, has become widespread due to enabling dynamical control of the droplets in microfluidic manipulations. In MEDA biochips, the electrowetting-on-dielectric (EWOD) technique stands out since it can actuate droplets with nano /picoliter volumes. Microelectrode cells on MEDA actuate multiple droplets simultaneously to route locations for the purpose of the biochemical operations. Taking advantage of the feature, droplets are often routed in parallel to achieve high-throughput outcomes. Regarding parallel manipulation of multiple droplets, however, the droplets are known to be initially placed at a distant position to avoid undesirable mixing. The droplets thus result in traveling a long way for a manipulation, and the required biochip size for routing is also enlarged. This paper proposes a routing method for droplets to reduce the biochip size on a MEDA biochip with the allowance of splitting during routing operations. We mathematically derive the routing problem, and the experiments demonstrate that our proposal can significantly reduce the biochip size by 70.8% on average, compared to the state-of-the-art method.

关键词： digital microfluidics MEDA droplet routing mathematical programming problem

来源：评论

学校读者我要写书评

暂无评论

Application of Meta-Heuristics to Scheduling problems in Plastics Forming Plant

引用

IFAC Proceedings Volumes 1995年第10期28卷 365-370页

作者： Hisashi Tamaki Kazuyuki Taguchi Mituhiko Araki Kyoto University Department of Electrical Engineering Yoshida-konmachi Sakyo-ku Kyoto 606-01 Japan

A scheduling problem in a plastics forming plant is studied. This problem basically belongs to the class of unrelated parallel machine problems, but includes several restrictions which originate from the necessity to use auxiliary equipments. We have proposed a method to solve them without relying upon dispatching rules by transforming the scheduling problem to a mathematical programming problem, and by representing feasible schedules by binary strings. This formulation enables to use the meta-heuristics (such as simulated annealing, genetic algorithms, etc.). In this paper, we propose a way for improving a search by meta-heuristics by modifying the representation of a schedule, i.e., not using the binary representation but using an alphabetical one. We actually carried out computational experiments for the problems of practical size, which shows that our methods can give satisfactory solutions to the considered scheduling problem

关键词： scheduling problem plastics forming plant meta-heuristics mathematical programming problem simulated annealing

来源：评论

学校读者我要写书评

暂无评论

The Vehicle Routing problem for Several Agents Among the Objects of Two Types

The Vehicle Routing Problem for Several Agents Among the Obj...

引用

International Conference on Complex Systems: Control and Modeling problems

作者： Sergey Medvedev Anastasiya Sorokina Olga Medvedeva Voronezh State University

ISBN: (纸本)9781728167015

The paper considers the vehicle routing problem for several agents among the objects of two types. It is necessary to move all objects of the first type to objects of the second type. That is, it is necessary to create routes for agents so that all objects of the first type are to be visited, objects of different types should be alternated in the route and the total cost of moving is to be minimal. The mathematical model of the problem in the form of a mathematical programming problem is proposed. The paper describes the developed "greedy" and genetic solution algorithms. Special crossover and mutation operators have been developed for this problem to implement the genetic algorithm. The paper presents the computational experiment conducted on the basis of the developed software.

关键词： Vehicle routing problem mathematical programming problem Genetic algorithm "greedy algorithm" Crossover operator Mutation operator Routing problem Genetic Algorithm (GA) Agents Vehicle routing Necessary Total Costs

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：