首页 | 本学科首页   官方微博 | 高级检索  
     


A Tabu search algorithm for the network pricing problem
Authors:L Brotcorne  F Cirinei  P Marcotte  G Savard
Affiliation:1. INRIA Lille Nord Europe, Parc Scientifique de la Haute Borne, 40 Avenue Halley, Bat A Park Plaza, 59650 Villeneuve D''Ascq, France;2. Expretio, 200 Laurier Street West, Suite 400, Montréal, QC, Canada H2T 2N8;3. CIRRELT, Département d''Informatique et de Recherche Opérationnelle, Université de Montréal C.P. 6128, Succursale Centre-Ville, Montréal, QC, Canada H3C 3J7;4. GERAD, Département de Mathématiques et de Génie Industriel, Ecole Polytechnique de Montréal C.P. 6079, Succursale Centre-Ville, Montréal, QC, Canada H3C 3A7
Abstract:In this paper, we propose an efficient Tabu Search procedure for solving the NP-hard network pricing problem. By exploiting the problem's features, the algorithm allows the near-optimal solution of problem instances that are out of reach of exact combinatorial methods.
Keywords:Tabu Search  Pricing problem on network  Combinatorial optimization
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号