Abstract
In this paper, we propose a new global warehousing problem supporting advance conflicts: the Warehousing Problem with Conflict (WPC). A set of items are to be loaded into a number of warehouses. We assume a fixed capacity for all warehouses and a predefined weight for each item. The main goal of the WPC is to minimize the overall used number of warehouses under the incompatibility constraint of some pairs of items. We model this optimization problem as a Bin Packing Problem with Conflict (BPPC). As the complexity of the BPPC is NP-Hard, a Multi-start Tabu Search (MTS) is proposed as a solution approach. The empirical validation is done using a developed Decision Support System (DSS) and a comparison to a state-of-the-art approach is performed. The experimental results show that the MTS produces considerably better results than the various existing approaches to the detriment of the gap values.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
David, S.J.: Fast algorithms for bin packing. Journal of Computer and System Sciences 3, 272–314 (1974)
Maiza, M.: Heuristics for Solving the Bin-Packing Problem with Conflict. Applied Mathematical Sciences 5, 739–752 (2011)
Christofides, N., Mingozzi, A., Toth, P.: The vehicle routing problem. In: Combinatorial Optimization. Wiley (1979)
Jansen, K., Öhring, S.: Approximation Algorithms for Time Constrained Scheduling. Information and Computation 132, 85–108 (1997)
Kemal, K., Grdal, E.: Decision support for packing in warehouses. In: 21st International Symposium, Istanbul, Turkey (2006)
Gendreau, M., Laporte, G., Semet, F.: Heuristics and lower bounds for the bin packing problem with conflicts. Computers & Operations Research 31, 347–358 (2004)
Masri, H., Krichen, S., Guitouni, A.: A Multi-start Tabu Search Approach for Solving the Information Routing Problem. In: Murgante, B., et al. (eds.) ICCSA 2014, Part II. LNCS, vol. 8580, pp. 267–277. Springer, Heidelberg (2014)
Khanafer, A., Clautiaux, F., Talbi, E.-G.: New lower bounds for bin packing problem with conflicts. Computers & Operations Research 206, 281–288 (2010)
Lodi, A., Martello, S., Vigo, D.: Heuristic and metaheuristic approaches for a class of two-dimensional bin packing problems. INFORMS Journal on Computing 11, 345–357 (1999)
Lodi, A., Martello, S., Vigo, D.: Heuristic algorithms for the three-dimensional bin packing problem. European Journal of Operational Research 141, 410–420 (2002)
Glover, F., Taillard, E., Werra, D.: A User’s Guide to Tabu Search. Ann. Oper. Res. 41, 3–28 (1993)
Fekete, S.-P., Schepers, J.: New classes of fast lower bounds for bin packing problems. Mathematical Programming 91, 11–31 (2001)
Maiza, M., Radjef, M.S.: Heuristics for Solving the Bin-Packing Problem with Conflicts. Applied Mathematical Sciences 35, 1739–1752 (2011)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Jouida, S.B., Ouni, A., Krichen, S. (2015). A Multi-start Tabu Search Based Algorithm for Solving the Warehousing Problem with Conflict. In: Le Thi, H., Pham Dinh, T., Nguyen, N. (eds) Modelling, Computation and Optimization in Information Systems and Management Sciences. Advances in Intelligent Systems and Computing, vol 360. Springer, Cham. https://doi.org/10.1007/978-3-319-18167-7_11
Download citation
DOI: https://doi.org/10.1007/978-3-319-18167-7_11
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-18166-0
Online ISBN: 978-3-319-18167-7
eBook Packages: EngineeringEngineering (R0)