2026-10-15T23:58:40Z https://data.mendeley.com/oai

oai:data.mendeley.com/4zhjc3sj8d.1 2022-07-05T17:10:06Z

ÇALIK, Hatice Instances for secure container loading under multi-drop and axle weight constraints Mendeley Data The instances are designed to solve the Cargo Securing Problem under Multi-Drop and Axle Weight Constraints (CSP-MD-AW). The data set can be utilized for loading and packing of rectangular items with multiple customers or item groups as well as weight-related restrictions. Each file is designed as follows: - The first line has two entries which indicate the number of customers/groups and the number of items/pallets. - Each of the remaining lines provide the details of a rectangular item in five entries: item ID, customer/group ID, dimensions in centimeters (long-edge length and short-edge length) and weight in kilograms. For example, the NII-P7C3M file below corresponds to an instance with 7 items from 3 customers. Items 0 and 1 belong to customer 1, items 2, 3, and 4 belong to customer 2 and items 5 and 6 belong to customer 3. 3 7 0 1 120 80 500 1 1 120 80 500 2 2 120 80 1500 3 2 120 80 1500 4 2 120 80 1500 5 3 120 100 2400 6 3 120 100 2400 The file IDs contain information about the number of items and customers as well as weight and dimension categories. We refer to the original paper "Cargo securing under multi-drop and axle weight constraints" for the details of these categories. Operations Research Combinatorial Optimization Integer Programming Mixed Integer Programming Road Transportation Packing Problem Juwet, Marc Yaman, Hande Vanden Berghe, Greet Dataset doi:10.17632/4zhjc3sj8d.1 oai:data.mendeley.com/4zhjc3sj8d.1 Creative Commons Attribution 4.0 International http://creativecommons.org/licenses/by/4.0 https://data.mendeley.com/datasets/4zhjc3sj8d 2022-07-05T17:10:06Z