Derya Sever | Eindhoven University of Technology (original) (raw)
Papers by Derya Sever
The Hague Utrecht A12 1.1.2 Routing Models in Stochastic Networks Routing models are classified b... more The Hague Utrecht A12 1.1.2 Routing Models in Stochastic Networks Routing models are classified based on which type of network information is considered in the model as explained in Section 1.1.1. In Figure 1.7 represents a matrix where routing models are represented according to the types of information considered in the model. In this section, we will explain each quadrant of this matrix. Traditionally, in most research and software, routing problems are modeled in a static 1.4. Thesis Outline In the thesis, we model all the dynamic routing problems using an MDP and solve them using a DP. In Chapters 3-5, we consider dynamic travel times due to disruptions in the network. Chapter 3, analyzes the value of information in DSPP where we develop efficient stochastic lookahead strategies. In Chapter 4, we tackle DSPP problems with higher levels of dynamism by developing ADP algorithms. In Chapter 5, we consider link correlations during traffic disruptions such as spillback effect in DSPP. Considering stochastic and dynamically revealed demand is a focal element in Chapter 6 where we develop ADP algorithms (Figure 1.9). The chapters of the thesis are based on the following papers:
Transportation Research Part C: Emerging Technologies, 2018
The dynamic shortest path problem with time-dependent stochastic disruptions consists of finding ... more The dynamic shortest path problem with time-dependent stochastic disruptions consists of finding a route with a minimum expected travel time from an origin to a destination using both historical and real-time information. The problem is formulated as a discrete time finite horizon Markov decision process and it is solved by a hybrid Approximate Dynamic Programming (ADP) algorithm with a clustering approach using a deterministic lookahead policy and value function approximation. The algorithm is tested on a number of network configurations which represent different network sizes and disruption levels. Computational results reveal that the proposed hybrid ADP algorithm provides high quality solutions with a reduced computational effort.
DOI to the publisher's website. • The final author version and the galley proof are versions of t... more DOI to the publisher's website. • The final author version and the galley proof are versions of the publication after peer review. • The final published version features the final layout of the paper including the volume, issue and page numbers. Link to publication General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. • Users may download and print one copy of any publication from the public portal for the purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain • You may freely distribute the URL identifying the publication in the public portal. If the publication is distributed under the terms of Article 25fa of the Dutch Copyright Act, indicated by the "Taverne" license above, please follow below link for the End User Agreement:
DOI to the publisher's website. • The final author version and the galley proof are versions of t... more DOI to the publisher's website. • The final author version and the galley proof are versions of the publication after peer review. • The final published version features the final layout of the paper including the volume, issue and page numbers. Link to publication General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. • Users may download and print one copy of any publication from the public portal for the purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain • You may freely distribute the URL identifying the publication in the public portal. If the publication is distributed under the terms of Article 25fa of the Dutch Copyright Act, indicated by the "Taverne" license above, please follow below link for the End User Agreement:
DOI to the publisher's website. • The final author version and the galley proof are versions of t... more DOI to the publisher's website. • The final author version and the galley proof are versions of the publication after peer review. • The final published version features the final layout of the paper including the volume, issue and page numbers. Link to publication General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. • Users may download and print one copy of any publication from the public portal for the purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain • You may freely distribute the URL identifying the publication in the public portal. If the publication is distributed under the terms of Article 25fa of the Dutch Copyright Act, indicated by the "Taverne" license above, please follow below link for the End User Agreement:
Computers & Operations Research, 2013
ABSTRACT Traffic network disruptions lead to significant increases in transportation costs. We co... more ABSTRACT Traffic network disruptions lead to significant increases in transportation costs. We consider networks in which a number of links are vulnerable to these disruptions leading to a significantly higher travel time on these links. For these vulnerable links, we consider known link disruption probabilities and knowledge of transition probabilities for recovering from or getting into a disruption. We develop a framework based on dynamic programming in which we formulate and evaluate different known online and offline routing policies. Next to this, we develop computation-time-efficient hybrid routing policies. To test the efficiency of the different routing policies, we develop a test bed of networks based on a number of characteristics and analyze the results in terms of routes, cost performance and calculation times. Our results show that a significant part of the cost reduction can be obtained by considering only a limited part of the network in detail. The performance of our proposed hybrid policy is only slightly worse than the optimal policy.
Computers & Operations Research, 2013
ABSTRACT Traffic network disruptions lead to significant increases in transportation costs. We co... more ABSTRACT Traffic network disruptions lead to significant increases in transportation costs. We consider networks in which a number of links are vulnerable to these disruptions leading to a significantly higher travel time on these links. For these vulnerable links, we consider known link disruption probabilities and knowledge of transition probabilities for recovering from or getting into a disruption. We develop a framework based on dynamic programming in which we formulate and evaluate different known online and offline routing policies. Next to this, we develop computation-time-efficient hybrid routing policies. To test the efficiency of the different routing policies, we develop a test bed of networks based on a number of characteristics and analyze the results in terms of routes, cost performance and calculation times. Our results show that a significant part of the cost reduction can be obtained by considering only a limited part of the network in detail. The performance of our proposed hybrid policy is only slightly worse than the optimal policy.
The Hague Utrecht A12 1.1.2 Routing Models in Stochastic Networks Routing models are classified b... more The Hague Utrecht A12 1.1.2 Routing Models in Stochastic Networks Routing models are classified based on which type of network information is considered in the model as explained in Section 1.1.1. In Figure 1.7 represents a matrix where routing models are represented according to the types of information considered in the model. In this section, we will explain each quadrant of this matrix. Traditionally, in most research and software, routing problems are modeled in a static 1.4. Thesis Outline In the thesis, we model all the dynamic routing problems using an MDP and solve them using a DP. In Chapters 3-5, we consider dynamic travel times due to disruptions in the network. Chapter 3, analyzes the value of information in DSPP where we develop efficient stochastic lookahead strategies. In Chapter 4, we tackle DSPP problems with higher levels of dynamism by developing ADP algorithms. In Chapter 5, we consider link correlations during traffic disruptions such as spillback effect in DSPP. Considering stochastic and dynamically revealed demand is a focal element in Chapter 6 where we develop ADP algorithms (Figure 1.9). The chapters of the thesis are based on the following papers:
Transportation Research Part C: Emerging Technologies, 2018
The dynamic shortest path problem with time-dependent stochastic disruptions consists of finding ... more The dynamic shortest path problem with time-dependent stochastic disruptions consists of finding a route with a minimum expected travel time from an origin to a destination using both historical and real-time information. The problem is formulated as a discrete time finite horizon Markov decision process and it is solved by a hybrid Approximate Dynamic Programming (ADP) algorithm with a clustering approach using a deterministic lookahead policy and value function approximation. The algorithm is tested on a number of network configurations which represent different network sizes and disruption levels. Computational results reveal that the proposed hybrid ADP algorithm provides high quality solutions with a reduced computational effort.
DOI to the publisher's website. • The final author version and the galley proof are versions of t... more DOI to the publisher's website. • The final author version and the galley proof are versions of the publication after peer review. • The final published version features the final layout of the paper including the volume, issue and page numbers. Link to publication General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. • Users may download and print one copy of any publication from the public portal for the purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain • You may freely distribute the URL identifying the publication in the public portal. If the publication is distributed under the terms of Article 25fa of the Dutch Copyright Act, indicated by the "Taverne" license above, please follow below link for the End User Agreement:
DOI to the publisher's website. • The final author version and the galley proof are versions of t... more DOI to the publisher's website. • The final author version and the galley proof are versions of the publication after peer review. • The final published version features the final layout of the paper including the volume, issue and page numbers. Link to publication General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. • Users may download and print one copy of any publication from the public portal for the purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain • You may freely distribute the URL identifying the publication in the public portal. If the publication is distributed under the terms of Article 25fa of the Dutch Copyright Act, indicated by the "Taverne" license above, please follow below link for the End User Agreement:
DOI to the publisher's website. • The final author version and the galley proof are versions of t... more DOI to the publisher's website. • The final author version and the galley proof are versions of the publication after peer review. • The final published version features the final layout of the paper including the volume, issue and page numbers. Link to publication General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. • Users may download and print one copy of any publication from the public portal for the purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain • You may freely distribute the URL identifying the publication in the public portal. If the publication is distributed under the terms of Article 25fa of the Dutch Copyright Act, indicated by the "Taverne" license above, please follow below link for the End User Agreement:
Computers & Operations Research, 2013
ABSTRACT Traffic network disruptions lead to significant increases in transportation costs. We co... more ABSTRACT Traffic network disruptions lead to significant increases in transportation costs. We consider networks in which a number of links are vulnerable to these disruptions leading to a significantly higher travel time on these links. For these vulnerable links, we consider known link disruption probabilities and knowledge of transition probabilities for recovering from or getting into a disruption. We develop a framework based on dynamic programming in which we formulate and evaluate different known online and offline routing policies. Next to this, we develop computation-time-efficient hybrid routing policies. To test the efficiency of the different routing policies, we develop a test bed of networks based on a number of characteristics and analyze the results in terms of routes, cost performance and calculation times. Our results show that a significant part of the cost reduction can be obtained by considering only a limited part of the network in detail. The performance of our proposed hybrid policy is only slightly worse than the optimal policy.
Computers & Operations Research, 2013
ABSTRACT Traffic network disruptions lead to significant increases in transportation costs. We co... more ABSTRACT Traffic network disruptions lead to significant increases in transportation costs. We consider networks in which a number of links are vulnerable to these disruptions leading to a significantly higher travel time on these links. For these vulnerable links, we consider known link disruption probabilities and knowledge of transition probabilities for recovering from or getting into a disruption. We develop a framework based on dynamic programming in which we formulate and evaluate different known online and offline routing policies. Next to this, we develop computation-time-efficient hybrid routing policies. To test the efficiency of the different routing policies, we develop a test bed of networks based on a number of characteristics and analyze the results in terms of routes, cost performance and calculation times. Our results show that a significant part of the cost reduction can be obtained by considering only a limited part of the network in detail. The performance of our proposed hybrid policy is only slightly worse than the optimal policy.