We propose a model and solution methods, for locating a fixed number of multiple-server, congestible common service centers or congestible public facilities. Locations are chosen so to minimize consumers’ congestion (or queuing) and travel costs, considering that all the demand must be served....

In this paper we propose a metaheuristic to solve a new version of the Maximum Capture Problem. In the original MCP, market capture is obtained by lower traveling distances or lower traveling time, in this new version not only the traveling time but also the waiting time will affect the market...

The Generalized Assignment Problem consists in assigning a set of tasks to a set of agents with minimum cost. Each agent has a limited amount of a single resource and each task must be assigned to one and only one agent, requiring a certain amount of the resource of the agent. We present new...

The Maximum Capture problem (MAXCAP) is a decision model that addresses the issue of location in a competitive environment. This paper presents a new approach to determine which store’s attributes (other than distance) should be included in the new Market Capture Models and how they ought to...

A new direction of research in Competitive Location theory incorporates theories of Consumer Choice Behavior in its models. Following this direction, this paper studies the importance of consumer behavior with respect to distance or transportation costs in the optimality of locations obtained by...