Pub Date : 2023-11-02DOI: 10.1007/s10287-023-00484-w
Zvi Drezner, Dawit Zerom
{"title":"A refinement of the gravity model for competitive facility location","authors":"Zvi Drezner, Dawit Zerom","doi":"10.1007/s10287-023-00484-w","DOIUrl":"https://doi.org/10.1007/s10287-023-00484-w","url":null,"abstract":"","PeriodicalId":46743,"journal":{"name":"Computational Management Science","volume":"126 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135932899","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}
Pub Date : 2023-10-30DOI: 10.1007/s10287-023-00482-y
Maren S. Barth, Katharina Palm, Henrik Andersson, Tobias A. Granberg, Anders N. Gullhav, Andreas Krüger
Abstract Evacuation preparedness includes ensuring proper infrastructure, resources and planning for moving people from a dangerous area to safety. This is especially important and challenging during mass gatherings, such as large concerts. In this paper, we present the Emergency Exit Layout Problem (EELP) which is the problem of locating a given number of emergency exits and deciding their width such that the time it takes to evacuate the crowd from an arena is minimized. The EELP takes into account the geography of the arena and its surroundings, as well as the number of pedestrians in the crowd and the distribution of these within the arena. The EELP is formulated as a two-stage stochastic mixed integer linear program to handle the uncertainty related to the location of the possible incidents and the distribution of the pedestrians. Two cases are studied, a large concert planned at the Leangen trotting track in Trondheim and a smaller indoor arena. For each case, the EELP is solved for different scenarios, and the suggested layouts are evaluated using an agent-based simulation model. In particular, the potential of incorporating detailed assessment regarding the location and probability of specific incidents and the distribution of pedestrians are investigated. The computational study shows that making a more detailed risk assessment has little effect on the large concert, but a significant impact on the location of the emergency exits for the smaller indoor case. The results also indicate that it is more important to consider the location and probability of specific incidents rather than the pedestrian distribution.
{"title":"Emergency exit layout planning using optimization and agent-based simulation","authors":"Maren S. Barth, Katharina Palm, Henrik Andersson, Tobias A. Granberg, Anders N. Gullhav, Andreas Krüger","doi":"10.1007/s10287-023-00482-y","DOIUrl":"https://doi.org/10.1007/s10287-023-00482-y","url":null,"abstract":"Abstract Evacuation preparedness includes ensuring proper infrastructure, resources and planning for moving people from a dangerous area to safety. This is especially important and challenging during mass gatherings, such as large concerts. In this paper, we present the Emergency Exit Layout Problem (EELP) which is the problem of locating a given number of emergency exits and deciding their width such that the time it takes to evacuate the crowd from an arena is minimized. The EELP takes into account the geography of the arena and its surroundings, as well as the number of pedestrians in the crowd and the distribution of these within the arena. The EELP is formulated as a two-stage stochastic mixed integer linear program to handle the uncertainty related to the location of the possible incidents and the distribution of the pedestrians. Two cases are studied, a large concert planned at the Leangen trotting track in Trondheim and a smaller indoor arena. For each case, the EELP is solved for different scenarios, and the suggested layouts are evaluated using an agent-based simulation model. In particular, the potential of incorporating detailed assessment regarding the location and probability of specific incidents and the distribution of pedestrians are investigated. The computational study shows that making a more detailed risk assessment has little effect on the large concert, but a significant impact on the location of the emergency exits for the smaller indoor case. The results also indicate that it is more important to consider the location and probability of specific incidents rather than the pedestrian distribution.","PeriodicalId":46743,"journal":{"name":"Computational Management Science","volume":"32 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136104148","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}
Pub Date : 2023-10-24DOI: 10.1007/s10287-023-00479-7
Aleksandr Lobanov, Andrew Veprikov, Georgiy Konin, Aleksandr Beznosikov, Alexander Gasnikov, Dmitry Kovalev
{"title":"Non-smooth setting of stochastic decentralized convex optimization problem over time-varying Graphs","authors":"Aleksandr Lobanov, Andrew Veprikov, Georgiy Konin, Aleksandr Beznosikov, Alexander Gasnikov, Dmitry Kovalev","doi":"10.1007/s10287-023-00479-7","DOIUrl":"https://doi.org/10.1007/s10287-023-00479-7","url":null,"abstract":"","PeriodicalId":46743,"journal":{"name":"Computational Management Science","volume":"13 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135219386","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}
Pub Date : 2023-10-18DOI: 10.1007/s10287-023-00481-z
Ali Salmasnia, Soudabeh Hajihaji, Saeid Sharafi, Mohammad Reza Maleki
{"title":"Integration of inventory control, maintenance policy, and quality control for selling products under warranty","authors":"Ali Salmasnia, Soudabeh Hajihaji, Saeid Sharafi, Mohammad Reza Maleki","doi":"10.1007/s10287-023-00481-z","DOIUrl":"https://doi.org/10.1007/s10287-023-00481-z","url":null,"abstract":"","PeriodicalId":46743,"journal":{"name":"Computational Management Science","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135823381","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}
Abstract In this paper we provide an efficient methodology to compute the credit value adjustment of a European contingent claim subject to some default event concerning the issuer solvability, when the underlying and the default event are correlated. In particular, in a Black and Scholes market/CIR intensity-default model, we consider a second order expansion around the origin of a vulnerable call option with respect to a correlation parameter $$rho$$ ρ , which may be used to describe the wrong way risk of the contract, measuring the dependence between the underlying asset price and the option’s issuer default intensity. Numerical implementations of this approach are compared with the benchmark Monte Carlo simulations.
{"title":"Wrong Way Risk corrections to CVA in CIR reduced-form models","authors":"Fabio Antonelli, Alessandro Ramponi, Sergio Scarlatti","doi":"10.1007/s10287-023-00480-0","DOIUrl":"https://doi.org/10.1007/s10287-023-00480-0","url":null,"abstract":"Abstract In this paper we provide an efficient methodology to compute the credit value adjustment of a European contingent claim subject to some default event concerning the issuer solvability, when the underlying and the default event are correlated. In particular, in a Black and Scholes market/CIR intensity-default model, we consider a second order expansion around the origin of a vulnerable call option with respect to a correlation parameter $$rho$$ <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"> <mml:mi>ρ</mml:mi> </mml:math> , which may be used to describe the wrong way risk of the contract, measuring the dependence between the underlying asset price and the option’s issuer default intensity. Numerical implementations of this approach are compared with the benchmark Monte Carlo simulations.","PeriodicalId":46743,"journal":{"name":"Computational Management Science","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136112988","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}
Pub Date : 2023-10-05DOI: 10.1007/s10287-023-00475-x
Wei Wang, Huifu Xu
{"title":"Preference robust state-dependent distortion risk measure on act space and its application in optimal decision making","authors":"Wei Wang, Huifu Xu","doi":"10.1007/s10287-023-00475-x","DOIUrl":"https://doi.org/10.1007/s10287-023-00475-x","url":null,"abstract":"","PeriodicalId":46743,"journal":{"name":"Computational Management Science","volume":"2011 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135481878","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}
Pub Date : 2023-09-30DOI: 10.1007/s10287-023-00478-8
Nooshin Heidari, Ahmad Hemmati
Abstract In this paper, we propose an adaptive large neighborhood search-based matheuristic algorithm to solve a multi-product many-to-many maritime inventory routing problem. The problem addresses a short sea inventory routing problem that aims to find the best route and distribution plan for multiple products with a heterogeneous fleet of vessels through a network including several producers and customers. Each port can be visited a given number of times during the planning horizon, and the stock level for each product should lie within the predefined bound limits. The problem was introduced by Hemmati et al. (Eur J Oper Res 252:775–788, 2016). They developed a mixed integer programming formulation and proposed a matheuristic algorithm to solve the problem. Although their proposed algorithm worked well in terms of running time, it suffers from disregarding a part of the solution space. In this study, we propose a new matheuristic algorithm to find better solutions by exploring the entire solution space for the same problem. In our solution methodology, we split the variables into routing and non-routing variables. Then in an iterative process, we determine the values of the routing variables with an adaptive large neighborhood search algorithm, and we pass them as input to a penalized model which is a relaxed and modified version of the mathematical model introduced in Hemmati et al. (2016). The information from solving the penalized model, including the values of the non-routing variables, is then passed to the adaptive large neighborhood search algorithm for the next iteration. Several problem-dependent operators are defined. The operators use the information they get from the penalized model and focus on decreasing the penalty values. Computational results show up to 26% improvement in the quality of the solutions for the group of instances with a large feasible solution space. We get the optimal value for the remaining instances matched with the reported results.
摘要针对多产品多对多海运库存路由问题，提出了一种基于自适应大邻域搜索的数学算法。该问题解决了一个海上库存路线问题，旨在通过包括多个生产商和客户在内的网络，为异构船队的多种产品找到最佳路线和分销计划。在规划范围内，每个港口可以访问给定次数，并且每个产品的库存水平应在预定义的边界限制内。Hemmati等人提出了这个问题(Eur J Oper Res 252:775-788, 2016)。他们开发了一个混合整数规划公式，并提出了一个数学算法来解决这个问题。尽管他们提出的算法在运行时间方面表现良好，但它忽略了解决方案空间的一部分。在本研究中，我们提出了一种新的数学算法，通过探索同一问题的整个解空间来寻找更好的解。在我们的解决方案方法中，我们将变量分为路由变量和非路由变量。然后，在迭代过程中，我们使用自适应大邻域搜索算法确定路由变量的值，并将它们作为输入传递给惩罚模型，该模型是Hemmati等人(2016)引入的数学模型的放松和修改版本。求解惩罚模型得到的信息，包括非路由变量的值，然后传递给自适应大邻域搜索算法进行下一次迭代。定义了几个与问题相关的操作符。操作者利用他们从惩罚模型中得到的信息，专注于减少惩罚值。计算结果表明，对于具有较大可行解空间的实例组，解的质量提高了26%。我们得到与报告结果匹配的剩余实例的最优值。
{"title":"An ALNS-based matheuristic algorithm for a multi-product many-to-many maritime inventory routing problem","authors":"Nooshin Heidari, Ahmad Hemmati","doi":"10.1007/s10287-023-00478-8","DOIUrl":"https://doi.org/10.1007/s10287-023-00478-8","url":null,"abstract":"Abstract In this paper, we propose an adaptive large neighborhood search-based matheuristic algorithm to solve a multi-product many-to-many maritime inventory routing problem. The problem addresses a short sea inventory routing problem that aims to find the best route and distribution plan for multiple products with a heterogeneous fleet of vessels through a network including several producers and customers. Each port can be visited a given number of times during the planning horizon, and the stock level for each product should lie within the predefined bound limits. The problem was introduced by Hemmati et al. (Eur J Oper Res 252:775–788, 2016). They developed a mixed integer programming formulation and proposed a matheuristic algorithm to solve the problem. Although their proposed algorithm worked well in terms of running time, it suffers from disregarding a part of the solution space. In this study, we propose a new matheuristic algorithm to find better solutions by exploring the entire solution space for the same problem. In our solution methodology, we split the variables into routing and non-routing variables. Then in an iterative process, we determine the values of the routing variables with an adaptive large neighborhood search algorithm, and we pass them as input to a penalized model which is a relaxed and modified version of the mathematical model introduced in Hemmati et al. (2016). The information from solving the penalized model, including the values of the non-routing variables, is then passed to the adaptive large neighborhood search algorithm for the next iteration. Several problem-dependent operators are defined. The operators use the information they get from the penalized model and focus on decreasing the penalty values. Computational results show up to 26% improvement in the quality of the solutions for the group of instances with a large feasible solution space. We get the optimal value for the remaining instances matched with the reported results.","PeriodicalId":46743,"journal":{"name":"Computational Management Science","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136279937","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}
Pub Date : 2023-09-25DOI: 10.1007/s10287-023-00476-w
Giancarlo Bigi, Lorenzo Lampariello, Simone Sagratella, Valerio Giuseppe Sasso
Abstract We study relations between the solution sets of Variational Inequalities, Minty Variational Inequalities, Natural Map problems and Nash Equilibrium Problems. Moreover, motivated by the inherent relevance of inexactness both in modeling non-cooperative games and in algorithms for variational inequalities, we consider inexact versions of such problems and we establish relations to quantify how inexactness propagates from one problem to the other.
{"title":"Approximate variational inequalities and equilibria","authors":"Giancarlo Bigi, Lorenzo Lampariello, Simone Sagratella, Valerio Giuseppe Sasso","doi":"10.1007/s10287-023-00476-w","DOIUrl":"https://doi.org/10.1007/s10287-023-00476-w","url":null,"abstract":"Abstract We study relations between the solution sets of Variational Inequalities, Minty Variational Inequalities, Natural Map problems and Nash Equilibrium Problems. Moreover, motivated by the inherent relevance of inexactness both in modeling non-cooperative games and in algorithms for variational inequalities, we consider inexact versions of such problems and we establish relations to quantify how inexactness propagates from one problem to the other.","PeriodicalId":46743,"journal":{"name":"Computational Management Science","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135815148","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}
Pub Date : 2023-09-22DOI: 10.1007/s10287-023-00477-9
Nahid Rezaeinia, Julio C. Góez, Mario Guajardo
Abstract Given two sets of objects, the integer assignment problem consists of assigning objects of one set to objects in the other set. Traditionally, the goal of this problem is to find an assignment that minimizes or maximizes a measure of efficiency, such as maximization of utility or minimization of cost. Lately, the interest in incorporating a measure of fairness in addition to efficiency has gained importance. This paper studies how to incorporate these two criteria in an integer assignment, using the Jain’s index as a measure of fairness. The original formulation of the assignment problem with this index involves a non-concave function, which renders a non-linear non-convex problem, usually hard to solve. To this aim, we develop two reformulations, where one is based on a quadratic objective function and the other one is based on integer second-order cone programming. We explore the performance of these reformulations in instances of real-world data derived from an application of assigning personnel to projects, and also in instances of randomly generated data. In terms of solution quality, all formulations prove to be effective in finding solutions capturing both efficiency and fairness criteria, with some slight differences depending on the type of instance. In terms of solving time, however, the performances of the formulations differ considerably. In particular, the integer quadratic approach proves to be much faster in finding optimal solutions.
{"title":"On efficiency and the Jain’s fairness index in integer assignment problems","authors":"Nahid Rezaeinia, Julio C. Góez, Mario Guajardo","doi":"10.1007/s10287-023-00477-9","DOIUrl":"https://doi.org/10.1007/s10287-023-00477-9","url":null,"abstract":"Abstract Given two sets of objects, the integer assignment problem consists of assigning objects of one set to objects in the other set. Traditionally, the goal of this problem is to find an assignment that minimizes or maximizes a measure of efficiency, such as maximization of utility or minimization of cost. Lately, the interest in incorporating a measure of fairness in addition to efficiency has gained importance. This paper studies how to incorporate these two criteria in an integer assignment, using the Jain’s index as a measure of fairness. The original formulation of the assignment problem with this index involves a non-concave function, which renders a non-linear non-convex problem, usually hard to solve. To this aim, we develop two reformulations, where one is based on a quadratic objective function and the other one is based on integer second-order cone programming. We explore the performance of these reformulations in instances of real-world data derived from an application of assigning personnel to projects, and also in instances of randomly generated data. In terms of solution quality, all formulations prove to be effective in finding solutions capturing both efficiency and fairness criteria, with some slight differences depending on the type of instance. In terms of solving time, however, the performances of the formulations differ considerably. In particular, the integer quadratic approach proves to be much faster in finding optimal solutions.","PeriodicalId":46743,"journal":{"name":"Computational Management Science","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136060071","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}
Pub Date : 2023-09-08DOI: 10.1007/s10287-023-00472-0
M. Ferris, Andrew B. Philpott
{"title":"Renewable electricity capacity planning with uncertainty at multiple scales","authors":"M. Ferris, Andrew B. Philpott","doi":"10.1007/s10287-023-00472-0","DOIUrl":"https://doi.org/10.1007/s10287-023-00472-0","url":null,"abstract":"","PeriodicalId":46743,"journal":{"name":"Computational Management Science","volume":"20 1","pages":"1-40"},"PeriodicalIF":0.9,"publicationDate":"2023-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44991188","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：