Next Article in Journal
Text Mining for Big Data Analysis in Financial Sector: A Literature Review
Previous Article in Journal
Mobile Apps for Green Food Practices and the Role for Consumers: A Case Study on Dining Out Practices with Chinese and Dutch Young Consumers
Previous Article in Special Issue
How Does Urban Rail Transit Influence Residential Property Values? Evidence from An Emerging Chinese Megacity
 
 
Search for Articles:
Title / Keyword
Author / Affiliation / Email
Journal
Article Type
 
 
Advanced Search
 
Section
Special Issue
Volume
Issue
Number
Page
 
Journals
Sustainability
Volume 11
Issue 5
10.3390/su11051276
sustainability-logo
Submit to this Journal Review for this Journal Propose a Special Issue
► Article Menu

Article Menu

share Share announcement Help format_quote Cite question_answer Discuss in SciProfiles thumb_up
...
Endorse textsms
...
Comment
first_page
settings
Order Article Reprints
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Microscopic Simulation of Cruising for Parking of Trucks as a Measure to Manage Freight Loading Zone

by
Clélia Lopez
1,*,
Chuan-Lin Zhao
2,*,
Stéphane Magniol
1,
Nicolas Chiabaut
1 and
Ludovic Leclercq
1
1
LICIT, ENTPE/IFSTTAR, Université de Lyon, F-69518 Lyon, France
2
School of Civil and Transportation Engineering, Beijing University of Civil Engineering and Architecture, Beijing 100044, China
*
Authors to whom correspondence should be addressed.
Sustainability 2019, 11(5), 1276; https://doi.org/10.3390/su11051276
Submission received: 20 October 2018 / Revised: 18 February 2019 / Accepted: 21 February 2019 / Published: 28 February 2019
(This article belongs to the Special Issue New Governance Model and Strategy to Improve a Sustainable Transport System)
Browse Figures
Versions Notes

Abstract

:
This paper investigated economic truck parking behavior to implement comprehensive Freight Loading Zone (FLZ) policies. We assumed that the delivery trucks can only park on FLZ. The proposed contribution is to quantify the cruising for parking time of trucks. We used a microscopic traffic simulation based on a Manhattan network and the real network of Lyon (France). This paper explored the relationship between the searching time, the parking probabilities and the region’s parking density. Based on research results, an application to last mile cost function is proposed.

1. Introduction

The transport of goods in urban areas is essential for the economy of any given city. Nevertheless, urban freight delivery and pick-up movements can have at least four major negative impacts: Congestion, insecurity, pollution [1], and energy consumption. Especially, when the drivers have limited time for delivery, they double-park so as not to cruise for parking. Double-parking can cause temporal reductions of the road capacity in several places. The capacity drops can consequently increase travel time delays and reduce the global performances of transportation networks [2,3,4,5].
The Freight Loading Zone (FLZ) management is a challenge as the multi-modal demand of the existing infrastructure increases. Indeed, parking is essential for trucks to deliver and pick-up goods. Implementing comprehensive urban freight policies is a challenge for public decision makers. The lack of understanding of the supply chain perspective is one of the identified difficulties [6,7]. City managers can apply numerous strategies to reduce illegal freight double-parking problems. Based on previous studies, this paper attempts to identify two FLZ policies that are inherently linked: (i) Freight double-parking fine; and (ii) spatial FLZ management. It is recognized that private cars’ compliance in ensuring they do not park at FLZ can play a crucial role in reducing double-parking [5].
(i) Numerous researches focus on parking price policy designed for cars [8,9,10] car-sharing [11], and freight [12]. However, few studies have evaluated freight double-parking fine policy [13,14]. Actually, enforcement can be considered a reduction of the FLZ demand [5,15]. Increasing double-parking fines price can discourage illegal drivers, but not ensure their elimination [13]. Moreover, cities are dependent on goods mobility and should not be dissuaded to double-park without adjusting a proper number of vacant FLZs, i.e., compensatory actions. Nourinejad and Roorda [14] proposed an equilibrium model between the illegal commercial vehicle parking and the enforcement policies—defined in their study by the citation fine and level of enforcement.
(ii) The management of FLZ’s location is a dynamic problem through space and time. We identified two management solutions, which can be used individually or combined: Spatially, i.e., the number and the location of FLZ, and temporally, i.e., time window, time limit of parking, or enforcement of the booking system of FLZ [16,17]. Despite the fact that there is no universally agreed framework to identify the optimal spatial configuration and management system of FLZ, some papers proposed methodologies to establish their number, location, and usage [5,18]. Nourinejad et al. [19] evaluated the reserved streets for freight parking as a potential truck parking policy. In urban areas, freight parking infrastructure has a high demand and limited supply [5]. Malik et al. [20] examined the impact of imbalance between FLZ demand and supply. This imbalance can vary considerably in terms of different areas and roadway types [21]. Management solutions contribute to the efficient use of FLZ infrastructure by optimizing the use of space and time. This optimization makes it possible to maintain a level of service, while reducing the number of FLZs [18]. While, a reduction in the number of FLZ increases the distance between a pair of FLZs. In the literature, numerous papers proposed to design the FLZ systems by solving the optimization problem. Muñuzuri et al. [18] solved the location-allocation problem [22] for the FLZ spatial configuration. The authors analyzed the resulting number, location, and availability of FLZs. Their indicator is the average traveled distance between the FLZ used and the customer, i.e., the walking distance. This paper considers a return as the unavailability of parking space. The network scale is one street. More generally, Levy and Benenson [23] proposed a GIS-based approach for assessing parking patterns in urban areas, where dynamic supply and demand are taken into account.
Three major reasons can lead to the behavior of trucks to double-park: (i) the probability of finding a vacant FLZ through the time. This probability is influenced by the occupancy rate [24], e.g., FLZ may be already occupied illegally by private cars or by another delivery truck. The consequences are uncertain times for cruising, additional delays, and fuel consumption; (ii) the spatial configuration of FLZs can be inappropriate, e.g., the FLZ locations may be inconsistent by unfollowing the economy dynamic; and (iii) the maneuvering time may dissuade drivers [13].
This paper aims to retrieve the searching time of trucks, where double-parking by delivery trucks is eliminated. We define the searching time as the cruising-for-parking time, i.e., the time for a truck to find the first vacant parking. Moreover, to enhance the relevance of trucks to cruising-for-parking, we assume the automatized and systematic deployment of double-parking fine, and used the technology of autonomous delivery vehicles designed for sidewalks. Finally, microscopic traffic simulation with two case studies are carried out, a theoretical Manhattan network and the real network of Lyon (France) and its real data of FLZ location. We evaluate the FLZ system of Lyon through two axes of indicators: Spatially using Voronoï diagram and temporally using the cruise-for-truck-parking.
We investigated how the searching time is affected by two parameters: (i) The occupancy level of FLZs, and (ii) the region density of FLZs. To the best of our knowledge, there are no existing studies that focus on this line of research. Particularly, on researching time as an endogenous function of trucks’ travel time to evaluate FLZ management. We assume that there is a relationship between the cruise-for-parking and the probability of trucks to double-park. Thus, the minimization of the searching time can be an aggregated metric to evaluate both, the FLZ system performance and the double-parking rate. Based on our findings, an application to a last mile cost function is proposed.
The paper is organized as follows. In Section 2, microscopic simulation is described integrating the parking choice model, the availability model, and the traffic model. Section 3 describes the two case studies, their relative data and transportation network. In Section 4, a spatial analysis of FLZ management is established and the quantization of the searching time is analyzed. In Section 5, an application to a last mile cost function is proposed. Section 6 draws the conclusion in this paper and presents some implications for future work.

2. Methodology

To retrieve the searching time, this paper proposed a methodology that includes the simulation of private car traffic flow and the trucks’ cruising-for-parking at the microscopic simulation scale. A two-step commercial vehicle parking model is presented: (i) A parking choice model, and (ii) an availability model.
In this paper, the commercial vehicle can only park on an FLZ, and not on any other kind of parking slot. Moreover, the state of demand was considered as the likelihood of finding ta vacant FLZ and the supply as the number of FLZs normalized by area, i.e., the FLZ density [FLZ/km]. Moreover, this paper attempted to identify five characteristics for simulating delivery routes: The origin and the destination, the array of stop points—customers, its order, the route between each pair of stop points, and the stopping time duration. Furthermore, the experimental design was based on the assumption that the properties of delivery routes do not influence the searching time. Consequently, origin, destination, and stop points were set randomly. In addition, the stopping time duration was fixed.

2.1. Parking Choice Model

The parking choice model was applied for each customer. The truck driver would choose the first parking available which is located at the shortest traveled distance of the customer location. Indeed, we assumed that the delivery truck driver aims to minimize his walking distance between the establishment to visit and the place the truck is parked. To this end, we assumed that the delivery truck drivers have the entire knowledge of the topology network. Moreover, we assumed that the delivery truck has no information of the FLZs occupancies, e.g., the location of the first FLZ vacant for a given customer.
For each customer, the array of FLZs of the network was sorted in ascending order according to the traveled distance from the given customer and the FLZ i. To this end, we used the [25] Dijkstra algorithm to compute the first shortest traveled distance for a given pair-wise origin and destination. Traveled distance makes it possible to consider the directed graph of the network (e.g., instead of Euclidean distance).
In this study, we designated acceptance thresholds for the walking distance and the searching time. Their calibrations call for specific attention as traveled distances and travel times can be heterogeneous throughout the network. The limitation of this model is that the total searching distance is not optimized for the delivery route generation (i.e., Traveling Salesman Problem or Vehicle Routing Problem algorithms). Indeed, the parking choice model considers each customer independently.

2.2. Availability Model

This paper investigated the Bernoulli’s principle to model the parking availability [26,27]. We determined that p is the probability to find a vacant FLZ and T0 is the occupancy rate, which satisfies T0 = 1 − p. We defined k as the number of failure among Bernoulli trials before getting one success, i.e., finding the first available FLZ. The geometric distribution gives the probability of k defined as:
P ( k ) = ( 1 − p ) k − 1 p
with 0 ≤ p ≤ 1. Note that if k is higher than the number of FLZs considered then the delivery truck repeats the FLZ array until the k-th FLZ is reached. Arnott and Williams [27] demonstrated that the use of geometric distribution underestimated the cruising time for parking.
This availability model made it possible to study various probabilities p, which can represent different rates of FLZs occupancy in urban areas. The occupancy rate of 53% was used in the study of [28] Plantier and Bonnet. Numerous solutions can contribute to decrease the rate of FLZs occupancy, e.g., a better rotation of trucks parking (reduction of the limit delivery time), the enforcement of private car to not to park on FLZ, or increasing of the number of FLZ. More precisely, occupancy rate (state of the demand at time t) and the supply are inherently linked and thereby can influence each other.
This paper introduced the study of a carrousel in order to analyze the phenomenon related to our model of availability. The carrousel (Figure 1-a) is a single direction infinite circle where the truck travels until it finds the first vacant FLZ, as described in the parking choice model. The carrousel is not a circle network, as studied by [29] Litvak and Van Zwet. Carrousel is a generic schema of the proposed availability model, where distance of a given pair of FLZs can be related to any meshed transportation network.
To analytically study the availability model, we employed a stochastic approach of the distance of a given pair of FLZs. More precisely, the distance followed the gamma probability density function [30]. Figure 1-b shows the fit of the gamma probability density function on the distribution of link length from the network of Lyon. The mean and the standard deviation are respectively 103, and 92 m. Let the two parameters be the shape denoted by A and the scale denoted by B, which are set respectively to A = 1.95 and B = 52.8. Figure 1-c shows the traveled distance distribution, where p = 0.5. Note that a zero value means no searching distance as the first FLZ visited is vacant. Figure 1-d shows the boxplots of the distribution of various p, from 0.1 to 0.9 by step of 0.1. The use of boxplot made it possible to establish a first statistical study of the properties of searching traveled distance influenced by p, i.e., the mean, the median and the interquartile range. These three indicators are decreasing as a function of p.

2.3. Microscopic Simulation of the Traffic Dynamics

To model traffic dynamics, this paper used a microscopic traffic simulator SymuVia [31]. The latter is based on the Newell’s model [32,33] that is equivalent to the LWR’s model [32,33]. The trajectories calculated by the microscopic traffic simulator SymuVia are represented in Lagrangian coordinates. Microscopic simulation is computationally demanding for large scale networks, especially when the demand level is high. In fact, this kind of simulation requires the computation of the individual vehicle’s trajectories at each instant time t.
This article carried out a microscopic simulation of mixed traffic is composed of private cars and commercial delivery trucks. We investigated the searching time that commercial trucks take to find the first vacant FLZ for each customer. The searching time was only calculated if the first closest FLZ to the customer is not vacant. If the first FLZ is vacant, the searching time would be zero. The network traffic was assigned according to the first Wardrop principle [34], where users want to minimize their own travel times. The network equilibrium corresponded to the Deterministic User Equilibrium. Some studies performed a sensitivity analysis to investigate the influence of the traffic parameters calibration (see e.g., [3,35,36]).

2.4. Indicators

In this paper, time-space indicators were used to evaluate an FLZ system. Firstly, this paper defined a spatial indicator that was based on the number and locations of FLZs on the network. Secondly, in order to characterize the FLZ’s level of service, it proposed using the Voronoï diagram [37]. The latter is composed by convex polygons (or cells), calculated from the equidistant Euclidian distance of FLZ. Therefore, each polygon corresponds to an FLZ. In the literature, Voronoï diagrams were also used to partition a transportation network into a set of polygons based on the spatial distribution of data points [38]. In this study, the data points corresponded to the FLZ. Thanks to the Voronoï polygons, three different variables were established, including the number of adjacent polygons, the surface area and density of a polygon. On one hand, this paper focused on the latter two variables, which enabled the identification of FLZ region. For each FLZ region, similar policy measures were set up to increase the performance of the FLZ management. On the other hand, this paper attempted to define another temporal indicator that was based on the searching time for FLZ. The searching time increased as the congestion of traffic in the network becomes more significant. Therefore, this indicator can be calculated from real or simulated traffic data.

3. Data Description

Two cases were considered in this study: The Manhattan network and the real network of Lyon. The free-flow speed was denoted by v and the acceleration was denoted by a. For both private cars and trucks, v = 14 m/s and a = 0.5 m/s2. The maximal density (denoted by kc) of private cars and trucks were set to kc = 0.17 and kc = 0.1, respectively.

3.1. Manhattan Theoretical Network

The meshed theoretical network is composed of 440 links and 100 nodes. The double-way one-lane network has a constant link length of 200 m. This theoretical yet Manhattan-comparable network rendered the author to study a standard grid topology representative of some urban cities [39]. The green light parameter was set to 30 s for a cycle of 60 s. The traffic demand was set to reach free-flow traffic states and the assignment is distributed through entrances to avoid traffic border effects. We set a constant stopping time fixed to 3 min (as the service time used by [13] Figliozzi and Tipagornwong for Service B).
Moreover, 6 configurations of FLZs were considered: The number of FLZs is varied and their locations tend to be spatially and homogeneously distributed. The density d = [0.6; 2.2; 3.9; 5; 6.1; 6.7] FLZ/km. Figure 2-a,b show two configurations of FLZs on the Manhattan network, where d = 0.6, and d = 6.7, respectively. Note that for any given FLZ, its location was arbitrarily set to the middle of its relative link.

3.2. Lyon Real Network

The Lyon network is composed of 1317 FLZs, where real-world data were provided by Data Grand Lyon. In addition, 10329 establishments were registered in Lyon, based on the government data SIRENE. Figure 3-a shows red and gray data points corresponding to FLZ, and establishment, respectively. Both variables were defined by their coordinates. FLZ has been snapped to the directed Lyon network as FLZ locations are required for the parking choice model. To this end, the FLZ was snapped to the link minimizing the Euclidean distance. The methodology of snapping objects into a transportation network is the same as that was used in [40] Lopez’s work.
The directed Lyon network is composed of the 6th and 3rd districts of Lyon city as shown in Figure 3-b. This network is characterized by 3461 links, 1827 nodes, 233 entries, and 229 exits. The private car demand and traffic lights settings were based on real data from a joint survey [41], and open databases [42,43]. The private car demand was estimated by an enhanced four-step model [44]. A sum of 230 FLZs were assigned to the directed Lyon network the was considered for microscopic simulation. In this paper, uniformly distributed random numbers were used to select 500 delivery points. This paper investigated 100 routes of 5 customers, where the stopping time was set to 2 min. It also took into consideration that there is one route per simulation in order to reduce bias in the searching time quantization with the impact of delivery routes on the traffic flow [3].

4. Results

The impact of the state of the demand (denoted by p) and the state of supply (denoted by d) of FLZs on the searching time were quantified, on both the Manhattan and the Lyon networks. First, a spatial analysis of the FLZ configuration was established on the real network of Lyon. Then, the searching time measure was used to study the FLZ system.
Figure 4-a shows the Lyon network were partitioned, based on Voronoï decomposition. The black cells and the blue points represent the Voronoï polygons, and the FLZs, respectively. Voronoï cells properties make it possible to identify the shortest Euclidian distance of FLZ for any customer, based on cell perimeter; i.e., the FLZ where the customer is in the Voronoï polygon. Thus, Voronoï cells area can be used to measure the spatial FLZ level of service. The increase of the Voronoï cell area decreases the FLZ level of service. It is important to note that the FLZ location is not the centroidal Voronoï tessellation (i.e., is not the center of mass).
Figure 4-b distinguishes the density of establishments by the color of polygons, where the density is normalized from 0 to 1. Figure 4-c represents the cross-analysis of the cells based on two of its characteristics: The length area and the density. The x-axis represents the number of establishments and the y-axis represents the length area. Voronoï cell (depicted by blue points), called FLZ in the legend. The research findings showed two potential regions for enhancement: (i) The region where temporal FLZ system should be enhanced, and (ii) the region where spatial FLZ configuration should be enhanced. (i) The south-east of the Figure 4-c is characterized by a low length area with a high density of establishments. These values usually belong to an FLZ configuration of a city center, where the dynamic of the economy is the highest. The temporal FLZ system should be enhanced in this region, as the length area is already low. Indeed, enforcing FLZ turnover can be more relevant in this region that creates additional FLZs, as the existing infrastructure offer in city center is limited; (ii) the north of the Figure 4-c is characterized by a high length area. Spatial FLZ should increase in this region as Voronoï length area that is too long, can induce a high traveled distance to reach the shortest FLZ, for a given customer. In further work, the spatial analysis of the FLZ level of service can be refined by the number of adjacent Voronoï cells. Moreover, the number of establishments—density cell—can be normalized by the number of movements (pickup and delivery) with the use of a freight demand model [3,45]. One of the major conclusions of [46] David et al. is that, the number of FLZs in Lyon was generally appropriate. Their study focused on the first and the second district of Lyon, which are characterized by high commercial, residential density and congestion. Their parameters were 324 FLZ and 332 movements (representing 75% of Lyon urban freight).
Stochastic simulations of the Manhattan network have been computed per p and d, where each simulation includes a route of several customers, varying from 3 to 15. Such network enabled the study of 6 FLZ spatial configurations, that are homogeneously distributed. Figure 5-a shows the distribution of 220 observations of searching time, where p = 0.4 and d = 2.2 FLZ/km. The x-axis represents the searching time, [s], and the y-axis represents the frequency.
Figure 5-b shows the boxplots for each p varying from 0.2 to 0.8, where the density is set to d = 2.2 FLZ/km. The trend of boxplots is similar to the Figure 1-d. As our analysis has shown, the searching time distribution is dependent on the geometric probability function, considered in the availability model (cf. Section 2.2). The mean searching time is 482 s, and 31 s, respectively for p = 0.2, and p = 0.8. Moreover, the interquartile range can represent the uncertainty of the searching time, which is equal to 616 s and 0 s for p = 0.2 and p = 0.8, respectively. This interquartile range significantly decreases from p = 0.2 to p = 0.4.
Figure 5-c,d visualize respectively the mean and the median searching time [s], depending on p and d. 3D-plots make it possible to analyze the dual-impacts of p and d on the cruising-for-truck-parking. The highest mean observation is the mean searching time of 664 s, where p = 0.2 and d = 0.6. Starting from a threshold of d, the trend of the searching time distribution through p tends to be similar. This observation can suggest that, even if FLZ supply is well-furnished, the searching time can be influenced by p. On one hand, these results can be interpreted as a requirement of at least a threshold number of FLZs for a given urban area, in order to access a reasonable searching time for delivery trucks. On the other hand, the probability p should be increased to reduce the mean searching time and its related uncertainty, e.g., by FLZ policies reinforcement or encouraging turn-over.
Figure 5-e presents the abacus of the mean searching time [s] related to the probability p and the density d respectively on the axis x and y. Contour plot renders identification of region by a high mean searching time, which is highlighted in pink. Black arrows represent the gradient slope. The results show a predominant influence of p on the mean searching time. These results demonstrate that: The enforcement of temporal FLZ turn-over can lead to a greater decrease in the mean searching time than the creation of numerous new FLZs. We propose the use of the Searching Time Abacus (STA) to estimate the mean searching time, based on static demand and homogeneous regions from real-world cities and consequently evaluate FLZ system. For policy makers, STA can be a powerful tool for developing comprehensive freight policies that tackle illegal double-parking problems. Based on the STA, regions that are favorable for creating new FLZs or promoting the FLZ turnover can be identified. Moreover, we believe that two parameters—the occupancy rate and the density of FLZ—are affordable for city manager by survey methodology [47].
The simulated searching times of the Lyon network was first studied with the same statistical framework as the Manhattan network. Figure 6-a shows the distribution of the searching time where p = 0.5. Figure 6-b shows the boxplot of cruising-for-truck-parking with respect to p, varying from 0.2 to 0.9 by step of 0.1. Each boxplot corresponds to the distribution of 500 searching time observations. More precisely, for a given p, 100 microscopic simulations of a delivery route, composed of 5 establishments, are carried out. The blue curve represents the mean searching time with respect to p. The data suggests similar trends between the Manhattan network study and Lyon network study. However, the scales of these values are different because of the topological differences of the networks.
Figure 6-c cross-analyze the simulated cruising-for-truck-parking observations, where the x and the y axis correspond to the searching time and the walking distance, respectively. The walking distance is defined by the shortest undirected graph distance from the first nearest available FLZ to the customer location. The size of the data point corresponds to p, the probability of finding a vacant FLZ. The results demonstrate three regions in Figure 6-c: (i) the south-west region is characterized by low values of both searching time and walking distance. These observations represent the delivery customer experience, where an FLZ system is well furnished. The searching time is minimized by a high probability to find a vacant FLZ and high density of FLZs in a given zone; (ii) the west region is characterized by a low searching time and a walking distance which can be high. This situation can be considered a perspective for walking distance to be minimized by improving the FLZ configuration (the FLZ number and their locations); (iii) the east region is characterized by high searching time, while the walking distance is variable. This region tends to be characterized by a low p. Indeed, the p variable has a predominant influence on the searching time.

5. Application to a Last Mile Cost Function

This section assessed the additional cost of the last mile by considering the searching time. The use of a econometric model, the searching time makes it possible to estimate the retailer’s reactions of imposed FLZ policies. In the literature, numerous studies investigated the value of time (VOT) [48]. However, few studies have focused on the FLZ availability on the last mile cost function and truck driver behavior [13]. This section aimed to quantify the cruising-for-truck-parking, using a simplified cost function, relative to a route and service characteristics as shown in Table 1.
To fulfill the aim, we employed an existing econometric model [49], based on long-term service cost, which includes vehicle maintenance cost and consumption costs. Table 1 shows the variables used to formulate the searching time cost function.
The mean searching time was computed by microscopic traffic models corresponding to an additional time of 40 min for a route. The linear cost function model, applied in this study, provided the results of the additional cost of the searching time of 17.2, 103.2 and 412.8 €, corresponding respectively to the temporal scale of the day, the week, and the month.
Moreover, this total searching time for a given delivery driver was compared to a driver who would double-park for each customer. Monthly, on average 16 h could be spent on cruise-for-parking under the aforementioned variables. This additional time can be interpreted as: (i) An additional working time and costs, or, (ii) a decreasing number of customers delivered. Note that the marginal cost of congestion is endogenous of the searching time. The advantage is that traditional information required for congestion pricing, such as the travel demand and the traffic flow derived, are not necessary [51].

6. Conclusions

This paper proposed the searching time as an indicator to measure the performance of an FLZ system. We assumed the elimination of double-parking by the deployment of the automatized as well as systematic double-parking. This research findings showed how this aggregated measure is influenced by the FLZ offer (the number and the location of FLZ) and the FLZ supply (the probability to find a vacant FLZ as the freight parking demand). In this study, microscopic traffic models were applied to simulate the cruising-for-parking of delivery trucks. The methodology includes the parking choice model and the availability model, which has been studied analytically. This research is, to our best knowledge, the first attempt to study the truck searching time by modeling a two-step commercial vehicle parking model in a microscopic traffic simulation.
Two different typologies of directed networks have been studied: The theoretical yet Manhattan-comparable network and the real network of Lyon (France). First, a spatial analysis was established as the Lyon network has been partition into cells based on real-data of FLZs. Specific indicators were proposed in order to identify region where spatial and temporal FLZ configurations should be enhanced. Second, searching time was measured. The results show a predominant influence of the probability of a vacant FLZ on the cruising-for-parking and its related uncertainty. At least a threshold number of FLZ was suggested in order to access a reasonable mean searching time. Moreover, the probability to find an available FLZ should be increased in order to shorten the mean searching time, e.g., by FLZ policies reinforcement or encouraging turn-over.
The searching time measurement has numerous promising applications. The utilization of an econometric model based on the searching time can help to estimate the retailers’ reactions of imposed FLZ policies. For further work, the influence of traffic state on the searching time should be investigated. Moreover, the impact of cruising-for-parking of trucks on the global performances of the network can be explored, as established for the cruising-for-parking of private cars [25]. This study proposed a framework for policy makers to properly manage an FLZ system by using STA. Based on that, the evaluation of the STA as a model to predict the mean searching time should be studied, where uncertainty can be included.

Author Contributions

Conceptualization, S.M.; Methodology, C.L. and C.-L.Z.; Validation, C.-L.Z., S.M.; Formal Analysis, C.L. and S.M.; Investigation, C.L.; Resources, C.-L.Z. and S.M.; Data Curation, S.M.; Writing-Original Draft Preparation, C.L.; Writing-Review & Editing, C.L. and C.-L.Z.; Supervision, N.C. and L.L.; Project Administration, C.L. and C.-L.Z.; Funding Acquisition, C.-L.Z. and L.L.

Funding

This study received funding from Region Rhône Alpes ARC-7 program and the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation program (grant agreement 646592–MAGnUM project). The authors acknowledge the funding supported by National Natural Science Foundation of China (71601012) and The Fundamental Research Funds from Beijing University of Civil Engineering and Architecture (X18148, X18149).

Acknowledgments

The authors would like to thank Arthur Burianne for SIRENE establishment data treatment, Jean Krug for the calibration of the Lyon traffic simulation and Etienne Hans for his scientific advices. In the meantime, the authors thank Zhengui Xue, Sergio Batista Wen-na Dou, Feriel Boughatene and Tansy Zhao for proofreading this paper.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Muñuzuri, J.; Van Duin, R.; Escudero-Santana, A. How efficient is city logistics? Estimating ecological footprints for urban freight deliveries. Procedia Soc. Behav. Sci. 2010, 2, 6165–6176. [Google Scholar] [CrossRef] [Green Version]
  2. Chiabaut, N. Investigating Impacts of Pickup-delivery Maneuvers on Traffic Flow Dynamics. Transp. Res. Procedia 2015, 6, 351–364. [Google Scholar] [CrossRef] [Green Version]
  3. Lopez, C.; Gonzalez-Feliu, J.; Chiabaut, N.; Leclercq, L. Assessing the Impacts of Goods Deliveries’ Double Line Parking on the Overall Traffic under Realistic Conditions; Information systems, Logistics and Supply Chain: Bordeaux, France, 2016. [Google Scholar]
  4. Ramadan, A.; Roorda, M.J. An integrated traffic microsimulation model of illegal on-street parking in downtown Toronto. In Proceedings of the 96th International Conference of Transportation Research Board, Washington, DC, USA, 8–12 January 2017; p. 17-05970. [Google Scholar]
  5. Alho, A.; De Abreu e Silva, J.; Pinho de Sousa, J.; Blanco, E. Improving mobility by optimizing the number, location and usage of loading/unloading bays for urban freight vehicles. Transp. Res. Part D: Transp. Environ. 2018, 61 Pt A, 3–18. [Google Scholar] [CrossRef]
  6. Van Duin, R.; Slabbekoorn, M.; Tavasszy, L.; Quak, H. Identifying dominant stakeholder perspectives on urban freight policies: A Q-analysis on urban consolidation centres in The Netherlands. Transport 2018, 33, 867–880. [Google Scholar] [CrossRef]
  7. Dablanc, L. Goods transport in large European cities: Difficult to organize, difficult to modernize. Transp. Res. Part A: Policy Pract. 2007, 41, 280–285. [Google Scholar] [CrossRef]
  8. Simicevic, J.; Milosavljevic, N.; Maletic, G.; Kaplanovic, S. Defining parking price based on users’ attitudes. Transp. Policy 2012, 23, 70–78. [Google Scholar] [CrossRef]
  9. Zakharenko, R. The time dimension of parking economics. Transp. Res. Part B: Methodol. 2016, 91, 211–228. [Google Scholar] [CrossRef]
  10. Fulman, N.; Benenson, I. Simulating parking for establishing parking prices. Procedia Comput. Sci. 2017, 109, 911–916. [Google Scholar] [CrossRef]
  11. Balac, M.; Ciari, F.; Axhausen, K.W. Modeling the impact of parking price policy on free-floating carsharing: Case study for Zurich, Switzerland. Transp. Res. Part C: Emerg. Technol. 2016, 77, 207–225. [Google Scholar] [CrossRef]
  12. Marcucci, E.; Gatta, V.; Scaccia, L. Urban freight, parking and pricing policies: An evaluation from a transport providers’ perspective. Transp. Res. Part A: Policy Pract. 2015, 74, 239–249. [Google Scholar] [CrossRef]
  13. Figliozzi, M.; Tipagornwong, C. Impact of last mile parking availability on commercial vehicle cost and operations. Supply Chain Forum Int. J. 2017, 18, 60–68. [Google Scholar] [CrossRef]
  14. Nourinejad, M.; Roorda, M.J. Parking enforcement policies for commercial vehicles. Transp. Res. Part A 2017, 102, 33–50. [Google Scholar] [CrossRef]
  15. Aiura, N.; Taniguchi, E. Planning on-street loading-unloading spaces considering the behavior of pickup-delivery and parking enforcement. In Recent Advances in City Logistics; Thompson, R.G., Taniguchi, E., Eds.; Elsevier: Oxford, UK, 2006. [Google Scholar]
  16. Patier, D.; David, B.; Deslandres, V.; Chalon, R. A New Concept for Urban Logistics: Delivery Area Booking. In Proceedings of the Eighth International Conference on City Logistics, Bali, Indonesia, 17–19 June 2013. [Google Scholar]
  17. David, B.; Hassas, S.; Deslandres, V.; Chalon, R.; Patier, D.; Thébaud, J.-B.; Descombes, P. Freight Distribution Based on Delivery Area Booking. In Proceedings of the Transport Research Arena (TRA) 5th Conference: Transport Solutions from Research to Deployment, Paris, France, 14–17 April 2014. [Google Scholar]
  18. Muñuzuri, J.; Cuberos, M.; Abaurrea, F.; Escudero, A. Improving the design of urban loading zone systems. J. Transp. Geogr. 2017, 59, 1–13. [Google Scholar] [CrossRef]
  19. Nourinejad, M.; Wenneman, A.; Nurul Habib, K.; Roorda, M. Truck parking in urban areas: Application of choice modelling within traffic simulation. Transp. Res. Part A: Policy Pract. 2014, 64, 54–64. [Google Scholar] [CrossRef]
  20. Malik, L.; Sanchez-Diaz, I.; Tiwari, G.; Woxenius, J. Urban freight-parking practices: The cases of Gothenburg (Sweden) and Delhi (India). Res. Transp. Bus. Manag. 2017, 24, 37–48. [Google Scholar] [CrossRef]
  21. Chen, Q.; Conway, A.; Cheng, J. Parking for residential delivery in New York City: Regulations and behavior. Transp. Policy 2017, 54, 53–60. [Google Scholar] [CrossRef]
  22. Scott, A.J. Location-allocation system: A review. Geogr. Anal. 1970, 2, 95–119. [Google Scholar] [CrossRef]
  23. Levy, N.; Benenson, I. GIS-based method for assessing city parking patterns. J. Transp. Geogr. 2015, 46, 220–231. [Google Scholar] [CrossRef]
  24. Van Nieuwkoop, R.; Rutherford, T.F.; Axhausen, K.W. A Traffic Equilibrium Model with Paid-Parking Search. J. Transp. Econ. Policy 2016, 50, 262–268. [Google Scholar] [CrossRef]
  25. Dijkstra, E.W. A note on Two Problems in Connexion with Graphs. Numer. Math. 1959, 1, 269–271. [Google Scholar] [CrossRef]
  26. Leclercq, L.; Sénécat, A.; Mariotte, G. Dynamic macroscopic simulation of on-street parking search: A trip-based approach. Transp. Res. Part B 2017, 101, 268–282. [Google Scholar] [CrossRef]
  27. Arnott, R.; Williams, P. Cruising for parking around a circle. Transp. Res. Part B: Methodol. 2017, 104, 357–375. [Google Scholar] [CrossRef]
  28. Plantier, T.; Bonnet, G. Aires de Livraison: Planifier, Aménager et Gérer L’accueil des Véhicules; CERTU—Centre d’étude sur les Réseaux, les Transports, L’urbanisme et les Constructions Publiques: CLEMENT-WERNY Cécile, France, 2013. [Google Scholar]
  29. Litvak, N.; Van Zwet, W.R. On the minimal travel time needed to collect n items on a circle. Ann. Appl. Probab. 2004, 14, 881–902. [Google Scholar] [CrossRef] [Green Version]
  30. Cody, J. An Overview of Software Development for Special Functions. Lecture Notes in Mathematics. In Numerical Analysis Dundee; Watson, G.A., Ed.; Springer: Berlin, Germany, 1976; p. 506. [Google Scholar]
  31. Leclercq, L.; Bécarie, C. A meso LWR model designed for network applications. In Proceedings of the Transportation Research Board 91th Annual Meeting, Washington, DC, USA, 22–26 January 2012; Volume 118, p. 238. [Google Scholar]
  32. Lighthill, M.J.; Whitham, G.B. On kinematic waves II. A theory of traffic flow on long crowded roads. Proc. R. Soc. 1955, 229, 317–345. [Google Scholar]
  33. Richards, P.I. Shock waves on the highways. Oper. Res. 1956, 4, 42–51. [Google Scholar] [CrossRef]
  34. Wardrop, J.G. Some theoretical aspects of road traffic research. Proc. Inst. Civ. Eng. Part II 1952, 1, 325–378. [Google Scholar] [CrossRef]
  35. Xueyu, G.; Gayah, V.V. An analytical framework to model uncertainty in urban network dynamics using Macroscopic Fundamental Diagrams. Transp. Res. Procedia 2017, 23, 497–516. [Google Scholar]
  36. Duruisseau, C.; Leclercq, L. Path selection methods and network performance: A sensitivity analysis. In Proceedings of the Heart 2017 Symposium, Haifa, Israel, 12–14 September 2017. [Google Scholar]
  37. Aurenhammer, F. Voronoi Diagrams—A Survey of a Fundamental Geometric Data Structure. ACM Comput. Surv. 1991, 23, 345–405. [Google Scholar] [CrossRef]
  38. Kim, J.; Zheng, K.; Corcoran, J.; Ahn, S.; Papamanolis, M. Trajectory flow map: Graph-based approach to analyzing temporal evolution of aggregated traffic flows in large-scale urban networks. In Proceedings of the 96th Annual Meeting of Transportation Research Board, Washington, DC, USA, 8–12 January 2017; p. 17-06885. [Google Scholar]
  39. Fulman, N.; Benenson, I. Agent-Based Modeling for Transportation Planning: A Method for Estimating Parking Search Time Based on Demand and Supply. Phys. Soc. 2018, 1806, 10874. [Google Scholar]
  40. Lopez, C.; Krishnakumari, P.; Leclercq, L.; Chiabaut, N.; van Lint, H. Spatio-temporal Partitioning of Transportation Network using Travel Time data. In Proceedings of the 96th Annual Meeting of Transportation Research Board, Washington, DC, USA, 8–12 January 2017; p. 17-01911. [Google Scholar]
  41. Sytral. Enquête Déplacement 2015 de l’aire Métropolitaine Lyonnaise: Principaux Résultats; Sytral: Lyon, France, 2016. [Google Scholar]
  42. Base SIRENE. 2018. Available online: https://www.sirene.fr/ (accessed on 24 July 2018).
  43. Portail IGN—L’information Grandeur Nature. 2018. Available online: http://www.ign.fr/ (accessed on 20 August 2018).
  44. Bonnel, P. Prévision de la demande de transport; HDR, ENTPE, Université de Lyon 2; CNRS: Lyon, France, 2001. [Google Scholar]
  45. Kaszubowski, D. Urban Freight Transport Demand Modelling and Data Availability Constraints. In Proceedings of the Conference: Scientific and Technical Conference Transport Systems Theory and Practice, Katowice, Poland, 17–19 September 2018. [Google Scholar]
  46. David, B.; Patier, D.; Deslandres, V.; Bossin, P.; Hassas, S.; Chalon, R.; Descombes, P.; Geray, L.; Routhier, J.-L.; Gallea, J.-B.; et al. Projet ALF: Aires de Livraison du Futur. Rapport final public du projet. Available online: https://hal.archives-ouvertes.fr/LET/halshs-01686618v1 (accessed on 24 July 2018).
  47. Cats, O.; Zhang, C.; Nissan, A. Survey methodology for measuring parking occupancy: Impacts of an on-street parking pricing scheme in an urban center. Transp. Policy 2016, 47, 55–63. [Google Scholar] [CrossRef]
  48. Schreiter, T.; Pel, A.; van Lint, H.; Hoogendoorn, S. Modeling Monetary Costs of Multi-class Traffic Flow—Application to the Dynamic Management of Truck Lanes. In Proceedings of the 15th International IEEE Conference on Intelligent Transportation Systems, Anchorage, AK, USA, 16–19 September 2012. [Google Scholar]
  49. Davis, B.A.; Figliozzi, M.A. A methodology to evaluate the competitiveness of electric delivery trucks. Transp. Res. Part E: Logist. Transp. Rev. 2013, 49, 8–23. [Google Scholar] [CrossRef]
  50. Motavalli, J. Frito-Lay Adds Electric Trucks to Its Fleet. The New York Times. Available online: http://wheels.blogs.nytimes.com/2010/09/08/frito-lay-adds-electric-trucksto-its-fleet/> (accessed on 24 July 2018).
  51. Simoni, M.D.; Pel, A.J.; Waraich, R.A.; Hoogendoorn, S. Marginal Cost Congestion Pricing based on the Network Fundamental Diagram. Transp. Res. Part C: Emerg. Technol. 2015, 56, 221–238. [Google Scholar] [CrossRef]
Sustainability 11 01276 g001 550
Figure 1. (a) Carrousel schema, (b) distribution of link length from the Lyon network, (c) histogram of traveled distance where p = 0.5 and (d) boxplots of traveled distance. Note that if k = 0 (where k is the number of failure), traveled distance equals to 0. Indeed, if the first FLZ visited is available, the truck is not cruising-for-parking.
Figure 1. (a) Carrousel schema, (b) distribution of link length from the Lyon network, (c) histogram of traveled distance where p = 0.5 and (d) boxplots of traveled distance. Note that if k = 0 (where k is the number of failure), traveled distance equals to 0. Indeed, if the first FLZ visited is available, the truck is not cruising-for-parking.
Sustainability 11 01276 g001
Sustainability 11 01276 g002 550
Figure 2. (a,b) Manhattan network where d = 0.6 and d = 6.7.
Figure 2. (a,b) Manhattan network where d = 0.6 and d = 6.7.
Sustainability 11 01276 g002
Sustainability 11 01276 g003 550
Figure 3. (a) Visualization of real-world data: establishments and FLZ of Lyon and (b) the directed network for simulation.
Figure 3. (a) Visualization of real-world data: establishments and FLZ of Lyon and (b) the directed network for simulation.
Sustainability 11 01276 g003
Sustainability 11 01276 g004 550
Figure 4. Voronoï cell of the Lyon network where, (a) FLZ are displayed and (b) cell color is the density of establishments; and (c) cross-evaluation of the FLZ configuration.
Figure 4. Voronoï cell of the Lyon network where, (a) FLZ are displayed and (b) cell color is the density of establishments; and (c) cross-evaluation of the FLZ configuration.
Sustainability 11 01276 g004
Sustainability 11 01276 g005a 550Sustainability 11 01276 g005b 550
Figure 5. Manhattan results of the searching time (a) distribution where FLZ density d = 2.2 FLZ/km and probability p = 0.4, (b) boxplots where d = 2.2 FLZ/km, (c,d) mean and median searching time and (e) the abacus of the mean searching time.
Figure 5. Manhattan results of the searching time (a) distribution where FLZ density d = 2.2 FLZ/km and probability p = 0.4, (b) boxplots where d = 2.2 FLZ/km, (c,d) mean and median searching time and (e) the abacus of the mean searching time.
Sustainability 11 01276 g005aSustainability 11 01276 g005b
Sustainability 11 01276 g006a 550Sustainability 11 01276 g006b 550
Figure 6. Lyon network results of the searching time (a) distribution where p = 0.5, (b) boxplots through the probability to find a vacant FLZ, (c) the searching time through the walking time.
Figure 6. Lyon network results of the searching time (a) distribution where p = 0.5, (b) boxplots through the probability to find a vacant FLZ, (c) the searching time through the walking time.
Sustainability 11 01276 g006aSustainability 11 01276 g006b
Table
Table 1. Variables used to formulate the searching time cost function.
Table 1. Variables used to formulate the searching time cost function.
VariableDescriptionValue
ciDiesel cost [€/km] a0.54
mMaintenance cost [€/km] b0.32
pOccupancy rate [%] c53
dFLZ density [FLZ/km] d3
stMean searching time [s]120
NpNumber of customers20
vAverage speed traveled [km/h]30
NdNumber of working days per week6
NwNumber of weeks per month4
a French national statistic on fuel prices for commercial diesel vehicle https://www.prix-carburant.gouv.fr. b [50]. c [28]. d Assumes approximately the density of a region of the Lyon network based on real FLZ data from Data Grand Lyon https://data.grandlyon.com/.

Share and Cite

MDPI and ACS Style

Lopez, C.; Zhao, C.-L.; Magniol, S.; Chiabaut, N.; Leclercq, L. Microscopic Simulation of Cruising for Parking of Trucks as a Measure to Manage Freight Loading Zone. Sustainability 2019, 11, 1276. https://doi.org/10.3390/su11051276

AMA Style

Lopez C, Zhao C-L, Magniol S, Chiabaut N, Leclercq L. Microscopic Simulation of Cruising for Parking of Trucks as a Measure to Manage Freight Loading Zone. Sustainability. 2019; 11(5):1276. https://doi.org/10.3390/su11051276

Chicago/Turabian Style

Lopez, Clélia, Chuan-Lin Zhao, Stéphane Magniol, Nicolas Chiabaut, and Ludovic Leclercq. 2019. "Microscopic Simulation of Cruising for Parking of Trucks as a Measure to Manage Freight Loading Zone" Sustainability 11, no. 5: 1276. https://doi.org/10.3390/su11051276

APA Style

Lopez, C., Zhao, C. -L., Magniol, S., Chiabaut, N., & Leclercq, L. (2019). Microscopic Simulation of Cruising for Parking of Trucks as a Measure to Manage Freight Loading Zone. Sustainability, 11(5), 1276. https://doi.org/10.3390/su11051276

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop