RISS 학술연구정보서비스

검색
다국어 입력

http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.

변환된 중국어를 복사하여 사용하시면 됩니다.

예시)
  • 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
  • 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
닫기
    인기검색어 순위 펼치기

    RISS 인기검색어

      검색결과 좁혀 보기

      선택해제

      오늘 본 자료

      • 오늘 본 자료가 없습니다.
      더보기
      • 무료
      • 기관 내 무료
      • 유료
      • KCI등재

        Harmony Search Algorithm for Continuous Network Design Problem with Link Capacity Expansions

        Ozgur Baskan 대한토목학회 2014 KSCE JOURNAL OF CIVIL ENGINEERING Vol.18 No.1

        The Continuous Network Design Problem (CNDP) deals with determining the set of link capacity expansions and the corresponding equilibrium link flows which minimizes the system performance index defined as the sum of total travel times and investment costs of link capacity expansions. In general, the CNDP is characterized by a bilevel programming model, in which the upper level problem is generally to minimize the total system cost under limited expenditure, while at the lower level problem, the User Equilibrium (UE)link flows are determined by Wardrop’s first principle. It is well known that bilevel model is nonconvex and algorithms for finding global or near global optimum solutions are preferable to be used in solving it. Furthermore, the computation time is tremendous for solving the CNDP because the algorithms implemented on real sized networks require solving traffic assignment model many times. Therefore, an efficient algorithm, which is capable of finding the global or near global optimum solution of the CNDP with less number of traffic assignments, is still needed. In this study, the Harmony Search (HS) algorithm is used to solve the upper level objective function and numerical calculations are performed on eighteen link and Sioux Falls networks. The lower level problem is formulated as user equilibrium traffic assignment model and Frank-Wolfe method is used to solve it. It has been observed that the HS algorithm is more effective than many other compared algorithms on both example networks to solve the CNDP in terms of the objective function value and UE traffic assignment number.

      • SCIEKCI등재

        Imipenem - Cilastatin versus Sulbactam - Cefoperazone plus Amikacin in the Initial Treatment of Febrile Neutropenic Cancer Patients

        (Ozgur Ozyilkan),(Ulku Yalcintas),(Sezgin Baskan) 대한내과학회 1999 The Korean Journal of Internal Medicine Vol.14 No.2

        N/A The treatment of infectious complications in cancer patients has evolved as a consequence of the developments in the chemotherapy of cancer patients. In this prospective, randomized study, we compared imipenem-cilastatin and sulbactam- cefoperazone with amikacin in the empiric therapy of febrile neutropenic (<1000/mm3) patients with liquids and solid tumours. Of 30 evaluable episodes, 15 were treated with imipenem-cilastatin and 15 were treated with sulbactam- cefoperazone plus amikacin. 73% of episodes were culture-positive; gram-positive pathogens accounted for 62% of the isolates. Bacteremia was the most frequent site of infection. The initial clinical response rate for both regimens was 60% (p>0.05). No major adverse effects occurred. This study demonstrated that imipenem-cilastatin monotherapy and combination therapy of sulbactam-cefoperazone plus amikacin were equally effective empiric therapy for febrile granulocytopenic cancer patients.

      연관 검색어 추천

      이 검색어로 많이 본 자료

      활용도 높은 자료

      해외이동버튼