A simple and effective genetic algorithm for the two-stage capacitated facility location problem

             

A simple and effective genetic algorithm for the two-stage capacitated facility location problem

Abstract

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 Lagrangean heuristics proposed in the literature for the problem.

Keywords

  • Two-stage facility location;
  • Genetic Algorithm;
  • Multi-stage Transportation Systems

دانلود مقاله کامل -- ویژه اعضای طلایی

alt

جهت اطلاع از نحوه ارتقا عضویت طلایی به

آپشن اعضای طلایی مراجعه فرمایید

 

کتابخانه دیجیتال دپارتمان

سامانه هوشمند ژورنال مقالات