维普中文期刊产品整合服务
54篇 您的检索式:作者名="Prodhon C"
    题名 作者 年代 出处 被引量
1Solving the two-echelon location routing problem by a GRASP reinforced by a learning process and path relinking 显示文摘Nguyen V P Prins C Prodhon C 2012European Journal of Operational Research (S0377-2217)2012,216,1:1
2Solving the twoechelon location routing problem by a GRASP reinforced by a learning process and path relinking显示文摘NGUYEN V P PRINS C PRODHON C 2012European Journal of Operational Research2012,216,1:1
3AHybrid Evolutionary Local Search with Depth First Search Split Procedure for the Heterogeneous Vehicle Routing Problems 显示文摘Duhamel C Laeonune P Prodhon C 2012Engineering Applications of Artificial Intelligence2012,25,2:1
4GRASP/VND and multi-start evolutionary local search for the single truck and trailer routing problem with satellite depots显示文摘Villegas J G Prins C Prodhon C 2010Engineering Applications of Artificial Intelligence2010,23,5:1
5Solving the two-echelon location routing problem by a GRASP reinforced by a learning process and path relinking显示文摘Nguyen V P Prins C Prodhon C 2012European Journal of Operational Research2012,216,1:1
6A survey of recent research on location-routing problems显示文摘Prodhon C Prins C 2014European Journal of Operational Research2014,238,1:1
7A memetic algorithm with population management (MA|PM) for the capacitated location-routing problem显示文摘Prins C Prodhon C Calvo R W 2006Lecture Notes in Computer Science2006,3906,:1
8Solving the capaci rated location-routing problem by a cooperative Lagrangean relaxation granular tabu search heuristic显示文摘PRINS C PRODHON C RUIZ A 2007Transportation Science2007,41,4:1
9Efficient frameworks for greedy split and new depth first search split procedures for routing problems显示文摘Duhamel C Lacomme P Prodhon C 2011Computers and Operations Research2011,38,4:1
10Solving the capacitated location-routing problem by a cooperative lagrangean relaxation-granular tabu search heuristic 显示文摘Prins C Prodhon C Ruiz A Soriano P Wolfler-Calvo R 2007Transportation Science2007,41,4:1
11Solving the two-echelon location routing problem by a GRASP reinforced by a learning process and path relinking显示文摘Nguyen V P Prins C Prodhon C 2012European Journal of Operational Research2012,216,1:1
12Efficient frameworks for greedy split and new depth first search split procedures for routing problems显示文摘Duhamel C Lacomme P Prodhon C 2011Computers and Operations Research2011,38,4:1
13Solving the two-echelon location routing problem by a GRASP reinforced by a learning process and path relinking 显示文摘Nguyen V P Prins C Prodhon C 2012European Journal of Operational Research2012,216,1:1
14Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking显示文摘Prins C Prodhon C Ruiz A Wolfler-Calvo R 20064OR2006,4,3:1
15A memetic algorithm with population management ( MA I PM) for the capacitated location-routing problem显示文摘Prins C Prodhon C Soriano P Ruiz A 2006Lecture Notes in Computer Science2006,3906,:1
16Solving the two-echelor location routing problem by a GRASP reinforced by a leamin: process and path relinking 显示文摘NGUYEN V P PRINS C PRODHON C 2012European Journal of Operational Research2012,216,1:1
17A multi-start iterated lo- cal search with tabu list and path relinking for the two-echelon loca- tion-routing problem 显示文摘NGUYEN V P PRINS C PRODHON C 2012Engineering Applications of Artificial In- telligence2012,25,1:1
18A GRASP with Evolutionary Path Relinking for the Truck and Trailer Routing Problem显示文摘Villegas J G Prins C Prodhon C 2011Computers and Operations Research2011,38,9:1
19Efficientframeworks for greedy split and new depth first searchsplit procedures for routing problems 显示文摘DUHAMEL C LACOMME P PRODHON C 2011Computers andOperations Research2011,38,4:1
20Solving the two-echelon location routing problem by a GRASP reinforced by a learning process and path relinking显示文摘Nguyen V P Prins C Prodhon C 2012European Journal of Operational Research2012,216,1:1
返回顶部 每页显示:
共3页 首页 上一页 第1页 下一页 末页 /3 跳转

网站首页 | 关于我们 | 联系我们 | 产品服务 | 客服中心 | 广告服务 | 版权声明 | 网站联盟 | 友情链接 | 售卡网点

版权所有© 渝B2-20050021-1 渝公网安备 50019002500403号 违法和不良信息举报中心

互联网出版许可证 新出网证(渝)字10号 全国400电话 - 免长途话费