Abstract. We investigate the ( r ∣ X p )‐medianoid problem for networks. This is a competitive location that consists of determining locations facilities belonging to firm in order maximize its market share space where competitor already operating with facilities. consider six scenarios resulting from combination three customer choice rules (binary, partially binary, and proportional) two types services (essential unessential). Known discretization results about existence solution set nodes...

Tourism generates huge amounts of waste. It has been estimated that about half the waste generated by hotels is food and garden bio-waste. This bio-waste can be used to make compost pellets. In turn, pellets as an absorbent material in composters energy source. this paper, we consider problem locating composting pellet-making facilities so a chain managed at or close generation points. The general objective twofold: i) avoid transportation from treatment points product production demand...

Abstract. In this research note, the follower location problem where customers' choice is based on an attraction function analysed. The depends both distance between customers and facilities, characteristics (quality) of facilities. Customers at each node impose a minimum level in order to patronise facility then they share their buying power among facilities that pass threshold. amount demand captured by these proportional perceived customers. case, discretisation network proved.

This article deals with a network competitive localization problem in which firm seeks to determine the location of new facility, competes all facilities operating market, both belonging same and competing firms. In this context, two frequently conflicting objectives are involved: maximization total market share captured by minimization losses for its existing due being facility (cannibalization). We formulate as multi-objective optimization model. Some GIS tools that provide some maps...

Abstract The ‐centroid problem or leader–follower is generalized considering different customer choice rules where a may use facilities belonging to firms, if the difference in travel distance (or time) small enough. Assuming essential goods, some particular are analyzed. Linear programming formulations for ‐medianoid and problems presented an exact solution approach applied. Some computational examples included.

Considering that the structure of any input-output table (IOT) or social accounting matrix (SAM) is defined by both row and column coefficients, updating adjusting process has to deal with conflict between ratios. We present a bi-objective optimization problem where objectives are in terms horizontal vertical coefficients. Our method applied different criteria their results compared. also apply this situations not same for parts SAM. Considerando que la estructura de cualquier matriz o...