Conclusion and Future Work

Một phần của tài liệu computational optimization, methods and algorithms koziel yang 2011 06 17 Cấu trúc dữ liệu và giải thuật (Trang 132 - 137)

The Simulation Optimization approach is applicable to very general multi-location inventory systems. The concept presented in this chapter iteratively combines a sim- ulator with Particle Swarm Optimization. This concept allows the investigation of complex models with few assumptions and is theoretically not limited to a loca- tion count contrary to analytical approaches. Due to the complexity of the model, it is difficult to understand the effect of certain policies. Therefore, valuable insights regarding the dynamics of the system are obtained through simulation in addition to the optimal parameter set. However, applying global optimization to complex models still involves a certain risk to end in a local optimum. That risk is confined by extending the simulation time and the optimization cycle count. The optimum

depends on the model specification and shows a specific structure. The development of such a structure is one of the most intriguing aspects, and the question arises, what conditions have a promoting effect.

As aforementioned an advantage of the Simulation Optimization of multi-location inventory systems with lateral transshipments is that the model itself is straightfor- ward extendable. Functional extensions are, e.g., policies for periodic orders, trans- shipment orders and product offers. Extending the parameter set itself, the capacity of the locations can be optimized by introducing estate and energy cost for unused storage. Thus, not only the flows of transshipments are optimized, but also the al- location of capacities. In addition to static aspects of the model, the parameter set may be extended by dynamic properties such as the location-specific order period time. Besides these extensions there is an idea regarding orders from more than one location at a time. Under specific circumstances one location evolves as a supplier, ordering and redistributing product units. Therefore, the basic idea is to release an order by several locations and to solve the Traveling Salesman Problem with mini- mal cost. However, the existing heuristics already seem to approximate such a trans- portation logic well, and thus, the inclusion of more elaborate policies is expected just to increase complexity. Further research may also concentrate on characteristics favoring demand forecast and promoting certain flows through a location network leading to a structure.

Acknowledgment.The authors would like to thank the Robert Bosch doctoral program, the German Academic Exchange Service and the Foundation of the German Business for fund- ing their research.

References

[1] Arnold, J., Kochel, P., Uhlig, H.: With Parallel Evolution towards the Optimal Order Policy of a Multi-Location Inventory with Lateral Transshipments. In: Papachristos, S., Ganas, I. (eds.) Research Papers of the 3rd ISIR Summer School, pp. 1–14 (1997) [2] Belgasmi, N., Sa¨ıd, L.B., Gh´edira, K.: Evolutionary Multiobjective Optimization of the

ulti-Location Transshipment Problem. Operational Research 8(2), 167–183 (2008) [3] Chiou, C.-C.: Transshipment Problems in Supply Chain Systems: Review and Exten-

sions. Supply Chain, Theory and Applications, 558–579 (2008) [4] Clerc, M.: Standard PSO (2007),

http://www.particleswarm.info/Programs.htmlOnline: accessed July 31, 2010

[5] Clerc, M., Kennedy, J.: The Particle Swarm – Explosion, Stability, and Convergence in a Multidimensional Complex Space. IEEE Transactions on Evolutionary Computa- tion 6(1), 58–73 (2002)

[6] Dye, C.-Y., Hsieh, T.-P.: A Particle Swarm Optimization for Solving Joint Pricing and Lot-Sizing Problem with Fluctuating Demand and Unit Purchasing Cost. Computers &

Mathematics with Applications 60, 1895–1907 (2010)

[7] Evers, P.T.: Heuristics for Assessing Emergency Transshipments. European Journal of Operational Research 129, 311–316 (2001)

[8] Fu, M.C., Healy, K.J.: Techniques for Optimization via Simulation: An Experimental Study on an (s;S) Inventory System. IIE Transactions 29, 191–199 (1997)

[9] Fu, M.C., Glover, F.W., April, J.: Simulation Optimization: A Review, New Develop- ments and Applications. In: Kuhl, M.E., Steiger, N.M., Armstrong, F.P., Joines, J.A.

(eds.) Proceedings of the 2005 Winter Simulation Conference, pp. 83–95 (2005) [10] Gong, Y., Y¨ucesan, E.: Stochastic Optimization for Transshipment Problems with Posi-

tive Replenishment Lead Times. International Journal of Production Economics (2010) (in Press, Corrected Proof)

[11] Guariso, G., Hitz, M., Werthner, H.: An Integrated Simulation and Optimization Mod- elling Environment for Decision Support. Decision Support Systems 16(2), 103–117 (1996)

[12] Herer, Y.T., Tzur, M., Y¨ucesan, E.: The Multilocation Transshipment Problem. IIE Transactions 38, 185–200 (2006)

[13] Hochmuth, C.A.: Design and Implementation of a Software Tool for Simulation Op- timization of Multi-Location Inventory Systems with Transshipments. Master’s thesis, Chemnitz University of Technology, In German (2008)

[14] Hochmuth, C.A., L´assig, J., Thiem, S.: Simulation-Based Evolutionary Optimization of Complex Multi-Location Inventory Models. In: 3rd IEEE International Conference on Computer Science and Information Technology (ICCSIT), vol. 5, pp. 703–708 (2010) [15] Iassinovski, S., Artiba, A., Bachelet, V., Riane, F.: Integration of Simulation and Op-

timization for Solving Complex Decision Making Problems. International Journal of Production Economics 85(1), 3–10 (2003)

[16] K¨ampf, M., K¨ochel, P.: Simulation-Based Sequencing and Lot Size Optimisation for a Production-and-Inventory System with Multiple Items. International Journal of Produc- tion Economics 104, 191–200 (2006)

[17] Kennedy, J., Eberhart, R.: Particle Swarm Optimization. In: Proceedings of IEEE Inter- national Conference on Neural Networks, vol. 4, pp. 1942–1948 (1995)

[18] K¨ochel, P.: About the Optimal Inventory Control in a System of Locations: An Approxi- mate Solution. Mathematische Operationsforschung und Statistik, Serie Optimisation 8, 105–118 (1977)

[19] K¨ochel, P.: A Survey on Multi-Location Inventory Models with Lateral Transship- ments. In: Papachristos, S., Ganas, I. (eds.) Inventory Modelling in Production and Supply Chains, Research Papers of the 3rd ISIR Summer School, Ioannina, Greece, pp. 183–207 (1998)

[20] K¨ochel, P.: Simulation Optimisation: Approaches, Examples, and Experiences. Tech- nical Report CSR-09-03, Department of Computer Science, Chemnitz University of Technology (2009)

[21] Kochel, P., Arnold, J.: Evolutionary Algorithms for the Optimization of Multi-Location Systems with Transport. In: Simulationstechnik, Proceedings of the 10th Symposium in Dresden, pp. 461–464. Vieweg (1996)

[22] K¨ochel, P., Niel¨ander, U.: Simulation-Based Optimisation of Multi-Echelon Inventory Systems. International Journal of Production Economics 93-94, 505–513 (2005) [23] K¨ochel, P., Thiem, S.: Search for Good Policies in a Single-Warehouse, Multi-Retailer

System by Particle Swarm Optimisation. International Journal of Production Economics (2010) (in press, corrected proof)

[24] Kukreja, A., Schmidt, C.P.: A Model for Lumpy Parts in a Multi-Location Inventory System with Transshipments. Computers & Operations Research 32, 2059–2075 (2005) [25] Kukreja, A., Schmidt, C.P., Miller, D.M.: Stocking Decisions for Low- Usage Items in

a Multilocation Inventory System. Management Science 47, 1371–1383 (2001)

[26] Li, J., Gonz´alez, M., Zhu, Y.: A Hybrid Simulation Optimization Method for Produc- tion Planning of Dedicated Remanufacturing. International Journal of Production Eco- nomics 117(2), 286–301 (2009)

[27] Minner, S., Silver, E.A., Robb, D.J.: An Improved Heuristic for Deciding on Emergency Transshipments. European Journal of Operational Research 148, 384–400 (2003) [28] ¨Ozdemir, D., Y¨ucesan, E., Herer, Y.T.: Multi-Location Transshipment Problem

with Capacitated Transportation. European Journal of Operational Research 175(1), 602–621 (2006)

[29] Parsopoulos, K.E., Skouri, K., Vrahatis, M.N.: Particle swarm optimization for tack- ling continuous review inventory models. In: Giacobini, M., Brabazon, A., Cagnoni, S., Di Caro, G.A., Drechsler, R., Ek´art, A., Esparcia-Alc´azar, A.I., Farooq, M., Fink, A., McCormack, J., O’Neill, M., Romero, J., Rothlauf, F., Squillero, G., Uyar, A.Sá., Yang, S. (eds.) EvoWorkshops 2008. LNCS, vol. 4974, pp. 103–112. Springer, Heidelberg (2008)

[30] Robinson, L.W.: Optimal and Approximate Policies in Multi-Period Multi- Location Inventory Models with Transshipments. Operations Research 38, 278–295 (1990) [31] Ruppeiner, G., Pedersen, J.M., Salamon, P.: Ensemble Approach to Simulated anneal-

ing. Jounal de Physique I 1(4), 455–470 (1991)

[32] Willis, K.O., Jones, D.F.: Multi-Objective Simulation Optimization through Search Heuristics and Relational Database Analysis. Decision Support Systems 46(1), 277–286 (2008)

[33] Xu, K., Evers, P.T., Fu, M.C.: Estimating Customer Service in a Two- Location Contin- uous Review Inventory Model with Emergency Transshipments. European Journal of Operational Research 145, 569–584 (2003)

[34] Zhan, Z.-H., Feng, X.-L., Gong, Y.-J., Zhang, J.: Solving the Flight Frequency Program- ming Problem with Particle Swarm Optimization. In: Proceedings of the 11th Congress on Evolutionary Computation, CEC 2009, pp. 1383–1390. IEEE Press, Los Alamitos (2009)

Traditional and Hybrid Derivative-Free Optimization Approaches for Black Box Functions

Genetha Anne Gray and Kathleen R. Fowler

Abstract.Picking a suitable optimization solver for any optimization problem is quite challenging and has been the subject of many studies and much debate. This is due in part to each solver having its own inherent strengths and weaknesses. For example, one approach may be global but have slow local convergence properties, while another may have fast local convergence but is unable to globally search the entire feasible region. In order to take advantage of the benefits of more than one solver and to overcome any shortcomings, two or more methods may be combined, forming a hybrid. Hybrid optimization is a popular approach in the combinatorial optimization community, where metaheuristics (such as genetic algorithms, tabu search, ant colony, variable neighborhood search, etc.) are combined to improve robustness and blend the distinct strengths of different approaches. More recently, metaheuristics have been combined with deterministic methods to form hybrids that simultaneously perform global and local searches. In this Chapter, we will exam- ine the hybridization of derivative-free methods to address black box, simulation- based optimization problems. In these applications, the optimization is guided solely by function values (i.e.not by derivative information), and the function values re- quire the output of a computational model. Specifically, we will focus on improving derivative-free sampling methods through hybridization. We will review derivative- free optimization methods, discuss possible hybrids, describe intelligent hybrid ap- proaches that properly utilize both methods, and give an examples of the successful application of hybrid optimization to a problem from the hydrological sciences.

Genetha Anne Gray

Department of Quantitative Modeling & Analysis, Sandia National Laboratories,

P.O. Box 969, MS 9159, Livermore, CA 94551-0969 USA e-mail:gagray@sandia.gov

Kathleen R. Fowler

Department of Mathematics & Computer Science,

Clarkson University, P.O. Box 5815, Potsdam, NY, 13699-5815 USA e-mail:kfowler@clarkson.edu

Một phần của tài liệu computational optimization, methods and algorithms koziel yang 2011 06 17 Cấu trúc dữ liệu và giải thuật (Trang 132 - 137)

Tải bản đầy đủ (PDF)

(292 trang)