An incremental approach for storage and delivery planning problems

• Autorzy: Sakakibara K. , Tian Y. , Nishikawa I.
• Języki publikacji: EN

Abstrakty

EN

We consider a logistic planning problem for simultaneous optimization of the storage and the delivery. This problem arises in the consolidate shipment using an intermediate storage in a supply chain, which is typically found in the automobile industry. The vehicles deliver the items from the origin to the destination, while the items can be stored at some warehousing facilities as the intermediate storage during the delivery. The delivery plan is made for each day separately, but the storage at a warehouse may last for more than one day. Therefore, the entire logistic plan should be considered over a certain period for the total optimization. We formulate the storage and delivery problem as a mixed integer programming. Then, we propose a relax-and-fix type heuristic method, which incrementally fixes decision variables until all the variables are fixed to obtain a complete solution. Moreover, a semiapproximate model is introduced to effectively fix the variables. Based on the formulation, the delivery plan can be solved for each day separately. This has the advantage especially in the dynamic situation, where the delivery request is modified from the original request before the actual delivery day. Numerical experiments show that the simultaneous optimization gives the effective storage plan to reduce the total logistic cost, and the proposed heuristics efficiently reduce the computational time and are robust against the dynamic situation.

Słowa kluczowe

EN

simultaneous optimization; logistic terminal; consolidate shipment; mixed-integer programming; relax-and-fix

• Wydawca: AGH University of Science and Technology Press
• Czasopismo: Decision Making in Manufacturing and Services
• Rocznik: 2012
• Tom: Vol. 6, no. 1-2
• Strony: 5--23
• Opis fizyczny: Bibliogr. 19 poz., rys., wykr., tab.

Twórcy

autor

Sakakibara K.

• College of Information Science and Engineering, Ritsumeikan University; Noji-Higashi, Kusatsu city, Shiga 525-8577, JAPAN

autor

Tian Y.

• Nihon Unisys, Ltd.; Koto ward, Tokyo 135-8560, JAPAN

autor

Nishikawa I.

• College of Information Science and Engineering, Ritsumeikan University; Noji-Higashi, Kusatsu city, Shiga 525-8577, JAPAN

Bibliografia

• Akartunali, K. & Miller, A. J. (2009), A heuristic approach for big bucket multi-level production planning problems, European Journal of Operational Research 193(2), 396–411.
• Campbell, J. (1990), Locating transportation terminals to serve an expanding demand, Transportation Research B 24(3), 173–193.
• Chen, P., Guo, Y., Lim, A. & Rodrigues, B. (2006), Multiple crossdocks with inventory and time windows, Computers & Operations Research 33(1), 43–63.
• Comelli, M., Gourgand, M. & Lemoine, D. (2008), A review of tactical planning models, Journal of Systems Science and Systems Engineering 17(2), 204–229.
• Daganzo, C. (1996), Logistics Systems Analysis, Springer.
• Ferreira, D., Morabito, R. & Rangel, S. (2009), Solution approaches for the soft drink integrated production lot sizing and scheduling problem, European Journal of Operational Research 196(2), 697–706.
• IBM (2008), CPLEX11, http://www-01.ibm.com/software/integration/optimization/cplexoptimizer/.
• Irnich, S. & Desaulniers, G. (2005), Column Generation, Springer-Verlag, chapter 2.
• Kelly, J. D. & Mann, J. L. (2004), Flowsheet decomposition heuristic for scheduling: a relax-and fix method, Computers and Chemical Engineering 28, 2193–2200.
• Lawler, E. L., Lenstra, J. K., Kan, A. H. G. R. & Shmoys, D. B., eds (1985), The Traveling Salesman Problem, John Wiley & Sons.
• Musa, R., Arnaout, J.-P. & Jung, H. (2010), Ant colony optimization algorithm to solve for the transportation problem of cross-docking network, Computers & Industrial Engineering 59, 85–92.
• Nemhauser, G., Kan, A. R. & Todd, M., eds (1989), Handbooks in Operations Research and Management Science Volume 1, Elsevier.
• Onoyama, T., Maekawa, T., Kubota, S., Tsuruta, S. & Komoda, N. (2008), A selfish constraint satisfaction genetic algorithm for planning a long-distance transportation network, Electronics and Communications in Japan 91(9), 1–10.
• Pedroso, J. & Kubo, M. (2005), Hybrid tabu search for lot sizing problems, in Hybrid Metaheuristics, Proceedings, Vol. 3636 of Lecture Notes in Computer Science, Springer-Verlag, 66–77.
• Pochet, Y. & Vyve, M. V. (2004), A general heuristic for production planning problems, INFORMS Journal on Computing 16, 316–327.
• Pochet, Y. & Wolsey, L. A. (2006), Production planning by mixed integer programming, Springer.
• Sakakibara, K., Tian, Y. & Nishikawa, I. (2011), Mixed integer programming model and incremental optimization for delivery and storage planning using truck terminals (in Japanese), Transactions of the Institute of Systems, Control and Information Engineers 24(3), 88–96.
• Taniguchi, E., Noritake, M., Yamada, T. & Izumitani, T. (1999), Optimal size and location planning of public logistics terminals, Transportation Research Part E: Logistics and Transportation Review 35(3), 207–222.
• Wu, T. & Shi, L. (2009), Hybrid nested partitions and relax-and-fix approach for capacitated multi-item lot sizing problem, in IEEE/INFORMS International Conference on Service Operations, Logistics and Informatics, 359–364.