English
Polski
REPORT A PROBLEM
LINKS
Resource link (short)
http://www.zasobynauki.pl/zasoby/83153Resource link (repository)
https://id.e-science.pl/records/83153Resource metadata
| Title |
Test instances for a Time-Dependent Traveling Salesman Problem |
|---|---|
| Persons |
Authors:
Mariusz Uchroński, Jarosław Pempera
Partner: Wrocław University of Science and Technology |
| Description |
Test instances for n=5,6,7,8 was generated in following way. For each job j (j=1,...,n): si - service time - random integer from range [1,100] with uniform distribution, wi - cost of the penalty function - random integer from range [1,10] with uniform distribution, di - due date - random integer from range [P(1-TF-RDD/2), P(1-TF+RDD/2)] with uniform distribution. Where P = SUM{j=1,...,n}p(j), RDD=0.2,0.4,0.6,0.8,1.0 (relative range of due dates) and FT=0.2,0.4,0.6,0.8,1.0 (average tardiness factor). For each of the 25 pairs of values of RDD and FT five instances were generated. Overal 500 instances wewre generated - 125 for each value of n. The following procedure was used to determine travel times tij - Step 1: Determine n pairs of xi,yi points (recipients' coordinates) on the plane. The elements xi and yi were generated randomly according to a uniform distribution on the interval [1..100]. Step 2: For the coordinates of each pair of recipients xi,yi and xj, yj, determine the Euclidean distance. Round the obtained result up to the nearest integer (ceiling function). (English) |
| Keywords | "TSP"@pl, "szeregowanie zadań"@pl, "instancja"@pl, "scheduling"@en |
| Classification |
Resource type:
dataset, database Scientific discipline: Dziedzina nauk inżynieryjno-technicznych / automatyka, elektronika i elektrotechnika (2018) Destination group: students, scientists Harmful content: No |
| Characteristics |
Place of creation: Wrocław
Creation time: 2023 Resource language: English |
| License | CC BY-SA 4.0 |
| Technical information |
Submitter: Mariusz Uchroński Availability date: 22-05-2024 |
| Collections | Kolekcja Politechniki Wrocławskiej |
Similar resources
Test instances for a single-machine total weighted tardiness scheduling problem
Mariusz Uchroński, dataset, database, Wrocław University of Science and Technology, Dziedzina nauk inżynieryjno-technicznych / automatyka, elektronika i elektrotechnika (2018)
Algebra dróg elementarnych i jej zastosowanie do badań operacyjnych (PD-1971-01)
Stanisław Walukiewicz, thesis, Systems Research Institute Polish Academy of Sciences, Warsaw, Dziedzina nauk ścisłych i przyrodniczych / informatyka (2018)
Test instances for a single-machine total weighted tardiness scheduling problem
Mariusz Uchroński, dataset, database, Wrocław University of Science and Technology, Dziedzina nauk inżynieryjno-technicznych / automatyka, elektronika i elektrotechnika (2018)
Test instances or cost optimization in multimodal transport
Mariusz Uchroński, Radosław Idzikowski, Michał Jaroszczuk, Piotr P. Nowak, dataset, database, Wrocław University of Science and Technology, Dziedzina nauk inżynieryjno-technicznych / informatyka techniczna i telekomunikacja (2018)
Analiza nowych zastosowań teorii szeregowania zadań w organizacji robót budowlanych
Michał Podolski, thesis, Wrocław University of Science and Technology, dziedzina nauk technicznych / budownictwo (2011)
Test instances for a single-machine total weighted tardiness scheduling problem
Mariusz Uchroński, dataset, database, Wrocław University of Science and Technology, Dziedzina nauk inżynieryjno-technicznych / automatyka, elektronika i elektrotechnika (2018)