A Metaheuristic to Solve a Location-Routing Problem with Non-Linear Costs
暂无分享,去创建一个
[1] Pierre Hansen,et al. Variable Neighborhood Decomposition Search , 1998, J. Heuristics.
[2] Angel B. Ruiz,et al. Designing Distribution Networks: Formulations and Solution Heuristic , 2004, Transp. Sci..
[3] Pierre Hansen,et al. Variable neighborhood search: Principles and applications , 1998, Eur. J. Oper. Res..
[4] Said Salhi,et al. The effect of ignoring routes when locating depots , 1989 .
[5] P. Hansen,et al. Variable neighborhood search for the p-median , 1997 .
[6] Gilbert Laporte,et al. Location-Arc Routing Problems , 2001 .
[7] Juan A. Díaz,et al. A compact model and tight bounds for a combined location-routing problem , 2005, Comput. Oper. Res..
[8] SorianoPatrick,et al. Designing Distribution Networks , 2004 .
[9] Michel Gendreau,et al. Diversification strategies in tabu search algorithms for the maximum clique problem , 1996, Ann. Oper. Res..
[10] Chinyao Low,et al. Heuristic solutions to multi-depot location-routing problems , 2002, Comput. Oper. Res..
[11] Mark S. Daskin,et al. A warehouse location-routing problem , 1985 .
[12] Matteo Fischetti,et al. The symmetric generalized traveling salesman polytope , 1995, Networks.
[13] Oded Berman,et al. Technical Note - Routing and Location-Routing p-Delivery Men Problems on a Path , 1994, Transp. Sci..
[14] C. K. Y. Lin,et al. A location-routing-loading problem for bill delivery services , 2002 .
[15] Laura I. Burke,et al. A two-phase tabu search approach to the location routing problem , 1999, Eur. J. Oper. Res..