Search

• Determining the urban critical infrastructures in the event of an earthquake. • Designing Location-Routing-Inventory decisions in humanitarian relief chain. • Simulation of interaction of urban infrastructure in earthquake conditions. • Using a cooperative game to examine the manner of cooperation of disaster relief supply chain players. • Application of the model to a real-world disaster relief logistic case study. This paper describes a new simulation based mathematical model for locating distribution centres, vehicle routing, and inventory problems under earthquake conditions. In this paper, the proposed network includes affected areas, suppliers, distribution centres, and hospitals. Additionally, the basic infrastructures of the city, which are very fragile at the time of the earthquake, are identified. Then, the demand of each relief commodity is calculated depending on the different earthquake scenarios using simulation. The estimated demand is incorporated into the mathematical model as an uncertain parameter. The proposed methodology is designed as a two-stage model so that in the first stage the location and inventory of distribution centres are addressed. Thereafter, in the second stage the routing decisions are taken for the distribution of relief commodities from the distribution centres and suppliers to the affected areas. Due to the NP-hardness of the second stage model, this model is solved using multi-objective stochastic fractal search. This algorithm is one of the population-based and stochastic optimization techniques and inspired by the natural phenomenon of fractal growth. It should be noted that in the second stage, a cooperative game theory of coalition type is considered, which resulted in synergies that minimize the relief golden time. The kind of cooperation is the use of potential of co-operators' vehicle. In this stage, the possibility for the players to cooperate by sharing people and commodities transportation requests is considered. Also, to validate the model, a real case study is provided for a possible earthquake in Tehran. Finally, the comparison between the simulation results and the values obtained from the real system evaluates the performance of the implemented model. Considering normality and a 95% confidence interval, it can be concluded that the proposed model provides a precise representation of the real system's performance. [ABSTRACT FROM AUTHOR]

In every kind of industry to have esteemed production in limited time and cost marks its capital gain. It may be any section of the industry, such as technical, mechanical, human resource or sales, all are co-related with the end products a factory produces to be marketed off in the world spectrum. This paper reflects a short and applicable method to overcome the difficulties arising in the all-around production of goods in industries when time and capital are limited. In simple terms, this model formatted on games theory (n-person cooperative games). Lastly, for more illustration, a case study is posted to explain the issues with examples for better understanding of Shapely value and the concept of the nucleolus. All departments of a production house can benefit equally. [ABSTRACT FROM AUTHOR]

Power flow tracing has been suggested as an approach for evaluating 1) transmission system usage (TSU) cost and 2) loss (MW) cost for generator and load entities in the system. Recently, optimal power flow tracing methods have been proposed to "explicitly" model fairness constraints in the tracing framework. This paper, further, strengthens the tracing-compliant min-max fair cost allocation approach. The min-max model proposed in this paper is robust. It addresses concerns like scalability, numerical stability and termination in a finite number of steps while searching the optimal solution. We also propose a methodology to model DISCOMs and GENCOs as coalition within min-max framework. Case studies on an all India network of 1699 nodes and comparison with average participation and marginal participation methods bring out the better conflict resolution feature of the proposed approach. A method to model HVDC lines within the marginal participation scheme is also proposed. Quantitative and qualitative comparison of various TSU cost allocation methods on such a large system is another noteworthy contribution of the paper. [ABSTRACT FROM AUTHOR]

This paper deals with a linear production game with restricted communication. Based on the Owen solution (Owen in Math Progr 9:358-370, ), we propose a core-allocation reflecting the communication situation defined by a network. The core of a linear production game with unrestricted communication is included by that of the corresponding network restricted game. Taking this property into account, we develop a procedure for modifying the Owen solution to reflect the configuration of the enlarged core. [ABSTRACT FROM AUTHOR]

A multi-depot Chinese postman problem (MDCP) arises from a network (e.g. cityplan) in which several depots are located wherefrom edges (e.g. streets) have to be served. Since costs are involved with each visit to an edge, the objective is to find a minimum cost tour in the network that visits all edges of the network. Such a minimum cost tour consists of a collection of subtours such that the subtours originate from different depots, and each subtour starts and ends at the same depot. This typical OR problem turns into a multi decision maker problem if agents are assigned to the streets. In this new setting the cost of a minimum cost tour that visits all edges have to be paid by the agents. However, now each group of agents (coalition) has the opportunity to find its own minimum cost tour, i.e. a minimum cost tour that only visits the edges owned by the group of agents. Therefore, the main objective is to find allocations of the cost of a minimum tour that visits all agents in such a way that no coalition has higher costs than the costs incurred by its own minimum tour. We will use cooperative game theory to investigate whether these so-called core allocations exist. Therefore, we consider a cooperative Chinese postman (CP) game that is induced by an MDCP by associating every edge of the network with a different agent. In this paper, we characterize classes of networks that ensure the existence of core allocations, the so-called CP balanced graphs, and the existence of specific core allocations, the so-called CP submodular graphs. [ABSTRACT FROM AUTHOR]