Journal of Korean Institute of Industrial Engineers (대한산업공학회지)

Korean Institute of Industrial Engineers (대한산업공학회)
권호 표지
DOI QR코드

DOI QR Code

An Adaptive Genetic Algorithm for a Dynamic Lot-sizing and Dispatching Problem with Multiple Vehicle Types and Delivery Time Windows

다종의 차량과 납품시간창을 고려한 동적 로트크기 결정 및 디스패칭 문제를 위한 자율유전알고리즘

  • Kim, Byung-Soo (Graduate School of Management of Technology, Pukyong National University) ;
  • Lee, Woon-Seek (Department of Systems Management and Engineering, Pukyong National University)
  • 김병수 (부경대학교 일반대학원 기술경영(MOT) 협동과정) ;
  • 이운식 (부경대학교 시스템경영공학과)
  • Received : 2011.09.10
  • Accepted : 2011.11.10
  • Published : 2011.12.01
Download PDF
⟨ Previous Next ⟩

Abstract

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.

Keywords

References

  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. and Jaruphongsa, W. (2006), Dynamic Lot-sizing Model with Demand Time Windows and Speculative Cost Structure, Operations Research Letters, 34, 251-256. https://doi.org/10.1016/j.orl.2005.05.014
  3. Hwang, H. C. and Jaruphongsa, W. (2008), Dynamic Lot-sizing Model for Major and Minor Demands, European Journal of Operational Research, 184, 711-724 https://doi.org/10.1016/j.ejor.2006.11.017
  4. Jaruphongsa, W. and Lee, C. Y. (2008), Dynamic lot-sizing problem with demand time windows and container-based transportation, Optimization Letter, 2(1), 39-51.
  5. Jaruphongsa, W., Cetinkaya, S., and Lee, C. H. (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. https://doi.org/10.1016/j.ijpe.2003.10.012
  6. Jaruphongsa, W., Cetinkaya, S., and Lee, C. Y. (2005), A Dynamic Lot-sizing Model with Multi-Mode Replenishments : Polynomial Algorithms for Special Cases with Dual and Multiple Modes, IIE Transactions, 37, 453-467. https://doi.org/10.1080/07408170590918218
  7. Kim, B. S. and Lee, W. S. (2010), A Genetic Algorithm for a Dynamic Lot-Sizing Problem with Delivery Time Windows, Journal of the Korean Production and Operations Management Society, 21(4), 383-398.
  8. Lee, C. Y. (1989), A Solution to The Multiple Set-Up Problem with Dynamic Demand, IIE Transactions, 21(3), 266-270. https://doi.org/10.1080/07408178908966231
  9. Lee, C. Y., Cetinkaya, S., and Jaruphongsa, W. (2003a), A Dynamic Model for Inventory Lot Sizing and Outbound Shipment Scheduling at a Third-Party Warehouse, Operations Research, 51, 735- 747. https://doi.org/10.1287/opre.51.5.735.16752
  10. Lee, C. Y., Cetinkaya, S., and Wagelmans, A. P. M. (2001), A Dynamic Lot-sizing Model with Demand Time Windows, Management Science, 47, 1384-1395. https://doi.org/10.1287/mnsc.47.10.1384
  11. Lee, W. S. (1998), A Dynamic Production and Transportation Model with Multiple Freight Container Types, Journal of the Korean Institute of Industrial Engineers, 24(1), 157-165.
  12. Lee, W. S. (2010), A Dynamic Ordering, Shipping, and Outbound Dispatching Problem with Delivery Time Windows, Journal of the Korean Management Engineering Society, 15(3), 15-23.
  13. Lee, W. S., Kim, C. H., and Sox, C. R. (2003b), A Dynamic Production and Transportation Model with Heterogeneous Vehicle Types, International Journal of Industrial Engineering, 10, 420-426.
  14. Topal, A., Cetinkaya, S. and Lee, C. Y. (2003), The Buyer-Vendor Coordination Problems: Modeling Inbound and Outbound Cargo Costs, IIE Transactions on Logistics and Scheduling, 35(10), 987- 1002.
  15. Wagner, H. M. and Whitin, T. M. (1958), Dynamic Version of the Economic Lot Size Model, Management Science, 5(1), 89-96.

Cited by

  1. A Dynamic Lot-Sizing and Outbound Dispatching Problem with Delivery Time Windows and Heterogeneous Container Types vol.40, pp.4, 2014, https://doi.org/10.7232/JKIIE.2014.40.4.435