지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
이용수
초록· 키워드
오류제보하기
This paper considers an inbound lot-sizing and outbound dispatching problem for a single product in a thirdparty logistics (3PL) distribution center. Demands are dynamic and finite over the discrete time horizon, and moreover, each demand has a delivery time window which is the time interval with the dates between the earliest and the latest delivery dates All the product amounts must be delivered to the customer in the time window.
Ordered products are shipped by multiple vehicle types and the freight cost is proportional to the vehicle-types and the number of vehicles used. First, we formulate a mixed integer programming model. Since it is difficult to solve the model as the size of real problem being very large, we design a conventional genetic algorithm with a local search heuristic (HGA) and an improved genetic algorithm called adaptive genetic algorithm (AGA). AGA spontaneously adjusts crossover and mutation rate depending upon the status of current population. Finally, we conduct some computational experiments to evaluate the performance of AGA with HGA.
Ordered products are shipped by multiple vehicle types and the freight cost is proportional to the vehicle-types and the number of vehicles used. First, we formulate a mixed integer programming model. Since it is difficult to solve the model as the size of real problem being very large, we design a conventional genetic algorithm with a local search heuristic (HGA) and an improved genetic algorithm called adaptive genetic algorithm (AGA). AGA spontaneously adjusts crossover and mutation rate depending upon the status of current population. Finally, we conduct some computational experiments to evaluate the performance of AGA with HGA.
목차
1. 서론
2. 최적화 모형
3. 유전알고리즘(Genetic algorithm)
4. 자율유전알고리즘(Adaptive Genetic Algorithm : AGA)
5. 컴퓨터 실험
6. 결론
참고문헌
참고문헌 (15)
참고문헌 신청
1. [학술지(정기간행물)] - Hwang, H. C / 2007 / An Efficient Procedure for Dynamic Lot-sizing Model with Demand Time Windows / Journal of Global Optimization 37 : 11 ~ 26
2. [학술지(정기간행물)] - Hwang, H. C / 2006 / Dynamic Lot-sizing Model with Demand Time Windows and Speculative Cost Structure / Operations Research Letters 34 : 251 ~ 256
3. [학술지(정기간행물)] - Hwang, H. C / 2008 / Dynamic Lot-sizing Model for Major and Minor Demands / European Journal of Operational Research 184 : 711 ~ 724
4. [학술지(정기간행물)] - Jaruphongsa, W / 2008 / Dynamic lot-sizing problem with demand time windows and container-based transportation / Optimization Letter 2 (1) : 39 ~ 51
5. [학술지(정기간행물)] - Jaruphongsa, W. / 2004 / Warehouse Space Capacity and Delivery Time Window Considerations in Dynamic Lot-sizing for a Simple Supply Chain / International Journal of Production Economics 92 : 169 ~ 180
2. [학술지(정기간행물)] - Hwang, H. C / 2006 / Dynamic Lot-sizing Model with Demand Time Windows and Speculative Cost Structure / Operations Research Letters 34 : 251 ~ 256
3. [학술지(정기간행물)] - Hwang, H. C / 2008 / Dynamic Lot-sizing Model for Major and Minor Demands / European Journal of Operational Research 184 : 711 ~ 724
4. [학술지(정기간행물)] - Jaruphongsa, W / 2008 / Dynamic lot-sizing problem with demand time windows and container-based transportation / Optimization Letter 2 (1) : 39 ~ 51
5. [학술지(정기간행물)] - Jaruphongsa, W. / 2004 / Warehouse Space Capacity and Delivery Time Window Considerations in Dynamic Lot-sizing for a Simple Supply Chain / International Journal of Production Economics 92 : 169 ~ 180
이 논문의 저자 정보
최근 본 자료
댓글(0)
0
UCI(KEPA) : I410-ECN-0101-2013-530-003629421