|
465 | 465 | "type": "Title" |
466 | 466 | }, |
467 | 467 | { |
468 | | - "element_id": "0cc9334df550d1730f2d468941a38225", |
| 468 | + "element_id": "02c4df0e110486afd2bd74245e7d93d9", |
469 | 469 | "metadata": { |
470 | 470 | "data_source": {}, |
471 | 471 | "filetype": "application/pdf", |
|
474 | 474 | ], |
475 | 475 | "links": [ |
476 | 476 | { |
477 | | - "start_index": 386, |
| 477 | + "start_index": 383, |
478 | 478 | "text": "https :// orlib . uqcloud . net /", |
479 | 479 | "url": "https://orlib.uqcloud.net/" |
480 | 480 | } |
481 | 481 | ], |
482 | 482 | "page_number": 2 |
483 | 483 | }, |
484 | | - "text": "Subject area Operations research More specific subject area Vehicle scheduling Type of data Tables, text files How data were acquired Artificially generated by a C þ þ program on Intels Xeons CPU E5– 2670 v2 with Linux operating system. Data format Raw Experimental factors Sixty randomly generated instances of the MDVSP with the number of depots in (8, 12, 16) and the number of trips in (1500, 2000, 2500, 3000) Experimental features Randomly generated instances Data source location IITB-Monash Research Academy, IIT Bombay, Powai, Mumbai, India. Data accessibility Data can be downloaded from https://orlib.uqcloud.net/ Related research article Kulkarni, S., Krishnamoorthy, M., Ranade, A., Ernst, A.T. and Patil, R., 2018. A new formulation and a column generation-based heuristic for the multiple depot vehicle scheduling problem. Transportation Research Part B: Methodological, 118, pp. 457–487 [3].", |
| 484 | + "text": "Subject area Operations research More specific subject area Vehicle scheduling Type of data Tables, text files How data were acquired Artificially generated by a Cþ þ program on Intels Xeons CPU E5– 2670 v2 with Linux operating system. Data format Raw Experimental factors Sixty randomly generated instances of the MDVSP with the number of depots in (8,12,16) and the number of trips in (1500, 2000, 2500, 3000) Experimental features Randomly generated instances Data source location IITB-Monash Research Academy, IIT Bombay, Powai, Mumbai, India. Data accessibility Data can be downloaded from https://orlib.uqcloud.net/ Related research article Kulkarni, S., Krishnamoorthy, M., Ranade, A., Ernst, A.T. and Patil, R., 2018. A new formulation and a column generation-based heuristic for the multiple depot vehicle scheduling problem. Transportation Research Part B: Methodological, 118, pp. 457–487 [3].", |
485 | 485 | "type": "Table" |
486 | 486 | }, |
487 | 487 | { |
|
576 | 576 | "type": "Title" |
577 | 577 | }, |
578 | 578 | { |
579 | | - "element_id": "683993fc4592941bf8b06173870aa63c", |
| 579 | + "element_id": "1f3d79f338b86fbfcfa7054f11de28f0", |
580 | 580 | "metadata": { |
581 | 581 | "data_source": {}, |
582 | 582 | "filetype": "application/pdf", |
|
585 | 585 | ], |
586 | 586 | "links": [ |
587 | 587 | { |
588 | | - "start_index": 611, |
| 588 | + "start_index": 609, |
589 | 589 | "text": "https :// orlib . uqcloud . net", |
590 | 590 | "url": "https://orlib.uqcloud.net" |
591 | 591 | } |
592 | 592 | ], |
593 | 593 | "page_number": 2 |
594 | 594 | }, |
595 | | - "text": "The dataset contains 60 different problem instances of the multiple depot vehicle scheduling pro- blem (MDVSP). Each problem instance is provided in a separate file. Each file is named as ‘RN-m-n-k.dat’, where ‘m’, ‘n’, and ‘k’ denote the number of depots, the number of trips, and the instance number for the size, ‘ðm; nÞ’, respectively. For example, the problem instance, ‘RN-8–1500-01.dat’, is the first problem instance with 8 depots and 1500 trips. For the number of depots, m, we used three values, 8, 12, and 16. The four values for the number of trips, n, are 1500, 2000, 2500, and 3000. For each size, ðm; nÞ, five instances are provided. The dataset can be downloaded from https://orlib.uqcloud.net. For each problem instance, the following information is provided:", |
| 595 | + "text": "The dataset contains 60 different problem instances of the multiple depot vehicle scheduling pro- blem (MDVSP). Each problem instance is provided in a separate file. Each file is named as ‘RN-m-n-k.dat’, where ‘m’, ‘n’, and ‘k’ denote the number of depots, the number of trips, and the instance number for the size, ‘ðm;nÞ’, respectively. For example, the problem instance, ‘RN-8–1500-01.dat’, is the first problem instance with 8 depots and 1500 trips. For the number of depots, m, we used three values, 8,12, and 16. The four values for the number of trips, n, are 1500, 2000, 2500, and 3000. For each size, ðm;nÞ, five instances are provided. The dataset can be downloaded from https://orlib.uqcloud.net. For each problem instance, the following information is provided:", |
596 | 596 | "type": "NarrativeText" |
597 | 597 | }, |
598 | 598 | { |
|
661 | 661 | "type": "UncategorizedText" |
662 | 662 | }, |
663 | 663 | { |
664 | | - "element_id": "96ca028aef61c1fd98c9f0232a833498", |
| 664 | + "element_id": "39943e8e76f7ddd879284cf782cac2f4", |
665 | 665 | "metadata": { |
666 | 666 | "data_source": {}, |
667 | 667 | "filetype": "application/pdf", |
|
670 | 670 | ], |
671 | 671 | "page_number": 2 |
672 | 672 | }, |
673 | | - "text": "For each trip i A 1; 2; …; n, a start time, ts i , an end time, te i , a start location, ls i , and an end location, le i , and", |
| 673 | + "text": "For each trip iA1;2;…;n, a start time, ts i, an end time, te i , a start location, ls i, and an end location, le i , and", |
674 | 674 | "type": "NarrativeText" |
675 | 675 | }, |
676 | 676 | { |
|
726 | 726 | "type": "NarrativeText" |
727 | 727 | }, |
728 | 728 | { |
729 | | - "element_id": "2bd550b209c7c06c42966aad21822ea5", |
| 729 | + "element_id": "9698643b7f3d779d8a5fdb13dffef106", |
730 | 730 | "metadata": { |
731 | 731 | "data_source": {}, |
732 | 732 | "filetype": "application/pdf", |
|
735 | 735 | ], |
736 | 736 | "page_number": 3 |
737 | 737 | }, |
738 | | - "text": "and end location of the trip. A long trip is about 3–5 h in duration and has the same start and end location. For all instances, m r l and the locations 1; …; m correspond to depots, while the remaining locations only appear as trip start and end locations.", |
| 738 | + "text": "and end location of the trip. A long trip is about 3–5 h in duration and has the same start and end location. For all instances, mrl and the locations 1;…;m correspond to depots, while the remaining locations only appear as trip start and end locations.", |
739 | 739 | "type": "NarrativeText" |
740 | 740 | }, |
741 | 741 | { |
|
804 | 804 | "type": "NarrativeText" |
805 | 805 | }, |
806 | 806 | { |
807 | | - "element_id": "9d3f44c51fe13ebdf6b9511859e4f1b7", |
| 807 | + "element_id": "02146cfa4d68e86d868e99acab4f7c42", |
808 | 808 | "metadata": { |
809 | 809 | "data_source": {}, |
810 | 810 | "filetype": "application/pdf", |
|
813 | 813 | ], |
814 | 814 | "page_number": 3 |
815 | 815 | }, |
816 | | - "text": "For each instance size ðm; nÞ, Table 1 provides the average of the number of locations, the number of times, the number of vehicles, and the number of possible empty travels, over five instances. The number of locations includes m distinct locations for depots and the number of locations at which various trips start or end. The number of times includes the start and the end time of the planning horizon and the start/end times for the trips. The number of vehicles is the total number of vehicles from all the depots. The number of possible empty travels is the number of possible connections between trips that require a vehicle travelling empty between two consecutive trips in a schedule.", |
| 816 | + "text": "For each instance size ðm;nÞ, Table 1 provides the average of the number of locations, the number of times, the number of vehicles, and the number of possible empty travels, over five instances. The number of locations includes m distinct locations for depots and the number of locations at which various trips start or end. The number of times includes the start and the end time of the planning horizon and the start/end times for the trips. The number of vehicles is the total number of vehicles from all the depots. The number of possible empty travels is the number of possible connections between trips that require a vehicle travelling empty between two consecutive trips in a schedule.", |
817 | 817 | "type": "NarrativeText" |
818 | 818 | }, |
819 | 819 | { |
|
830 | 830 | "type": "NarrativeText" |
831 | 831 | }, |
832 | 832 | { |
833 | | - "element_id": "d9904b5393369c5204af83b64035802a", |
| 833 | + "element_id": "fc4b1e0c5bb8b330e2160f6615975401", |
834 | 834 | "metadata": { |
835 | 835 | "data_source": {}, |
836 | 836 | "filetype": "application/pdf", |
|
839 | 839 | ], |
840 | 840 | "page_number": 3 |
841 | 841 | }, |
842 | | - "text": "The dataset also includes a program ‘GenerateInstance.cpp’ that can be used to generate new instances. The program takes three inputs, the number of depots ðmÞ, the number of trips ðnÞ, and the number of instances for each size ðm; nÞ.", |
| 842 | + "text": "The dataset also includes a program ‘GenerateInstance.cpp’ that can be used to generate new instances. The program takes three inputs, the number of depots ðmÞ, the number of trips ðnÞ, and the number of instances for each size ðm;nÞ.", |
843 | 843 | "type": "NarrativeText" |
844 | 844 | }, |
845 | 845 | { |
|
934 | 934 | "type": "NarrativeText" |
935 | 935 | }, |
936 | 936 | { |
937 | | - "element_id": "17e17590003c0f514220c453f88da6b7", |
| 937 | + "element_id": "86e18db80eab89d0556c22321732e4e7", |
938 | 938 | "metadata": { |
939 | 939 | "data_source": {}, |
940 | 940 | "filetype": "application/pdf", |
|
943 | 943 | ], |
944 | 944 | "page_number": 4 |
945 | 945 | }, |
946 | | - "text": "Number of Number of columns in Description lines each line 1 3 The number of depots, the number of trips, and the number of locations. 1 m The number of vehicles rd at each depot d. n 4 One line for each trip, i ¼ 1; 2; …; n. Each line provides the start location ls i , the start i , the end location le time ts i and the end time te i for the corresponding trip. l l Each element, δij; where i; j A 1; 2; …; l, refers to the travel time between location i and location j.", |
| 946 | + "text": "Number of Number of columns in Description lines each line 1 3 The number of depots, the number of trips, and the number of locations. 1 m The number of vehicles rd at each depot d. n 4 One line for each trip, i ¼ 1;2;…;n. Each line provides the start location ls i, the start i, the end location le time ts i and the end time te i for the corresponding trip. l l Each element, δij; where i;jA1;2;…;l, refers to the travel time between location i and location j.", |
947 | 947 | "type": "Table" |
948 | 948 | }, |
949 | 949 | { |
|
0 commit comments