Probabilistic programming models for traffic incident management operations planning

Date

2013-03-01

Author

Ozbay, Kaan
İyigün, Cem
Baykal-Gursoy, Melike
XİAO, Weihua

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

65
views

0
downloads

This paper proposes mathematical programming models with probabilistic constraints in order to address incident response and resource allocation problems for the planning of traffic incident management operations. For the incident response planning, we use the concept of quality of service during a potential incident to give the decision-maker the flexibility to determine the optimal policy in response to various possible situations. An integer programming model with probabilistic constraints is also proposed to address the incident response problem with stochastic resource requirements at the sites of incidents. For the resource allocation planning, we introduce a mathematical model to determine the number of service vehicles allocated to each depot to meet the resource requirements of the incidents by taking into account the stochastic nature of the resource requirement and incident occurrence probabilities. A detailed case study for the incident resource allocation problem is included to demonstrate the use of proposed model in a real-world context. The paper concludes with a summary of results and recommendations for future research.

Subject Keywords

Transportation, Incident management, Logistics, Quality of service, p-Efficient points, Stochastic programming, Probabilistic constraints

URI

https://hdl.handle.net/11511/35772

Journal

ANNALS OF OPERATIONS RESEARCH

DOI

https://doi.org/10.1007/s10479-012-1174-6

Collections

Department of Industrial Engineering, Article

Suggestions

OpenMETU
Core

An interactive algorithm to find the most preferred solution of multi-objective integer programs LOKMAN, BANU; Köksalan, Mustafa Murat; Korhonen, Pekka J.; Wallenius, Jyrki (Springer Science and Business Media LLC, 2016-10-01) In this paper, we develop an interactive algorithm that finds the most preferred solution of a decision maker (DM) for multi-objective integer programming problems. We assume that the DM's preferences are consistent with a quasiconcave value function unknown to us. Based on the properties of quasiconcave value functions and pairwise preference information obtained from the DM, we generate constraints to restrict the implied inferior regions. The algorithm continues iteratively and guarantees to find the mos...
A robust bi-objective mathematical model for disaster rescue units allocation and scheduling with learning effect Tirkolaee, Erfan Babaee; Aydin, Nadi Serhan; Ranjbar-Bourani, Mehdi; Weber, Gerhard Wilhelm (Elsevier BV, 2020-11-01) This paper proposes a novel bi-objective mixed-integer linear programming (MILP) model for allocating and scheduling disaster rescue units considering the learning effect. When a natural phenomenon (e.g., earthquake or flood) occurs, the presented decision support model is expected to help decision-makers of emergency relief centers to provide efficient planning for rescue units to minimize the total weighted completion time of rescue operations, as well as the total delay in rescue operations. The problem ...
A two-level variational multiscale method for convection-dominated convection-diffusion equations Volker, John; Kaya Merdan, Songül; Layton, William (2006-01-01) This paper studies the error in, the efficient implementation of and time stepping methods for a variational multiscale method (VMS) for solving convection-dominated problems. The VMS studied uses a fine mesh C-O finite element space X-h to approximate the concentration and a coarse mesh discontinuous vector finite element space L-H for the large scales of the flux in the two scale discretization. Our tests show that these choices lead to an efficient VMS whose complexity is further reduced if a (locally) L...
Probabilistic D-clustering Ben-Israel, Adi; İyigün, Cem (2008-06-01) We present a new iterative method for probabilistic clustering of data. Given clusters, their centers and the distances of data points from these centers, the probability of cluster membership at any point is assumed inversely proportional to the distance from (the center of) the cluster in question. This assumption is our working principle.
Automated composition of web services with the abductive event calculus Ozorhan, Esra Kirci; Kuban, Esat Kaan; Çiçekli, Fehime Nihan (2010-10-01) This paper proposes the application of the abductive event calculus to the web service composition and execution problem. There are different approaches to web service composition, which are suitable for different application scenarios. In this paper, we are concerned with the formalization of both the interleaved and template-based approaches using the event calculus framework. First, in the interleaved approach, it is shown that given a set of OWL-S web service descriptions in a service repository and a s...

Citation Formats

K. Ozbay, C. İyigün, M. Baykal-Gursoy, and W. XİAO, “Probabilistic programming models for traffic incident management operations planning,” ANNALS OF OPERATIONS RESEARCH, pp. 389–406, 2013, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/35772.