Browse > Article
http://dx.doi.org/10.7232/JKIIE.2015.41.3.233

Genetic Algorithms for a Multi-product Dynamic Lot-sizing and Dispatching Problem with Delivery Time Windows and Multi-vehicle Types  

Kim, Byung Soo (Department of Industrial and Management Engineering, Incheon University)
Chae, Syungkyu (Department of Systems Management and Engineering, Graduate School, Pukyong National University)
Lee, Woon-Seek (Division of Systems and Management and Engineering, Pukyong National University)
Publication Information
Journal of Korean Institute of Industrial Engineers / v.41, no.3, 2015 , pp. 233-242 More about this Journal
Abstract
This paper analyzes a multi-product inbound lot-sizing and outbound dispatching problem with multi-vehicle types in a third-party logistics distribution center. The product must be delivered to the customers within the delivery time window and backlogging is not allowed. Replenishing orders are shipped by several types of vehicles with two types of the freight costs, i.e., uniform and decreasing, are considered. The objective of this study is to determine the lot-size and dispatching schedules to minimize the total cost with the sum of inbound and outbound transportation and inventory costs over the entire time horizon. In this study, we mathematically derive a mixed-integer programming model and propose a genetic algorithm (GA1) based on a local search heuristic algorithm to solve large-scale problems. In addition, we suggest a new genetic algorithm (GA2) with an adjusting algorithm to improve the performance of GA1. The basic mechanism of the GA2 is to provide an unidirectional partial move of products to available containers in the previous period. Finally, we analyze the results of GA1 and GA2 by evaluate the relative performance using the gap between the objective values of CPLEX and the each algorithm.
Keywords
Delivery time windows; Dynamic lot-sizing; Multi-product; Multi-vehicle types; Dispatching; Genetic algorithms; Local search heuristic;
Citations & Related Records
Times Cited By KSCI : 2  (Citation Analysis)
연도 인용수 순위
1 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.   DOI
2 Hwang, H. C. (2007), An Efficient Procedure for Dynamic Lot-Sizing Model with Demand Time Windows, Journal of Global Optimization, 37, 11-26.
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.   DOI
4 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.   DOI
5 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.
6 Kim, B. S. and Lee, W. S. (2011), An Adaptive Genetic Algorithm for a Dynamic Lot-sizing and Dispatching Problem with Multiple Vehicle Types and Delivery Time Windows, Journal of the Korean Institute of Industrial Engineers, 37(4), 331-341.   DOI   ScienceOn
7 Kim, B. S., Lee, W. S., and Koh, S. G. (2012), A genetic algorithm for dynamic inbound ordering and outbound dispatching problem with delivery time windows, Engineering Optimization, 44(7), 859-874.   DOI
8 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.   DOI
9 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.
10 Seo, W. C. and Lee, W. S. (2014), A Dynamic Lot-sizing and Outbound Dispatching Problem with Delivery Time Windows and Heterogeneous Container Types, Journal of the Korean Institute of Industrial Engineers, 40(4), 435-441.   DOI