+publisher:"Delft University of Technology" +contributor:("de Weerdt, Mathijs")

Delft University of Technology

1. Ionescu, Victor (author); van der Meer, Mike (author); van Kooten, Bram (author); Paardekooper, Gijs (author). A Guide to Solving Pathfinding Problems with Multiple Agents.

Degree: 2020, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:6e38c31f-8b43-44f5-b1cd-1654d24a8e8e

► Currently, literature regarding Multiagent Path Finding (MAPF) does not give a broad enough overview of all the different approaches. Many papers are hard to read… (more)

Subjects/Keywords: Multi-agent; Path Finding; Algorithm; MAPF; CPF; Overview; Performance analysis

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Ionescu, Victor (author); van der Meer, Mike (author); van Kooten, Bram (author); Paardekooper, G. (. (2020). A Guide to Solving Pathfinding Problems with Multiple Agents. (Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:6e38c31f-8b43-44f5-b1cd-1654d24a8e8e

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Ionescu, Victor (author); van der Meer, Mike (author); van Kooten, Bram (author); Paardekooper, Gijs (author). “A Guide to Solving Pathfinding Problems with Multiple Agents.” 2020. Thesis, Delft University of Technology. Accessed January 18, 2021. http://resolver.tudelft.nl/uuid:6e38c31f-8b43-44f5-b1cd-1654d24a8e8e.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Ionescu, Victor (author); van der Meer, Mike (author); van Kooten, Bram (author); Paardekooper, Gijs (author). “A Guide to Solving Pathfinding Problems with Multiple Agents.” 2020. Web. 18 Jan 2021.

Vancouver:

Ionescu, Victor (author); van der Meer, Mike (author); van Kooten, Bram (author); Paardekooper G(. A Guide to Solving Pathfinding Problems with Multiple Agents. [Internet] [Thesis]. Delft University of Technology; 2020. [cited 2021 Jan 18]. Available from: http://resolver.tudelft.nl/uuid:6e38c31f-8b43-44f5-b1cd-1654d24a8e8e.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Ionescu, Victor (author); van der Meer, Mike (author); van Kooten, Bram (author); Paardekooper G(. A Guide to Solving Pathfinding Problems with Multiple Agents. [Thesis]. Delft University of Technology; 2020. Available from: http://resolver.tudelft.nl/uuid:6e38c31f-8b43-44f5-b1cd-1654d24a8e8e

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Delft University of Technology

2. Bao, Shiwei (author). A Robust Solution to Train Shunting using Decision Trees.

Degree: 2018, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:9acb3bd1-1ffb-4ebb-b886-f10c7291b101

► This research tackles the Train Unit Shunting Problem (TUSP) in train maintenance service sites. Many researches focus on producing feasible solutions, but only a few… (more)

Subjects/Keywords: train shunting; decision trees; Robust

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Bao, S. (. (2018). A Robust Solution to Train Shunting using Decision Trees. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:9acb3bd1-1ffb-4ebb-b886-f10c7291b101

Chicago Manual of Style (16^th Edition):

Bao, Shiwei (author). “A Robust Solution to Train Shunting using Decision Trees.” 2018. Masters Thesis, Delft University of Technology. Accessed January 18, 2021. http://resolver.tudelft.nl/uuid:9acb3bd1-1ffb-4ebb-b886-f10c7291b101.

MLA Handbook (7^th Edition):

Bao, Shiwei (author). “A Robust Solution to Train Shunting using Decision Trees.” 2018. Web. 18 Jan 2021.

Vancouver:

Bao S(. A Robust Solution to Train Shunting using Decision Trees. [Internet] [Masters thesis]. Delft University of Technology; 2018. [cited 2021 Jan 18]. Available from: http://resolver.tudelft.nl/uuid:9acb3bd1-1ffb-4ebb-b886-f10c7291b101.

Council of Science Editors:

Bao S(. A Robust Solution to Train Shunting using Decision Trees. [Masters Thesis]. Delft University of Technology; 2018. Available from: http://resolver.tudelft.nl/uuid:9acb3bd1-1ffb-4ebb-b886-f10c7291b101

Delft University of Technology

3. van Kreveld, Ivo (author). Distributing tasks in committees: An algorithmic research in a cooperative game theory problem.

Degree: 2020, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:b9c9992b-e6f7-49d8-8c94-4fc7c25f7093

►

Cooperative game theory studies multi-agent environments where agents are able to make binding agreements. A lot has been written about dividing goods or other positive… (more)

Subjects/Keywords: Game Theory; Cooperative Games; Strategyproofness; Fair Division; Task Distribution; Computational Complexity

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

van Kreveld, I. (. (2020). Distributing tasks in committees: An algorithmic research in a cooperative game theory problem. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:b9c9992b-e6f7-49d8-8c94-4fc7c25f7093

Chicago Manual of Style (16^th Edition):

van Kreveld, Ivo (author). “Distributing tasks in committees: An algorithmic research in a cooperative game theory problem.” 2020. Masters Thesis, Delft University of Technology. Accessed January 18, 2021. http://resolver.tudelft.nl/uuid:b9c9992b-e6f7-49d8-8c94-4fc7c25f7093.

MLA Handbook (7^th Edition):

van Kreveld, Ivo (author). “Distributing tasks in committees: An algorithmic research in a cooperative game theory problem.” 2020. Web. 18 Jan 2021.

Vancouver:

van Kreveld I(. Distributing tasks in committees: An algorithmic research in a cooperative game theory problem. [Internet] [Masters thesis]. Delft University of Technology; 2020. [cited 2021 Jan 18]. Available from: http://resolver.tudelft.nl/uuid:b9c9992b-e6f7-49d8-8c94-4fc7c25f7093.

Council of Science Editors:

van Kreveld I(. Distributing tasks in committees: An algorithmic research in a cooperative game theory problem. [Masters Thesis]. Delft University of Technology; 2020. Available from: http://resolver.tudelft.nl/uuid:b9c9992b-e6f7-49d8-8c94-4fc7c25f7093

Delft University of Technology

4. Elghlan, Faris (author). One-Class Classification: for high-dimensional data.

Degree: 2019, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:b5aabe84-8a8b-4841-848d-136ab6ce0825

►

This M.Sc. thesis report investigates the application of one-class classification techniques to complex high-dimensional data. The aim of a one-class classifier is to separate target… (more)

Subjects/Keywords: one-class; classification; high-dimensional; Autoencoder; GAN; Wasserstein Autoencoder; Pattern Recognition; Machine Learning; Deep Learning

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Elghlan, F. (. (2019). One-Class Classification: for high-dimensional data. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:b5aabe84-8a8b-4841-848d-136ab6ce0825

Chicago Manual of Style (16^th Edition):

Elghlan, Faris (author). “One-Class Classification: for high-dimensional data.” 2019. Masters Thesis, Delft University of Technology. Accessed January 18, 2021. http://resolver.tudelft.nl/uuid:b5aabe84-8a8b-4841-848d-136ab6ce0825.

MLA Handbook (7^th Edition):

Elghlan, Faris (author). “One-Class Classification: for high-dimensional data.” 2019. Web. 18 Jan 2021.

Vancouver:

Elghlan F(. One-Class Classification: for high-dimensional data. [Internet] [Masters thesis]. Delft University of Technology; 2019. [cited 2021 Jan 18]. Available from: http://resolver.tudelft.nl/uuid:b5aabe84-8a8b-4841-848d-136ab6ce0825.

Council of Science Editors:

Elghlan F(. One-Class Classification: for high-dimensional data. [Masters Thesis]. Delft University of Technology; 2019. Available from: http://resolver.tudelft.nl/uuid:b5aabe84-8a8b-4841-848d-136ab6ce0825

Delft University of Technology

5. Guijt, Arthur (author). Encoding OAS: Solving order acceptance and scheduling with modified black box approaches.

Degree: 2019, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:8f6e1f9e-a3ef-4067-bb61-0893c790f044

► In many real world scheduling problems there exist hard deadlines after which tasks can no longer be performed. Conversely, not all tasks are necessarily required… (more)

Subjects/Keywords: order acceptance and scheduling; Evolutionary Algorithms; optimization algorithms; Permutation problem

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Guijt, A. (. (2019). Encoding OAS: Solving order acceptance and scheduling with modified black box approaches. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:8f6e1f9e-a3ef-4067-bb61-0893c790f044

Chicago Manual of Style (16^th Edition):

Guijt, Arthur (author). “Encoding OAS: Solving order acceptance and scheduling with modified black box approaches.” 2019. Masters Thesis, Delft University of Technology. Accessed January 18, 2021. http://resolver.tudelft.nl/uuid:8f6e1f9e-a3ef-4067-bb61-0893c790f044.

MLA Handbook (7^th Edition):

Guijt, Arthur (author). “Encoding OAS: Solving order acceptance and scheduling with modified black box approaches.” 2019. Web. 18 Jan 2021.

Vancouver:

Guijt A(. Encoding OAS: Solving order acceptance and scheduling with modified black box approaches. [Internet] [Masters thesis]. Delft University of Technology; 2019. [cited 2021 Jan 18]. Available from: http://resolver.tudelft.nl/uuid:8f6e1f9e-a3ef-4067-bb61-0893c790f044.

Council of Science Editors:

Guijt A(. Encoding OAS: Solving order acceptance and scheduling with modified black box approaches. [Masters Thesis]. Delft University of Technology; 2019. Available from: http://resolver.tudelft.nl/uuid:8f6e1f9e-a3ef-4067-bb61-0893c790f044

Delft University of Technology

6. Festen, David (author). Evaluating Multiparty Multilateral Turn-Taking Negotiation Protocols.

Degree: 2018, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:2d9bc31b-9bc3-4cac-a69f-3c1c06cd5f7f

► In order to be accepted by negotiating parties, negotiation protocols need to be fair and unbiased. We extend the bilateral turn-taking negotiation protocol to multiparty… (more)

Subjects/Keywords: Genius; Automated Negotiation; Multilateral; Turn-taking; Negotiations; Multiparty; Protocol; Protocol Evaluation

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Festen, D. (. (2018). Evaluating Multiparty Multilateral Turn-Taking Negotiation Protocols. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:2d9bc31b-9bc3-4cac-a69f-3c1c06cd5f7f

Chicago Manual of Style (16^th Edition):

Festen, David (author). “Evaluating Multiparty Multilateral Turn-Taking Negotiation Protocols.” 2018. Masters Thesis, Delft University of Technology. Accessed January 18, 2021. http://resolver.tudelft.nl/uuid:2d9bc31b-9bc3-4cac-a69f-3c1c06cd5f7f.

MLA Handbook (7^th Edition):

Festen, David (author). “Evaluating Multiparty Multilateral Turn-Taking Negotiation Protocols.” 2018. Web. 18 Jan 2021.

Vancouver:

Festen D(. Evaluating Multiparty Multilateral Turn-Taking Negotiation Protocols. [Internet] [Masters thesis]. Delft University of Technology; 2018. [cited 2021 Jan 18]. Available from: http://resolver.tudelft.nl/uuid:2d9bc31b-9bc3-4cac-a69f-3c1c06cd5f7f.

Council of Science Editors:

Festen D(. Evaluating Multiparty Multilateral Turn-Taking Negotiation Protocols. [Masters Thesis]. Delft University of Technology; 2018. Available from: http://resolver.tudelft.nl/uuid:2d9bc31b-9bc3-4cac-a69f-3c1c06cd5f7f

Delft University of Technology

7. Zhong, Shijian (author). Solving Train Maintenance Scheduling Problem with Neural Networks and Tree Search.

Degree: 2018, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:71cf86fd-64a7-4bd0-bcbd-e9635727e972

►

The Train Maintenance Scheduling Problem (TMSP) is a real-world problem that aims at complete maintenance tasks of trains by scheduling their activities on a service… (more)

Subjects/Keywords: Train Maintenance Scheduling Problem; Reactive Agent; Supervised Learning; Neural Networks; Tree Search

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Zhong, S. (. (2018). Solving Train Maintenance Scheduling Problem with Neural Networks and Tree Search. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:71cf86fd-64a7-4bd0-bcbd-e9635727e972

Chicago Manual of Style (16^th Edition):

Zhong, Shijian (author). “Solving Train Maintenance Scheduling Problem with Neural Networks and Tree Search.” 2018. Masters Thesis, Delft University of Technology. Accessed January 18, 2021. http://resolver.tudelft.nl/uuid:71cf86fd-64a7-4bd0-bcbd-e9635727e972.

MLA Handbook (7^th Edition):

Zhong, Shijian (author). “Solving Train Maintenance Scheduling Problem with Neural Networks and Tree Search.” 2018. Web. 18 Jan 2021.

Vancouver:

Zhong S(. Solving Train Maintenance Scheduling Problem with Neural Networks and Tree Search. [Internet] [Masters thesis]. Delft University of Technology; 2018. [cited 2021 Jan 18]. Available from: http://resolver.tudelft.nl/uuid:71cf86fd-64a7-4bd0-bcbd-e9635727e972.

Council of Science Editors:

Zhong S(. Solving Train Maintenance Scheduling Problem with Neural Networks and Tree Search. [Masters Thesis]. Delft University of Technology; 2018. Available from: http://resolver.tudelft.nl/uuid:71cf86fd-64a7-4bd0-bcbd-e9635727e972

Delft University of Technology

8. Hugtenburg, Stefan (author). Reducing the need for communication in wireless sensor networks using machine learning and planning techniques.

Degree: 2017, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:637213b2-c46a-4a07-b740-21d6c4742b93

► Wireless sensor networks are commonly used to remotely and automatically monitor environments. One of the main challenges in wireless sensor networks is to use the… (more)

Subjects/Keywords: wireless sensor networks; Machine Learning; POMDP; neural networks; planning; energy conservation

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Hugtenburg, S. (. (2017). Reducing the need for communication in wireless sensor networks using machine learning and planning techniques. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:637213b2-c46a-4a07-b740-21d6c4742b93

Chicago Manual of Style (16^th Edition):

Hugtenburg, Stefan (author). “Reducing the need for communication in wireless sensor networks using machine learning and planning techniques.” 2017. Masters Thesis, Delft University of Technology. Accessed January 18, 2021. http://resolver.tudelft.nl/uuid:637213b2-c46a-4a07-b740-21d6c4742b93.

MLA Handbook (7^th Edition):

Hugtenburg, Stefan (author). “Reducing the need for communication in wireless sensor networks using machine learning and planning techniques.” 2017. Web. 18 Jan 2021.

Vancouver:

Hugtenburg S(. Reducing the need for communication in wireless sensor networks using machine learning and planning techniques. [Internet] [Masters thesis]. Delft University of Technology; 2017. [cited 2021 Jan 18]. Available from: http://resolver.tudelft.nl/uuid:637213b2-c46a-4a07-b740-21d6c4742b93.

Council of Science Editors:

Hugtenburg S(. Reducing the need for communication in wireless sensor networks using machine learning and planning techniques. [Masters Thesis]. Delft University of Technology; 2017. Available from: http://resolver.tudelft.nl/uuid:637213b2-c46a-4a07-b740-21d6c4742b93

Delft University of Technology

9. Renting, Bram (author). Strategy Configuration and Selection for Automated Negotiation Agents.

Degree: 2019, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:11718a0a-8c07-40eb-a812-8364ffaea514

► Negotiation is the art of resolving conflicts of interests by finding outcomes that all parties agree with. Humans negotiate often, as there are many conflicts… (more)

Subjects/Keywords: Automated Negotiation; Algorithm Configuration; Algorithm Selection; Opponent Modelling

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Renting, B. (. (2019). Strategy Configuration and Selection for Automated Negotiation Agents. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:11718a0a-8c07-40eb-a812-8364ffaea514

Chicago Manual of Style (16^th Edition):

Renting, Bram (author). “Strategy Configuration and Selection for Automated Negotiation Agents.” 2019. Masters Thesis, Delft University of Technology. Accessed January 18, 2021. http://resolver.tudelft.nl/uuid:11718a0a-8c07-40eb-a812-8364ffaea514.

MLA Handbook (7^th Edition):

Renting, Bram (author). “Strategy Configuration and Selection for Automated Negotiation Agents.” 2019. Web. 18 Jan 2021.

Vancouver:

Renting B(. Strategy Configuration and Selection for Automated Negotiation Agents. [Internet] [Masters thesis]. Delft University of Technology; 2019. [cited 2021 Jan 18]. Available from: http://resolver.tudelft.nl/uuid:11718a0a-8c07-40eb-a812-8364ffaea514.

Council of Science Editors:

Renting B(. Strategy Configuration and Selection for Automated Negotiation Agents. [Masters Thesis]. Delft University of Technology; 2019. Available from: http://resolver.tudelft.nl/uuid:11718a0a-8c07-40eb-a812-8364ffaea514

Delft University of Technology

10. van Elsas, Maarten (author). The Complexity of Stability: In Parallel Processor Scheduling.

Degree: 2019, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:d5db27f8-75c1-4633-ae95-4404a42e03de

► In dynamic scheduling, some of the information about the scheduling problem is learnt during the execution of the schedule. Because of this, creating a low… (more)

Subjects/Keywords: Planning under Uncertainty; Stability; Scheduling Repair; Complexity; Partial Order Schedules

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

van Elsas, M. (. (2019). The Complexity of Stability: In Parallel Processor Scheduling. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:d5db27f8-75c1-4633-ae95-4404a42e03de

Chicago Manual of Style (16^th Edition):

van Elsas, Maarten (author). “The Complexity of Stability: In Parallel Processor Scheduling.” 2019. Masters Thesis, Delft University of Technology. Accessed January 18, 2021. http://resolver.tudelft.nl/uuid:d5db27f8-75c1-4633-ae95-4404a42e03de.

MLA Handbook (7^th Edition):

van Elsas, Maarten (author). “The Complexity of Stability: In Parallel Processor Scheduling.” 2019. Web. 18 Jan 2021.

Vancouver:

van Elsas M(. The Complexity of Stability: In Parallel Processor Scheduling. [Internet] [Masters thesis]. Delft University of Technology; 2019. [cited 2021 Jan 18]. Available from: http://resolver.tudelft.nl/uuid:d5db27f8-75c1-4633-ae95-4404a42e03de.

Council of Science Editors:

van Elsas M(. The Complexity of Stability: In Parallel Processor Scheduling. [Masters Thesis]. Delft University of Technology; 2019. Available from: http://resolver.tudelft.nl/uuid:d5db27f8-75c1-4633-ae95-4404a42e03de

Delft University of Technology

11. Kole, Sjors (author). Constructing level-2 phylogenetic networks from trinets.

Degree: 2020, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:c699ea63-f8c8-40f7-8f07-11ac055c42e0

►

Phylogenetic networks are a generalization of evolutionary trees that can be used to represent reticulate events. Level-k phylogenetic networks are such networks, but with a… (more)

Subjects/Keywords: networks reconstruction; phylogenetic networks; reticulate evolution; supernetwork

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Kole, S. (. (2020). Constructing level-2 phylogenetic networks from trinets. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:c699ea63-f8c8-40f7-8f07-11ac055c42e0

Chicago Manual of Style (16^th Edition):

Kole, Sjors (author). “Constructing level-2 phylogenetic networks from trinets.” 2020. Masters Thesis, Delft University of Technology. Accessed January 18, 2021. http://resolver.tudelft.nl/uuid:c699ea63-f8c8-40f7-8f07-11ac055c42e0.

MLA Handbook (7^th Edition):

Kole, Sjors (author). “Constructing level-2 phylogenetic networks from trinets.” 2020. Web. 18 Jan 2021.

Vancouver:

Kole S(. Constructing level-2 phylogenetic networks from trinets. [Internet] [Masters thesis]. Delft University of Technology; 2020. [cited 2021 Jan 18]. Available from: http://resolver.tudelft.nl/uuid:c699ea63-f8c8-40f7-8f07-11ac055c42e0.

Council of Science Editors:

Kole S(. Constructing level-2 phylogenetic networks from trinets. [Masters Thesis]. Delft University of Technology; 2020. Available from: http://resolver.tudelft.nl/uuid:c699ea63-f8c8-40f7-8f07-11ac055c42e0

Delft University of Technology

12. Baart, Robert (author). Algorithms for a bounded-width order acceptance and scheduling problem with sequence-dependent setup time using decision diagrams.

Degree: 2018, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:2f9cbec9-d724-4b65-828e-d3ef2772537d

►

Order acceptance and scheduling problems (OAS) is a category of problems where the decision of which jobs to schedule and how to schedule them is… (more)

Subjects/Keywords: order acceptance and scheduling; decision diagrams

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Baart, R. (. (2018). Algorithms for a bounded-width order acceptance and scheduling problem with sequence-dependent setup time using decision diagrams. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:2f9cbec9-d724-4b65-828e-d3ef2772537d

Chicago Manual of Style (16^th Edition):

Baart, Robert (author). “Algorithms for a bounded-width order acceptance and scheduling problem with sequence-dependent setup time using decision diagrams.” 2018. Masters Thesis, Delft University of Technology. Accessed January 18, 2021. http://resolver.tudelft.nl/uuid:2f9cbec9-d724-4b65-828e-d3ef2772537d.

MLA Handbook (7^th Edition):

Baart, Robert (author). “Algorithms for a bounded-width order acceptance and scheduling problem with sequence-dependent setup time using decision diagrams.” 2018. Web. 18 Jan 2021.

Vancouver:

Baart R(. Algorithms for a bounded-width order acceptance and scheduling problem with sequence-dependent setup time using decision diagrams. [Internet] [Masters thesis]. Delft University of Technology; 2018. [cited 2021 Jan 18]. Available from: http://resolver.tudelft.nl/uuid:2f9cbec9-d724-4b65-828e-d3ef2772537d.

Council of Science Editors:

Baart R(. Algorithms for a bounded-width order acceptance and scheduling problem with sequence-dependent setup time using decision diagrams. [Masters Thesis]. Delft University of Technology; 2018. Available from: http://resolver.tudelft.nl/uuid:2f9cbec9-d724-4b65-828e-d3ef2772537d

Delft University of Technology

13. Dai, Lu (author). A machine learning approach for optimisation in railway planning.

Degree: 2018, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:20170a8c-7e1e-434f-b5d6-9ba933e2ab6e

►

Planning and scheduling problem is a hard problem, especially in real life cases. The time and space complexity increase quickly along with the increase of… (more)

▼

Planning and scheduling problem is a hard problem, especially in real life cases. The time and space complexity increase quickly along with the increase of problem size. In transportation systems, such problems exist a lot. The automation of transportation systems depends a lot on the improvements of developing planning and scheduling algorithm. Nowadays, machine learning, as modern technology, has been adopted in every field. The power of machine learning is its ability to obtain useful information from large datasets. Considering problem instance information and corresponding solution status as data and label respectively, there is the possibility that the solvable instances hold patterns in common. This is where machine learning comes into the stage. This research is focusing on how to combine machine learning with traditional planning and scheduling algorithm based on the Dutch Railway System. Specifically, making use of a large amount of stored instance and solution details to improve the service site planning process is our purpose. Combing machine learning and traditional scheduling system is a new and hard topic. In this work, we implement a machine learning system adapting to the scheduling algorithm content. We define and collect dataset matching our research goals. A framework is designed according to the imbalanced characteristics of our datasets. To explore the nature of algorithms, we choose to calculate features from the problem instances and scheduling process directly. Besides, we perform a high vol- ume of experiments to select the based machine learning techniques to adopt. What’s more, we also design a test framework to evaluate our machine learning systems. Im- provements are observed in our work. Additionally, we would like to explore the features and machine learning techniques to improve the performance in the future work.

Computer Engineering | Algorithmics

Advisors/Committee Members: Verwer, Sicco (mentor), de Weerdt, Mathijs (graduation committee), Tax, David (graduation committee), Delft University of Technology (degree granting institution).

Subjects/Keywords: Planning & scheduling algorithms; Machine learning; Local search algorithm; Imbalanced learning; Feature extraction

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Dai, L. (. (2018). A machine learning approach for optimisation in railway planning. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:20170a8c-7e1e-434f-b5d6-9ba933e2ab6e

Chicago Manual of Style (16^th Edition):

Dai, Lu (author). “A machine learning approach for optimisation in railway planning.” 2018. Masters Thesis, Delft University of Technology. Accessed January 18, 2021. http://resolver.tudelft.nl/uuid:20170a8c-7e1e-434f-b5d6-9ba933e2ab6e.

MLA Handbook (7^th Edition):

Dai, Lu (author). “A machine learning approach for optimisation in railway planning.” 2018. Web. 18 Jan 2021.

Vancouver:

Dai L(. A machine learning approach for optimisation in railway planning. [Internet] [Masters thesis]. Delft University of Technology; 2018. [cited 2021 Jan 18]. Available from: http://resolver.tudelft.nl/uuid:20170a8c-7e1e-434f-b5d6-9ba933e2ab6e.

Council of Science Editors:

Dai L(. A machine learning approach for optimisation in railway planning. [Masters Thesis]. Delft University of Technology; 2018. Available from: http://resolver.tudelft.nl/uuid:20170a8c-7e1e-434f-b5d6-9ba933e2ab6e

Delft University of Technology

14. van Vuuren, Bart (author). Route plan scheduling for automated guided vehicles at container terminals.

Degree: 2017, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:21aab98c-6d59-4bff-85c0-a6a164624e02

► Heavy competition between container terminals and the increasing volume of world-wide container shipment force container terminals to continuously increase productivity and reduce costs. An important… (more)

▼ Heavy competition between container terminals and the increasing volume of world-wide container shipment force container terminals to continuously increase productivity and reduce costs. An important condition for optimal operation of container terminals is that Quay Cranes (QCs) maximize their productive time, which requires a minimal lateness of Automated Guided Vehicles (AGVs) that bring and pick up containers at the QCs. In this research, the AGV driving strategy is investigated in order to reduce the time QCs are waiting for an AGV. A route plan scheduling module for AGVs is developed, in which the central system plans the driving positions of AGVs in advance, and determines in what order AGVs should cross intersections. For priority determination, a first-come first-served strategy is compared with an advanced priority strategy that gives priority to AGVs that are late or have an important job, like bringing a container to a QC. Furthermore, the impact of AGVs' greediness for crossing intersections is investigated by comparing a greedy strategy with a non-greedy strategy. By testing the priority and greediness strategies in a state-of-the-art simulation environment that was extended with our route plan scheduling module, it is found that advanced priorities reduce QC waiting time and improve QC productivity compared to the first-come first-served priority strategy. The non-greedy strategy gives a small decrease of the AGV driving delay compared to the greedy strategy. To investigate the full potential of using advanced priorities in a system with route plan scheduling, the route plans should better predict the AGV driving behavior, for which we suggest to use a more detailed AGV planning strategy. Finally, we discuss that AGV driving with reduced inter-vehicle distance is a promising approach to improve terminal performance. Advisors/Committee Members: Spaan, Matthijs (mentor), de Weerdt, Mathijs (graduation committee), Kuipers, Fernando (graduation committee), Bast, G.J, (graduation committee), Delft University of Technology (degree granting institution).

Subjects/Keywords: Container terminal; automated guided vehicle; scheduling; planning

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

van Vuuren, B. (. (2017). Route plan scheduling for automated guided vehicles at container terminals. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:21aab98c-6d59-4bff-85c0-a6a164624e02

Chicago Manual of Style (16^th Edition):

van Vuuren, Bart (author). “Route plan scheduling for automated guided vehicles at container terminals.” 2017. Masters Thesis, Delft University of Technology. Accessed January 18, 2021. http://resolver.tudelft.nl/uuid:21aab98c-6d59-4bff-85c0-a6a164624e02.

MLA Handbook (7^th Edition):

van Vuuren, Bart (author). “Route plan scheduling for automated guided vehicles at container terminals.” 2017. Web. 18 Jan 2021.

Vancouver:

van Vuuren B(. Route plan scheduling for automated guided vehicles at container terminals. [Internet] [Masters thesis]. Delft University of Technology; 2017. [cited 2021 Jan 18]. Available from: http://resolver.tudelft.nl/uuid:21aab98c-6d59-4bff-85c0-a6a164624e02.

Council of Science Editors:

van Vuuren B(. Route plan scheduling for automated guided vehicles at container terminals. [Masters Thesis]. Delft University of Technology; 2017. Available from: http://resolver.tudelft.nl/uuid:21aab98c-6d59-4bff-85c0-a6a164624e02

Delft University of Technology

15. van den Bogaerdt, Pim (author). Multi-Machine Scheduling Lower Bounds Using Decision Diagrams.

Degree: 2018, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:c234fa84-6916-400c-8eb4-c8a1146423ea

► We investigate the use of relaxed decision diagrams for obtaining lower bounds on multi-machine scheduling problems. The type of scheduling problem we consider models a… (more)

Subjects/Keywords: scheduling; decision diagrams; lower bounds; relaxation

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

van den Bogaerdt, P. (. (2018). Multi-Machine Scheduling Lower Bounds Using Decision Diagrams. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:c234fa84-6916-400c-8eb4-c8a1146423ea

Chicago Manual of Style (16^th Edition):

van den Bogaerdt, Pim (author). “Multi-Machine Scheduling Lower Bounds Using Decision Diagrams.” 2018. Masters Thesis, Delft University of Technology. Accessed January 18, 2021. http://resolver.tudelft.nl/uuid:c234fa84-6916-400c-8eb4-c8a1146423ea.

MLA Handbook (7^th Edition):

van den Bogaerdt, Pim (author). “Multi-Machine Scheduling Lower Bounds Using Decision Diagrams.” 2018. Web. 18 Jan 2021.

Vancouver:

van den Bogaerdt P(. Multi-Machine Scheduling Lower Bounds Using Decision Diagrams. [Internet] [Masters thesis]. Delft University of Technology; 2018. [cited 2021 Jan 18]. Available from: http://resolver.tudelft.nl/uuid:c234fa84-6916-400c-8eb4-c8a1146423ea.

Council of Science Editors:

van den Bogaerdt P(. Multi-Machine Scheduling Lower Bounds Using Decision Diagrams. [Masters Thesis]. Delft University of Technology; 2018. Available from: http://resolver.tudelft.nl/uuid:c234fa84-6916-400c-8eb4-c8a1146423ea

Delft University of Technology

16. Mandersloot, Jeroen (author). Model-based rare category detection for temporal data.

Degree: 2018, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:80755ee1-95c9-4b7d-b828-fff818ceadd4

► Rare category detection is the task of discovering rare classes in unlabelled and imbalanced datasets. Existing algorithms focus almost exclusively on static data in which… (more)

Subjects/Keywords: rare category detection; temporal data; semi-supervised learning; mixture models; markov random fields

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Mandersloot, J. (. (2018). Model-based rare category detection for temporal data. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:80755ee1-95c9-4b7d-b828-fff818ceadd4

Chicago Manual of Style (16^th Edition):

Mandersloot, Jeroen (author). “Model-based rare category detection for temporal data.” 2018. Masters Thesis, Delft University of Technology. Accessed January 18, 2021. http://resolver.tudelft.nl/uuid:80755ee1-95c9-4b7d-b828-fff818ceadd4.

MLA Handbook (7^th Edition):

Mandersloot, Jeroen (author). “Model-based rare category detection for temporal data.” 2018. Web. 18 Jan 2021.

Vancouver:

Mandersloot J(. Model-based rare category detection for temporal data. [Internet] [Masters thesis]. Delft University of Technology; 2018. [cited 2021 Jan 18]. Available from: http://resolver.tudelft.nl/uuid:80755ee1-95c9-4b7d-b828-fff818ceadd4.

Council of Science Editors:

Mandersloot J(. Model-based rare category detection for temporal data. [Masters Thesis]. Delft University of Technology; 2018. Available from: http://resolver.tudelft.nl/uuid:80755ee1-95c9-4b7d-b828-fff818ceadd4

Delft University of Technology

17. Verburg, Floris (author). Improving RCPSP algorithms using machine learning methods.

Degree: 2018, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:82c2c44b-c3d6-4d9a-9b2f-49a0f71eb1a3

► For performing technical maintenance, it is important to keep a detailed schedule of resources and temporal constraints. The Resource Constrained Project Scheduling Problem (RCPSP) is… (more)

Subjects/Keywords: Scheduling; Maintenance scheduling; Resource Constrained Project Scheduling Problem; Precedence Constraint Posting; Machine learning; Monte Carlo simulation

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Verburg, F. (. (2018). Improving RCPSP algorithms using machine learning methods. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:82c2c44b-c3d6-4d9a-9b2f-49a0f71eb1a3

Chicago Manual of Style (16^th Edition):

Verburg, Floris (author). “Improving RCPSP algorithms using machine learning methods.” 2018. Masters Thesis, Delft University of Technology. Accessed January 18, 2021. http://resolver.tudelft.nl/uuid:82c2c44b-c3d6-4d9a-9b2f-49a0f71eb1a3.

MLA Handbook (7^th Edition):

Verburg, Floris (author). “Improving RCPSP algorithms using machine learning methods.” 2018. Web. 18 Jan 2021.

Vancouver:

Verburg F(. Improving RCPSP algorithms using machine learning methods. [Internet] [Masters thesis]. Delft University of Technology; 2018. [cited 2021 Jan 18]. Available from: http://resolver.tudelft.nl/uuid:82c2c44b-c3d6-4d9a-9b2f-49a0f71eb1a3.

Council of Science Editors:

Verburg F(. Improving RCPSP algorithms using machine learning methods. [Masters Thesis]. Delft University of Technology; 2018. Available from: http://resolver.tudelft.nl/uuid:82c2c44b-c3d6-4d9a-9b2f-49a0f71eb1a3

Delft University of Technology

18. van der Linden, Koos (author). Decision diagrams for decomposed mixed integer linear programs.

Degree: 2017, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:57e43a69-e380-4917-9598-097710379b9f

►

A recent development in the field of discrete optimization is the combined use of (binary) decision diagrams (DD) and branch and bound for optimization. This… (more)

Subjects/Keywords: Decision diagrams; Mixed integer programming; Benders decomposition

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

van der Linden, K. (. (2017). Decision diagrams for decomposed mixed integer linear programs. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:57e43a69-e380-4917-9598-097710379b9f

Chicago Manual of Style (16^th Edition):

van der Linden, Koos (author). “Decision diagrams for decomposed mixed integer linear programs.” 2017. Masters Thesis, Delft University of Technology. Accessed January 18, 2021. http://resolver.tudelft.nl/uuid:57e43a69-e380-4917-9598-097710379b9f.

MLA Handbook (7^th Edition):

van der Linden, Koos (author). “Decision diagrams for decomposed mixed integer linear programs.” 2017. Web. 18 Jan 2021.

Vancouver:

van der Linden K(. Decision diagrams for decomposed mixed integer linear programs. [Internet] [Masters thesis]. Delft University of Technology; 2017. [cited 2021 Jan 18]. Available from: http://resolver.tudelft.nl/uuid:57e43a69-e380-4917-9598-097710379b9f.

Council of Science Editors:

van der Linden K(. Decision diagrams for decomposed mixed integer linear programs. [Masters Thesis]. Delft University of Technology; 2017. Available from: http://resolver.tudelft.nl/uuid:57e43a69-e380-4917-9598-097710379b9f

Delft University of Technology

19. Oudshoorn, Kaj (author). Game Theoretic Stable Microgrid Formation in the Electricity Grid.

Degree: 2017, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:5a3dedef-fa1e-4d79-8d4e-5fbd7f0e9875

► The current architecture of the power grid is outdated and will not provide the means to deal with the decentralization of energy sources. The smart… (more)

Subjects/Keywords: Microgrids; Stable Graph Partitioning; Coalition Theory; Algorithm

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Oudshoorn, K. (. (2017). Game Theoretic Stable Microgrid Formation in the Electricity Grid. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:5a3dedef-fa1e-4d79-8d4e-5fbd7f0e9875

Chicago Manual of Style (16^th Edition):

Oudshoorn, Kaj (author). “Game Theoretic Stable Microgrid Formation in the Electricity Grid.” 2017. Masters Thesis, Delft University of Technology. Accessed January 18, 2021. http://resolver.tudelft.nl/uuid:5a3dedef-fa1e-4d79-8d4e-5fbd7f0e9875.

MLA Handbook (7^th Edition):

Oudshoorn, Kaj (author). “Game Theoretic Stable Microgrid Formation in the Electricity Grid.” 2017. Web. 18 Jan 2021.

Vancouver:

Oudshoorn K(. Game Theoretic Stable Microgrid Formation in the Electricity Grid. [Internet] [Masters thesis]. Delft University of Technology; 2017. [cited 2021 Jan 18]. Available from: http://resolver.tudelft.nl/uuid:5a3dedef-fa1e-4d79-8d4e-5fbd7f0e9875.

Council of Science Editors:

Oudshoorn K(. Game Theoretic Stable Microgrid Formation in the Electricity Grid. [Masters Thesis]. Delft University of Technology; 2017. Available from: http://resolver.tudelft.nl/uuid:5a3dedef-fa1e-4d79-8d4e-5fbd7f0e9875

Delft University of Technology

20. Stegman, Lars (author). Optimising District Heating Operations.

Degree: 2019, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:54f53b4b-1ab9-4964-8099-2251c3af3bd2

► District heating systems (DHS) are considered the best alternative to individual heat boilers as they have higher efficiency and enable the use of sustainable heat… (more)

Subjects/Keywords: district heating; District Heating Network; Optimisation; metaheuristics

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Stegman, L. (. (2019). Optimising District Heating Operations. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:54f53b4b-1ab9-4964-8099-2251c3af3bd2

Chicago Manual of Style (16^th Edition):

Stegman, Lars (author). “Optimising District Heating Operations.” 2019. Masters Thesis, Delft University of Technology. Accessed January 18, 2021. http://resolver.tudelft.nl/uuid:54f53b4b-1ab9-4964-8099-2251c3af3bd2.

MLA Handbook (7^th Edition):

Stegman, Lars (author). “Optimising District Heating Operations.” 2019. Web. 18 Jan 2021.

Vancouver:

Stegman L(. Optimising District Heating Operations. [Internet] [Masters thesis]. Delft University of Technology; 2019. [cited 2021 Jan 18]. Available from: http://resolver.tudelft.nl/uuid:54f53b4b-1ab9-4964-8099-2251c3af3bd2.

Council of Science Editors:

Stegman L(. Optimising District Heating Operations. [Masters Thesis]. Delft University of Technology; 2019. Available from: http://resolver.tudelft.nl/uuid:54f53b4b-1ab9-4964-8099-2251c3af3bd2

Delft University of Technology

21. Popping, Sven (author). Automated crash fault localization.

Degree: 2020, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:da6486bd-886c-44ac-832a-f9825f6a2ba8

►

Debugging application crashes is an expensive and time-taking process, relying on the developer’s expertise, and requiring knowledge about the system. Over the years, the research… (more)

▼

Debugging application crashes is an expensive and time-taking process, relying on the developer’s expertise, and requiring knowledge about the system. Over the years, the research community has developed several automated approaches to ease debugging. Among those approaches, search-based crash reproduction, which tries to generate a test case capable of reproducing a given crash to make it observable to the developers, solely based on the stack trace included in the crash report. We believe that this makes crash reproduction the perfect candidate to achieve end-to-end crash fault localization. In this thesis, we explore and empirically evaluate the usage of search-based crash reproduction combined with spectrum-based fault localization on 50 real-world crashes. Starting from a crash report, we generate crash-reproducing test cases and use them in conjunction with the existing or an automatically generated unit test suite as input for spectrum-based fault localization. Our results show that, although, hand-written test cases remain the most efficient in the general scenario, automatically generated crash-reproducing test cases still reduce the number of statements to be investigated by developers. Additionally, when considering the best-case scenario where only crash-reproducing test cases covering the fault are evaluated, we observe no statistically significant difference between the accuracy of fault localization when using hand-written or automatically generated test cases. Our results confirm the feasibility of end-to-end automated crash fault localization. The results also identify new challenges for both automated test case generation and fault localization, as well as when they are combined.

Computer Science

Advisors/Committee Members: van Deursen, Arie (mentor), Devroey, Xavier (mentor), Panichella, Annibale (graduation committee), de Weerdt, Mathijs (graduation committee), Derakhshanfar, Pouria (graduation committee), Delft University of Technology (degree granting institution).

Subjects/Keywords: Search-Based Crash Reproduction; Automated Fault Localization; Search-based Software Engineering

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Popping, S. (. (2020). Automated crash fault localization. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:da6486bd-886c-44ac-832a-f9825f6a2ba8

Chicago Manual of Style (16^th Edition):

Popping, Sven (author). “Automated crash fault localization.” 2020. Masters Thesis, Delft University of Technology. Accessed January 18, 2021. http://resolver.tudelft.nl/uuid:da6486bd-886c-44ac-832a-f9825f6a2ba8.

MLA Handbook (7^th Edition):

Popping, Sven (author). “Automated crash fault localization.” 2020. Web. 18 Jan 2021.

Vancouver:

Popping S(. Automated crash fault localization. [Internet] [Masters thesis]. Delft University of Technology; 2020. [cited 2021 Jan 18]. Available from: http://resolver.tudelft.nl/uuid:da6486bd-886c-44ac-832a-f9825f6a2ba8.

Council of Science Editors:

Popping S(. Automated crash fault localization. [Masters Thesis]. Delft University of Technology; 2020. Available from: http://resolver.tudelft.nl/uuid:da6486bd-886c-44ac-832a-f9825f6a2ba8

Delft University of Technology

22. van der Tuin, Marieke (author). Time-dependent earliest arrival routes with drivers legislation and preferences.

Degree: 2017, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:82a5c26e-b9ad-492a-be30-6bf6eeb4a58c

►

Freight transporters use software kits to plan the routes for their trucks. Breaks required by the European drivers legislation are nowadays planned as late as… (more)

▼

Freight transporters use software kits to plan the routes for their trucks. Breaks required by the European drivers legislation are nowadays planned as late as possible. However, in some cases it is beneficial to plan these mandatory breaks during waiting time, such as truck driving bans. In this thesis this problem is addressed by computing earliest arrival routes with optimal break planning. The problem is formulated and optimally solved as a variation of Dijkstra's algorithm. The slow Dijkstra computation times of several seconds per route are improved using time-dependent contraction hierachies, which enable a query time of several milliseconds per route while the solution quality remains good. For two days of driving with a night rest in between, 17% of the analysed routes improves with optimal break scheduling, resulting in an average improvement of 5 hours of driving time. If the taking of breaks is additionally restricted to parking lots, the influence on the arrival time is on average increased with only 3 minutes. However, 5% of the considered routes are not feasible any more due to absence of truck parking lots along the planned route. Another 15% of the routes face large changes in roads that should be taken. The planned routes are all optimized for having the earliest arrival time. However, the freight company's objective also concerns fuel optimized driving or providing reliable arrival times to the customer. This thesis analyses such preferences and combines them into a route planner that incorporates results of stated and revealed choice experiments. It is shown that generally toll avoidance and congestion avoidance have most influence on the route choice and arrival time. On average differences are small, but for some routes this leads to changes of up to 15% in travel time. This thesis analyses the problem of route planning from two perspectives: algorithmic and behavioural. Several observations are made: algorithms are not suitable for obtaining the best route instead of the fastest, and the output of behavioural research cannot be used directly in practice to compute preferred routes. Effort could be made in future to integrate both research communities such that algorithms are able to reflect what a freight transporter actually wants.

Individual Double Degree: Software Technology - Transport, Infrastructure and Logistics

Advisors/Committee Members: de Weerdt, Mathijs (mentor), Chorus, Caspar (mentor), Knoop, Victor (mentor), Batz, Veit (mentor), van Cranenburgh, Sander (mentor), Delft University of Technology (degree granting institution).

Subjects/Keywords: shortest path; trucks; drivers legislation; preferences; utility function; time-dependent road network; break planning

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

van der Tuin, M. (. (2017). Time-dependent earliest arrival routes with drivers legislation and preferences. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:82a5c26e-b9ad-492a-be30-6bf6eeb4a58c

Chicago Manual of Style (16^th Edition):

van der Tuin, Marieke (author). “Time-dependent earliest arrival routes with drivers legislation and preferences.” 2017. Masters Thesis, Delft University of Technology. Accessed January 18, 2021. http://resolver.tudelft.nl/uuid:82a5c26e-b9ad-492a-be30-6bf6eeb4a58c.

MLA Handbook (7^th Edition):

van der Tuin, Marieke (author). “Time-dependent earliest arrival routes with drivers legislation and preferences.” 2017. Web. 18 Jan 2021.

Vancouver:

van der Tuin M(. Time-dependent earliest arrival routes with drivers legislation and preferences. [Internet] [Masters thesis]. Delft University of Technology; 2017. [cited 2021 Jan 18]. Available from: http://resolver.tudelft.nl/uuid:82a5c26e-b9ad-492a-be30-6bf6eeb4a58c.

Council of Science Editors:

van der Tuin M(. Time-dependent earliest arrival routes with drivers legislation and preferences. [Masters Thesis]. Delft University of Technology; 2017. Available from: http://resolver.tudelft.nl/uuid:82a5c26e-b9ad-492a-be30-6bf6eeb4a58c

Delft University of Technology

23. Diwangkoro Muhammad Dolaputra, Dola (author). Fully Distributed Optimal Power Flow.

Degree: 2018, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:8dc35dc4-0a6f-4560-a503-e0bbb4a6b1a9

►

There are many methods for solving an optimal power flow (OPF) problem. Most of them employ one central unit to solve the problem (centralized) while… (more)

▼

There are many methods for solving an optimal power flow (OPF) problem. Most of them employ one central unit to solve the problem (centralized) while in others, every node/area computes for its coverage and send information to its neighbor(s) every time. The mentioned method is called Distributed OPF. In this thesis, the Distributed OPF aims for a fast and resilient algorithm to solve a DC-OPF problem based on Consensus + Innovation (C+I) method. The research focuses on developing a faster algorithm in solving an OPF problem for a DC distribution grid. The current C+I method has tuning parameters, all of which are determined by trial and error for every case. They are sensitive parameters that determine the speed of the iteration to converge to the solution. This thesis attempts to form adaptive tuning parameters by understanding their function in every equation for a variable update. By understanding the purpose of each tuning parameter and the physical interpretation, some parameters can be formulated while the other is still determined by estimating the value. The losses and congestion are also taken into account. In the results, by formulating these parameters, they are shown that the iteration number has dropped significantly compared to the previous research. Regarding the resilience of the algorithm, the distributed approach relies on the information exchange between the nodes and delay on the information exchange will stall the whole iteration process. Therefore, an asynchronous algorithm is implemented to resolve the problem by setting a timeout duration. The timeout duration enables the algorithm to wait for the new information only for the desired duration, and therefore the calculation converges in faster.

Electrical Sustainable Energy

Advisors/Committee Members: Cvetkovic, Milos (mentor), Mackay, Laurens (mentor), Chakraborty, Shantanu (mentor), Palensky, Peter (graduation committee), de Weerdt, Mathijs (graduation committee), Delft University of Technology (degree granting institution).

Subjects/Keywords: Optimization Algorithm; Optimal power flow

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Diwangkoro Muhammad Dolaputra, D. (. (2018). Fully Distributed Optimal Power Flow. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:8dc35dc4-0a6f-4560-a503-e0bbb4a6b1a9

Chicago Manual of Style (16^th Edition):

Diwangkoro Muhammad Dolaputra, Dola (author). “Fully Distributed Optimal Power Flow.” 2018. Masters Thesis, Delft University of Technology. Accessed January 18, 2021. http://resolver.tudelft.nl/uuid:8dc35dc4-0a6f-4560-a503-e0bbb4a6b1a9.

MLA Handbook (7^th Edition):

Diwangkoro Muhammad Dolaputra, Dola (author). “Fully Distributed Optimal Power Flow.” 2018. Web. 18 Jan 2021.

Vancouver:

Diwangkoro Muhammad Dolaputra D(. Fully Distributed Optimal Power Flow. [Internet] [Masters thesis]. Delft University of Technology; 2018. [cited 2021 Jan 18]. Available from: http://resolver.tudelft.nl/uuid:8dc35dc4-0a6f-4560-a503-e0bbb4a6b1a9.

Council of Science Editors:

Diwangkoro Muhammad Dolaputra D(. Fully Distributed Optimal Power Flow. [Masters Thesis]. Delft University of Technology; 2018. Available from: http://resolver.tudelft.nl/uuid:8dc35dc4-0a6f-4560-a503-e0bbb4a6b1a9

Delft University of Technology

24. Stegmann, Irma (author). Flexibility trading for aggregators of electrical vehicles within the Universal Smart Energy Framework: A research on trading flexibility in a USEF compliant market at distribution level for aggregators of electrical vehicles.

Degree: 2017, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:4105d2e5-1095-4ebb-a590-788fe1946555

►

Increased use of the distribution grid due to the uptake of distributed energy resources and the expected penetrations of Electrical Vehicles (EVs) could lead to… (more)

Subjects/Keywords: Electrical Vehicles; EVs; Aggregator; Smart charging; distribution system operator; USEF; Jedlix

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Stegmann, I. (. (2017). Flexibility trading for aggregators of electrical vehicles within the Universal Smart Energy Framework: A research on trading flexibility in a USEF compliant market at distribution level for aggregators of electrical vehicles. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:4105d2e5-1095-4ebb-a590-788fe1946555

Chicago Manual of Style (16^th Edition):

Stegmann, Irma (author). “Flexibility trading for aggregators of electrical vehicles within the Universal Smart Energy Framework: A research on trading flexibility in a USEF compliant market at distribution level for aggregators of electrical vehicles.” 2017. Masters Thesis, Delft University of Technology. Accessed January 18, 2021. http://resolver.tudelft.nl/uuid:4105d2e5-1095-4ebb-a590-788fe1946555.

MLA Handbook (7^th Edition):

Stegmann, Irma (author). “Flexibility trading for aggregators of electrical vehicles within the Universal Smart Energy Framework: A research on trading flexibility in a USEF compliant market at distribution level for aggregators of electrical vehicles.” 2017. Web. 18 Jan 2021.

Vancouver:

Stegmann I(. Flexibility trading for aggregators of electrical vehicles within the Universal Smart Energy Framework: A research on trading flexibility in a USEF compliant market at distribution level for aggregators of electrical vehicles. [Internet] [Masters thesis]. Delft University of Technology; 2017. [cited 2021 Jan 18]. Available from: http://resolver.tudelft.nl/uuid:4105d2e5-1095-4ebb-a590-788fe1946555.

Council of Science Editors:

Stegmann I(. Flexibility trading for aggregators of electrical vehicles within the Universal Smart Energy Framework: A research on trading flexibility in a USEF compliant market at distribution level for aggregators of electrical vehicles. [Masters Thesis]. Delft University of Technology; 2017. Available from: http://resolver.tudelft.nl/uuid:4105d2e5-1095-4ebb-a590-788fe1946555

Delft University of Technology

25. de Raad, Brendon (author). When DICE meets the dice: Integrated Economic and Climate Assessment under Uncertainty.

Degree: 2017, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:703806c1-eb2e-425d-bf41-fcbe6d194d05

►

With the decision made to act upon climate change, the remaining question is: "How?". Economic theory suggests that the most efficient method is by means… (more)

Subjects/Keywords: DICE; Stochastic Dynamic Programming; Levels of uncertainty; Dismal theorem

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

de Raad, B. (. (2017). When DICE meets the dice: Integrated Economic and Climate Assessment under Uncertainty. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:703806c1-eb2e-425d-bf41-fcbe6d194d05

Chicago Manual of Style (16^th Edition):

de Raad, Brendon (author). “When DICE meets the dice: Integrated Economic and Climate Assessment under Uncertainty.” 2017. Masters Thesis, Delft University of Technology. Accessed January 18, 2021. http://resolver.tudelft.nl/uuid:703806c1-eb2e-425d-bf41-fcbe6d194d05.

MLA Handbook (7^th Edition):

de Raad, Brendon (author). “When DICE meets the dice: Integrated Economic and Climate Assessment under Uncertainty.” 2017. Web. 18 Jan 2021.

Vancouver:

de Raad B(. When DICE meets the dice: Integrated Economic and Climate Assessment under Uncertainty. [Internet] [Masters thesis]. Delft University of Technology; 2017. [cited 2021 Jan 18]. Available from: http://resolver.tudelft.nl/uuid:703806c1-eb2e-425d-bf41-fcbe6d194d05.

Council of Science Editors:

de Raad B(. When DICE meets the dice: Integrated Economic and Climate Assessment under Uncertainty. [Masters Thesis]. Delft University of Technology; 2017. Available from: http://resolver.tudelft.nl/uuid:703806c1-eb2e-425d-bf41-fcbe6d194d05

Delft University of Technology

26. Haridas, Anand (author). Extending the lifetime of NB-IoT devices through Energy-Harvesting techniques.

Degree: 2018, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:596af01f-adef-428d-b802-730a1ff11e4f

►

For the Internet of Things (IoT) applications that send a few bytes of sensor information infrequently, several long-range IoT technologies have been conceived. Narrowband IoT… (more)

▼

For the Internet of Things (IoT) applications that send a few bytes of sensor information infrequently, several long-range IoT technologies have been conceived. Narrowband IoT (NB-IoT) is one of them that stands out due to its extended coverage, high penetrability, and high reliability features. Envisaged long device lifetime and the extended coverage are important aspects of the NB-IoT radio technology that has garnered attention. With the increase in applications to connect a large number of devices over long distances, it becomes crucial for the technology to meet the lifetime expectations set in the standards. However, the empirical lifetime estimations, done as part of this work, indicate that the current devices do notmeet the lifetime estimates targeted in the 3GPP standards, lasting for 2.38 yearswhen exchanging 200 bytes of data at a rate of 1 message per day. Potential solutions include energy-harvesting to augment the battery lifetime. However, due to the spatiotemporal variation in the amount of energy harvested, the supplemented energy levels will be less than the energy consumption. Therefore, it becomes essential for the sensor device enabled with NB-IoT communication technology to implement energy management techniques to maximize the utility to the application it serves based on its energy situation. Further, the coverage enhancement techniques inbuilt in the technology forms a major contributor to the low device lifetime. With the NB-IoT radio block considered as a ‘black box’ with no access to the software stack, innovative solutions are required to reduce the energy consumption of sending payloads without losing out on coverage. To this end, this work proposes a framework called xTEND to increase the utility of the device while being energy-efficient in deep coverage scenarios. In xTEND, the decision to transmit a payload is done by modeling the problem as a 0/1 incremental knapsack problem. A threshold policy is proposed that optimally schedules payloads in a given finite horizon, with a low complexity method to compute it on the device. Furthermore, as the coverage enhancement techniques deplete the battery soon for deep coverage scenarios, we propose to increase the transmission power adaptively based on the channel conditions. The framework is evaluated with an existing scheme in the literature that performs energy management and is shown to outperform in different traffic distributions. Further, with the framework, an average 3.8 J of energy savings and 8.027 s of time savings is obtained in the shared and control channels of the physical layer. This results in an average lifetime extension of 20 % in deep coverage scenarios. With the only requirement of access to the power amplifier embedded on the NB-IoT chipset, the framework can be implemented on the deployed sensor device.

Embedded Systems

Advisors/Committee Members: Venkatesha Prasad, Ranga Rao (mentor), Rao, Vijay (mentor), Kuipers, Fernando (graduation committee), de Weerdt, Mathijs (graduation committee), Delft University of Technology (degree granting institution).

Subjects/Keywords: NB-IoT; energy-harvesting; lifetime extension; Energy characterization

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Haridas, A. (. (2018). Extending the lifetime of NB-IoT devices through Energy-Harvesting techniques. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:596af01f-adef-428d-b802-730a1ff11e4f

Chicago Manual of Style (16^th Edition):

Haridas, Anand (author). “Extending the lifetime of NB-IoT devices through Energy-Harvesting techniques.” 2018. Masters Thesis, Delft University of Technology. Accessed January 18, 2021. http://resolver.tudelft.nl/uuid:596af01f-adef-428d-b802-730a1ff11e4f.

MLA Handbook (7^th Edition):

Haridas, Anand (author). “Extending the lifetime of NB-IoT devices through Energy-Harvesting techniques.” 2018. Web. 18 Jan 2021.

Vancouver:

Haridas A(. Extending the lifetime of NB-IoT devices through Energy-Harvesting techniques. [Internet] [Masters thesis]. Delft University of Technology; 2018. [cited 2021 Jan 18]. Available from: http://resolver.tudelft.nl/uuid:596af01f-adef-428d-b802-730a1ff11e4f.

Council of Science Editors:

Haridas A(. Extending the lifetime of NB-IoT devices through Energy-Harvesting techniques. [Masters Thesis]. Delft University of Technology; 2018. Available from: http://resolver.tudelft.nl/uuid:596af01f-adef-428d-b802-730a1ff11e4f

Delft University of Technology

27. Eckhardt, Chantal (author). Public transport route planning with preferences.

Degree: 2017, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:125091f2-c4f6-43f6-9b89-3145bf2e7a36

Computer Science Advisors/Committee Members: de Weerdt, Mathijs (mentor), van Nes, Rob (graduation committee), Yorke-Smith, Neil (graduation committee), Delft University of Technology (degree granting institution).

Subjects/Keywords: Public Transport; Route planning; Shortest path; Pareto-optimal; preferences

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Eckhardt, C. (. (2017). Public transport route planning with preferences. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:125091f2-c4f6-43f6-9b89-3145bf2e7a36

Chicago Manual of Style (16^th Edition):

Eckhardt, Chantal (author). “Public transport route planning with preferences.” 2017. Masters Thesis, Delft University of Technology. Accessed January 18, 2021. http://resolver.tudelft.nl/uuid:125091f2-c4f6-43f6-9b89-3145bf2e7a36.

MLA Handbook (7^th Edition):

Eckhardt, Chantal (author). “Public transport route planning with preferences.” 2017. Web. 18 Jan 2021.

Vancouver:

Eckhardt C(. Public transport route planning with preferences. [Internet] [Masters thesis]. Delft University of Technology; 2017. [cited 2021 Jan 18]. Available from: http://resolver.tudelft.nl/uuid:125091f2-c4f6-43f6-9b89-3145bf2e7a36.

Council of Science Editors:

Eckhardt C(. Public transport route planning with preferences. [Masters Thesis]. Delft University of Technology; 2017. Available from: http://resolver.tudelft.nl/uuid:125091f2-c4f6-43f6-9b89-3145bf2e7a36

		in
And / Or
		in
And / Or
		in
And / Or
		in

Open Access Theses and Dissertations