The capacitated location-routing problem (CLRP) is a new research area in logistics and distribution management. This problem combines two difficult problems: the facility location problem (FLP) and vehicle routing problem (VRP). The goal of the CLRP is to open a subset of depots, assign the customers into open facilities, and then design vehicle tours in order to minimize the total cost. The time windows constraint has numerous real-life applications, however there are little attention to this fact in the CLRP. This paper, considers the CLRP with hard time windows (CLRPHTW). At first, a mixed integer linear programming (MILP) formulations for the CLRPHTW is presented, then a meta-heuristic approach based on variable neighborhood search for solving the CLRPHTW is proposed. In order to evaluate the performance of the suggested method, this framework is tested on a set of instances. The experimental results show the effectiveness of the proposed approach.
Mohammadishad, A., & Fattahi, P. (2012). A Hybrid Meta-heuristic Approach for the Capacitated Location-Routing Problem with Hard Time Windows. Advances in Industrial Engineering, 46(2), 219-233. doi: 10.22059/jieng.2012.30564
MLA
A.R. Mohammadishad; P. Fattahi. "A Hybrid Meta-heuristic Approach for the Capacitated Location-Routing Problem with Hard Time Windows", Advances in Industrial Engineering, 46, 2, 2012, 219-233. doi: 10.22059/jieng.2012.30564
HARVARD
Mohammadishad, A., Fattahi, P. (2012). 'A Hybrid Meta-heuristic Approach for the Capacitated Location-Routing Problem with Hard Time Windows', Advances in Industrial Engineering, 46(2), pp. 219-233. doi: 10.22059/jieng.2012.30564
VANCOUVER
Mohammadishad, A., Fattahi, P. A Hybrid Meta-heuristic Approach for the Capacitated Location-Routing Problem with Hard Time Windows. Advances in Industrial Engineering, 2012; 46(2): 219-233. doi: 10.22059/jieng.2012.30564
)