{"entities":{"Q6726286":{"pageid":14445230,"ns":120,"title":"Item:Q6726286","lastrevid":54828806,"modified":"2026-01-29T21:07:29Z","type":"item","id":"Q6726286","labels":{"en":{"language":"en","value":"Problem instances for outbound truck loading and scheduling problem"}},"descriptions":{"en":{"language":"en","value":"Dataset published at Zenodo repository."}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"dae155fd0809a7906855cd4fa50dd7d71bed552b","datavalue":{"value":{"entity-type":"item","numeric-id":56885,"id":"Q56885"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6726286$55B711A5-A46D-4045-9C27-F5796F8A214A","rank":"normal"}],"P1459":[{"mainsnak":{"snaktype":"value","property":"P1459","hash":"8945fe01e994dc372935b80fd7429a527c825639","datavalue":{"value":"The following dataset contains problem instances for the outbound truck scheduling and loading problem, which are proposed in the work Giorgi Tadumadze  Simon Emde (2021): Loading and scheduling outbound trucks at a dispatch warehouse. IISE Transactions, DOI: 10.1080/24725854.2021.1983923.  The problem instances are stored in table instances, where columns of tables can be interpreted as follows:    ID: running index;  name: instance name, specifying the number of items \\(m\\), number of trucks \\(n\\), value of parameter \\(\\alpha\\), [value of parameter \\(\\Delta\\)], and the width of trucks time windows;  O: number of served OEMs;  m: number of items;  n: number of trucks;  Q: total number of available workers;  D: total number of available dock doors;  w_i: vector with \\(m\\) elements: the \\(i\\)-th element corresponds to the size (required space) of item \\(i\\);  d_i: vector with \\(m\\)elements: the \\(i\\)-th element corresponds to the deadline of item \\(i\\);  r_i: vector with \\(m\\)elements: the \\(i\\)-th element corresponds to the relative importance (penalty cost per time unit of earliness) of item \\(i\\);  c_j: vector with \\(n\\)elements: the \\(j\\)-th element corresponds to the capacity of truck \\(j\\);  a_j: vector with \\(n\\)elements: the \\(j\\)-th element corresponds to the earliest possible departure time of truck \\(j\\);  b_j: vector with \\(n\\)elements: the \\(j\\)-th element corresponds to the latest possible departure time of truck \\(j\\);  q_i: vector with \\(m\\)elements: the \\(i\\)-th element corresponds to the number of required workers to prepare and load item \\(i\\);  rho_i: vector with \\(m\\)elements: the \\(i\\)-th element corresponds to the handling time of item \\(i\\);  B_i:  \\(m \\times n\\) matrix: each entry in \\(j\\)-th column and \\(i\\)-th row corresponds to the binary parameter which has a value 1 if set of available trucks \\(B_i\\) contains truck \\(j\\) (i.e., if truck \\(j\\) departs towards the OEM, who ordered item); 0 otherwise;   The first 270 entries (ID between 1-270) contain OTSLP instances with different instance sizes, used for the computational performance experiments (Section 5.1).  The following 100 entries (ID between 271-370) contain 40 OTSLP instances with the varying time window width for each truck (ID between 271-310), 30 OTSLP instances with the varying level of available workers (ID between 311-340), and 30 OTSLP instances with the varying level of available dock doors (ID between 341-370), used for the managerial inside experiments (Section 5.2).  The detailed computational results for each instance and solution approach are reported in tables, which are named with the following convention: results_approach. Specifically, we report the required computational runtime in CPU seconds, status of the found solution (Optimal, Infeasible, Feasible / AbortTimeLim), as well as the best found upper (and lower) bound in columns runtime, status, UB and LB.","type":"string"},"datatype":"string"},"type":"statement","id":"Q6726286$EF8CE5AF-4145-4B75-A11B-D90DD49DC129","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"40cd7f874d1887973443b158642586a3e9670362","datavalue":{"value":{"time":"+2021-09-13T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6726286$3004EDCD-36AE-4A4D-AE4E-0F896CE9CA80","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"f0d5e6f7ee8f6033336fae37e0c556763f1c2da0","datavalue":{"value":{"entity-type":"item","numeric-id":6726285,"id":"Q6726285"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6726286$5FFD0B4B-E477-4439-AE2D-C0D15C18EAEE","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"cb32960ae71b39cdbfde73f0d17a146802cb222e","datavalue":{"value":{"entity-type":"item","numeric-id":251172,"id":"Q251172"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6726286$60411449-09FD-44F3-AEB6-49341CD2CA62","rank":"normal"}],"P227":[{"mainsnak":{"snaktype":"value","property":"P227","hash":"f0e2433dc658bda1f0a1734f155012779999f094","datavalue":{"value":"5504138","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6726286$B6EC0F63-86AB-48B2-AC2F-FA0542838C57","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"b35ac8d01ec7c60f1ef4c0272a132edb729a031b","datavalue":{"value":"10.5281/zenodo.5504138","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6726286$43E08C0D-2BEF-4E1B-8E62-617F3F6B63B8","rank":"normal"}],"P163":[{"mainsnak":{"snaktype":"value","property":"P163","hash":"45fcd4163b5f33e6e8c784f5522d7246c0a1a61e","datavalue":{"value":{"entity-type":"item","numeric-id":57056,"id":"Q57056"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6726286$EC9F09F1-ACA0-49E9-8D9C-D22A8C0F783E","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"d1e8073b72a070520efd3d14d4b3d2d3d03859e2","datavalue":{"value":{"entity-type":"item","numeric-id":5984635,"id":"Q5984635"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6726286$D6F1D2C7-F19B-4EBE-97C2-BE1ABFC5A577","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Problem instances for outbound truck loading and scheduling problem","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Problem_instances_for_outbound_truck_loading_and_scheduling_problem"}}}}}