Numerical Algebra Control and Optimization最新文献_第4页

Axiomatic results and dynamic processes for two weighted indexes under fuzzy transferable-utility behavior 模糊可转移效用行为下两个加权指标的公理结果和动态过程

IF 1.3

Numerical Algebra Control and Optimization Pub Date : 2022-01-01 DOI: 10.3934/naco.2021047

Y. Liao

引用次数: 1

A crowdsourced dynamic repositioning strategy for public bike sharing systems 公共自行车共享系统的众包动态重新定位策略

IF 1.3

Numerical Algebra Control and Optimization Pub Date : 2022-01-01 DOI: 10.3934/naco.2021049

I-Lin Wang, Chen-Tai Hou

{"title":"A crowdsourced dynamic repositioning strategy for public bike sharing systems","authors":"I-Lin Wang, Chen-Tai Hou","doi":"10.3934/naco.2021049","DOIUrl":"https://doi.org/10.3934/naco.2021049","url":null,"abstract":"Public bike sharing systems have become the most popular shared economy application in transportation. The convenience of this system depends on the availability of bikes and empty racks. One of the major challenges in operating a bike sharing system is the repositioning of bikes between rental sites to maintain sufficient bike inventory in each station at all times. Most systems hire trucks to conduct dynamic repositioning of bikes among rental sites. We have analyzed a commonly used repositioning scheme and have demonstrated its ineffectiveness. To realize a higher quality of service, we proposed a crowdsourced dynamic repositioning strategy: first, we analyzed the historical rental data via the random forest algorithm and identified important factors for demand forecasting. Second, considering 30-minute periods, we calculated the optimal bike inventory via integer programming for each rental site in each time period with a sufficient crowd for repositioning bikes. Then, we proposed a minimum cost network flow model in a time-space network for calculating the optimal voluntary rider flows for each period based on the current bike inventory, which is adjusted according to the forecasted demands. The results of computational experiments on real-world data demonstrate that our crowdsourced repositioning strategy may reduce unmet rental demands by more than 30% during rush hours compared to conventional trucks.","PeriodicalId":44957,"journal":{"name":"Numerical Algebra Control and Optimization","volume":null,"pages":null},"PeriodicalIF":1.3,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86290935","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 4

Stochastic DDM with regime–switching process 具有状态切换过程的随机DDM

IF 1.3

Numerical Algebra Control and Optimization Pub Date : 2022-01-01 DOI: 10.3934/naco.2022031

Battulga Gankhuu

引用次数: 3

Complexity analysis of an interior-point algorithm for linear optimization based on a new parametric kernel function with a double barrier term 基于双障碍项参数核函数的内点线性优化算法的复杂度分析

IF 1.3

Numerical Algebra Control and Optimization Pub Date : 2022-01-01 DOI: 10.3934/naco.2022003

Ayache Benhadid, F. Merahi

引用次数: 1

Static Markowitz mean-variance portfolio selection model with long-term bonds 长期债券的静态Markowitz均值-方差投资组合选择模型

IF 1.3

Numerical Algebra Control and Optimization Pub Date : 2022-01-01 DOI: 10.3934/naco.2022030

Dennis Ikpe, Romeo Mawonike, F. Viens

引用次数: 0

Global optimality conditions and duality theorems for robust optimal solutions of optimization problems with data uncertainty, using underestimators 数据不确定性优化问题鲁棒最优解的全局最优性条件和对偶性定理

IF 1.3

Numerical Algebra Control and Optimization Pub Date : 2022-01-01 DOI: 10.3934/naco.2021053

J. Kerdkaew, R. Wangkeeree, R. Wangkeeree

{"title":"Global optimality conditions and duality theorems for robust optimal solutions of optimization problems with data uncertainty, using underestimators","authors":"J. Kerdkaew, R. Wangkeeree, R. Wangkeeree","doi":"10.3934/naco.2021053","DOIUrl":"https://doi.org/10.3934/naco.2021053","url":null,"abstract":"In this paper, a robust optimization problem, which features a maximum function of continuously differentiable functions as its objective function, is investigated. Some new conditions for a robust KKT point, which is a robust feasible solution that satisfies the robust KKT condition, to be a global robust optimal solution of the uncertain optimization problem, which may have many local robust optimal solutions that are not global, are established. The obtained conditions make use of underestimators, which were first introduced by Jayakumar and Srisatkunarajah [1,2] of the Lagrangian associated with the problem at the robust KKT point. Furthermore, we also investigate the Wolfe type robust duality between the smooth uncertain optimization problem and its uncertain dual problem by proving the sufficient conditions for a weak duality and a strong duality between the deterministic robust counterpart of the primal model and the optimistic counterpart of its dual problem. The results on robust duality theorems are established in terms of underestimators. Additionally, to illustrate or support this study, some examples are presented.","PeriodicalId":44957,"journal":{"name":"Numerical Algebra Control and Optimization","volume":null,"pages":null},"PeriodicalIF":1.3,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80628792","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 3

A modified version of a Benson-type algorithm proposed for obtaining solutions with better dispersion on the non-dominated set of a non-convex multi-objective programming problem 针对一类非凸多目标规划问题的非支配集离散性较好的解，提出了改进的benson型算法

IF 1.3

Numerical Algebra Control and Optimization Pub Date : 2022-01-01 DOI: 10.3934/naco.2022039

A. H. Dehmiry, Maryam Kargarfard

引用次数: 0

Consistency of equilibrium stacks in finite uniform approximation of a noncooperative game played with staircase-function strategies 阶梯函数策略非合作博弈有限均匀逼近下均衡堆栈的一致性

IF 1.3

Numerical Algebra Control and Optimization Pub Date : 2022-01-01 DOI: 10.3934/naco.2022027

V. Romanuke

{"title":"Consistency of equilibrium stacks in finite uniform approximation of a noncooperative game played with staircase-function strategies","authors":"V. Romanuke","doi":"10.3934/naco.2022027","DOIUrl":"https://doi.org/10.3934/naco.2022027","url":null,"abstract":"<p style='text-indent:20px;'>A method of finite uniform approximation of an <inline-formula><tex-math id=\"M1\">begin{document}$ N $end{document}</tex-math></inline-formula>-person noncooperative game played with staircase-function strategies is presented. A continuous staircase <inline-formula><tex-math id=\"M2\">begin{document}$ N $end{document}</tex-math></inline-formula>-person game is approximated to a staircase <inline-formula><tex-math id=\"M3\">begin{document}$ N $end{document}</tex-math></inline-formula>-dimensional-matrix game by sampling the player's pure strategy value set. The set is sampled uniformly so that the resulting staircase <inline-formula><tex-math id=\"M4\">begin{document}$ N $end{document}</tex-math></inline-formula>-dimensional-matrix game is hypercubic. An equilibrium of the staircase <inline-formula><tex-math id=\"M5\">begin{document}$ N $end{document}</tex-math></inline-formula>-dimensional-matrix game is obtained by stacking the equilibria of the subinterval <inline-formula><tex-math id=\"M6\">begin{document}$ N $end{document}</tex-math></inline-formula>-dimensional-matrix games, each defined on a subinterval where the pure strategy value is constant. The stack is an approximate solution to the initial staircase game. The (weak) consistency of the approximate solution is studied by how much the players' payoff and equilibrium strategy change as the sampling density minimally increases. The consistency is equivalent to the approximate solution acceptability. An example of a 4-person noncooperative game is presented to show how the approximation is fulfilled for a case of when every subinterval quadmatrix game has pure strategy equilibria.</p>","PeriodicalId":44957,"journal":{"name":"Numerical Algebra Control and Optimization","volume":null,"pages":null},"PeriodicalIF":1.3,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75939887","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Alternated inertial forward-backward-forward splitting algorithm 交替惯性前向后前分裂算法

IF 1.3

Numerical Algebra Control and Optimization Pub Date : 2022-01-01 DOI: 10.3934/naco.2022035

引用次数: 0

Variable fixing method by weighted average for the continuous quadratic knapsack problem 连续二次型背包问题的加权平均定变量法

IF 1.3

Numerical Algebra Control and Optimization Pub Date : 2022-01-01 DOI: 10.3934/naco.2021048

Hsin-Min Sun, Yu-Juan Sun

引用次数: 1