This paper presents a multicriterion algorithm for dealing with joint facility location and network design problems, formulated as bi-objective problems. The algorithm is composed of two modules: a multiobjective quasi-Newton algorithm, that is used to find the location of the facilities; and a multiobjective genetic algorithm, which is responsible for finding the efficient topologies. These mo...

In this paper we present the problem of decision making on the facility location and pricing. We assume that the facilities can charge the different prices and the objective is to maximize the overall revenue. It is known that the problem is NPhard in the strong sense even for the given facility location. A two level local search heuristic based on the VNS framework is developed for this nonlin...

We discuss a tank design problem for a multi product plant, in which the optimal cycle time and the optimal campaign size are unknown. A mixedinteger nonlinear programming (MINLP) formulation is presented, where non-convexities are due to the tank investment cost, storage cost, campaign setup cost and variable production rates. The objective of the optimization model is to minimize the sum of t...

The location-routing problem is the most significant and yet new research field in location problems that considers simultaneously vehicle routing problem features with original one for achieving high-quality integrated distribution systems in beside of the global optimum. Simultaneous pickup and delivery based on time windows are the two main characteristics of logistic management that have be...

One of the main critical steps that should be taken during natural disasters is the assignment and distribution of resources among affected people. In such situations, this can save many lives. Determining the demands for critical items (i.e., the number of injured people) is very important. Accordingly, a number of casualties and injured people have to be known during a disaster. Obtaining an ...

High performance computing applied to competitive facility location and design problems: single and multi-objective optimization algorithms A mis padres, a mi hermano y a Manu Agradecimientos En primer lugar me gustaría agradecer a mis tres supervisores, Dra. D Prefacio La localización de servicios pretende encontrar el emplazamiento de uno o más centros Esta tesis, " High performance computing...

in this paper, we present the stochastic version of maximal covering location problem which optimizes both location and allocation decisions, concurrently. it’s assumed that traveling time between customers and distribution centers (dcs) is uncertain and described by normal distribution function and if this time is less than coverage time, the customer can be allocated to dc. in classical model...

For a locally optimal solution to the nonlinear semidefinite programming problem, under Robinson’s constraint qualification, the following conditions are proved to be equivalent: the strong second order sufficient condition and constraint nondegeneracy; the nonsingularity of Clarke’s Jacobian of the Karush-Kuhn-Tucker system; the strong regularity of the Karush-Kuhn-Tucker point; and others.

This paper proposes a new location problem of competitive facilities, e.g. shops and stores, with uncertain demands in the plane. By representing the demands for facilities as random variables, the location problem is formulated to a stochastic programming problem, and for finding its solution, three deterministic programming problems: expectation maximizing problem, probability maximizing prob...

This paper presents a deterministic and efficient algorithm for online facility location. The algorithm is based on a simple hierarchical partitioning and is extremely simple to implement. It also applies to a variety of models, i.e., models where the facilities can be placed anywhere in the region, or only at customer sites, or only at fixed locations. The paper shows that the algorithm is O(l...