Abstract
In this chapter, we evaluate the performance of the branch-and-bound algorithm and the heuristic variants presented in Chap. 5. Moreover, we investigate the performance of the mixed-integer linear program (3.40) (MILP) from Sect. 3.2.2. In Sect. 6.1, we describe the experimental design. Section 6.2 deals with the validation of the branch-and-bound algorithm, the heuristics, and the MILP using test sets from the literature for special cases of the resource transfer problem. Since to the best of our knowledge there are no systematically generated test instances available in the literature that include all components of the resource transfer problem, we have generated new test sets for integrated scheduling and routing problems arising in the context of supply chain operations planning. The generation of these test sets is described in Sect. 6.3 and the computational results are presented in Sect. 6.4
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Further information about LocalSolver and the available operators can be found at http://www.localsolver.com/doccenter.html.
- 2.
All instances are available at https://www.wiwi.tu-clausthal.de/abteilungen/produktion/forschung/schwerpunkte/project-generator/rcpspmax/.
- 3.
The exact numbers for the different categories of the solution status, the average computation times, and the average as well as the maximum deviations of the test sets ubo10 and ubo20 are given in Table A.1 in the appendix.
- 4.
The exact numbers of the different categories of the solution status, the average computation times, and the average as well as the maximum deviations of the test sets smj10 and smj20 are given in Table A.2 in the appendix.
- 5.
The exact numbers of the different categories for the solution status, the average computation times, and the average as well as the maximum deviations of the test sets ubo50 and ubo100 are given in Table A.3 in the appendix.
- 6.
The solution status and the box plots of the computation times and relative deviations of the instances are visualized in Figs. A.1, A.2, A.3, A.4, A.5, A.6, A.7, A.8, and A.9 in the appendix. The exact numbers for the different categories of the solution status, the average computation times, and the average as well as the maximum deviations of all test sets are given in Tables A.8, A.9, and A.10 in the appendix.
- 7.
All instances are available at https://www.wiwi.tu-clausthal.de/abteilungen/produktion/forschung/schwerpunkte/project-generator/mrcpspmax/.
- 8.
The exact numbers for the different categories of the solution status, the average computation times, and the average as well as the maximum deviations of the test sets mmj10 and mmj20 are given in Table A.4 in the appendix.
- 9.
The exact numbers for the different categories of the solution status, the average computation times, and the average as well as the maximum deviations of the test set mm30 are given in Table A.5 in the appendix.
- 10.
The solution status and the box plots of the computation times and relative deviations of the instances are visualized in Figs. A.10, A.11, A.12, A.13, and A.14 in the appendix. The exact numbers for the different categories of the solution status, the average computation times, and the average as well as the maximum deviations of all test sets are given in Tables A.11 and A.12 in the appendix.
- 11.
The instances are available at http://hhperez.webs.ull.es/PDsite/#Instances.
- 12.
The exact numbers for the different categories of the solution status, the average computation times, and the average as well as the maximum deviations of the test sets pdvrp10 and pdvrp20 are given in Table A.6 in the appendix.
- 13.
The exact numbers for the different categories of the solution status, the average computation times, and the average as well as the maximum deviations of the test set pdvrp30 are given in Table A.7 in the appendix.
- 14.
The solution status and the box plots of the computation times and relative deviations of the instances are visualized in Figs. A.15, A.16, A.17, A.18, and A.19 in the appendix. The exact numbers for the different categories of the solution status, the average computation times, and the average as well as the maximum deviations of all test sets are given in Tables A.13 and A.14 in the appendix.
- 15.
The exact numbers for the different categories of the solution status, the average computation times, and the average as well as the maximum deviations of the test set sc1 are given in Table A.15 in the appendix.
- 16.
The exact numbers for the different categories of the solution status, the average computation times, and the average as well as the maximum deviations of the test sets sc2 and sc3 can be found in Table A.16 in the appendix.
- 17.
The exact numbers for the different categories of the solution status, the average computation times, and the average as well as the maximum deviations of the test sets sc4 and sc5 are given in Table A.17 in the appendix.
- 18.
The exact numbers for the different categories of the solution status, the average computation times, and the average as well as the maximum deviations of the test sets sc6 and sc7 are specified in Table A.18 in the appendix.
- 19.
The exact numbers for the different categories of the solution status, the average computation times, and the average as well as the maximum deviations of the test sets sc8 and sc9 are provided in Table A.19 in the appendix.
- 20.
The exact numbers for the different categories of the solution status, the average computation times, and the average as well as the maximum deviations of the test sets sc10 and sc11 are given in Table A.20 in the appendix.
- 21.
The exact numbers for the different categories of the solution status, the average computation times, and the average as well as the maximum deviations of the test sets sc12 and sc13 are given in Table A.21 in the appendix.
- 22.
The exact numbers for the different categories of the solution status, the average computation times, and the average as well as the maximum deviations of the test sets sc14 and sc15 are given in Table A.22 in the appendix.
- 23.
The exact numbers for the different categories of the solution status, the average computation times, and the average as well as the maximum deviations of the test sets sc16 and sc17 are given in Table A.23 in the appendix.
- 24.
The exact numbers for the different categories of the solution status, the average computation times, and the average as well as the maximum deviations of the test sets sc18 and sc19 are given in Table A.24 in the appendix.
- 25.
The exact numbers for the different categories of the solution status, the average computation times, and the average as well as the maximum deviations of the test sets sc20 and sc20 are given in Table A.25 in the appendix.
- 26.
The solution status and the box plots of the computation times and relative deviations of the instances are visualized in Figs. A.20, A.21, A.22, A.23, A.24, A.25, A.26, A.27, A.28, A.29, A.30, A.31, A.32, A.33, A.34, A.35, A.36, A.37, A.38, A.39, A.40, A.41, A.42, A.43, A.44, A.45, A.46, A.47, A.48, A.49, A.50, and A.51 in the appendix. The exact numbers for the different categories of the solution status statistics, the average computation times, and the average as well as the maximum deviations of all test sets are shown in Tables A.26, A.27, A.28, A.29, A.30, A.31, A.32, A.33, A.34, A.35, and A.36 in the appendix.
References
Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows: theory, algorithms, and applications. Prentice Hall, Englewood Cliffs
Franck B, Neumann K, Schwindt C (2001) Truncated branch-and-bound, schedule construction, and schedule-improvement procedures for resource-constrained project scheduling. OR Spectr 23(3):297–324
Heilmann R (2003) A branch-and-bound procedure for the multi-mode resource-constrained project scheduling problem with minimum and maximum time lags. Eur J Oper Res 144(2):348–365
Kolisch R, Schwindt C, Sprecher A (1999) Benchmark instances for project scheduling problems. In: Wȩglarz J (ed) Project scheduling: recent models, algorithms and applications. Kluwer Academic Publishers, Dordrecht, pp 213–238
Schwindt C (1998a) Generation of resource-constrained project scheduling problems subject to temporal constraints. Technical Report WIOR-543, University of Karlsruhe
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Weiss, I. (2019). Experimental Analysis. In: The Resource Transfer Problem. Contributions to Management Science. Springer, Cham. https://doi.org/10.1007/978-3-030-02538-0_6
Download citation
DOI: https://doi.org/10.1007/978-3-030-02538-0_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-02537-3
Online ISBN: 978-3-030-02538-0
eBook Packages: Business and ManagementBusiness and Management (R0)