A DSS based on optimizer tools and MTS meta-heuristic for the Warehousing Problem with Conflicts
Introduction
The BPP is one of the basic problems in combinatorial optimization that can be classified in the category of -hard problems ( David et al., 1974 [1]). The hardness of the BPP is derived from its objective of assigning a set of items into a minimum number of available bins [2]. Such problems are extensively studied in various contexts as the industrial and logistic areas [3].
The basic version of the BPP can be defined as follows: given a set of items and a set of identical bins with fixed capacities, each item is characterized by its weight. The main objective of the BPP is to minimize the number of operated bins for the storage of the whole set of items.
As discussed in Krichen and Ben Jouida (2015) [4], many variations of the BPP can be pointed out as the variable size bin packing problem where items must be packed within a set of heterogeneous bins characterized by possibly different volumes and fixed costs. Also, the bin packing problem with conflict (BPPC) [5], [6] is considered as a challenging extension of the BPP that assumes the possibility of conflicts that might occur between pairs of items [7]. Such conflicts arise in many real-world applications, such as examination scheduling [8], parallel computing and database storage [9], product delivery [10] and resource clustering in highly distributed parallel computing [11].
As it is the case, the BPPC, has a potential effect in various areas, especially for the warehousing problem in the supply chain management (SCM) [12]. In fact, the warehousing problem, a strategic activity in the SC, that consists in finding the best storage configuration in the available warehouses and the allocation of customers' orders to be delivered from the different warehouses. This challenging activity in the SC, once optimized, can offer cost saving solutions [3]. A warehousing variant of great relevance in the SC takes into account the possibility of incompatibilities between items by avoiding joint packing of such items the same warehouse [13].
In this paper, we show the ability of the BPPC concept to handle the Warehousing Problem with Conflict (WPC) where conflicts can be assumed in the storage of items. As such, the set of bins in the BPPC represent the set of warehouses in the WPC. The main objective of the WPC is to minimize the number of warehouses while avoiding joint storage of items in conflict. Such problems handle chemical and pharmaceuticals storage instead stocking.
Since the WPC is -hard, numerous approximate methods were developed and compared to achieve concurrential solution quality [8], [14]. As it is the case, our incentive in this paper is to develop a Multi-start Tabu Search (MTS) that performs advanced features in order to well approximate the optimal solution that reports, in our case, the number of used bins. A Decision Support System (DSS), for the WPC, is also developed to solve the storage problems. The proposed DSS often present in storage applications. In fact, optimization tools used in the resolution step can either be accomplished by CPLEX or MTS, depending on the problem size. In fact, extensive computational experiments across a variety of problem sizes and different storage ratios are reported. A comparison to a state-of-the-art approach is performed to check the validity of the proposed MTS algorithm. The obtained results show that the MTS algorithm is computationally effective in generating optimal storage solutions.
This paper is structured as follows: The WPC is described and stated mathematically in Section 2. Section 3 describes the DSS and details the MTS algorithm for the WPC. Experimental results and computational study are reported in section 4 in order to provide the efficiency of our proposed algorithm.
Section snippets
Problem description and mathematical formulation
The WPC is stated as follows. Given a company that disposes of m warehouses and facing various customers' demands (see Fig. 1), the main company's concern is to find the best warehousing configuration that minimizes the number of used warehouses in the hope of minimizing the incurred holding cost in the SC. To do so, the company should plan its ordering of a set of items, from the supplier in terms of the launched customers' orders.
Furthermore, assuming that some items can be
A decision support system for the WPC
The DSS starts by the extraction of the warehousing data from the supply chain database. The first step of the DSS corresponds to the data entry for demands, conflicting items and whorehouses' descriptions. Such warehousing data and packing information constitute the inputs for the resolution step. Optimization tools used in the resolution step can either be accomplished by CPLEX or MTS, depending on the problem size. An empirical investigation of the generated solutions, in terms of the gap,
Experimental results
In this section, we study the performance of the MTS in solving the WPC. We start by adjusting the MTS parameters, namely:
- –
G: the size of the neighborhood
- –
: the number of runs
- –
: the number of iterations per run
Conclusion
In this work we studied the warehousing problem in the supply chain while assuming the possibility of conflicts between pairs of items. The main concern of the WPC is to pack the whole set of while avoiding joint storage of items in conflict. The objective of the WPC is to use the minimum number of warehouses. From a mathematical point of view, the WPC can be seen as a bin packing problem with conflicts, known to be -hard. As it is the case, we developed a MTS metaheuristic for approaching
References (18)
- et al.
Minimum number of warehouses for storing simultaneously compatible products
Proceedings of the Eleventh International Symposium on Inventories
Int. J. Prod. Econ.
(2003) - et al.
Heuristics and lower bounds for the bin packing problem with conflicts
Comput. Oper. Res.
(2004) - et al.
Approximation algorithms for time constrained scheduling
Inf. Comput.
(1997) Fast algorithms for bin packing
J. Comput. Syst. Sci.
(1974)- et al.
Colorful bin packing
- et al.
Supply Chain Management and Its Applications in Computer Science
(2015) - et al.
Bin packing with “largest in bottom” constraint: tighter bounds and generalizations
J. Comb. Optim.
(2013) Heuristics for solving the bin-packing problem with conflict
Appl. Math. Sci.
(2011)- et al.
A two-dimensional bin-packing problem with conflict penalties
Int. J. Prod. Res.
(2014)
Cited by (5)
Improvement of information system of cargo transportation routing management
2023, E3S Web of ConferencesMotion Planning of Warehouse Automation Robot Based on Recurrent Neural Network
2023, Proceedings - 2023 International Conference on Mechatronics, IoT and Industrial Informatics, ICMIII 2023A decision support system for the multi-client storage location assignment problem
2022, International Journal of Logistics Systems and ManagementOn the benchmark instances for the bin packing problem with conflicts
2021, AIRO Springer SeriesDecision making for Farmers: A Case Study of Agricultural Routing Planning
2019, ACIS 2019 Proceedings - 30th Australasian Conference on Information Systems