جلد 23، شماره 2 - ( 3-1391 )
جلد 23 شماره 2 صفحات 100-91 |
برگشت به فهرست نسخه ها
Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
A Simulated Annealing Algorithm for Unsplittable Capacitated Network Design. IJIEPR 2012; 23 (2) :91-100
URL: http://ijiepr.iust.ac.ir/article-1-441-fa.html
URL: http://ijiepr.iust.ac.ir/article-1-441-fa.html
Yaghini Masoud، Akhavan Mohammad Rahim. A Simulated Annealing Algorithm for Unsplittable Capacitated Network Design. نشریه بین المللی مهندسی صنایع و تحقیقات تولید. 1391; 23 (2) :91-100
1- School of Railway Engineering, Iran University of Science and Technology ، yaghini@iust.ac.ir
2- Department of Railway Transportation Engineering, Kermanshah University of Science and Technology
2- Department of Railway Transportation Engineering, Kermanshah University of Science and Technology
چکیده: (8352 مشاهده)
The Network Design Problem (NDP) is one of the important problems in combinatorial optimization. Among the network design problems, the Multicommodity Capacitated Network Design (MCND) problem has numerous applications in transportation, logistics, telecommunication, and production systems. The MCND problems with splittable flow variables are NP-hard, which means they require exponential time to be solved in optimality. With binary flow variables or unsplittable MCND, the complexity of the problem is increased significantly. With growing complexity and scale of real world capacitated network design applications, metaheuristics must be developed to solve these problems. This paper presents a simulated annealing approach with innovative representation and neighborhood structure for unsplittable MCND problem. The parameters of the proposed algorithms are tuned using Design of Experiments (DOE) method and the Design-Expert statistical software. The performance of the proposed algorithm is evaluated by solving instances with different dimensions from OR-Library. The results of the proposed algorithm are compared with the solutions of CPLEX solver. The results show that the proposed SA can find near optimal solution in much less time than exact algorithm.
ارسال پیام به نویسنده مسئول
| بازنشر اطلاعات | |
 | این مقاله تحت شرایط Creative Commons Attribution-NonCommercial 4.0 International License قابل بازنشر است. |
