CL-LCP Data Set
Description
These data sets provide benchmark instances and solutions for the users to encourage them to work on cardinality-and-length-constrained lane covering problem (CL-LCP) which is introduced in the paper titled "Nucleolus based cost allocation methods for a class of constrained lane covering games". In collaborative truckload transportation procurement (CTTP), shippers demanding truckload service from carriers aim to find regularly scheduled tours with minimal empty truck movements. In CTTP, there are three primary tasks to be achieved for establishing a successful logistics collaboration: (1) selecting collaborators, (2) finding the minimum cost system-wide solution, (3) allocating the resulting savings among the collaborators. Finding the minimum cost system-wide solution and allocating the minimum cost in a fair manner are two distinct phases and crucial tasks to be achieved for the sustainability of such networks. The minimum cost system-wide solution is calculated by formulating the problem as a lane covering problem (LCP). Since both carriers and shippers seek to identify tours (cycles) with limited points and length, we employ cardinality and length constraints on the LCP and define the CL-LCP. In the CL-LCP, a set of lanes belonging to multiple shippers is covered by restricted cycles such that system-wide cost is minimized. The CL-LCP can be formulated as a set covering problem and solved over the set of all feasible cycles. In order to allocate system-wide cost among participants (lanes), some concepts (core, stability, rationality, budget-balanced) or methods (Shapley value, nucleolus) in cooperative game theory can be used. We present all 24 instances we solve in the paper in "CL-LCP Data Set.rar" file and detailed solutions obtained from mathematical models and solution procedures we propose in the paper in "Solution_Info.xlsx" file. Furthermore, you can check more solution results in the paper we mentioned above. You can find the details about the instances in "explanation.txt" file. If you find any errors, want to comment, have any suggestions or have any additional benchmark instances, you are welcome to share and write an e-mail to onernihat@outlook.com.