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

On the Values of Vehicle-to-Grid Electricity Selling in Electric Vehicle Sharing

M&SOM-MANUFACTURING & SERVICE OPERATIONS MANAGEMENT 2021年第2期23卷 488-507页

作者： Zhang, Yiling Lu, Mengshi Shen, Siqian Univ Minnesota Dept Ind & Syst Engn Minneapolis MN 55455 USA Purdue Univ Krannert Sch Management W Lafayette IN 47907 USA Univ Michigan Dept Ind & Operat Engn Ann Arbor MI 48109 USA

Problem definition: We study electric vehicle (EV) sharing systems and explore the opportunity for incorporating vehicle-to-grid (V2G) electricity selling in EV sharing. Academic/practical relevance: The problem involves complex planning and operational decisions, as well as multiple sources of uncertainties. The related optimization models impose significant computational challenges. The potential value of V2G integration may have far-reaching impacts on EV sharing and sustainability. Methodology: We formulate the problem as a two-stage stochastic integer linear program. In the first stage, we optimize decisions related to service planning, the capacity of parking and charging facilities, EV battery capacities, and EV allocation in each zone under uncertain time-dependent trip demand and electricity prices. In the second stage, for a realized demand-price scenario, we construct a time-and-charging-status expanded transportation network and optimize operations of the shared vehicle fleet, EV battery charging, and V2G selling. We develop Benders decomposition and scenario decomposition approaches to improve computational efficiency. A linear-decision-rule-based approximation approach is also provided to model dynamic operations. Results: Via testing instances based on real-world and synthetic data, we demonstrate the computational efficacy of our approaches and study the benefits of integrating V2G in EV sharing from the service provider, consumer, and socioenvironmental aspects. Managerial implications: V2G integration can significantly increase the profitability of EV sharing and the quality of service. It results in the preference of larger EV fleets and battery capacities, which further leads to various socioenvironmental benefits. The benefit of V2G can still prevail, even with more severe battery degradation and can be more significant when combined with (i) more stringent service levels, (ii) more traffic congestion, or (iii) urban spatial structures with conc

关键词： sustainable transportation energy systems electric vehicle sharing vehicle-to-grid stochastic integer programming decomposition algorithms

来源：评论

学校读者我要写书评

暂无评论

A multistage stochastic programming model for the network air cargo allocation under capacity uncertainty

引用

TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW 2019年 131卷 292-307页

作者： Delgado, Felipe Trincado, Ricardo Pagnoncelli, Bernardo K. Pontificia Univ Catolica Chile Dept Transport & Logist Vicuna Mackenna 4860Casilla 306Correo 22 Santiago Chile Univ Adolfo Ibanez Escuela Negocios Diagonal Torres 2640 PenalolenOficina 533-C Santiago Chile

We propose a multistage stochastic programming model to optimally allocate cargo to the passengers network in order to maximize profit, taking into account incomes, costs and penalties for not delivering cargo that was previously accepted. Flights have a discrete number of possible capacity outcomes, with known probabilities, and uncertainty is represented by a scenario tree. The resulting problem is a large-scale linear program, and we use decomposition techniques to solve it, leveraging on the problem structure in order to be able to find good quality solutions. Our numerical experiments are based on a real network of a major commercial airline.

关键词： Air cargo Revenue management Stochastic programming decomposition algorithms

来源：评论

学校读者我要写书评

暂无评论

Outer approximation algorithms for separable nonconvex mixed-integer nonlinear programs

引用

MATHEMATICAL PROGRAMMING 2004年第3期100卷 517-535页

作者： Kesavan, P Allgor, RJ Gatzke, EP Barton, PI Sensitron Semicond Deer Pk NY 11729 USA Amazon Com Inc Seattle WA USA Univ S Carolina Dept Chem Engn Columbia SC 29208 USA MIT Dept Chem Engn Cambridge MA 02139 USA

A rigorous decomposition approach to solve separable mixed-integer nonlinear programs where the participating functions are nonconvex is presented. The proposed algorithms consist of solving an alternating sequence of Relaxed Master Problems (mixed-integer linear program) and two nonlinear programming problems (NLPs). A sequence of valid nondecreasing lower bounds and upper bounds is generated by the algorithms which converge in a finite number of iterations. A Primal Bounding Problem is introduced, which is a convex NLP solved at each iteration to derive valid outer approximations of the nonconvex functions in the continuous space. Two decomposition algorithms are presented in this work. On finite termination, the first yields the global solution to the original nonconvex MINLP and the second finds a rigorous bound to the global solution. Convergence and optimality properties, and refinement of the algorithms for efficient implementation are presented. Finally, numerical results are compared with currently available algorithms for example problems, illuminating the potential benefits of the proposed algorithm.

关键词： mixed-integer nonconvex nonlinear programming decomposition algorithms global solution

来源：评论

学校读者我要写书评

暂无评论

Dual Dynamic Programing with cut selection: Convergence proof and numerical experiments

引用

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2017年第1期258卷 47-57页

作者： Guigues, Vincent Fundacao Getulio Vargas Sch Appl Math 190 Praia Botafogo BR-22250900 Rio De Janeiro Brazil

We consider convex optimization problems formulated using dynamic programing equations. Such problems can be solved using the Dual Dynamic Programing algorithm combined with the Level 1 cut selection strategy or the Territory algorithm to select the most relevant Benders cuts. We propose a limited memory variant of Level 1 and show the convergence of DDP combined with the Territory algorithm, Level 1 or its variant for nonlinear optimization problems. In the special case of linear programs, we show convergence in a finite number of iterations. Numerical simulations illustrate the interest of our variant and show that it can be much quicker than a simplex algorithm on some large instances of portfolio selection and inventory problems. (C) 2016 Elsevier B.V. All rights reserved.

关键词： Dynamic Programing Nonlinear programing decomposition algorithms Dual Dynamic Programing Pruning methods

来源：评论

学校读者我要写书评

暂无评论

A two-level queueing network model with blocking and non-blocking messages

引用

ANNALS OF OPERATIONS RESEARCH 2000年第1-4期93卷 357-372页

作者： Ramesh, S Perros, HG N Carolina State Univ Dept Comp Sci Raleigh NC 27607 USA N Carolina State Univ Ctr Adv Comp & Commun Raleigh NC 27607 USA

We analyze a novel two-level queueing network with blocking, consisting of N level-1 parallel queues linked to M level-2 parallel queues. The processing of a customer by a level-1 server requires additional services that are exclusively offered by level-2 servers. These level-2 servers are accessed through blocking and non-blocking messages issued by level-1 servers. If a blocking message is issued, the level-1 server gets blocked until the message is fully processed at the level-2 server. The queueing network is analyzed approximately using a decomposition method, which can be viewed as a generalization of the well-known two-node decomposition algorithm used to analyze tandem queueing networks with blocking. Numerical tests show that the algorithm has a good accuracy.

关键词： queueing networks with blocking decomposition algorithms BCMP theorem

来源：评论

学校读者我要写书评

暂无评论

The obstacle problem for water tanks

引用

JOURNAL DE MATHEMATIQUES PURES ET APPLIQUEES 2003年第11期82卷 1527-1553页

作者： Bonnans, JF Fourati, RB Smaoui, H Inst Natl Rech Informat & Automat Projet SYDOCO F-78153 Rocquencourt France ENIT URMCS Tunis Tunisia

In this paper we discuss the problem of computing and analyzing the static equilibrium of a nonrigid water tank. Specifically, we fix the amount of water contained in the tank, modelled as a membrane. In addition, there are rigid obstacles that constrain the deformation. This amounts to a nonconvex variational problem. We derive the optimality system and its interpretation in terms of equilibrium of forces. A second-order sensitivity analysis, allowing to compute derivatives of solutions and a second-order Taylor expansion of the cost function, is performed, in spite of the fact that the cost function is not twice differentiable. We also study the finite elements discretization, introduce a decomposition algorithm for the numerical computation of the solution, and display numerical results. (C) 2003 Editions scientifiques et medicales Elsevier SAS. All rights reserved.

关键词： obstacle problem nonconvex variational problems sensitivity analysis finite elements decomposition algorithms

来源：评论

学校读者我要写书评

暂无评论

Minimization of a nondifferentiable convex function defined not everywhere

引用

OPTIMIZATION 2002年第6期51卷 819-840页

作者： Beer, K Gol'shtein, EG Sokolov, NA Russian Acad Sci Cent Econ & Math Inst Moscow 117418 Russia Tech Univ Chemnitz Fak Math D-09107 Chemnitz Germany

We examine an oracle-type method to minimize a convex function f over a convex polyhedron G. The method is an extension of the level-method to the case, when f is a not everywhere finite function, i.e., it may equal to +infinity at some points of G. An estimate of its efficiency is given, and some modifications of the method are mentioned. Finally, we indicate possible ways of its employment and report results of a numerical experiment.

关键词： nondifferentiable optimization cutting plane methods level methods decomposition algorithms

来源：评论

学校读者我要写书评

暂无评论

On Ritt's factorization of polynomials

引用

JOURNAL OF THE LONDON MATHEMATICAL SOCIETY-SECOND SERIES 2000年第1期62卷 127-138页

作者： Beardon, AF Ng, TW Univ Cambridge Ctr Math Sci Dept Pure Math & Math Stat Cambridge CB3 0WB England

Ritt has shown that any complex polynomial p can be written as the composition of polynomials p(1),...,p(m), where each p(1) is prime in the sense that it cannot be written as a non-trivial composition of polynomials. The factors p(1) are not unique but the number m of them is, as is the set of the degrees of the p(1). The paper extends Ritt's theory and, in particular, a third invariant of the decomposition is introduced.

关键词： decomposition algorithms Even

来源：评论

学校读者我要写书评

暂无评论

Iterative Preconditioned Methods in Krylov Spaces: Trends of the 21st Century

引用

COMPUTATIONAL MATHEMATICS AND MATHEMATICAL PHYSICS 2021年第11期61卷 1750-1775页

作者： Il'in, V. P. Russian Acad Sci Inst Computat Math & Math Geophys Siberian Branch Novosibirsk 630090 Russia Novosibirsk State Tech Univ Russia 630073 Russia

A analytic review of major problems and new mathematical and technological discoveries in methods for solving SLAEs is given. This stage of mathematical modeling is a bottleneck because the amount of the required computational resources grows nonlinearly with the increasing number of degrees of freedom of the problem. It is important that the efficiency and performance of computational methods and technologies significantly depend on how well the specific features of the class of application problems-electromagnetism, fluid dynamics, elasticity and plasticity, multiphase filtering, heat and mass transfer, etc. are taken into account. The development of Krylov iterative processes is mainly intended for the construction of two-level algorithms with various orthogonal, projective, variational, and spectral properties, including not only polynomial but also rational and harmonic approximation techniques. Additional acceleration of such algorithms is achieved on the basis of deflation and augmenting approaches using various systems of basis vectors. The goal of intensive studies is to construct efficient preconditioning operators on the basis of various principles: new multigrid schemes and parallel domain decomposition methods, multipreconditioning, nested and alternate triangular factorizations, low-rank and other algorithms for approximating inverse matrices, etc. High-performance and scalable parallelization are based on hybrid programming using internode message passing, multithreaded computations, vectorization, and graphics processing units (GPUs). Modern trends in mathematical methods and software are aimed at the creation of an integrated environment designed for a long lifecycle and massive innovations in important applications.

关键词： sparse SLAE preconditioning iterative methods Krylov subspaces symmetric and asymmetric matrices decomposition algorithms multigrid approaches approximate factorization

来源：评论

学校读者我要写书评

暂无评论

AN EASILY CONTROLLED NETWORK FOR FREQUENTLY USED PERMUTATIONS

引用

IEEE TRANSACTIONS ON COMPUTERS 1981年第4期30卷 296-298页

作者： YEW, PC LAWRIE, DH Department of Computer Science University of Illinois

A π network, which is a concatenation of 2 Ω networks [2], along with a simple control algorithm is proposed. This network is capable of performing all Ω network realizable permutations and the bit-permute-complement (BPC) class of permutations[5] in 0(log N) time. The control algorithm is actually a multiple-pass control algorithm on the Ω network, which is more general than Pease"s LU decomposition method [6] and Lenfant"s decomposition method[4].

关键词： Ω network Bit-permute-complement permutations decomposition algorithms multiple-pass control algorithm network partitions

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：