Transport networks with hub structure organise the exchange of shipments between many sources and sinks. All sources and sinks are connected to a small number of hubs which serve as transhipment points, so that only few, strongly consolidated transport relations exist. While hubs and detours lead to additional costs, the savings from bundling shipments, i.e. economies of scale, usually outweigh...

(ABSTRACT) This research is concerned with the development of algorithmic approaches for solving problems that arise in the design and analysis of telecommunication networks, location-allocation distribution contexts, and intelligent transportation networks. Specifically, the corresponding problems addressed in these areas are a local access and transport area (LATA) network design problem, the...

We consider a class of location-allocation problems with immobile servers, stochastic demand and congestion that arises in several planning contexts: location of emergency medical clinics; preventive healthcare centers; refuse collection and disposal centers; stores and service centers; bank branches and automated banking machines; internet mirror sites; web service providers (servers); and dis...

This work concerns a special class of multicriteria optimization problems, obtained from a given single-facility multicriteria planar location problem by adding several new cost functions. By means of a decomposition approach, based on the concept of Pareto reducibility, we have developed together with S. Alzorba and Chr. Günther an implementable algorithm for generating efficient solutions of ...

1 A Location Allocation Model for a Territorial Design Problem with Dense Demand; María Beatríz Bernábe Loranca, Faculty of Computer Science, Benemérita Universidad Autónoma de Puebla, Puebla, Mexico Rogelio González Velázquez, Faculty of Computer Science, Benemérita Universidad Autónoma de Puebla, Puebla, Mexico Elias Olivares Benítez, Interdisciplinary Center for Graduate Studies and Research...

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

In the Nearest Neighbor problem (NN), the objects in the database that are nearer to a given query object than any other objects in the database have to be found. In the conceptually inverse problem, Reverse Nearest Neighbor problem (RNN), objects that have the query object as their nearest neighbor have to be found. Reverse Nearest Neighbors queries have emerged as an important class of querie...

We consider the problem of placing a speciied number (p) of facilities on the nodes of a network so as to minimize some measure of the distances between facilities. This type of problem models a number of problems arising in facility location, statistical clustering , pattern recognition, and processor allocation problems in multiprocessor systems. We consider the problem under three diierent o...

We consider the problem of placing a speciied number (p) of facilities on the nodes of a network so as to minimize some measure of the distances between facilities. This type of problem models a number of problems arising in facility location, statistical clustering, pattern recognition, and also processor allocation problems in multiprocessor systems. We consider the problem under three diiere...