지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
이용수
초록· 키워드
오류제보하기
This paper deals with a coal supply planning problem for power plants. We propose a mathematical optimization model to make decisions for coal pile sections, movement of reclaimers, and operation time of conveyor belts.
The objective of the proposed model is to minimize the total operation time of conveyor belts and total movement time of reclaimers. The algorithm firstly selects a pile section by considering both the location of reclaimers and the stock amount on that pile section. And then the shortest path from the selected pile section has to be put into the operation schedule and check whether the total operation time is satisfied. Then finally the new schedule is updated. To this end, we have tested the proposed algorithm comparing with the general standard optimization package for the simplified problem SCSPP. From the numerous test runs for comparing with the existing coal supply scheduling methods, We see that the proposed model may improve the coal supply operation by reducing significant coal supply costs.
The objective of the proposed model is to minimize the total operation time of conveyor belts and total movement time of reclaimers. The algorithm firstly selects a pile section by considering both the location of reclaimers and the stock amount on that pile section. And then the shortest path from the selected pile section has to be put into the operation schedule and check whether the total operation time is satisfied. Then finally the new schedule is updated. To this end, we have tested the proposed algorithm comparing with the general standard optimization package for the simplified problem SCSPP. From the numerous test runs for comparing with the existing coal supply scheduling methods, We see that the proposed model may improve the coal supply operation by reducing significant coal supply costs.
목차
1. 서론
2. 기존연구
3. 수리모델
4. 제안 알고리즘
5. 실험 결과
6. 결론 및 추후 연구과제
참고문헌
<부록 1> SCSPP와 CSPP의 유형별 CPLEX와의 성능 비교 실험결과
참고문헌 (12)
참고문헌 신청
1. [학술지(정기간행물)] - Gorman, M. F / 1998 / An applacation of genetic and tabu searches to the freight railroad operating plan problem / Annals of Operations Research 78 : 51 ~ 69
2. [학술지(정기간행물)] - Jang, S. Y / 2006 / An optimization model for scheduling unloading operations at an integrated steel mill / KORMS 1 : 273 ~ 276
3. [학술지(정기간행물)] - Kim, K. H / 2003 / Berth scheduling by simulated annealing / Transportation Research part B (37) : 541 ~ 560
4. [학술지(정기간행물)] - Kim, K. H / 2004 / A crane scheduling method for port container terminals / European journal og Operational Research 156 : 752 ~ 768
5. [학술지(정기간행물)] - Kozan, E / 1999 / Genetic algorithms to schedule container transfers at multimodal terminals / International Tranactions in Operational Research 6 : 311 ~ 329
2. [학술지(정기간행물)] - Jang, S. Y / 2006 / An optimization model for scheduling unloading operations at an integrated steel mill / KORMS 1 : 273 ~ 276
3. [학술지(정기간행물)] - Kim, K. H / 2003 / Berth scheduling by simulated annealing / Transportation Research part B (37) : 541 ~ 560
4. [학술지(정기간행물)] - Kim, K. H / 2004 / A crane scheduling method for port container terminals / European journal og Operational Research 156 : 752 ~ 768
5. [학술지(정기간행물)] - Kozan, E / 1999 / Genetic algorithms to schedule container transfers at multimodal terminals / International Tranactions in Operational Research 6 : 311 ~ 329
이 논문의 저자 정보
이 논문과 함께 이용한 논문
휴리스틱 외판원 문제 알고리즘을 이용한 노천광산 보조 작업 차량의 최적 이동경로 분석
박보영
,
최요순
,
박한수
터널과 지하공간
2014
.02
Job Shop 환경에서 Shifting Bottleneck Heuristic을 이용한 동적일정계획에 관한 연구
현준재
,
김주일
,
이영훈
한국 SCM 학회지
2003
.12
라그랑쥐 쌍대 발견적 알고리듬을 이용한 동시 배송 수거 환경의 차량경로결정에 관한 연구
최경현
,
곽호만
,
이양호
한국 SCM 학회지
2006
.06
조선소에서 블록 운반을 위한 트랜스포터의 적정대수 결정 및 일정계획
주철민
한국 SCM 학회지
2013
.10
가전제품 배송과 설치 서비스의 이원화를 위한 배송 스케줄링 설계 및 분석
심인수
,
김태호
,
차주일
외 1명
한국 SCM 학회지
2011
.10
최근 본 자료
댓글(0)
0
UCI(KEPA) : I410-ECN-0101-2013-530-003636842