A hybrid model for multi-objective capacitated facility location network design problem

One of the primary concerns on many traditional capacitated facility location/network problems is to consider transportation and setup facilities in one single objective function. This simple assumption may lead to misleading solutions since the cost of transportation is normally considered for a short period time and, obviously, the higher cost of setting up the facilities may reduce the importance of the transportation cost/network. In this paper, we introduce capacitated facility location/network design problem (CFLNDP) with two separate objective functions in forms of multi-objective with limited capacity. The proposed model is solved using a new hybrid algorithm where there are two stages. In the first stage, locations of facilities and design of fundamental network are determined and in the second stage demands are allocated to the facilities. The resulted multi-objective problem is solved using Lexicography method for a well-known example from the literature with 21 node instances. We study the behaviour of the resulted problem under different scenarios in order to gain insight into the behaviour of the model in response to changes in key problem parameters.

[1]  Hanif D. Sherali,et al.  Linear Programming and Network Flows , 1977 .

[2]  R. Ravi,et al.  Approximation Algorithms for Problems Combining Facility Location and Network Design , 2006, Oper. Res..

[3]  Thomas L. Magnanti,et al.  A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design , 1989, Oper. Res..

[4]  Oded Berman,et al.  Improving the location of minisum facilities through network modification , 1993, Ann. Oper. Res..

[5]  Gilbert Laporte,et al.  Location routing problems , 1987 .

[6]  Ramaswamy Chandrasekaran,et al.  Network Design Subject to Facility Location , 2003, CCCG.

[7]  Zvi Drezner,et al.  NETWORK DESIGN: SELECTION AND DESIGN OF LINKS AND FACILITY LOCATION , 2003 .

[8]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[9]  J. MacGregor Smith,et al.  Topological network design of pedestrian networks , 2001 .

[10]  Mark S. Daskin,et al.  Capacitated facility location/network design problems , 2001, Eur. J. Oper. Res..

[11]  Terry L. Friesz,et al.  Disequilibrium Network Design: A New Paradigm for Transportation Planning and Control , 1998 .

[12]  Rajendra S. Solanki,et al.  Using decomposition in large-scale highway network design with a quasi-optimization heuristic , 1998 .

[13]  J. G. Klincewicz,et al.  HUB LOCATION IN BACKBONE/TRIBUTARY NETWORK DESIGN: A REVIEW , 1998 .

[14]  Lawrence V. Snyder,et al.  Facility Location in Supply Chain Design , 2005 .

[15]  Mark S. Daskin,et al.  A New Approach to Solving Applied Location/AIIocation Problems , 2008 .

[16]  Panos M. Pardalos,et al.  Network Design: Connectivity and Facilities Location , 1998 .

[17]  Robert Chasnov,et al.  Design and Optimization , 2013 .

[18]  Dominique Peeters,et al.  The Effect of Spatial Structure on p-Median Results , 1995, Transp. Sci..

[19]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[20]  Hai Yang,et al.  Models and algorithms for road network design: a review and some new developments , 1998 .

[21]  Mark S. Daskin,et al.  AN INTEGRATED MODEL OF FACILITY LOCATION AND TRANSPORTATION NETWORK DESIGN , 2001 .

[22]  Thomas L. Magnanti,et al.  Network Design and Transportation Planning: Models and Algorithms , 1984, Transp. Sci..