سال انتشار: ۱۳۸۳
محل انتشار: سومین کنفرانس ملی مهندسی صنایع
تعداد صفحات: ۱۴
Reza Zanjirani Farahani – Department of Industrial Engineering, Amirkabir University of Technology, Tehran, Iran. Supply Chain Management Research Center, Tehran, Iran.
Gilbert Laporte – Canada Research Chair in Distribution Management and GERAD, HEC Montréal, 3000 chemin de la Côte- Sainte-Catherine, Montreal, Canada H3T 2A7.
Feasibility of the loop means that the loop should be incident to at least one of the edges of each cell of a block layout. In our formulations we combine one of the recent algorithms used to determine shortest loop and a model that used to find the best location of P/D stations on a given loop. A compact formulation is developed for this problem and a relatively simple algorithm is resented. It is shown that instances containing up to 30 cells can be solved optimally using a commercial integer linear programming solver embedded within an iterative scheme.