# American Institute of Mathematical Sciences

January  2008, 4(1): 53-66. doi: 10.3934/jimo.2008.4.53

## A mixed simulated annealing-genetic algorithm approach to the multi-buyer multi-item joint replenishment problem: advantages of meta-heuristics

 1 Diocesan Girls' School, Kowloon, Hong Kong, China 2 Department of Applied Mathematics, The Hong Kong Polytechnic University, Hong Kong, China 3 Graduate School of Management, Kent State University, Kent, OH 44244, United States

Received  August 2006 Revised  December 2006 Published  January 2008

The Joint Replenishment Problem (JRP) is a multi-item inventory problem. The objective is to develop inventory policies that minimize total cost (comprised of holding and setup costs) over the planning horizon. In this paper we consider the extension of this problem to the multi-buyer, multi-item version of the JRP. We propose and test a mixed simulated annealing-genetic algorithm (SAGA) for the extended problem. Tests are conducted on problems from a leading bank in Hong Kong. Results are also compared to a pure GA approach and several interesting observations are made on the value of such meta-heuristics.
Citation: T. W. Leung, Chi Kin Chan, Marvin D. Troutt. A mixed simulated annealing-genetic algorithm approach to the multi-buyer multi-item joint replenishment problem: advantages of meta-heuristics. Journal of Industrial & Management Optimization, 2008, 4 (1) : 53-66. doi: 10.3934/jimo.2008.4.53
 [1] Ming-Jong Yao, Tien-Cheng Hsu. An efficient search algorithm for obtaining the optimal replenishment strategies in multi-stage just-in-time supply chain systems. Journal of Industrial & Management Optimization, 2009, 5 (1) : 11-32. doi: 10.3934/jimo.2009.5.11 [2] Jiao-Yan Li, Xiao Hu, Zhong Wan. An integrated bi-objective optimization model and improved genetic algorithm for vehicle routing problems with temporal and spatial constraints. Journal of Industrial & Management Optimization, 2017, 13 (5) : 1-18. doi: 10.3934/jimo.2018200 [3] Ming-Jong Yao, Yu-Chun Wang. Theoretical analysis and a search procedure for the joint replenishment problem with deteriorating products. Journal of Industrial & Management Optimization, 2005, 1 (3) : 359-375. doi: 10.3934/jimo.2005.1.359 [4] Mostafa Abouei Ardakan, A. Kourank Beheshti, S. Hamid Mirmohammadi, Hamed Davari Ardakani. A hybrid meta-heuristic algorithm to minimize the number of tardy jobs in a dynamic two-machine flow shop problem. Numerical Algebra, Control & Optimization, 2017, 7 (4) : 465-480. doi: 10.3934/naco.2017029 [5] Yaw Chang, Lin Chen. Solve the vehicle routing problem with time windows via a genetic algorithm. Conference Publications, 2007, 2007 (Special) : 240-249. doi: 10.3934/proc.2007.2007.240 [6] Didem Cinar, José António Oliveira, Y. Ilker Topcu, Panos M. Pardalos. A priority-based genetic algorithm for a flexible job shop scheduling problem. Journal of Industrial & Management Optimization, 2016, 12 (4) : 1391-1415. doi: 10.3934/jimo.2016.12.1391 [7] Abdel-Rahman Hedar, Alaa Fahim. Filter-based genetic algorithm for mixed variable programming. Numerical Algebra, Control & Optimization, 2011, 1 (1) : 99-116. doi: 10.3934/naco.2011.1.99 [8] Maryam Ghoreishi, Abolfazl Mirzazadeh, Gerhard-Wilhelm Weber, Isa Nakhai-Kamalabadi. Joint pricing and replenishment decisions for non-instantaneous deteriorating items with partial backlogging, inflation- and selling price-dependent demand and customer returns. Journal of Industrial & Management Optimization, 2015, 11 (3) : 933-949. doi: 10.3934/jimo.2015.11.933 [9] Behrouz Kheirfam, Morteza Moslemi. On the extension of an arc-search interior-point algorithm for semidefinite optimization. Numerical Algebra, Control & Optimization, 2018, 8 (2) : 261-275. doi: 10.3934/naco.2018015 [10] Po-Chung Yang, Hui-Ming Wee, Shen-Lian Chung, Yong-Yan Huang. Pricing and replenishment strategy for a multi-market deteriorating product with time-varying and price-sensitive demand. Journal of Industrial & Management Optimization, 2013, 9 (4) : 769-787. doi: 10.3934/jimo.2013.9.769 [11] Ping-Chen Lin. Portfolio optimization and risk measurement based on non-dominated sorting genetic algorithm. Journal of Industrial & Management Optimization, 2012, 8 (3) : 549-564. doi: 10.3934/jimo.2012.8.549 [12] Abdel-Rahman Hedar, Ahmed Fouad Ali, Taysir Hassan Abdel-Hamid. Genetic algorithm and Tabu search based methods for molecular 3D-structure prediction. Numerical Algebra, Control & Optimization, 2011, 1 (1) : 191-209. doi: 10.3934/naco.2011.1.191 [13] Qiang Long, Changzhi Wu. A hybrid method combining genetic algorithm and Hooke-Jeeves method for constrained global optimization. Journal of Industrial & Management Optimization, 2014, 10 (4) : 1279-1296. doi: 10.3934/jimo.2014.10.1279 [14] Marcin Studniarski. Finding all minimal elements of a finite partially ordered set by genetic algorithm with a prescribed probability. Numerical Algebra, Control & Optimization, 2011, 1 (3) : 389-398. doi: 10.3934/naco.2011.1.389 [15] Xuewen Huang, Xiaotong Zhang, Sardar M. N. Islam, Carlos A. Vega-Mejía. An enhanced Genetic Algorithm with an innovative encoding strategy for flexible job-shop scheduling with operation and processing flexibility. Journal of Industrial & Management Optimization, 2017, 13 (5) : 1-27. doi: 10.3934/jimo.2019088 [16] Adriel Cheng, Cheng-Chew Lim. Optimizing system-on-chip verifications with multi-objective genetic evolutionary algorithms. Journal of Industrial & Management Optimization, 2014, 10 (2) : 383-396. doi: 10.3934/jimo.2014.10.383 [17] Van Hieu Dang. An extension of hybrid method without extrapolation step to equilibrium problems. Journal of Industrial & Management Optimization, 2017, 13 (4) : 1723-1741. doi: 10.3934/jimo.2017015 [18] Qingxu Dou, Jesús Cuevas, J. C. Eilbeck, Francis Michael Russell. Breathers and kinks in a simulated crystal experiment. Discrete & Continuous Dynamical Systems - S, 2011, 4 (5) : 1107-1118. doi: 10.3934/dcdss.2011.4.1107 [19] Min Sha. Heuristics of the Cocks-Pinch method. Advances in Mathematics of Communications, 2014, 8 (1) : 103-118. doi: 10.3934/amc.2014.8.103 [20] Alexander Zeh, Antonia Wachter. Fast multi-sequence shift-register synthesis with the Euclidean algorithm. Advances in Mathematics of Communications, 2011, 5 (4) : 667-680. doi: 10.3934/amc.2011.5.667

2018 Impact Factor: 1.025

## Metrics

• PDF downloads (7)
• HTML views (0)
• Cited by (1)

## Other articlesby authors

• on AIMS
• on Google Scholar

[Back to Top]