排序方式: 共有33条查询结果,搜索用时 62 毫秒
31.
In late 2011, the Spanish terrorist organization ETA announced the end of armed violence after more than forty years of illegal activity. While the existing literature has already established the negative impact of terrorist actions on international tourism in a particular region, this paper aims to determine whether ETA’s final ceasefire and definitive dissolution had a positive impact on domestic tourism in Basque Country. To that end, a directed gravity model is estimated over a panel data-set of 699 domestic tourist flows between the Spanish regions from 2008 to 2013. Results suggest that the negative impact on visitor flows was localized in the Basque Country. Also, regardless of a permanent ceasefire announced in 2010, only the 2011 ‘definitive cessation of violence’ had an immediate significant impact on the number of visitors to the Basque Country. These results complement the scarce literature on post-conflict tourism analysis and may have implications for regional authorities in affected regions in their efforts to rebuild their destination brands. 相似文献
32.
We present, analyze, and compare three random search methods for solving stochastic optimization problems with uncountable feasible regions. Our adaptive search with resampling (ASR) approach is a framework for designing provably convergent algorithms that are adaptive and may consequently involve local search. The deterministic and stochastic shrinking ball (DSB and SSB) approaches are also convergent, but they are based on pure random search with the only difference being the estimator of the optimal solution [the DSB method was originally proposed and analyzed by Baumert and Smith]. The three methods use different techniques to reduce the effects of noise in the estimated objective function values. Our ASR method achieves this goal through resampling of already sampled points, whereas the DSB and SSB approaches address it by averaging observations in balls that shrink with time. We present conditions under which the three methods are convergent, both in probability and almost surely, and provide a limited computational study aimed at comparing the methods. Although further investigation is needed, our numerical results suggest that the ASR approach is promising, especially for difficult problems where the probability of identifying good solutions using pure random search is small. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
33.
We consider a scenario with two firms determining which products to develop and introduce to the market. In this problem, there exists a finite set of potential products and market segments. Each market segment has a preference list of products and will buy its most preferred product among those available. The firms play a Stackelberg game in which the leader firm first introduces a set of products, and the follower responds with its own set of products. The leader's goal is to maximize its profit subject to a product introduction budget, assuming that the follower will attempt to minimize the leader's profit using a budget of its own. We formulate this problem as a multistage integer program amenable to decomposition techniques. Using this formulation, we develop three variations of an exact mathematical programming method for solving the multistage problem, along with a family of heuristic procedures for estimating the follower solution. The efficacy of our approaches is demonstrated on randomly generated test instances. This article contributes to the operations research literature a multistage algorithm that directly addresses difficulties posed by degeneracy, and contributes to the product variety literature an exact optimization algorithm for a novel competitive product introduction problem. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009 相似文献