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...

Bus network design is an important problem in public transportation. A main step to this design is determining the number of required terminals and their locations. This is a special type of facility location problem, which is a time-consuming, large scale, combinatorial problem. In a previous attempt by the authors, this problem had been solved by GAMS, based on a branch and bound algorithm. ...

The Generalized Traveling Salesman Path Problem (GTSPP) involves finding the shortest path from a location s to a location t that passes through at least one location from each of a set of generalized location categories (e.g., gas stations, grocery stores). This NP-hard problem type has many applications in transportation and location-based services. We present two exact algorithms for solving...

in many practical distribution networks, managers face significant uncertainties in demand, local price of building facilities, transportation cost, and macro and microeconomic parameters. this paper addresses design of distribution networks in a supply chain system which optimizes the performance of distribution networks subject to required service level. this service level, which is considere...

In this chapter, we describe a variety of modeling and solution approaches for transportation resource management problems. The solution approaches that we propose either build on deterministic linear programming formulations, or formulate the problem as a dynamic program and use tractable approximations to the value functions. We describe two classes of methods to construct approximations to t...

A wide spectrum of “real world” problems, such as vehicle routing, machine and crew scheduling, facility location, portfolio analysis, electricity generation planning, and communication and transportation network design, demands the use of combinatorial optimization methods. By a combinatorial optimization problem, we mean a program where a linear or nonlinear objective function must be optimiz...

We present a constraint-and-column generation algorithm to solve two-stage robust optimization problems. Compared with existing Benders style cutting plane methods, it is a general procedure with a unified approach to deal with optimality and feasibility. A computational study on a two-stage robust location-transportation problem shows that it performs an order of magnitude faster. Also, it rev...

Abstract: This paper presents a sensitivity analysis to multiobjective transportation problem. The proposed approach yields to maximum tolerance percentages in multiobjective transportation problem. The weighted sum approach is used to solve the multiobjective transportation problem. The proposed approach allows changing in both the weights and the objective function coefficients and the right ...

In this document, I outline a few challenging algorithmic problems arising in my research on optimal transportation. I have attempted to pose these problems in “discrete” language. It easily could be the case that they admit straightforward solutions— which is great news!—or that you can do little more than the obvious algorithm. Any and all guidance from members of the theory community is welc...

in this study, we discuss the capacitated facility location-allocation problem with uncertain parameters in which the uncertainty is characterized by given finite numbers of scenarios. in this model, the objective function minimizes the total expected costs of transportation and opening facilities subject to the robustness constraint. to tackle the problem efficiently and effectively, an effici...