Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for +publisher:"Delft University of Technology" +contributor:("van den Berg, J.L."). Showing records 1 – 2 of 2 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


Delft University of Technology

1. Huizing, Dylan (author). General methods for synchromodal planning of freight containers and transports.

Degree: 2017, Delft University of Technology

Synchromodal freight transport is introduced as intermodal transport, so container transport that uses several transportation vehicles, with an increased focus on a-modal booking, cooperation and real-time flexibility. It is confirmed that general synchromodal network planning methods are rare or non-existent at the operational level. An extensive framework is developed that describes characteristics of different mathematical synchromodal optimisation problems on the tactical-operational levels. Three different problems are defined using this framework. Solution methods for these three problems are developed in this thesis, with a focus on low computation times so as to facilitate decision-support and real-time flexibility, and a focus on generality so as to make the methods applicable throughout different organisation structures. In the first problem, it is assumed that the transportation vehicles have fixed time tables and one only has to decide on a container-to-mode assignment, so by what modality-paths all containers reach their destination against minimal total cost. The containers have release times and deadlines. A model that also allows soft due dates is developed. Moreover, the option of using trucks or other ‘infinite resources’ to help fulfil requests is added. With appropriate graph reductions, this problem can be solved to optimality in little time by solving the minimum cost multi-commodity flow problem on an appropriate space-time network. In the second problem, the goal is the same but almost any element can be stochastic: for instance, travel times and container release times could be given a discrete probability distribution rather than a fixed value. Rigorous definitions are formulated to capture the generalities in this stochasticity. Multistage stochastic optimisation and Markov Decision Processes are illustrated, but advised against for their computing time: instead, Expected Future Iteration and 70%-Pessimistic Future Iteration are developed and shown to yield near-optimal results in a small amount of time in the simulated environment. In the final problem, there are no stochastic elements, but the decision-maker is given control over the vehicle time tables in addition to the control over container-to-mode assignments. This problem is argued to be a departure from classical optimisation problems, but shown to still be strongly NP-hard. An integer linear program is developed to solve the problem, but the results show that it scales too poorly to solve problems of ‘real life size’ in an appropriate amount of time for decision support. The Greedy Gain heuristic and Compatibility Clustering heuristic are developed: they solve much more limited sub-problems with the ILP, but unfortunately, even these sub-problems require too much computational effort at the wished instance size. A number of topics for future research are formulated, giving concrete advice on how to solve the second problem more robustly and how to solve the third… Advisors/Committee Members: Gijswijt, Dion (mentor), Sangers, A (mentor), Phillipson, Frank (mentor), van den Berg, J.L. (mentor), Aardal, Karen (graduation committee), Delft University of Technology (degree granting institution).

Subjects/Keywords: synchromodal; transport; routing; optimal; general

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Huizing, D. (. (2017). General methods for synchromodal planning of freight containers and transports. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:7f8c81df-3c03-43c2-b2d7-246e4b594d3d

Chicago Manual of Style (16th Edition):

Huizing, Dylan (author). “General methods for synchromodal planning of freight containers and transports.” 2017. Masters Thesis, Delft University of Technology. Accessed November 26, 2020. http://resolver.tudelft.nl/uuid:7f8c81df-3c03-43c2-b2d7-246e4b594d3d.

MLA Handbook (7th Edition):

Huizing, Dylan (author). “General methods for synchromodal planning of freight containers and transports.” 2017. Web. 26 Nov 2020.

Vancouver:

Huizing D(. General methods for synchromodal planning of freight containers and transports. [Internet] [Masters thesis]. Delft University of Technology; 2017. [cited 2020 Nov 26]. Available from: http://resolver.tudelft.nl/uuid:7f8c81df-3c03-43c2-b2d7-246e4b594d3d.

Council of Science Editors:

Huizing D(. General methods for synchromodal planning of freight containers and transports. [Masters Thesis]. Delft University of Technology; 2017. Available from: http://resolver.tudelft.nl/uuid:7f8c81df-3c03-43c2-b2d7-246e4b594d3d

2. Gribling, S.J. (author). A local search approach to resolving capacity issues in mobile cellular networks.

Degree: 2015, Delft University of Technology

In order to help network operators with their long term planning, a (part of a) decision support system has been developed in this thesis. We have compared two local search methods and we have investigated the influence of choosing the initial state more wisely. The choice of initial state is based upon the solution of a binary program resembling the mobile cellular network.

Applied Mathematics

Delft Institute of Applied Mathematics

Electrical Engineering, Mathematics and Computer Science

Advisors/Committee Members: Aardal, K.I. (mentor), Gijswijt, D.C. (mentor), Ouboter, T. (mentor), Van den Berg, J.L. (mentor).

Subjects/Keywords: local search; binary program; decision support system; mobile cellular networks

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Gribling, S. J. (. (2015). A local search approach to resolving capacity issues in mobile cellular networks. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:6d06ef0c-72f5-4453-92c9-796826d2c0c2

Chicago Manual of Style (16th Edition):

Gribling, S J (author). “A local search approach to resolving capacity issues in mobile cellular networks.” 2015. Masters Thesis, Delft University of Technology. Accessed November 26, 2020. http://resolver.tudelft.nl/uuid:6d06ef0c-72f5-4453-92c9-796826d2c0c2.

MLA Handbook (7th Edition):

Gribling, S J (author). “A local search approach to resolving capacity issues in mobile cellular networks.” 2015. Web. 26 Nov 2020.

Vancouver:

Gribling SJ(. A local search approach to resolving capacity issues in mobile cellular networks. [Internet] [Masters thesis]. Delft University of Technology; 2015. [cited 2020 Nov 26]. Available from: http://resolver.tudelft.nl/uuid:6d06ef0c-72f5-4453-92c9-796826d2c0c2.

Council of Science Editors:

Gribling SJ(. A local search approach to resolving capacity issues in mobile cellular networks. [Masters Thesis]. Delft University of Technology; 2015. Available from: http://resolver.tudelft.nl/uuid:6d06ef0c-72f5-4453-92c9-796826d2c0c2

.