A simple and effective genetic algorithm for the two-stage capacitated facility location problem
This paper presents a simple and effective Genetic Algorithm (GA) for the two-stage capacitated facility location problem (TSCFLP). The TSCFLP is a typical location problem which arises in freight transportation. In this problem, a single product must be transported from a set of plants to meet cust...
Na minha lista:
Principais autores: | , , , , , |
---|---|
Formato: | article |
Idioma: | English |
Publicado em: |
Elsevier
|
Assuntos: | |
Endereço do item: | https://repositorio.ufrn.br/handle/123456789/30459 |
Tags: |
Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!
|
Resumo: | This paper presents a simple and effective Genetic Algorithm (GA) for the two-stage capacitated facility location problem (TSCFLP). The TSCFLP is a typical location problem which arises in freight transportation. In this problem, a single product must be transported from a set of plants to meet customers demands, passing out by intermediate depots. The objective is to minimize the operation costs of the underlying two-stage transportation system thereby satisfying demand and capacity constraints of its agents. For this purpose, a GA is proposed and computational results are reported comparing the heuristic results with those obtained by two state-of-the-art Lagrangian heuristics proposed in the literature for the problem |
---|