|
Á¦ ¸ñ |
[RE]¼ö½Ä°ü·Ã ¹®Àǵ帳´Ï´Ù. |
|
ÀÛ¼ºÀÚ |
À̺´±â |
ÀÛ¼ºÀÏ |
2013-08-27 |
Á¶È¸¼ö |
1055 ȸ |
|
÷ºÎÆÄÀÏ |
÷ºÎµÈ ÆÄÀϾøÀ½.
|
|
¾È³çÇϼ¼¿ä. KSTEC À̺´±âÀÔ´Ï´Ù.
1. ¸ñÀû½Ä ¿À·ù
minimize max(i, j in N) ((sum(i, j in N) D[i][j] * x[i][j][1])/v[1]) + ((sum(i, j in N) D[i][j] * x[i][j][2])/v[2]) + ((sum(i, j in N) D[i][j] * x[i][j][3])/v[3]); // (1) ¸ðµç i,j¿¡ ´ëÇÏ¿© D[i][j]*x[i][j] °ªÀ» ÀÌ¹Ì ÇÕÇÑ »óÅÂÀÔ´Ï´Ù. (¸ðµç ¹è¿¡ ´ëÇÑ À̵¿°Å¸®ÀÇ ÇÕ) i, j¿¡ ÇØ´çÇÏ´Â °ªÁß¿¡¼ max°ªÀ» ãÀ» ¼ö ¾ø´Â »óÅÂÀ̱⠶§¹®¿¡, À§ ±¸¹®¿¡¼´Â max°¡ Àǹ̾ø½À´Ï´Ù.
i,j´Â ³ëµå(Àüü set : N), s´Â ¹è(Àüü set : S)¸¦ ³ªÅ¸³»´Â index¶ó¸é
minimize max(s in S) ((sum(i, j in N) D[i][j] * x[i][j][s])/v[s]) ;
·Î Ç¥ÇöÇÏ¿©¾ß °¢ ¹èµéÀÇ ÃÑ À̵¿°Å¸® Áß ÃÖ´ë°ªÀ» ÃÖ¼ÒÈ ÇÏ´Â ÇüŰ¡ µË´Ï´Ù. À§ µÎ ¼ö½Ä¿¡ ´ëÇÏ¿© Á÷Á¢ °è»êÇØ º¸½Ã¸é ¸íÈ®ÇØ Áú °ÍÀÔ´Ï´Ù. Á¤È®ÇÑ ¸ñÀû½ÄÀÇ ÀÇ¹Ì¿Í Ç¥Çö¹ýÀ» È®ÀÎÇØ º¸½Ã±â ¹Ù¶ø´Ï´Ù.
2. Á¦¾à½Ä ¿À·ù
// subtour elimination constraints forall(i,j in N_I, s in S) pi[i]-pi[j] + T*(sum(s in S) x[i][j][s]) <= T-1; // (7)
index »ç¿ë¿¡ ¿À·ù°¡ ÀÖ½À´Ï´Ù. forall(i,j in N_I, s in S) ¿¡¼ °¢ i, j, s ¿¡ ´ëÇÑ Á¦¾à½ÄÀ» ¼±¾ðÇϴµ¥, ½ÇÁ¦ Á¦¾à½Ä¿¡¼´Â sum(s in S) x[i][j][s] ·Î s¿¡ ´ëÇÑ ¸ðµç ÇÕÀ» ÇÏ¿©, ´õÀÌ»ó s index °ªÀÌ Á¸ÀçÇÏÁö ¾Ê´Â »óÅÂÀÔ´Ï´Ù.
µÎ °÷ Áß ÇѰ÷¿¡¼ s index¸¦ »ç¿ëÇÏÁö ¾Ê¾Æ¾ß ÇÕ´Ï´Ù. Á¤È®ÇÑ Á¦¾à½ÄÀÇ Àǹ̸¦ È®ÀÎÇØ º¸¼Å¾ß ÇÕ´Ï´Ù.
ÀÌ»óÀÔ´Ï´Ù. °¨»çÇÕ´Ï´Ù. |
|
|
|