This page has only limited features, please log in for full access.

Dr. Pilar Jiménez
Technical University of Cartagena (SPAIN)

Basic Info


Research Keywords & Expertise

0 Port Management
0 Bikesharing
0 Urban Transport
0 mobility patterns
0 traffic modelling

Fingerprints

Bikesharing
mobility patterns

Honors and Awards

The user has no records in this section


Career Timeline

The user has no records in this section.


Short Biography

The user biography is not available.
Following
Followers
Co Authors
The list of users this user is following is empty.
Following: 0 users

Feed

Journal article
Published: 31 March 2021 in Applied Sciences
Reads 0
Downloads 0

Ports are key factors in international trade, and new port terminals are quite costly and time consuming to build. Therefore, it is necessary to optimize existing infrastructure to achieve sustainability in logistics. This problem is more complex in multi-client port terminals, where quay infrastructure is shared among terminal operators who often have conflicting interests. Moreover, the berth allocation problem in liquid bulk terminals implies demanding restrictions due to the reduced flexibility in berth allocation for these types of goods. In this context, this paper presents HADES, a multi-agent platform, and the experience of its pilot use in the Port of Cartagena. HADES is a software platform where agents involved in vessel arrivals share meaningful but limited information. This is done to alleviate potential congestion in multi-client liquid bulk terminals, promoting a consensus where overall congestion anchoring is reduced. A study is presented using a mixed integer linear program (MILP) optimization model to analyze the maximum theoretical reduction in congestion anchoring, depending on the flexibility of vessel arrival time changes. Results show that 6 h of flexibility is enough to reduce congestion anchoring by half, and 24 h reduces it to negligible values. This confirms the utility of HADES, which is also briefly described.

ACS Style

Pilar Jiménez; José María Gómez-Fuster; Pablo Pavón-Mariño. HADES: A Multi-Agent Platform to Reduce Congestion Anchoring Based on Temporal Coordination of Vessel Arrivals—Application to the Multi-Client Liquid Bulk Terminal in the Port of Cartagena (Spain). Applied Sciences 2021, 11, 3109 .

AMA Style

Pilar Jiménez, José María Gómez-Fuster, Pablo Pavón-Mariño. HADES: A Multi-Agent Platform to Reduce Congestion Anchoring Based on Temporal Coordination of Vessel Arrivals—Application to the Multi-Client Liquid Bulk Terminal in the Port of Cartagena (Spain). Applied Sciences. 2021; 11 (7):3109.

Chicago/Turabian Style

Pilar Jiménez; José María Gómez-Fuster; Pablo Pavón-Mariño. 2021. "HADES: A Multi-Agent Platform to Reduce Congestion Anchoring Based on Temporal Coordination of Vessel Arrivals—Application to the Multi-Client Liquid Bulk Terminal in the Port of Cartagena (Spain)." Applied Sciences 11, no. 7: 3109.

Journal article
Published: 09 December 2020 in Sustainability
Reads 0
Downloads 0

The United Nations Sustainable Development Goals have been the strategic aims of many interventions in society recently. Navantia has developed a Sustainable Workplace Mobility Plan motivated by Sustainable Development Goal 11, Sustainable cities. Navantia is a leading Spanish company in the design and construction of high technology military and civilian vessels. This project is focused on the Navantia facilities in Cartagena. A workplace mobility plan has been developed to encourage sustainable mobility, promoting access on foot, by bike, by scooter, and using public transport to travel to and from the company’s facilities. The methodology used is based on the European Guidelines for developing and implementing a sustainable urban mobility plan. Thus, the current accesses and their mobility characteristics have been studied in detail, and surveys have been conducted among the company’s employees. A diagnosis of the situation has been elaborated. To solve the identified problems, three sets of measures have been developed: (i) improved access measures; (ii) management of car park areas; and (iii) soft measures. The economic cost of all these measures has been estimated, as well as the related carbon savings. As a result, a complete sustainable workplace mobility plan has been designed from an integrated point of view to encourage sustainable mobility, not only for the company’s employees but also for all the inhabitants of Cartagena, to transform the city into a place with good quality of life now and in the future. This practical case can serve as a reference for other companies that want to foster sustainable mobility among their employees, even when they are subject to urban constraints.

ACS Style

Pilar Jiménez; David María-Dolores; Stephany Beltrán. An Integrative and Sustainable Workplace Mobility Plan: The case study of Navantia-Cartagena (Spain). Sustainability 2020, 12, 10301 .

AMA Style

Pilar Jiménez, David María-Dolores, Stephany Beltrán. An Integrative and Sustainable Workplace Mobility Plan: The case study of Navantia-Cartagena (Spain). Sustainability. 2020; 12 (24):10301.

Chicago/Turabian Style

Pilar Jiménez; David María-Dolores; Stephany Beltrán. 2020. "An Integrative and Sustainable Workplace Mobility Plan: The case study of Navantia-Cartagena (Spain)." Sustainability 12, no. 24: 10301.

Journal article
Published: 31 October 2020 in Sustainability
Reads 0
Downloads 0

When analysing the performance of bike-sharing scheme (BSS) stations, it is common to find stations that are located in specific points that capture the interest of users, whereas nearby stations are clearly underused. This uneven behaviour is not totally understood. This paper discusses the potential factors influencing station attractiveness, supported by the related literature on cyclists’ and pedestrians’ preferences and the characteristics of the stations themselves. The existing literature addresses these topics independently, while this work unites them by proposing a non data-extensive methodology that allows the attractiveness of BSS stations to be assessed. Attractiveness in this context is understood as the set of physical, environmental and service-related features of a bike station that make it more appealing for BSS users than nearby stations. Special attention is paid to differentiating objective features, based on facts, from subjective features, those influenced by personal perceptions. This classification becomes important in this context because subjective aspects can change from one geographical location to another, making the findings related to these aspects difficult to apply to other regions. Moreover, the assessment of the stations’ levels of safety and security is included. Thus, the proposed measure of attractiveness of BSS stations provides a balanced overview of several features. The consideration of station attractiveness when designing BSS layouts will help to refine the design of new layouts and will assist in conducting an appropriate diagnostic evaluation of the existing ones. This tool will allow urban and transportation planners to reduce re-balancing costs and to maximise user satisfaction at a low cost, which have a direct impact on improving the urban sustainability. The proposed method is applied to the Dublin bike sharing scheme, Dublinbikes, with good performance results.

ACS Style

Maria Nogal; Pilar Jiménez. Attractiveness of Bike-Sharing Stations from a Multi-Modal Perspective: The Role of Objective and Subjective Features. Sustainability 2020, 12, 9062 .

AMA Style

Maria Nogal, Pilar Jiménez. Attractiveness of Bike-Sharing Stations from a Multi-Modal Perspective: The Role of Objective and Subjective Features. Sustainability. 2020; 12 (21):9062.

Chicago/Turabian Style

Maria Nogal; Pilar Jiménez. 2020. "Attractiveness of Bike-Sharing Stations from a Multi-Modal Perspective: The Role of Objective and Subjective Features." Sustainability 12, no. 21: 9062.

Journal article
Published: 12 June 2020 in Case Studies on Transport Policy
Reads 0
Downloads 0

Economic and financial analyses of port projects are essential to ensure project viability in terms of defined objectives, adequate returns to private and public stakeholders, and to society in general. Moreover, including early-stage risk analysis ensures better decision making and better outcomes. However, project risk management is not very frequently used in port infrastructure projects. To improve this area and to ensure the kind of transparency, with clear figures, that would make ports attractive to private investors, a general methodology is described for including risk analysis in an economic-financial analytical model of a port investment project that considers probabilistic distributions for selected input and output variables to yield more information than could be obtained from a deterministic model. The proposed methodology is illustrated by applying it to a port terminal investment project by the Cartagena Port Authority (Spain).

ACS Style

José María Gómez-Fuster; Pilar Jiménez. Probabilistic risk modelling for port investments: A practical approach. Case Studies on Transport Policy 2020, 8, 822 -831.

AMA Style

José María Gómez-Fuster, Pilar Jiménez. Probabilistic risk modelling for port investments: A practical approach. Case Studies on Transport Policy. 2020; 8 (3):822-831.

Chicago/Turabian Style

José María Gómez-Fuster; Pilar Jiménez. 2020. "Probabilistic risk modelling for port investments: A practical approach." Case Studies on Transport Policy 8, no. 3: 822-831.

Journal article
Published: 27 April 2019 in Sensors
Reads 0
Downloads 0

Waste collection is one of the targets of smart cities. It is a daily task in urban areas and it entails the planning of waste truck routes, taking into account environmental, economic and social factors. In this work, an optimal path planning algorithm has been developed together with a practical software platform for smart and sustainable cities that enables computing the optimal waste collection routes, minimizing the impact, both environmental (CO2 emissions and acoustic damage) and socioeconomic (number of trucks to be used and fuel consumption). The algorithm is executed in Net2Plan, an open-source planning tool, typically used for modeling and planning communication networks. Net2Plan facilitates the introduction of the city layout input information to the algorithm, automatically importing it from geographical information system (GIS) databases using the so-called Net2Plan-GIS library, which can also include positions of smart bins. The algorithm, Net2Plan tool and its extension are open-source, available in a public repository. A practical case in the city of Cartagena (Spain) is presented, where the optimal path planning for plastic waste collection is addressed. This work contributes to the urban mobility plans of smart cities and could be extended to other smart cities scenarios with requests of optimal path planning.

ACS Style

María-Victoria Bueno-Delgado; José-Luis Romero-Gázquez; Pilar Jiménez; Pablo Pavón-Mariño. Optimal Path Planning for Selective Waste Collection in Smart Cities. Sensors 2019, 19, 1973 .

AMA Style

María-Victoria Bueno-Delgado, José-Luis Romero-Gázquez, Pilar Jiménez, Pablo Pavón-Mariño. Optimal Path Planning for Selective Waste Collection in Smart Cities. Sensors. 2019; 19 (9):1973.

Chicago/Turabian Style

María-Victoria Bueno-Delgado; José-Luis Romero-Gázquez; Pilar Jiménez; Pablo Pavón-Mariño. 2019. "Optimal Path Planning for Selective Waste Collection in Smart Cities." Sensors 19, no. 9: 1973.

Journal article
Published: 01 April 2018 in International Journal of Sustainable Development and Planning
Reads 0
Downloads 0

La Manga del Mar Menor is a spit between the Mediterranean Sea and the Minor Sea. The dimensions of this sandbar are about 20 km length and about 100 m...

ACS Style

P. Jiménez; A. Martínez; M. Calatrava. Sustainable urban mobility plan at La Manga Del Mar Menor (Spain). International Journal of Sustainable Development and Planning 2018, 13, 594 -604.

AMA Style

P. Jiménez, A. Martínez, M. Calatrava. Sustainable urban mobility plan at La Manga Del Mar Menor (Spain). International Journal of Sustainable Development and Planning. 2018; 13 (4):594-604.

Chicago/Turabian Style

P. Jiménez; A. Martínez; M. Calatrava. 2018. "Sustainable urban mobility plan at La Manga Del Mar Menor (Spain)." International Journal of Sustainable Development and Planning 13, no. 4: 594-604.

Journal article
Published: 23 February 2017 in Journal of Intelligent Transportation Systems
Reads 0
Downloads 0

The management of vehicle travel times has been shown to be fundamental to traffic network analysis. To collect travel time measurement, some methods focus solely on isolated links or highway segments, and where two measurement points, at the beginning and at the end of a section, are deemed sufficient to evaluate users' travel time. However, in many cases, transport studies involve networks in which the problem is more complex. This article takes advantage of the plate scanning technique to propose an algorithm that minimizes the required number of registering devices and their location in order to identify vehicles candidates to compute the travel times of a given set of routes (or subroutes). The merits of the proposed method are explained using simple examples and are illustrated by its application to the real network of Ciudad Real.

ACS Style

Santos Sánchez-Cambronero; Pilar Jiménez; Ana Rivas; Inmaculada Gallego. Plate scanning tools to obtain travel times in traffic networks. Journal of Intelligent Transportation Systems 2017, 21, 390 -408.

AMA Style

Santos Sánchez-Cambronero, Pilar Jiménez, Ana Rivas, Inmaculada Gallego. Plate scanning tools to obtain travel times in traffic networks. Journal of Intelligent Transportation Systems. 2017; 21 (5):390-408.

Chicago/Turabian Style

Santos Sánchez-Cambronero; Pilar Jiménez; Ana Rivas; Inmaculada Gallego. 2017. "Plate scanning tools to obtain travel times in traffic networks." Journal of Intelligent Transportation Systems 21, no. 5: 390-408.

Proceedings article
Published: 12 July 2016 in The Sustainable City XI
Reads 0
Downloads 0
ACS Style

Pilar Jiménez; M. Calatrava. Cycle lane network to connect the different campuses of Technical University of Cartagena (Spain). The Sustainable City XI 2016, 1, 765 -775.

AMA Style

Pilar Jiménez, M. Calatrava. Cycle lane network to connect the different campuses of Technical University of Cartagena (Spain). The Sustainable City XI. 2016; 1 ():765-775.

Chicago/Turabian Style

Pilar Jiménez; M. Calatrava. 2016. "Cycle lane network to connect the different campuses of Technical University of Cartagena (Spain)." The Sustainable City XI 1, no. : 765-775.

Conference paper
Published: 01 July 2016 in EDULEARN16 Proceedings
Reads 0
Downloads 0

Information about the paper titled "NET2PLAN-UTN: AN EDUCATIONAL TOOL FOR MODELING AND PLANNING URBAN TRANSPORTATION NETWORKS" at IATED Digital Library

ACS Style

María Del Pilar Jiménez; Maria Victoria Bueno-Delgado; Pablo Pavon-Marino. NET2PLAN-UTN: AN EDUCATIONAL TOOL FOR MODELING AND PLANNING URBAN TRANSPORTATION NETWORKS. EDULEARN16 Proceedings 2016, 5702 -5711.

AMA Style

María Del Pilar Jiménez, Maria Victoria Bueno-Delgado, Pablo Pavon-Marino. NET2PLAN-UTN: AN EDUCATIONAL TOOL FOR MODELING AND PLANNING URBAN TRANSPORTATION NETWORKS. EDULEARN16 Proceedings. 2016; ():5702-5711.

Chicago/Turabian Style

María Del Pilar Jiménez; Maria Victoria Bueno-Delgado; Pablo Pavon-Marino. 2016. "NET2PLAN-UTN: AN EDUCATIONAL TOOL FOR MODELING AND PLANNING URBAN TRANSPORTATION NETWORKS." EDULEARN16 Proceedings , no. : 5702-5711.

Journal article
Published: 01 June 2016 in Journal of Transport Geography
Reads 0
Downloads 0

Since the first Bike Sharing System (BSS) was introduced in Amsterdam (1965), studies about BSSs have constantly increased. BSSs studies are typically focused on user's socio-economic characteristics, bike sharing patterns and purpose of use in the city. This paper increases the knowledge of bike station classification due to users' mobility patterns based on data mining tools. For this purpose stations will be identified by a code based on joining three ratios: the load factor or number of available bikes ratio, the cumulative trips ratio, and the turnover station ratio. The latter is the new ratio proposed in this paper, which measures the effectiveness degree of each station. The higher the rate, the more effective the station is. Data mining tools to work with these three ratios are used in the proposed algorithm. Specifically, the perceptually important points (PIP) process to represent and index each time series of each station, and a rule set to classify the stations, are used. The results could support planning and operations decisions for re-design and management of BSSs in relation to the spatial implications of the stations and the users' mobility patterns, due to the classification reveals imbalances in the distribution of bikes and lead to a better understanding of the system structure. The proposed method is applied to the Dublin Bikes Scheme with good performance results.

ACS Style

Pilar Jiménez; María Nogal; Brian Caulfield; Francesco Pilla. Perceptually important points of mobility patterns to characterise bike sharing systems: The Dublin case. Journal of Transport Geography 2016, 54, 228 -239.

AMA Style

Pilar Jiménez, María Nogal, Brian Caulfield, Francesco Pilla. Perceptually important points of mobility patterns to characterise bike sharing systems: The Dublin case. Journal of Transport Geography. 2016; 54 ():228-239.

Chicago/Turabian Style

Pilar Jiménez; María Nogal; Brian Caulfield; Francesco Pilla. 2016. "Perceptually important points of mobility patterns to characterise bike sharing systems: The Dublin case." Journal of Transport Geography 54, no. : 228-239.

Journal article
Published: 16 January 2013 in IEEE Transactions on Intelligent Transportation Systems
Reads 0
Downloads 0

It is demonstrated that the minimum number of sensors required to know all link flows in a traffic network can be determined only if path information is available. However, not all paths need to be enumerated but, at most, a small subset defining the rank rw of the link-path incidence matrix W. If this rank for a reduced subset of paths is already m - n, where m and n are the number of links and noncentroid nodes, respectively, we can conclude that m - n sensors are sufficient. It is also shown that the formulas providing the dependent link flows in terms of the independent link flows can be obtained by the node-based or path-based approaches with the same results only when rw = m - n. Finally, an algorithm to obtain the small subsets of linearly independent path vectors is given. The methods are shown by a parallel network example and the Ciudad Real and Cuenca networks, for which the savings in link counts with respect to the m - n bound are larger than 16%. The corresponding savings in path enumeration are larger than 80%.

ACS Style

Enrique Castillo; Aida Calvino; Jose Maria Menendez; Pilar Jimenez; Ana Rivas. Deriving the Upper Bound of the Number of Sensors Required to Know All Link Flows in a Traffic Network. IEEE Transactions on Intelligent Transportation Systems 2013, 14, 761 -771.

AMA Style

Enrique Castillo, Aida Calvino, Jose Maria Menendez, Pilar Jimenez, Ana Rivas. Deriving the Upper Bound of the Number of Sensors Required to Know All Link Flows in a Traffic Network. IEEE Transactions on Intelligent Transportation Systems. 2013; 14 (2):761-771.

Chicago/Turabian Style

Enrique Castillo; Aida Calvino; Jose Maria Menendez; Pilar Jimenez; Ana Rivas. 2013. "Deriving the Upper Bound of the Number of Sensors Required to Know All Link Flows in a Traffic Network." IEEE Transactions on Intelligent Transportation Systems 14, no. 2: 761-771.

Journal article
Published: 09 November 2012 in Transportation
Reads 0
Downloads 0

In this paper a special conjugate Bayesian method, for reconstructing and estimating traffic flows, based on α-shifted-Gamma \( \Upgamma (\theta ,\,\lambda ) \) models \( H(\alpha ,\,\theta ,\,\lambda ) \) is given. If the numbers of users traveling through different routes are assumed to be independent \( H(\alpha ,\,\theta ,\,\lambda) \) variables with common \( \lambda,\) the link, origin–destination (OD) and node flows are also \( H(\alpha ,\,\theta ,\,\lambda ) \) random variables. We assume that the main source of information is plate scanning, which permits us to identify, totally or partially, the vehicle route, OD and link flows by scanning their corresponding plate numbers at an adequately selected subset of links. The reconstruction of the sample flows can be done exactly or approximately, depending on the intensity of the plate scanning sampling procedure. To this end a generalized least squares technique is used together with the conservation laws. A Bayesian approach using special conjugate families is proposed that allows us to estimate different traffic flows, such as route, OD-pair, scanned link or counted link flows. A detailed description of how the prior assessment, the sampling, the posterior updating and the obtention of the Bayesian distribution is given. Finally, one example of application is used to illustrate the methods and procedures.

ACS Style

Enrique Castillo; Pilar Jiménez; José María Menéndez; María Nogal. A Bayesian method for estimating traffic flows based on plate scanning. Transportation 2012, 40, 173 -201.

AMA Style

Enrique Castillo, Pilar Jiménez, José María Menéndez, María Nogal. A Bayesian method for estimating traffic flows based on plate scanning. Transportation. 2012; 40 (1):173-201.

Chicago/Turabian Style

Enrique Castillo; Pilar Jiménez; José María Menéndez; María Nogal. 2012. "A Bayesian method for estimating traffic flows based on plate scanning." Transportation 40, no. 1: 173-201.

Journal article
Published: 17 February 2012 in Transportation
Reads 0
Downloads 0

The paper deals with the observability problem in traffic networks, including route, origin–destination and link flows, based on number plate scanning and link flow observations. A revision of the main observability concepts and methods is done using a small network. Starting with the full observability of the network based only on number plate scanning on some links, the number of scanned links is reduced and replaced by counted link flows, but keeping the full observability of all flows in the network. In this way, the cost can be substantially reduced. To this end, several methods are given and discussed, and two small and one real case of networks are used to illustrate the proposed methodologies. Finally, some conclusions and final recommendations are included.

ACS Style

Enrique Castillo; Ana Rivas; Pilar Jiménez; José María Menéndez. Observability in traffic networks. Plate scanning added by counting information. Transportation 2012, 39, 1301 -1333.

AMA Style

Enrique Castillo, Ana Rivas, Pilar Jiménez, José María Menéndez. Observability in traffic networks. Plate scanning added by counting information. Transportation. 2012; 39 (6):1301-1333.

Chicago/Turabian Style

Enrique Castillo; Ana Rivas; Pilar Jiménez; José María Menéndez. 2012. "Observability in traffic networks. Plate scanning added by counting information." Transportation 39, no. 6: 1301-1333.

Journal article
Published: 27 December 2011 in IEEE Transactions on Intelligent Transportation Systems
Reads 0
Downloads 0

A stochastic demand dynamic traffic model is presented to predict some traffic variables, such as link travel times, link flows, or link densities, and their time evolution in real networks. The model considers that the variables are generalized beta variables such that when they are marginally transformed to standard normal, they become multivariate normal. This gives sufficient degrees of freedom to reproduce (approximate) the considered variables at a discrete set of time-location pairs. Two options to learn the parameters of the model are provided-one based on previous observations of the same variables and one based on simulated data using existing dynamic models. The model is able to provide a point estimate, a confidence interval, or the density of the variable being predicted. To this end, a closed formula for the conditional future variable values (link travel times or flows), given the available past variable information, is provided. Since only local information is relevant to short-term link flow predictions, the model is applicable to very large networks. The following three examples of application are given: (1) the Nguyen-Dupuis network; (2) the Ciudad Real network; and (3) the Vermont state network. The resulting traffic predictions seem to be promising for real traffic networks and can be done in real time.

ACS Style

Enrique Castillo; María Nogal; José María Menendez; Santos Sanchez-Cambronero; Pilar Jimenez. Stochastic Demand Dynamic Traffic Models Using Generalized Beta-Gaussian Bayesian Networks. IEEE Transactions on Intelligent Transportation Systems 2011, 13, 565 -581.

AMA Style

Enrique Castillo, María Nogal, José María Menendez, Santos Sanchez-Cambronero, Pilar Jimenez. Stochastic Demand Dynamic Traffic Models Using Generalized Beta-Gaussian Bayesian Networks. IEEE Transactions on Intelligent Transportation Systems. 2011; 13 (2):565-581.

Chicago/Turabian Style

Enrique Castillo; María Nogal; José María Menendez; Santos Sanchez-Cambronero; Pilar Jimenez. 2011. "Stochastic Demand Dynamic Traffic Models Using Generalized Beta-Gaussian Bayesian Networks." IEEE Transactions on Intelligent Transportation Systems 13, no. 2: 565-581.

Journal article
Published: 30 November 2011 in Applied Mathematical Modelling
Reads 0
Downloads 0

In this paper an algebraic method, which shares all the advantages of the topological methods and allows us to obtain the same results as the standard algebraic method with a substantial reduction in memory and cpu requirements, is presented. The main idea consists of writing the link, OD and scanned flows in terms of route instead of OD flows. This alternative permits starting the algebraic and topological processes with identical matrices of zeros and ones. In addition, in most iterations the pivots can be selected in such a way that the resulting matrices after each iteration contain only zeroes, ones and minus ones. This allows us to design a ternary arithmetic which reproduces the algebraic results exactly, requires only two bits to store each matrix entry and have no precision or non-zero pivot identification problems. Only when this process cannot be continued, the pure algebraic method is used, but only with a very reduced size matrix when compared with the size of the initial matrix. The method is illustrated by its application to a very simple network and to a real network example (the city of Cuenca, Spain).

ACS Style

Enrique Castillo; Pilar Jiménez; José María Menéndez; Ana Rivas; Inmaculada Gallego. A ternary-arithmetic topological based algebraic method for networks traffic observability. Applied Mathematical Modelling 2011, 35, 5338 -5354.

AMA Style

Enrique Castillo, Pilar Jiménez, José María Menéndez, Ana Rivas, Inmaculada Gallego. A ternary-arithmetic topological based algebraic method for networks traffic observability. Applied Mathematical Modelling. 2011; 35 (11):5338-5354.

Chicago/Turabian Style

Enrique Castillo; Pilar Jiménez; José María Menéndez; Ana Rivas; Inmaculada Gallego. 2011. "A ternary-arithmetic topological based algebraic method for networks traffic observability." Applied Mathematical Modelling 35, no. 11: 5338-5354.

Journal article
Published: 17 October 2011 in IEEE Transactions on Intelligent Transportation Systems
Reads 0
Downloads 0

This paper presents a first-in-first-out (FIFO) rule consistent model for the continuous dynamic network loading problem. The model calculates the link travel time functions at a basic finite set of equally spaced times that are used to interpolate a monotone spline for all the other times. The model assumes a nonlinear link travel time function of the link volumes, but some corrections are made to satisfy the FIFO rule at the basic set. Furthermore, the use of monotone cubic splines preserving monotonicity guarantees that the FIFO rule is satisfied at all points. The model consists of five units: 1) a path origin flow wave definition unit; 2) a path wave propagation unit; 3) a congestion analysis unit; 4) a network flow propagation unit; and 5) an inference engine unit. The path flow intensity wave, which is the basic information, is modeled as a linear combination of basic waves. Next, the individual path waves are propagated throughout the paths by using a conservation equation that stretches or enlarges the wave lengths and increases or reduces the wave heights, depending on the degree of congestion at different links. Then, the individual path waves are combined together to generate the link and node waves. Finally, the inference engine unit combines all information items to make them compatible in times and locations using the aforementioned iterative method until convergence. The method is illustrated by some examples. The results seem to reproduce the observed trends closely. The required CPU times oscillated between seconds and a few minutes.

ACS Style

Enrique Castillo; José María Menendez; María Nogal; Pilar Jimenez; Santos Sanchez-Cambronero. A FIFO Rule Consistent Model for the Continuous Dynamic Network Loading Problem. IEEE Transactions on Intelligent Transportation Systems 2011, 13, 264 -283.

AMA Style

Enrique Castillo, José María Menendez, María Nogal, Pilar Jimenez, Santos Sanchez-Cambronero. A FIFO Rule Consistent Model for the Continuous Dynamic Network Loading Problem. IEEE Transactions on Intelligent Transportation Systems. 2011; 13 (1):264-283.

Chicago/Turabian Style

Enrique Castillo; José María Menendez; María Nogal; Pilar Jimenez; Santos Sanchez-Cambronero. 2011. "A FIFO Rule Consistent Model for the Continuous Dynamic Network Loading Problem." IEEE Transactions on Intelligent Transportation Systems 13, no. 1: 264-283.

Original articles
Published: 01 October 2011 in Journal of Intelligent Transportation Systems
Reads 0
Downloads 0

Given a traffic network, the problem of identifying the smallest subset of links on which to locate sensors that allow the exact estimation of a given subset of links flows is dealt with, and methods for solving this partial link-observability problem are given. As sources of information, the authors consider 2 separate types of link sensors: counters and scanners. The first type leads to a method, which is an alternative to the previous method of Hu, Peeta, and Chu. First, the authors show how the previous method can be directly used for solving the partial observability problem. Next, the authors present a simple alternative algorithm, based on the pivoting strategy, that can include information about route and Origin-Destination (OD) flows observability. The observability problem based on scanners leads to a more difficult problem but supplies much more information about traffic flows. The authors give 2 simple algorithms for solving this problem in this case. The first algorithm allows checking that a given subset of links supplies the required information to estimate the flows in the selected subset of links, and provides information about route and OD observability. The second, which is a random algorithm, permits reducing the number of links of an initial subset of scanned links that solves the problem, and when a further reduction is not possible, modifies the initial set of scanning links for a new trial randomly. The proposed methods are illustrated using the parallel highway network of Hu, Peeta, and Chu. Last, the authors apply methods to two examples of applications—the Nguyen-Dupuis and the real Cuenca network—and provide some conclusions.

ACS Style

Enrique Castillo; Inmaculada Gallego; José María Menéndez; Pilar Jiménez. Link Flow Estimation in Traffic Networks on the Basis of Link Flow Observations. Journal of Intelligent Transportation Systems 2011, 15, 205 -222.

AMA Style

Enrique Castillo, Inmaculada Gallego, José María Menéndez, Pilar Jiménez. Link Flow Estimation in Traffic Networks on the Basis of Link Flow Observations. Journal of Intelligent Transportation Systems. 2011; 15 (4):205-222.

Chicago/Turabian Style

Enrique Castillo; Inmaculada Gallego; José María Menéndez; Pilar Jiménez. 2011. "Link Flow Estimation in Traffic Networks on the Basis of Link Flow Observations." Journal of Intelligent Transportation Systems 15, no. 4: 205-222.

Journal article
Published: 01 September 2011 in Journal of Transportation Engineering
Reads 0
Downloads 0

This paper deals with the error recovery problem when scanned license plate data are used to predict traffic flows. The aim is to reduce the effects of errors owing to lost plates or mistaken transcription, to improve estimation results. To this end, a method is given and discussed for traffic flow prediction using plate scanning data and taking into account possible errors in plate number recognition. The proposed method uses Bayesian networks because this is an efficient tool for introducing the plate scan error flow as a variable in the model and mending the mistakes in the scan pattern. Several examples are used to illustrate the proposed model. Finally, some conclusions are included.

ACS Style

S. Sánchez-Cambronero; Enrique Castillo; J. M. Menéndez; Pilar Jiménez. Dealing with Error Recovery in Traffic Flow Prediction Using Bayesian Networks Based on License Plate Scanning Data. Journal of Transportation Engineering 2011, 137, 615 -629.

AMA Style

S. Sánchez-Cambronero, Enrique Castillo, J. M. Menéndez, Pilar Jiménez. Dealing with Error Recovery in Traffic Flow Prediction Using Bayesian Networks Based on License Plate Scanning Data. Journal of Transportation Engineering. 2011; 137 (9):615-629.

Chicago/Turabian Style

S. Sánchez-Cambronero; Enrique Castillo; J. M. Menéndez; Pilar Jiménez. 2011. "Dealing with Error Recovery in Traffic Flow Prediction Using Bayesian Networks Based on License Plate Scanning Data." Journal of Transportation Engineering 137, no. 9: 615-629.

Journal article
Published: 28 February 2010 in Transportation Research Part B: Methodological
Reads 0
Downloads 0

During the last decade, there has been a substantial interest in how to determine the optimal number and locations of traffic counters for origin–destination (OD) trip matrices estimation. On the contrary, the optimal allocation of plate scanning devices has received very limited attention, even though several authors have demonstrated that plate scanning (route identification) techniques are much more informative than those based on traditional link count information. This paper provides techniques for obtaining the optimal number and location of plate scanning devices for a given prior OD distribution pattern under different situations, i.e. maximum route identifiability or budget constraints. Two rules analogous to the counting location problem are developed, and several integer linear programming models fulfilling these rules are proposed. The proposed methods are finally illustrated by their application into Nguyen–Dupuis and Cuenca networks.

ACS Style

R. Mínguez; S. Sánchez-Cambronero; Enrique Castillo; Pilar Jiménez. Optimal traffic plate scanning location for OD trip matrix and route estimation in road networks. Transportation Research Part B: Methodological 2010, 44, 282 -298.

AMA Style

R. Mínguez, S. Sánchez-Cambronero, Enrique Castillo, Pilar Jiménez. Optimal traffic plate scanning location for OD trip matrix and route estimation in road networks. Transportation Research Part B: Methodological. 2010; 44 (2):282-298.

Chicago/Turabian Style

R. Mínguez; S. Sánchez-Cambronero; Enrique Castillo; Pilar Jiménez. 2010. "Optimal traffic plate scanning location for OD trip matrix and route estimation in road networks." Transportation Research Part B: Methodological 44, no. 2: 282-298.

Conference paper
Published: 01 January 2010 in Proceedings of the 2nd International Conference on Agents and Artificial Intelligence
Reads 0
Downloads 0
ACS Style

Pilar Jimenez; Santos Sánchez-Cambronero; Inmaculada Gallego; Ana Rivas. THE OBSERVABILITY PROBLEM IN TRAFFIC MODELS - An Algebraic Step by Step Method. Proceedings of the 2nd International Conference on Agents and Artificial Intelligence 2010, 560 -567.

AMA Style

Pilar Jimenez, Santos Sánchez-Cambronero, Inmaculada Gallego, Ana Rivas. THE OBSERVABILITY PROBLEM IN TRAFFIC MODELS - An Algebraic Step by Step Method. Proceedings of the 2nd International Conference on Agents and Artificial Intelligence. 2010; ():560-567.

Chicago/Turabian Style

Pilar Jimenez; Santos Sánchez-Cambronero; Inmaculada Gallego; Ana Rivas. 2010. "THE OBSERVABILITY PROBLEM IN TRAFFIC MODELS - An Algebraic Step by Step Method." Proceedings of the 2nd International Conference on Agents and Artificial Intelligence , no. : 560-567.