An Efficient Genetic Algorithm for Solving the Order Allocation Problem

Abstract:

This paper aims to solve an order allocation problem in supply chain management (SCM). In this problem, the price fluctuation over consecutive time periods is known beforehand. Based on that assumption, clients can arrange their orders in advance to minimize the costs incurred in SCM, e.g., purchasing cost or inventory holding host. However, order allocations are subject to demand volumes, time-varying costs, suppliers’ capacities, inventory levels, and inventory costs, etc. It is difficult to make a correct decision immediately. With so many factors affecting the decision-making, traditional methods (e.g., dynamic programming) is very time-consuming. Therefore, a genetic algorithm cooperated with a local search is proposed. The experimental results show that the problem can be solved efficiently and near optimally.

• Periodical: Advanced Materials Research (Volumes 433-440)
• Pages: 3939-3943
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.433-440.3939
• Online since: January 2012
• Authors: Jen Ya Wang, Ching Mei Cheng, Sheng Chung Tu
• Keywords: Decision-Making, Dynamic Programming, Genetic Algorithm (GA), Order Allocation

References

[1] M. Benisch, A. Sardinha, J. Andrews, R. Ravichandran, and N. Sadeh, CMieux: Adaptive Strategies for Competitive Supply Chain Trading, Electronic Commerce Research and Applications, Vol. 8, (2009), p.78.

DOI: 10.1016/j.elerap.2008.09.005

[2] C. Kiekintveld, J. Miller, P.R. Jordan, L.F. Callender, and M.P. Wellman, Forecasting Market Prices in a Supply Chain Game, Electronic Commerce Research and Applications, Vol. 8, (2009), p.63.

DOI: 10.1016/j.elerap.2008.11.005

[3] A. Sardinha, M. Benisch, N. Sadeh, R. Ravichandran, V. Podobnik, and M. Stan, The 2007 Procurement Challenge: A Competition to Evaluate Mixed Procurement Strategies, Electronic Commerce Research and Applications, Vol. 8, (2009), p.106.

DOI: 10.1016/j.elerap.2008.09.002

[4] R. Oliver and M. Webber, Supply Chain Management: Logistics Catches Up with Strategy, Outlook, Vol. 5, (1982), p.42.

[5] S.H. Ghodsypour and C.O. O'Brien, A Decision Support System for Supplier Selection Using an Integrated Analytic Hierarchy Process and Linear Programming, International Journal of Production Economics, Vol. 56, (1998).

DOI: 10.1016/s0925-5273(97)00009-1

[6] S.H. Ghodsypour and C.O. O'Brien, The Total Cost of Logistics in Supplier Selection, under Conditions of Multiple Sourcing, Multiple Criteria and Capacity Constraint, International Journal of Production Economics, Vol. 73, (2001).

DOI: 10.1016/s0925-5273(01)00093-7

[7] W.C. Benton, Quantity Discount Decision Under Conditions of Multiple Items, International Journal of Production Research, Vol. 10, (1991).

[8] B. Alidaee and G.A. Kochenberger, A Note on a Simple Dynamic Programming Approach to the Single-Sink, Fixed-Charge Transportation Problem, Transportation Science, Vol. 39, (2005).

DOI: 10.1287/trsc.1030.0055

[9] F. Mafakheri, M. Breton, and A. Ghoniem, Supplier Selection-Orderallocation: A Two-Stage Multiple Criteria Dynamic Programming Approach, International Journal of Production Economics, Vol. 132, (2011), p.52.

DOI: 10.1016/j.ijpe.2011.03.005

[10] F.C. Yang, K. Chen, M.T. Wang, P.Y. Chang, and K.C. Sun, Mathematical Modeling of Multi-Plant Order Allocation Problem and Solving by Genetic Algorithm with Matrix Representation, The International Journal of Advanced Manufacturing Technology, Vol. 51, (2010).

DOI: 10.1007/s00170-010-2696-1

[11] J.Y. Wang, T.P. Chang, and J.S. Chen, An Enhanced Genetic Algorithm for Bi-Objective Pump Scheduling in Water Supply, Expert System with Applications, Vol. 36, (2009), p.3772.

DOI: 10.1016/j.eswa.2009.01.054