A GIS-based optimization framework for competitive multi-facility location-routing problem

This is the latest version of this item.

Abstract

In a dynamic market setting, firms need to quickly respond to shifting demographics and economic conditions. In this paper, we investigate the problem of determining the optimum set of locations for a firm, which operates a chain of facilities under competition. We consider the objective of maximizing profit, defined as gross profit margin minus logistics costs. We propose a location-routing model where revenue is realized according to probabilistic patronization of customers and routing costs are incurred due to vehicles serving the open facilities from a central depot. We propose a hybrid heuristic optimization methodology for solving this model. The optimal locations are searched for by a Genetic Algorithm while an integrated Tabu Search algorithm is employed for solving the underlying vehicle routing problem. The solution approach is tested on a real dataset of a supermarket chain. The results show that the location decisions made by the proposed methodology lead to increased market share and profit margin, while keeping logistics costs virtually unchanged. Finally, we present a GIS-based framework that can be used to store, analyze and visualize all data as well as model solutions in geographic format.

Available Versions of this Item

• A GIS-based optimization framework for competitive multi-facility location-routing problem. (deposited 04 Dec 2009 14:12)
  • A GIS-based optimization framework for competitive multi-facility location-routing problem. (deposited 06 Dec 2009 17:34)
    • A GIS-based optimization framework for competitive multi-facility location-routing problem. (deposited 24 Aug 2010 11:20) [Currently Displayed]