Skip to main content
ConductScienceScienceDex
Powered by ShareScore

Find research datasets worth reusing

Search datasets from major research repositories and use ShareScore to quickly assess how well each record supports discovery, access, and reuse.

3

datasets available to search

ShareScore release 0.9.0

Reset

Dataset results

3 results for “Truck scheduling”

Learn how ShareScore rates datasets ↗
zenodo40/100

Instance data for "Scheduling Trucks on Factory Premises"

<p>Instance data for the paper</p> <ul> <li>Wirth, M., &amp; Emde, S. (2018). Scheduling trucks on factory premises. <em>Computers &amp; Industrial Engineering</em>, <em>126</em>, 175-186.</li> </ul> <p>Every instance is in a separate text file, of which there are 54 in total (18 small, medium, and large instances, respectively). The data format is as follows.</p> <p>&lt;num&gt; is the running index of the instance.</p> <p>&lt;NumTrucks&gt; is the total number of trucks (jobs).</p> <p>&lt;NumDoors&gt; is the total number of dock doors (machines) on the factory premises.</p> <p>&lt;MaxDoors&gt; denotes the maximum number of doors to be visited per truck.</p> <p>&lt;FactoryLength&gt; denotes the size of the factory premises in meters (used to calculate the distances).</p> <p>&lt;Distribution&gt; is the type of probability distribution used for generating the processing and transfer times.</p> <p>&lt;Processing&gt; is a binary matrix signalling if a truck requires processing at a door: if and only if the entry in line i and column j is 1, truck j requires processing at door i.</p> <p>&lt;ProcessingTime&gt; is the processing time matrix: the entry in line i and column j is the processing time of truck j at door i.</p> <p>&lt;DoorDistance&gt; is the distance matrix between doors. The entrance / exit dummy door is the first line / column.</p> <p>&lt;ReleaseDate&gt; is the release date vector for the trucks.</p> <p>&lt;DueDate&gt; are the due dates of the trucks.</p> <p>&lt;Cost&gt; are the weights in the objective for each truck.</p>

opencc-by-4.0Aug 2021View details →
zenodo36/100

Problem instances for integrated truck and workforce scheduling problem

<p>We randomly generated in total 500 problem instances for the integrated truck and workforce scheduling (ITWS) problem which is proposed in the article &quot;Tadumadze, G., Boysen, N., Emde, S., and Weidinger, F. (2019): Integrated truck and workforce scheduling to accelerate the unloading of trucks. <em>European Journal of Operational Research</em>, 278(1), 343-362, <a href="https://doi.org/10.1016/j.ejor.2019.04.024">https://doi.org/10.1016/j.ejor.2019.04.024</a>&quot;.</p> <p>The problem instances are generated for two representative truck scheduling settings:</p> <ul> <li>distribution center (ITWS-DC)</li> <li>cross-docking terminal (ITWS-CD).</li> </ul> <p>The instance size is defined by the number of dock doors for inbound operations |D|, the number of inbound trucks |J| (and the number of outbound trucks |O| for the ITWS-CD setting) and they are dubbed as follows:</p> <ul> <li>XS: |D| = 5; |J| = 20; (|O| = 5)</li> <li>S: |D|= 15; |J| = 50; (|O| = 15)</li> <li>M: |D|= 25; |J| = 100; (|O| = 25)</li> <li>L: |D|= 50; |J| = 200; (|O| = 50)</li> </ul> <p>For each setting the instances are divided in sets &quot;computational study&quot; and &quot;managerial insights&quot;.</p> <p>For each setting, the dataset &quot;computational study&quot; is divided into two parts (&ldquo;part 1&rdquo; and &ldquo;part 2&rdquo;) consisting of 80 and 60 instances which vary in problem size (XS, S, M and L) and the expected relative width of the trucks&#39; time windows (&Omega;_{max}).</p> <p>The dataset &quot;managerial insights&quot; consists of problem instances that vary in acceleration effect of trucks&#39; processing times by additional logistics workers (&kappa;) and scenarios of the workforce size |W|. The notations for the workforce scenario have following meanings:</p> <ul> <li>plentiful workforce: |W|=2 &sdot; |D|</li> <li>scarce workforce |W|=|D|.</li> </ul> <p>For each setting (i.e., ITWS-DC and ITWS-CD) subset &ldquo;part 1&rdquo; of &quot;managerial insights&quot; contains 100 instances (50 with scarce workforce scenario and 50 with plentifull workforce scenario) and &ldquo;part 2&rdquo; - 10 instances.</p> <p>The instances are labeled according to the following naming convention: &quot;[problem]_[setting]_[size]_[&Omega;_{max}]_[&kappa;]_[ID]&quot; where ID is a running index of instance of the same parameter constellation. As instances in &ldquo;part 1&rdquo; of the dataset &ldquo;managerial insights&rdquo; vary in workforce scenarios the instance names are extended by [scenario] from ahead so that following naming convention is applied: &quot;[scenario]_[problem]_[setting]_[size]_[ &Omega;_{max}]_[&kappa;]_[ID]&quot;.</p> <p>For detailed instance generation scheme see Section 4.1 of the above mentioned work.</p> <p>The file for the problem ITWS-DC are structured as follows:</p> <p>|J| = &lt;number of inbound trucks&gt;;</p> <p>T = &lt;length of planning horizon&gt;;</p> <p>K_j = &lt;vector with |J| elements: the j-th element corresponds to number of unloading modes for truck j&gt;;</p> <p>|W| = &lt;total number of available workers for inbound operations&gt;;</p> <p>|D| = &lt;number of inbound doors&gt;;</p> <p>rho_{jk} = &lt;|J|*K_{max} matrix (with K_max=max_{j&isin;J}{K_j}): each entry in k-th column and j-th row corresponds to the processing time of truck j if it is unloaded by k logistics workers (the elements in k-th column and j-th row where k&lt;K_j is set to the default value &ldquo;0&rdquo;)&gt;;</p> <p>a_j = &lt;vector with |J| elements: the j-th element corresponds to the arrival time of truck j&gt;;</p> <p>d_j = &lt;vector with |J| elements: the j-th element corresponds to the arrival time of truck j&gt;;</p> <p>alpha_j = &lt;vector with |J| elements: the j-th element corresponds to the duration of truck j&rsquo;s initial docking (i.e., step (1))&gt;;</p> <p>beta_j = &lt;vector with |J| elements: the j-th element corresponds to the duration of truck j&rsquo;s initial docking plus preparation (i.e., step (1) + step (2))&gt;;</p> <p>gamma_j = &lt;vector with |J| elements: the j-th element corresponds to the duration of truck j&rsquo;s trailer secluding plus undocking (i.e., step (4) + step (5))&gt;;</p> <p>delta_j = &lt;vector with |J| elements: the j-th element corresponds to the duration of truck j&rsquo;s final undocking (i.e., step (5))&gt;;</p> <p>&nbsp;</p> <p>The file for the problem ITWS-CD are extended by following additional parameters:</p> <p>|O| = &lt;number of inbound trucks&gt;;</p> <p>FI_{jo} = &lt;|J|*|O| matrix: each entry in o-th column and j-th row corresponds to the weight, of a shipment delivered by inbound truck j dedicated to outbound truck o&gt;;</p> <p>dep_o = vector with |O| elements: the o-th element corresponds to the departure time for outbound truck o&gt;;</p> <p>fi_{go} = &lt;|D|*|O| matrix: each entry in o-th column and g-th row corresponds to the transfer time for moving goods from dock g to outbound truck o&gt;;</p>

opencc-by-4.0Nov 2018View details →
zenodo36/100

Problem instances for outbound truck loading and scheduling problem

<p>The following dataset contains problem instances for the outbound truck scheduling and loading problem, which are proposed in the work &quot;Giorgi Tadumadze &amp; Simon Emde (2021): Loading and scheduling outbound trucks at a dispatch warehouse. <em>IISE Transactions</em>, DOI: <a href="https://doi.org/10.1080/24725854.2021.1983923">10.1080/24725854.2021.1983923</a>&rdquo;.</p> <p>The problem instances are stored in table &ldquo;instances&rdquo;, where columns of tables can be interpreted as follows:</p> <ul> <li>ID: &lt;running index&gt;;</li> <li>name: &lt;instance name, specifying the number of items <span class="math-tex">\(m\)</span>, number of trucks <span class="math-tex">\(n\)</span>, value of parameter <span class="math-tex">\(\alpha\)</span>, [value of parameter <span class="math-tex">\(\Delta\)</span>], and the width of trucks&rsquo; time windows&gt;;</li> <li>O: &lt;number of served OEMs&gt;;</li> <li>m: &lt;number of items&gt;;</li> <li>n: &lt;number of trucks&gt;;</li> <li>Q: &lt;total number of available workers&gt;;</li> <li>D: &lt;total number of available dock doors&gt;;</li> <li>w_i: &lt;vector with <span class="math-tex">\(m\)</span> elements: the <span class="math-tex">\(i\)</span>-th element corresponds to the size (required space) of item <span class="math-tex">\(i\)</span>&gt;;</li> <li>d_i: &lt;vector with <span class="math-tex">\(m\)</span>&nbsp;elements: the <span class="math-tex">\(i\)</span>-th element corresponds to the deadline of item <span class="math-tex">\(i\)</span>&gt;;</li> <li>r_i: &lt;vector with <span class="math-tex">\(m\)</span>&nbsp;elements: &nbsp;the <span class="math-tex">\(i\)</span>-th element corresponds to the relative importance (penalty cost per time unit of earliness) of item <span class="math-tex">\(i\)</span>&gt;;&nbsp;</li> <li>c_j: &lt;vector with <span class="math-tex">\(n\)</span>&nbsp;elements: the <span class="math-tex">\(j\)</span>-th element corresponds to the capacity of truck <span class="math-tex">\(j\)</span>&gt;;</li> <li>a_j: &lt;vector with <span class="math-tex">\(n\)</span>&nbsp;elements: &nbsp;the <span class="math-tex">\(j\)</span>-th element corresponds to the earliest possible departure time of truck <span class="math-tex">\(j\)</span>&gt;;</li> <li>b_j: &lt;vector with <span class="math-tex">\(n\)</span>&nbsp;elements: the <span class="math-tex">\(j\)</span>-th element corresponds to the latest possible departure time of truck <span class="math-tex">\(j\)</span>&gt;;</li> <li>q_i: &lt;vector with <span class="math-tex">\(m\)</span>&nbsp;elements: the <span class="math-tex">\(i\)</span>-th element corresponds to the number of required workers to prepare and load item <span class="math-tex">\(i\)</span>&gt;;</li> <li>rho_i: &lt;vector with <span class="math-tex">\(m\)</span>&nbsp;elements: the <span class="math-tex">\(i\)</span>-th element corresponds to the handling time of item <span class="math-tex">\(i\)</span>&gt;;</li> <li>B_i: &lt; <span class="math-tex">\(m \times n\)</span> matrix: each entry in <span class="math-tex">\(j\)</span>-th column and <span class="math-tex">\(i\)</span>-th row corresponds to the binary parameter which has a value 1 if set of available trucks <span class="math-tex">\(B_i\)</span> contains truck <span class="math-tex">\(j\)</span> (i.e., if truck <span class="math-tex">\(j\)</span> departs towards the OEM, who ordered item); 0 otherwise&gt;;</li> </ul> <p>The first 270 entries (ID between 1-270) contain OTSLP instances with different instance sizes, used for the computational performance experiments (Section 5.1).</p> <p>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 &nbsp;(ID between 311-340), and 30 OTSLP instances with the varying level of available dock doors &nbsp;(ID between 341-370), used for the managerial inside experiments (Section 5.2).</p> <p>The detailed computational results for each instance and solution approach are reported in tables, which are named with the following convention: &lt;results_&lt;approach&gt;&rdquo;. Specifically, we report the required computational runtime in CPU seconds, status of the found solution (&ldquo;Optimal&rdquo;, &ldquo;Infeasible&rdquo;, &ldquo;Feasible&rdquo; / &ldquo;AbortTimeLim&rdquo;), as well as the best found upper (and lower) bound in columns &ldquo;runtime&rdquo;, &ldquo;status&rdquo;, &ldquo;UB&rdquo; and &ldquo;LB&rdquo;.</p>

opencc-by-4.0Sep 2021View details →

ScienceDex guides

Understand access before you commit

These curated guides explain access requirements, typical timelines, costs, and reuse considerations for widely used research datasets.

Compare curated datasets

Allen Brain Atlas

Allen Brain Atlas is an Allen Institute collection of brain map atlases, datasets, APIs, and analysis tools covering mouse, human, and non-human primate brain resources.

allen-brain-atlas
neuroscienceopenDocumentation, web resources, and API references are available online.
Last verified 2026-04-30Open record

Annotated Behaviour and Observability Dataset (ABODe)

ABODe is a University of Edinburgh DataShare dataset for behavior classification in group-housed mice using home-cage video, identities, bounding boxes, ground-plate positions, and annotator labels.

abode-home-cage
behavioral-neuroscienceopenThe DataShare record exposes download links for annotations, documentation, license text, and the zipped per-snippet data directory.
Last verified 2026-04-30Open record

DANDI Archive for NWB datasets

DANDI is a BRAIN Initiative archive for publishing and sharing neurophysiology data, including electrophysiology, optophysiology, and behavioral data packaged as NWB and related standards.

dandi-nwb
electrophysiologyopenPublished Dandiset metadata and archive endpoints are available through the production DANDI API.
Last verified 2026-04-30Open record

International Brain Laboratory public data

The International Brain Laboratory public data releases expose standardized mouse decision-making experiments, including Neuropixels recordings, widefield calcium imaging, behavior, and session metadata accessed through the ONE API.

ibl
behavioral-neuroscienceopenPublic sessions can be searched and loaded from the IBL public data server through ONE.
Last verified 2026-04-29Open record

OpenNeuro

OpenNeuro is a free, open platform for sharing neuroimaging datasets, with public search, dataset pages, and download paths for web, S3, DataLad, and the OpenNeuro CLI.

openneuro
neuroscienceopenPublished datasets are available on demand over the internet.
Last verified 2026-04-29Open record

ScienceDex for faculty

Your academic CV and NIH biosketch

Make your CV in your school's format and your NIH biosketch from it, then download both as Word files.