A two-phase heuristic algorithm for the fixed-charge capacitated network design problem with turn penalties
暂无分享,去创建一个
[1] J U Choi,et al. Development of the tree-based link labeling algorithm for optimal path-finding in urban transportation networks , 1998 .
[2] Varadharajan Sridhar,et al. Benders-and-cut algorithm for fixed-charge capacitated network design problem , 2000, Eur. J. Oper. Res..
[3] Thomas L. Magnanti,et al. Network Design and Transportation Planning: Models and Algorithms , 1984, Transp. Sci..
[4] Di Yuan,et al. A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem , 2000, Oper. Res..
[5] L. R. Foulds. A multi-commodity flow network design problem , 1981 .
[6] J. Herrmann,et al. A Dual Ascent Approach to the Fixed-Charge Capacitated Network Design Problem , 1996 .
[7] Yeong-Dae Kim,et al. A space partitioning method for facility layout problemswith shape constraints , 1998 .
[8] Richard D. McBride,et al. Controlling left and u-turns in the routing of refuse collection vehicles , 1982, Comput. Oper. Res..
[9] Mark W. Lewis. On the use of guided design search for discovering significant decision variables in the fixed-charge capacitated multicommodity network design problem , 2009 .
[10] Michel Gendreau,et al. A Simplex-Based Tabu Search Method for Capacitated Network Design , 2000, INFORMS J. Comput..
[11] Bernard Gendron. A note on "a dual-ascent approach to the fixed-charge capacitated network design problem" , 2002, Eur. J. Oper. Res..
[12] Lawrence Bodin,et al. A detailed description of a computer system for the routing and scheduling of street sweepers , 1979, Comput. Oper. Res..
[13] Georg Kliewer,et al. Relax-and-Cut for Capacitated Network Design , 2005, ESA.
[14] Stephan Winter,et al. Modeling Costs of Turns in Route Planning , 2002, GeoInformatica.
[15] Jeffrey K. Uhlmann,et al. An Efficient Algorithm for Computing Least Cost Paths with Turn Constraints , 1998, Inf. Process. Lett..
[16] Michel Gendreau,et al. Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design , 2003, Oper. Res..
[17] Myoung Hwan Choi,et al. Turn penalty problem model for minimum time AGV routing , 1997, Proceedings of the IECON'97 23rd International Conference on Industrial Electronics, Control, and Instrumentation (Cat. No.97CH36066).
[18] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.
[19] Jeff L. Kennington,et al. A Survey of Linear Cost Multicommodity Network Flows , 1978, Oper. Res..
[20] G Laporte,et al. Solving arc routing problems with turn penalties , 2000, J. Oper. Res. Soc..
[21] Teodor Gabriel Crainic,et al. Multicommodity Capacitated Network Design , 1999 .
[22] Teodor Gabriel Crainic,et al. A first multilevel cooperative algorithm for capacitated multicommodity network design , 2006, Comput. Oper. Res..
[23] Michel Gendreau,et al. EFFICIENT ROUTING OF SERVICE VEHICLES , 1997 .