Genetic algorithms for the single source capacitated location problem

Authors:
Maria João Cortinhal;Maria Eugénia Captivo
Affiliations:
ISCTE-CIO, Av. Forças Armadas, 1649-026, Lisboa, Portugal;ISCTE-CIO, Av. Forças Armadas, 1649-026, Lisboa, Portugal and Faculdade de Ciências da Universidade de Lisboa, Edifìcio C2 - Campo Grande, 1749-016 Lisboa, Portugal
Venue:
Metaheuristics
Year:
2004

Citing 3
Cited 2

Efficient algorithms for the capacitated concentrator location problem

Computers and Operations Research
The number partitioning problem: an open challenge for evolutionary computation?

New ideas in optimization
Algorithm 97: Shortest path

Communications of the ACM

An evolutionary algorithm for some cases of the single-source constrained plant location problem

Proceedings of the 10th annual conference on Genetic and evolutionary computation
Using Logic-Based Benders Decomposition to Solve the Capacity-and Distance-Constrained Plant Location Problem

INFORMS Journal on Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The single source capacitated location problem is considered. Given a set of potential locations and the plant capacities, it must be decided where and how many plants must be open and which clients must be assigned to each open plant. Genetic algorithms that use different methodologies for handling constraints are described and tested. Computational experiments on different sets of problems are presented.