AN ASSESSMENT OF ROAD NETWORK OPTIMALITY IN TIGRAY,

Geographic remoteness and poverty connected

INTERDISCIPLINARY PROJECT

By Axel Hirschel (10656146), Wai Kee Man (10580514) & Claudia Schwennen (10655808) Date: 8 May 2016 Words: 6585 Supervisors: Koen van der Gaast & Crelis Rammelt Abstract In recent years major public investments have been made in infrastructure development in Ethiopia. The Ethiopian Roads Authority (ERA) has expressed its goal for this road development, which is mainly poverty alleviation. This study is focused on evaluating the optimality of the current road network regarding this goal by taking geographic remoteness and poverty per woreda, which is a part of a province, into consideration. There are just a few towns in Tigray that are not geographically remote. Poverty is also not evenly distributed throughout the province. The poverty rate is generally higher in areas with higher population density. With the use of Geographic Information System (GIS) data files and a self-made algorithm, it is concluded that the current network is not optimal yet.

1 Table of Contents 1. Introduction ...... 3 2. Theoretical framework ...... 5 2.1 Impact of roads on poverty ...... 5 2.2 Network optimality ...... 6 2.3 Geographic remoteness ...... 8 2.4 Integration of the different concepts and theories ...... 8 3. Methodology ...... 10 3.1 Design of the optimality algorithm ...... 10 3.3 Poverty assessment ...... 12 3.3 Geographic remoteness assessment ...... 13 4. Results ...... 14 4.1 Results of the poverty assessment ...... 15 4.2 Results of the geographic remoteness assessment ...... 16 4.3 Results of the optimality algorithm ...... 17 5. Discussion ...... 18 6. Conclusion ...... 20 References ...... 21 Appendix A. ArcGIS data used in the geographic remoteness assessment ...... 23 Appendix B. Woreda information used in the poverty assessment ...... 25 Appendix C: Roads in current network and optimal network and algorithm codes ...... 27

2 1. Introduction

Ethiopia is one of the least developed and poorest countries in the world. It has gone through various types of regimes and disasters such as drought, famine and civil war. As it is an agrarian economy, 81% of the population in 2014 lives in rural areas (World Bank, n.d.) where the poverty rate is exceptionally high. Therefore, strategies focused on developing agricultural growth are essential in reducing the country’s poverty (Diao & Pratt 2007; Easterly, 2002).

Road development is one of the status quo strategies to tackle these problems. According to World Bank (2009), they are the fundament of a country’s infrastructure, support growth in agriculture and industry and they provide access to internal markets and social infrastructure. Various studies support this theory as they have showed that better road quality and more access to rural areas have a positive impact on poverty reduction (Dercon, Gilligan, Hoddinott & Woldehanna, 2009; Khandker, Bakht & Koolwal, 2009).

Ethiopia’s government tackles problems with road development, because most research suggests that roads have a significant influence on poverty reduction. Still, parts of Ethiopia are unconnected and/or reliant on economic policy of the government. As a lot of money is invested in Ethiopia’s road development plans (World Bank, 2009) and it holds great potential to reduce poverty, it is essential that these roads are allocated optimally within Ethiopia. This means that the plans should have an impact on what it is meant to be for, in this case poverty reduction. Especially impoverished regions should have some priority, while also keeping in mind the investments that need to be put into the project. A factor that greatly determines the investments is the geographic remoteness of regions. This could significantly increase the investments, which might not be feasible (Bird et al., 2010). If the network is not optimal, it means millions of dollars are gone to waste and an unnecessary amount of people still suffer in poverty. This research will assess both this factor and the poverty rate in order to conduct an assessment of the optimality of the current road network in Ethiopia. Moreover, only asphalt road will be considered in this research, due to the available resources of this research and because these form a stronger factor in the accessibility to large urban centres (Hearn, 2011).

Optimality within infrastructure design is often defined as network reliability. The general idea within the multiple forms of network reliability is that the network can perform its proposed service level adequately for the period of time intended under the operating conditions encountered (Billington & Allan, 1992). This implies a pragmatic approach in which the results of a network are most important and should fulfill the wishes of the users. Within most research, the proposed service level is a directly measurable unit. However, the intended service of a network is subjective and is therefore reliant on interpretations of its function.

Within the context of Ethiopian road development, the government had specified the services that roads were to perform. The two large-scale road sector development programs (RSDP) during the period between 1997 and 2009 had selection criteria of the Ethiopian Roads Authority (ERA), shown in table 1. These criteria and their weighting indicate the

3 goals of RSDPs: economic development and the provision of access to remote regions to alleviate poverty (Shiferaw, Soederbom, Siba & Alemu, 2012).

Table 1 ERA’s weight for Road Placements (Shiferaw, Soederbom, Siba & Alemu, 2012)

So within this paper the optimality of Ethiopian province Tigray’s current road network is used as a case study. It should be noted that this assessment will prove that poverty can be alleviated. The current placement of roads is analyzed on basis of poverty and remoteness. Tigray was suitable since a lot of data was available for this province, and the province contains a variety of remote locations. It is therefore possible to see which areas have been prioritized, and evaluate whether this was optimal.

The research question is: “To what extent can the road network in Tigray, Ethiopia, be optimized to lessen poverty based on poverty rates and geographic remoteness?” The sub questions are listed below. ● How is the degree of geographic remoteness distributed in Tigray? ● How is the degree of poverty distributed in Tigray? ● How optimal is the current road network in Tigray?

Since Ethiopia has limited budgets for road network development, not every town can be connected. This means that certain towns have been prioritized within the government. Using a self-made algorithm and Geographic Information System (GIS) data, it is possible to assess this prioritization on basis of the services roads should provide according to the ERA.

Firstly, the theoretical framework of the research is explained further in this report. The integration of the various disciplines is also mentioned within this chapter. Secondly, the methodological approach is explained, and the choices within the algorithm are clarified. Thirdly, the results of the research is presented. Fourthly, the results and the limitations of the research are discussed. Lastly, a few clear recommendations for network improvement and the overall consequences of the research are given.

4 2. Theoretical framework

2.1 Impact of roads on poverty Numerous researches have been conducted, but overall several factors can be identified of the impact of roads on poverty in the scientific literature. First, roads facilitate the provision of basic needs, such as health and education. Second, roads give access to markets and with a greater input, prices will be reduced due to lower transport costs. High transport costs can be partially explained by geographic disadvantages, such as being landlocked and the remoteness of a region. Local economies do not have access to and from global market centers. Thirdly, transport infrastructure is able to reduce poverty by creating employment and new job opportunities (Calderón & Servén, 2008; Beuran, Gachassin & Raballand, 2015; Porter, 2002).

Dercon et al. (2009) used longitudinal household data for their quantitative research and showed that public investment in road quality and increased access to agricultural extension services led to faster consumption growth rates and lower poverty rates. Roads indirectly provide benefits for the economy by supplying access to opportunities.

Ali and Pernia (2003) compiled several results from studies that point to a significant impact of roads on poverty reduction through economic growth. They conclude that roads cause this impact through agricultural productivity, nonfarm employment, and an increase in consumption expenditure and time savings. The two authors have summarized the links from infrastructure investments to eventually poverty reduction in figure 1. For example, when investments are made into the building of roads, employees are needed and new job opportunities that are non-agricultural will arise. This influences the poor’s wages and, hence, stimulates economic growth. Higher productivity and expanded employment then affect the supply and prices of goods and thus, the poor’s well-being (Ali & Pernia, 2003).

5

Figure 1. Simple analytical framework with links between Infrastructure and Poverty Reduction (Ali & Pernia, 2003)

Poverty is a complex concept that can be defined and measured in many ways. One of the reasons why this concept is complicated is because it is socially constructed, thus a range of variables are correlated (Bevan & Joireman, 1997). When looking at what to measure, measures can be objective or subjective. Bevan and Joireman (1997) define ‘objective’ as a measure that is relatively simple to administer and one that the observer has decided on to measure. Subjective measures are thus locally defined or by the person who is being researched and who usually combines a number of indicator that are locally regarded as important. For instance, a subjective measure of poverty would be how poor the local observer ranks himself. For this research, we aim to find data that is suitable within the scope of this research. Objective measurements also tend to be quantitative which complements our analysis as these data can be easily converted into the programs that will be used.

2.2 Network optimality Within the rural provinces in Ethiopia the poverty rate is exceptionally high. Since road development is a major strategy to combat poverty within Ethiopia, it is necessary to assess whether the limited means are spent optimally. However, optimality needs to be defined in order to assess it.

6 As stated in the introduction, optimality is often defined as reliability. The reliability of a network is the probability of the network performing its proposed service level adequately for the period of time intended under the operating conditions encountered (Billington & Allan, 1992). Wakabayashi and Lida (1992) propose a similar definition for network reliability. Since the road infrastructure of Tigray is a network, it is possible to use this definition. Wakabayashi and Iida (1992) have linked the definition of reliability to road networks; road network reliability is the probability that two nodes are connected for traffic.

To assure the positive impacts of roads on poverty alleviation, the roads need to be accessible for the population within the woredas, which are the second administrative units above the smallest unit of local government in rural communities in Ethiopia. The effects are namely bound to the location of the road. Since these positive effects of roads are vital for economic development for impoverished regions and since the ERA has placed these roads with the intention to combat poverty, the required service of the road is to tackle poverty. Chen, Yang, Lo and Tangs (2002) explicate three categories in reliability namely connectivity reliability, capacity reliability, and travel time reliability. Connectivity reliability is concerned with the nodes being connected. A path between two nodes always needs to be present (Wakabayashi & Iida, 1989). The network can work in only two states, either there is a connection between the nodes, or there is none. The binary state approach can be suitable for extreme situations, such as natural disasters (Chen et al., 2002).

Travel time reliability is applied when evaluating whether all nodes can be reached within certain time intervals (Asakura & Kashiwadani, 1991). The travel time between nodes is influenced by differences in traffic flows, such as the occurrence of daily traffic jams. Asakura (1999) later included that degradation of roads can also influence the travel time. He defined a ratio in which the more degraded a road is, the less reliable it is. This is in line with connectivity reliability, as severely degraded and therefore inaccessible roads are under both definitions unreliable.

Capacity reliability is concerned whether the capacity of a road is great enough for a specific demand at all times (Chen et al., 2002). The maximum road capacity therefore always need to be equal or greater to the specific demand at that time. In capacity reliability the everyday disturbances are also accounted for.

Most network reliability research had been done to developed infrastructure networks in Western countries. These papers focused on optimizing transportation flows and preventing traffic jams using both the definitions of travel time reliability and capacity reliability. These interpretations of reliability are unsuited for this research though. First of all, while traffic jams may exist within Ethiopia, the RSDPs were not intended to combat these. Moreover, most variables used within both fields are inaccessible.

However, the concept of reliability can still be used within the current road network in Ethiopia. Within connectivity reliability, one of the major challenges is to connect as much nodes as possible. The ERA has also specifically aimed to connect yet unconnected regions and therefore one road is sufficient. The critique on the binary state of connectivity is also less impactful in this case study; although a town can benefit from extra links when already

7 connected, the effects of one connection already provide the benefits mentioned within the previous paragraph.

In conclusion, the optimality of an infrastructure networks can be evaluated on basis of its reliability of its connectivity. Tigray’s network should combat poverty and therefore it needs to connect towns to the current network in order for the roads to have a positive impact. The network is therefore optimal if it connects as many impoverished people as possible.

2.3 Geographic remoteness The concept geographic remoteness is very much related to the connectivity between certain communities and large towns, as it describes how large the access is to large towns. The Australian Institute of Health and Welfare (AIHW, n.d.) also describes this concept as “the level of access to certain services and goods”. It is an important concept that needs to be considered, as it also describes what the socioeconomic impacts could have on unconnected communities, as suggested by the AIHW. This is for example supported by Sunderlin et al. (2008), who specifically found a correlation between poverty rate and forest cover, although the poverty density is quite low in densely vegetated areas. Epprecht et al. (2011) conducted a study in Vietnam in order to observe whether poverty is related to physical accessibility or to the fact that some groups are ethnic minorities. They found that the physical accessibility is a strong predictor of poverty. However, they also found that the accessibility to small urban centres are of greater importance than large urban centres. Bird et al. (2010) also found that higher poverty rates exist in remote areas and that poor infrastructure is especially a problem, as this increases the travel costs as well. As it might be difficult to put large investments into road development in remote areas and especially in mountainous areas, it might be interesting to determine whether the location of political and administrative centres, so that small urban centres can develop in these areas (ibid.).

The geographic remoteness greatly depends on the physical distance between certain communities and larger towns (AIHW, n.d.). Physical features in the landscape are crucial for the determination of the geographic remoteness of certain locations, as the physical distance is greatly dependent on these physical features (Pugh & Cheers, 2010). The physical features that will be focused on in this research are mountainous areas, rivers and forests. The physical distance is also significantly related to socioeconomic developments. An example of this is the privatization of public services, and in combination with large distances, this will increase the transport costs for the citizens of the communities of interest, which indirectly increases the physical distance and also the distance to markets (Huskey, 2005; Pugh & Cheers, 2010). This demonstrates how the geographic remoteness could have an impact on socioeconomic developments and therefore also on poverty reduction.

2.4 Integration of the different concepts and theories In order to find common ground between the different concepts and theories from the three disciplines, one concept was used as an overarching concept, which is optimality. The concepts and theories have been reorganized into one system where optimality is the overarching concept. This type of integration was introduced by Repko (2012), which is called the technique of (re)organization. Essentially, commonalities between different

8 concepts and theories are determined, after which they are linked together and (re)organized into one system.

As described earlier, optimality is defined as that something can perform its proposed service level adequately for the period of time intended under the operating conditions encountered. For this study, this can be described through the geographic remoteness and poverty reduction of the communities of interest. As described in the previous section, the geographic remoteness gives an indication of the connectivity between the communities and towns, which in turn also describes the access to certain goods and services of the inhabitants. It affects the travel time, the travel distance and the travel costs, but it also determines the road construction costs when road development plans are considered. This in turn could determine whether investments should be put into certain projects and, because these might not be feasible in geographically remote areas. In cases like this, it might be difficult to combat poverty and the proposed service level of road development, namely poverty reduction, might not be possible to be reached. In short, it indirectly affects the possibilities for poverty reduction at certain locations. However, in non-geographically remote areas, road development could have a great impact on poverty reduction as explained before. Roads cause this impact through agricultural productivity, nonfarm employment, and an increase in consumption expenditure and time savings. These will all increase the economic welfare of the poor (Ali & Pernia, 2003).

The geographic remoteness will be assessed by mapping the physical features in the landscape. As reducing poverty is the ultimate goal of road development, poverty will be assessed by mapping poverty rates. This is of importance, because the placement of asphalt roads will also be mapped in order to do the optimization analysis and see whether there are any general connections that can be made.

Figure 2. Integrated concepts and theories

9 3. Methodology

As stated in the introduction, for the assessment of the geographic remoteness and poverty rates in Tigray, ArcGIS will be used to map these variables. Four different situations can be defined, which will determine whether a road should be placed in the optimal network. Figure 3 gives a quick overview of these four situations along an x-axis and y-axis together with the two variables. The first situation is when the poverty rate is high, but the degree of geographic remoteness is low. As stated before, impoverished regions should be connected to the current network in order to possibly alleviate poverty. As the degree of geographic remoteness is low, a road will be placed in this situation for the optimal network. The second situation is when both the poverty rate and the degree of geographic remoteness are high. In this case, it might not be feasible to invest into road development, especially since the region is very poor, which might not bring about the expected economic returns. As explained earlier, alternatives could be considered in future research. The third situation is when both the poverty rate and the degree of geographic remoteness are low. For this situation a road can be placed, as it might be likely that road development in regions like these will bring about the economic returns. Lastly, the fourth situation is when the poverty rate is low, but the degree of geographic remoteness is high. Again, in this case it might not be feasible to invest into road development.

Figure 3. Different situations regarding the economic potential and poverty

3.1 Design of the optimality algorithm Within the research it is most important that the produced roads are optimal. As described within the theoretical framework, the network is optimal if it connects as many poor people as possible. It is essential to base the optimality of the network on the currently existing roads, since Ethiopia cannot spend more money on roads than it did. So firstly, all current connections between 2 towns have been entered in a database. The length of each road has

10 been calculated by the Euclidean distance between the coordinates of different towns. The real length of a road will be larger than the calculated length. However, since both existing and suggested links’ lengths will be based on this distance, and many of these links will be calculated, it can be assumed that the deviation of the Euclidean distance is not problematic. The total length of all roads combined is the maximum length of the network.

The optimality of a network can be calculated by designing a suited algorithm for the problem. For the optimality implementation, an algorithm in Python 3 was written, which is included in appendix C. The basis for the algorithm was the database with the information of certain woredas and towns. The information in the database includes the coordinates, names, poverty-indicators and remoteness of all the used towns. Since not all specific data on every town is present, we chose to use the information of the town’s woreda. This is a fair assumption, since woredas are pretty small and because asphalt roads to the specific towns are also important for the surrounding region. How the information of this database is gathered will be explained in section 3.3 and 3.4. It should be noted though that this means there is not actual information about the regions in between the towns and that this is not included in the algorithm, but rather the information about the landscape is included in the score of the town.

The central idea of optimal road placement is connecting large groups of people within Tigray, and prioritizing impoverished regions. The score of every town is based on its poverty and inhabitants and portrayed as a number, as well as for the degree of geographic remoteness. Towns that are geographically remote are not considered further. The number is calculated by multiplying the poverty rate of the town by the inhabitants of it. This way we get the amount of poor people within the town. The network optimality is then the sum of scores of every connected town, so the total of poor people connected. Within the calculation multiple roads to one town do not increase the score, but it might be beneficial when from that specific point roads can be created to unconnected towns nearby.

The optimal networks can be created using a recursive function to create possible links between nodes. The input for this function is a list of nodes, a list of roads and the maximum length of the total road. Every node within a possible optimal network is evaluated whether they are connected. If the node is unconnected, it will go on to the next node. If the node is connected, it will check all nodes again whether they are connected and if a node is not connected, it will make a connection between the connected node and the unconnected node. For every connection the distance between both nodes is subtracted from the maximum road. Every time a connection has been made, it will enter the updated list of nodes and whether these are connected, the updated list of roads and the new available road length in this function. If every node is connected or if the available road is fully used, that network will be given as output of the function. It will now continue with the for-loops. This way every possible optimal network can be created.

A possibility for the creation of the most optimal network is to calculate the optimality-score of every possible network with the length of the current network and then choose the one with the highest score. This is not possible though, since the information that needs to be remembered to both create and compare the various networks will exceed the amount of

11 atoms on earth. It is therefore necessary to eliminate bad suggestions beforehand to adhere to reasonable computer power and memory.

The algorithm will step-by-step calculate possible networks. Where normally the recursive function will call upon itself until every network is fully created, this algorithm will stop after connecting 3 roads. All networks are now within a long list. The optimality of all the created 3-road-networks and the length of these networks are compared on the basis of score divided by unit road placed. The list is sorted on this criteria and the first network in the list is now the most optimal network. From the most optimal network, the first of the three roads is saved. Now the program again calls upon the algorithm, but with the input including the roads previously formed. The program continues creating new roads until all of the available road is placed, by constantly creating 3-road-networks and evaluating these networks. Besides the maximum depth, the maximum amount of roads placed can also be entered as input. With this function possible extensions to the current network can be created.

3.3 Poverty assessment As stated earlier, the poorest people in Ethiopia live in rural areas. For this reason we will focus on a woreda level in our research. A woreda is the second administrative unit above the smallest unit of local government in rural communities in Ethiopia. Furthermore, data on woreda-level is broadly more available. Consequently, when data on woreda level is being used, data about towns will be very contrasting and hard to visualize in a map. For these reasons and the limited time we have for this research, urban poverty will not be taken into our research and only rural poverty by woreda will be mapped, unless stated otherwise. However, towns will be displayed on the maps, this allows us to see if there may be any remarkable connections between the rural poverty rate of woredas and placement of roads and towns.

As economic data was not available, we opted for the food poverty line as our measure of poverty. Households which are below the poverty line are households who could not consume enough to get the minimum calorie requirement of 2200 Kcal per day (Nega et al., 2011). The head count ratio of rural poverty per woreda will eventually be mapped in ArcGIS. The food security will also be visualized in ArcGIS in order to see if there is a connection between food security and poverty. If this is present, it suggests that the theory that agriculture has a big influence on poverty is positive.

Firstly, the current asphalt road network needs to be visualized. Next, the population density will be mapped in order to see which areas are most rural and urban. Hereafter, a map with the poverty rate per woreda will be made. Once again, these maps will be made using ArcGIS. This data and information about which towns are present in which woreda will be clearly ordered as it is needed for the poverty assessment and the making of the algorithm.

12

3.3 Geographic remoteness assessment A dataset provided by Dr. Crelis Rammelt contains most of the data that was used in this research. Other missing data was found either through ArcGIS online or through literature. Appendix A contains the complete metadata of all the data that was used in ArcGIS.

For the geographic remoteness mountainous areas, rivers and forests were mapped. More divisions of physical features could be used, but the scale of this research is too large to do this, which is why the focus was on three physical features only. Firstly, a Digital Elevation Model (DEM) was used to construct the slopes of Tigray. The DEM is visualized in figure 4. Since no exact definition could be found for lowlands regarding the corresponding slopes, lowlands were estimated at slopes between 0° and 10°. Data that included the rivers and forests were found through ArcGIS online. Ideally, rivers could be constructed using satellite imagery and by drawing polygons or lines in ArcGIS. Also, forests could be mapped through ERDAS by using Remote Sensing (RS). However, due to limited time, the data from ArcGIS online was used in this research.

Figure 4. Digital Elevation Model (DEM) of Tigray Larger weight was given to mountain ranges than to rivers. Hearn (2011) studied the construction and maintenance of roads in lowlands and mountainous areas and concluded that the construction costs in mountainous areas can be two to three times higher than the construction costs in lowlands. An example of a project that he studied was a project in Ethiopia where a road was built across the Blue Nile gorge in 2010. The costs of the construction on the plateau were approximately $300 000. In contrast, the construction costs in the gorge were approximately $900 000. In comparison, the United States Department of Agriculture (2011) estimated the construction costs of bridges between $2100 and $3350 per feet and on top of that $30 000 - $40 000 for deep spread footings.

13 This is why larger weight was given to mountainous areas. In addition, Hearn (2011) also found that the lowest construction costs possible in mountainous areas are often part of unsustainable construction strategies. He stresses that there is a significant need in efficient planning of the costs and that there is a need of the right technical resources.

The geographic remoteness will be clarified through two scores, namely that a region is not or slightly geographically remote or that a region is geographically remote. The regions that are geographically remote will automatically not be connected to the current network. Furthermore, coordinates of specific areas will also be retrieved for the making of the algorithm. These scores and coordinates are put into a table, which are needed for the algorithm.

4. Results

Figure 5. The road network of Tigray in 2007

Figure 5 shows the road network of Tigray as it was in 2007.

14

4.1 Results of the poverty assessment Figure 6 shows the map of Tigray with the different rural poverty rates per woreda. Tigray counts 32 woredas. The mean poverty level is 44%. The highest head count ratio with 75% is in and Mereb Hele. The woreda with the lowest rural poverty is Kafta Humera with just 10% (Nega et al., 2011). It is remarkable that high and low poverty woredas are bordering each other but overall, it seems like poverty rates are higher in the Eastern part of Tigray and lower in the West. The exact poverty rate per woreda can be found in Appendix B with additional information.

Based off of figure 7, it can be assumed that the population density in Western Tigray is sparse: less than 50 inhabitants per square kilometer. Lower population density in an area with enough successful agricultural practices may explain why the West of this province has lower poverty headcount ratio.

Figure 6. Poverty percentage per woreda in Tigray, Irob and Mereb Hele selected in North-East and Kafta Humera selected on the West side

15

Figure 7. Population density per woreda in Tigray

4.2 Results of the geographic remoteness assessment Figure 9 shows the results of the geographic remoteness assessment. It contains the slope of the hills and mountains, rivers and the woody biomass/forests. Furthermore, it visualizes the towns and woredas of interest and the asphalt roads as well. The towns and their woredas that are not or slightly geographically remote are selected with a bright blue color. The selected towns are Chercher in Raya Azebo in the south of Tigray, Haiqmeshal in Wenberta in the East and Mai Gaba in Welkait in the West. Raya Azebo and Mai Gaba are the towns that are slightly remote, as bridge costs need to be taken into account. The other towns are geographically remote due to the mountain ranges, and construction costs will be substantially high in this case as explained earlier. Because the forests were mainly situated on the mountain ranges, they did not need to be considered further.

16

Figure 8. Map showing the geographic remoteness of towns in Tigray, through mountainous areas, rivers and forests

4.3 Results of the optimality algorithm The current network has a total length of 1.121.423 units, and consists of 44 roads. It connects 42 of the 60 towns within Tigray. The total population connected to the current network is 2.008.277. It has connected 1.059.973 impoverished inhabitants. The optimal network created by the algorithm has a total length of 1.047.961, and consists of 37 roads. It connects 38 of the 60 towns in Tigray. The total population connected to the current network is 2.865.350. It has connected 1.530.680 poor inhabitants. Both networks are listed in Appendix C.

12 roads occur in both networks, which is relatively few. 25 towns have been connected in both networks. Within the optimal network, towns far in the west have not been connected, whereas they have been connected in current network. This is due to the relatively low poverty rates in western Tigray. The optimal network scores especially better in the connection of all places near other nodes, since it prefers these links over long connections. The current network connects 31% less impoverished people and 30% less people overall.

A possible explanation for the differences between the two networks might be that some towns have been connected multiple times and that this does not reflect within the score. However, the optimal network uses 0.97 road per town and the current network 1.05 road per town. This does not explain the major difference in optimality though. Most probable is that the ERA prefers asphalt roads throughout Tigray and connecting adjacent villages with rural roads.

17

Current Network Optimal Network • 44 roads • 37 roads • 42 out of 60 towns • 38 out of 60 towns • 2.0 million people • 2.9 million people • 1.1 million people beneath the poverty • 1.5 million people beneath the poverty line line

Overall • 12 roads exactly the same • 25 towns connected in both networks • 31 % less people in current network • 30 % less impoverished people in current network Table 2. Optimality assessment summary results

Since the current network cannot be revised, it is also interesting to see which connections can improve the current network the most. Firstly, Rama should be connected, since a lot of people live in Rama. This connection can best be established from . Also, Semema can be linked rather easily, since it is nearby Shire Endalase. Lastly, Mahbre Degue has a relatively high amount of people as well, yet it is currently unconnected. This link can also be established from Axum.

5. Discussion

As stated in the introduction, the model presented here is still quite simplistic. Due to limited resources, the focus of this research was narrowed down to a few factors. Moreover, due to limited availability of data of Ethiopia, the focus needed to be narrowed down even further. Even though the model is quite simplistic, it can serve as a base or starting point for future research and it offers great possibilities for automatic road planning, as manual road planning can be quite intensive (Mohammadi Samani et al., 2010). This has also been recognized by others and this has resulted in the recent development of automatic road planning. Again, it should be noted that actual poverty reduction was not assessed in this research, but rather new roads are proposed that are part of the most optimal road network that resulted from this research. Another similar research was conducted by Mohammadi Samani et al. (2010). They used GIS and AHP (Analytical Hierarchy Process) for the planning of forest roads and compared this to the traditional way of road planning. Although they did not look at socioeconomic factors, they took into account more geographical and ecological factors, such as hydrology, slope, geology, soil, tree volume, tree type. They classified areas of the research area into 5 classes of suitability for forest roads. They found that this way of planning showed better results than the traditional way of road planning. This also suggests that in future research a baseline is needed in order to compare the result and determine the performance of the model. A research that did include socioeconomic factors was conducted by Yang and Bell (2007). They presented new developments concerning the Network Design Problem (NDP), which means that the travel demand is growing at higher rates than that the network can

18 grow. At the same time, resources to expand this network are limited. They developed an economic based function for the optimization of the road network by including the elasticity of the travel demand, but they also included the preferential routes and capacity improvements. Both studies give some indication of how different factors can be included into optimization models and how the model in this research can be improved.

What also need to be taken into further consideration is the fact that only rural data and asphalt roads have been assessed in this research. Even though most people live in rural areas, the urban population also matters and may even be even taken into more consideration than rural poverty heads when road placement is being planned. Urban areas ultimately also produce and involve economic development. In our case study we focus on Ethiopia while the first two RSDPs were running from 1997 to 2009. In these two RSDPs trunk roads and link roads were constructed and upgraded. The RSDPs do not focus on unpaved rural roads while rural roads also have potential to lead to economic growth and poverty reduction (Escobal & Ponce, 2002). The inclusion of travel time reliability as definition for optimality could be useful for the assessment of the network including rural roads, since it allows differences between roads.

Another factor that could be considered is that not only the physical distance plays a role in poverty. As explained earlier, Epprecht et al. (2011) showed that the geographic remoteness is a strong predictor of poverty. However, they show that the socio-cultural distance is probably a stronger predictor. In this perspective, barriers include the language and the cultural differences. It could be interesting to focus on this aspect as well in future research.

Moreover, as stated earlier, it might be difficult for governments to decide whether large investments should be put into the road development in remote areas (Bird et al., 2010). Epprecht et al. (2011) stated that small urban centres might be of greater importance than large urban centres in the poverty distribution in a country. Therefore, it might be interesting to look into the alternative to invest into the development of small urban centres, by locating small political and administrative centres into these areas. This should be done in future research.

The result presented in this research only represents one moment in time. However, it might be interesting to conduct a long term research of the past and see whether the optimality of the network was better or worse in the past, since the poverty distribution might have been different in the past.

Concerning the geographic remoteness assessment, there are some points that could be improved in future research. Ideally the rivers and forests are determined using recent satellite imagery when there are enough resources to do this. Furthermore, it is difficult to get a quick idea of at which point the road construction costs substantially increase for mountainous areas. Collaborations with road engineers is particularly important for this type of research to get a clearer idea of how the construction costs increase. Finally, depending on which scale is being used, it might be interesting to look at other subdivisions of physical features, which should be done at lower scales.

19 6. Conclusion

Since roads are capable of empowering and developing areas, it is needed to create connection to these towns. The socioeconomic benefits of roads, such as access to larger markets, education and job opportunities, need to be available for as many people as possible. Most importantly, these effects directly benefit the poor within the woredas that are dependent on help from the government.

One of the problems in connecting all regions across Tigray is their geographical remoteness. Mountain ranges and the forest across them make the design and engineering of roads to these towns that are geographically remote more expensive in construction. However, also some reasonably not-remote towns have not been connected. Furthermore, poverty is not evenly distributed through Tigray. The poverty rate is generally higher in areas with higher population density and of course, in areas with higher food stress. With the algorithm it can be concluded that the current network is not optimal, since with the total length of roads in the current network more people could have been linked to the current road network. This difference in optimality between the current and the optimal network can for some extent be explained by the inclusion of other data. However, the difference needs to be researched further as the suggested optimal network scores 30% better. For further road development, suggestions within this research need to be considered as they improve the optimality.

20 References

Aliber, M. (2003). Chronic poverty in South Africa: Incidence, causes and policies. World Development, 31(3), 473-490.

Ali, I. & Pernia, E. M. (2003). Infrastructure and Poverty Reduction - What is the Connection?. Asian Development Bank.

Asakura, Y., & Kashiwadani, M. (1991). Road network reliability caused by daily fluctuation of traffic flow. In PTRC Summer Annual Meeting, 19th, 1991, University of Sussex, United Kingdom. Australian Institute of Health and Welfare (AIHW) (n.d.). Geographic remoteness. Retrieved from: http://meteor.aihw.gov.au/content/index.phtml/itemId/396537

Baccini, A., Laporte, N., Goetz, S.J., Sun, M. and Dong, H. 2008. A first map of tropical Africa's above- ground biomass derived from satellite imagery. Environmental Research Letters 3.

Beuran, M., Gachassin, M., & Raballand, G. (2015). Are There Myths on Road Impact and Transport in Sub-Saharan Africa?. Development Policy Review,33(5), 673-700.

Bevan, P., & Joireman, S. F. (1997). The perils of measuring poverty: identifying the ‘poor’ in rural Ethiopia. Oxford Development Studies, 25(3), 315-343.

Billington, R., R. Allan. (1992). Reliability evaluation of engineering systems: Concepts & techniques, Plenum Press Publish, New York, United States of America.

Calderón, C., & Servén, L. (2008). Infrastructure and economic development in Sub-Saharan Africa. World Bank Policy Research Working Paper Series, 4712. World Bank

Chen, A., H. Yang, H.K. Lo, W.H. Tang (2002) Capacity reliability of a road network; an assessment methodology and numerical results, in: Transportation Research Part B, 36, pp. 225-252.

Dercon, S., Gilligan, D. O., Hoddinott, J., & Woldehanna, T. (2009). The impact of agricultural extension and roads on poverty and consumption growth in fifteen Ethiopian villages. American Journal of Agricultural Economics, 91(4), 1007-1021.

Diao, X., & Pratt, A. N. (2007). Growth options and poverty reduction in Ethiopia–An economy-wide model analysis. Food Policy, 32(2), 205-228.

Escobal, J., & Ponce, C. (2003). The benefits of rural roads. Enhancing income opportunities for the rural poor, working paper 40-I. Grupo de Análisis para el Desarrollo.

Easterly, W. (2002). Growth in Ethiopia: retrospect and prospect. Center for Global Development, New York University. Retrieved from: http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.192.4349&rep=rep1&type=pdf

21 Hanjra, M. A., Ferede, T., & Gutta, D. G. (2009). Pathways to breaking the poverty trap in Ethiopia: Investments in agricultural water, education, and markets. Agricultural Water Management, 96(11), 1596-1604.

Hearn, G. J. (2011). Slope engineering for mountain roads. Geological Society of London.

Huskey, L. (2005). Challenges to economic development: Dimensions of “remoteness” in the North. Polar Geography, 29(2), 119-125.

Iida, Y., & Wakabayashi, H. (1989). An approximation method of terminal reliability of road network using partial minimal path and cut sets. In Transport Policy, Management & Technology Towards 2001: Selected Proceedings of the Fifth World Conference on Transport Research (Vol. 4).

Khandker, S. R., Bakht, Z., & Koolwal, G. B. (2009). The poverty impact of rural roads: evidence from Bangladesh. Economic Development and Cultural Change, 57(4), 685-722.

Najafi, A., & Mohammadi Samani, K. (2010). Planning road network in mountain forests using GIS and Analytic Hierarchical Process (AHP).Caspian Journal of environmental sciences, 8(2), 151-162.

Nega, F., Negash, Z., Solomon, M. G., Mohammednur, Y., Miruts, H. (2011). Baseline socioeconomic Survey Report of .

Porter, G. (2002). Living in a walking world: rural mobility and social equity issues in sub-Saharan Africa. World development, 30(2), 285-300.

Pugh, R., & Cheers, B. (2010). Rural social work: An international perspective. Policy Press.

Repko, A. F. (2012). Interdisciplinary research: process and theory.

Shiferaw, A., Soederbom, M., Siba, E., & Alemu, G. (2012). Road networks and enterprise performance in Ethiopia: Evidence from the road sector development program. International Growth Centre, The College of William and Mary, Working Paper, 12, 0696.

United States Department of Agriculture (USDA) (February, 2011). Cost estimating guide for road construction. USDA.

Wakabayashi, H., Y. Iida (1992) Upper and lower bounds of terminal reliability of road networks: an efficient method with Boolean algebra., in: Journal of Natural Disaster Science, 14, pp. 29-44.

World Bank. (2009). In Ethiopia all roads lead to development. International Development Association. Retrieved 1 March 2016 from: http://web.worldbank.org/WBSITE/EXTERNAL/EXTABOUTUS/IDA/0,,contentMDK:22229790~menuPK: 4754051~pagePK:51236175~piPK:437394~theSitePK:73154,00.html

Yang, H., & H. Bell, M. G. (1998). Models and algorithms for road network design: a review and some new developments. Transport Reviews, 18(3), 257-278.

22 Appendix A. ArcGIS data used in the geographic remoteness assessment

ArcGIS data

Name layer Source Description

DEM_Tigray Dr. Crelis Rammelt This layer contains the digital elevation model of the province Tigray, Ethiopia

Asphalt roads Dr. Crelis Rammelt This layer contains the asphalt roads of the province Tigray, Ethiopia

Towns Dr. Crelis Rammelt This layer contains towns of the province Tigray, Ethiopia

Slope_Tigray Produced through the layer This layer contains the slopes of DEM_Tigray the elevation of the province Tigray, Ethiopia

Ethiopia Rivers ArcGIS online - ajhethiopia This layer contains the rivers of the province Tigray, Ethiopia

Ethiopia woody above-ground ArcGIS online - consbio Observations from the moderate biomass resolution imaging spectroradiometer (MODIS) were used in combination with a large data set of Field measurements to map woody above-ground biomass (AGB) across tropical Africa. We generated a best- quality cloud-free mosaic of MODIS satellite reflectance observations for the period 2000- 2003 and used a regression tree model to predict AGB at 1 km resolution. Results based on a cross-validation approach show that the model explained 82% of the variance in AGB, with a root mean square error of 50.5 Mg ha- 1 for a range of biomass between 0 and 454 Mg ha-1 . Analysis of lidar metrics from the Geoscience Laser Altimetry System (GLAS),

23 which are sensitive to vegetation structure, indicate that the model successfully captured the regional distribution of AGB. The results showed a strong positive correlation ( R2 = 0.90) between the GLAS height metrics and predicted AGB.

2014 Ethiopia Woredas ArcGIS online - bodonnell_USAID Third Level administrative divisions

FoodSecurity ArcGIS online - bstayer_eth Food security data for Ethiopia.

24 Appendix B. Woreda information used in the poverty assessment

Woreda Poverty rate in % Population in 2007 Population density

Alamata 44 104002 136

Ambalaje 63 131531 154

Asegede Tsimbela 19 165168 63

Atsbi Wenberta 36 136746 143

Dengua Temben 45 138320 121

Endamehoni 73 56512 81

Enderta 23 139235 93

Erob 75 31510 37

Ganta Afeshum 53 107970 187

Gulomahda 35 103274 157

Hawzen 49 144561 151

Hintao Wajirat 65 185464 94

Kafta Humera 10 112269 15

Kola Temben 58 163646 109

Lay Adinabo 20 136721 68

Lay Mayichew 57 88469 150

Medebay Zana 35 153521 134

Mekele 31 262622 94

Mereb Lehe 75 120612 123

25 29 127374 129

Ofla 63 154680 108

Raya Azebo 51 165750 158

Saesi Tsada Amba 55 168 86

Samre/Seharti Samire 43 151690 25

Tahtay Adiyabo 40 111336 25

Tahtay Koraro 56 120846 164

Tahtay Maychew 35 83520 129

Tanku 45 113121 71

Tsegede 43 126732 44

Tsilemti 22 169150 58

Welait 24 170565 41

Werie Lehe 62 178430 128

26 Appendix C: Roads in current network and optimal network and algorithm codes The roads in green occur in both networks.

Optimal Network New Network

Location 1 Location 2 Location 1 Location 2 abiyadi yechla Abiyadi Hagereselam hagereselam abiyadi Abiyadi Werqamba kisad gaba adi hageray Adebay Setit humra mai gaba adi remts Adi Daero Adi Nebri Ead adigudem Adi goshu Adebay betmara adishu Adi Hageray Sheraro alamata Adi Nebri Ead Adi Hageray atsbi Adi Remts Ketema Nigus

Mahbre degue axum Adi Remts Dansha hiwane betmara Axum dela bora Adigudem Mekelle alamata chercher Adishu Betmara hiwane dela Alamata Wajatmuga shire endaslase endabaguna Alamata Korem yechla gjet Alamata Mokoni mekelle hagereselam Axum Wuqro maray atsbi haigmeshal Betmara Hiwane hagereselam hawzen Bizet Fatsi adigudem hiwane Bizet Adigrat shire endaslase kisad gaba Edaga hamus Bizet mokoni korem Fatsi Zalambesa mokoni machew Freweyni Edaga hamus semema Mahbre degue Freweyni Hawzen mai hanse mai gaba Haiqmeshal Freweyni

27 kisad gaba mai hanse Hiwane Adigudem adishu mokoni Kisad Gaba Mai Hanse machew msweaty Korem Msweaty werqamba rama Machew Adishu gjet samre Mai Hanse Adi Remts semema selekleka Mekelle Haiqmeshal werqamba semema Mekelle Hagereselam adi hageray sheraro Msweaty Machew semema shire endaslase Rawyan Mai Kadra alamata wajatmuga Rawyan Baeker abiyadi weqamba Selekleka Shire Endaslase selekleka wuqro maray Setit humra Rawyan selekleka zana Sheraro Adi goshu

Shire Endaslase Kisad Gaba

Shire Endaslase Adi Daero

Werqamba Hawzen

Werqamba Axum

Wuqro maray Selekleka

28 1 Network optimality code from math import sqrt from copy import deepcopy def find shortest combination(locations): ’’’Looks for the shortest new road that ... can be built. Builds no road if ... m a x road is exceeded ’’’ shortest distance = False shortest link = [] for location in locations: if location["connected"]: ’’’there is existing connection ,... lets loop over the possible ... short routes ’’’ for connection in locations: if not connection["connected"]: distance = sqrt(abs(... location["x"] − ... connection["x"]) ∗∗2 ... + abs(location["y"]... −connection["y"]) ∗∗2) if not shortest distance... or distance ... < shortest distance: shortest distance =... distance shortest link = ... [location,connection] return shortest distance, shortest link def find best connections(start locations, ... start roads, distance, max road , ... parent score, depth): ’’’finds all connections within max r o a d . . . and not going further than depth ... into the tree.’’’ if (depth > 0): my list = [] my best = 0 locations = deepcopy(start locations) for location in start locations: ’’’Every node should be checked ...

1 whether connected. ’’’ if location["connected"]: ’’’we have an existing ... connection , lets loop ... over the possible ... short routes ’’’ for i in range(len(locations)): connection = locations[i] if not ... connection["connected"]: ’’’Can only connect ... nodes not already ... connected ’’’ new distance = sqrt(... abs(location["x"]... −connection["x"]) ∗∗2 ... +abs(location["y"] − ... connection["y"]) ∗∗2) ... ’’’Eucladian distance ... between 2 points ’’’ if new distance + ... distance <= max road: ’’’Road can not ... be too long.’’’ new roads = ... deepcopy( ... start roads) new locations = ... deepcopy(locations) node score = ... new locations[i] ... ["score"]... + parent score ’’’make dict of the ... new r o a d ’ ’ ’ new roads.append({ ’start’: location , ’end’: new locations[i], ’distance’: new distance , }) new locations[i]["connected"]... = True

2 if depth > 0: ’’’Find possible ... extentions on ... roads, so that ... you can compare ... networks ’’’ next level = ... find best connections( new locations[:], new roads [:], distance + new distance , max road , node score , depth −1) if depth == 1: ’’’Append all ... possible roads. ’’’ my list.append( next level) else: for level in next level: my list.append(level) elif max road < find shortest combination( start locations)[0]: return start locations , start roads , distance + new distance , max road , parent score , sorted list = sorted( my list , key = lambda overview: −(overview[4] / overview[2]) ) ’’’Sort list on basis of length road ... divided by points of network’’’ return sorted list if depth == 0: ’’’End of depth, return input.’’’ return start locations, start roads, distance, ... max road, parent score def create best(locations, roads, max road , ... depth, amount):

3 ’’’Returns the best road, namely the ... first road of the best network ... created by find b e s t connections ’’’ sorted list = find best connections( locations , roads , 0, max road , 0, depth) if not len(sorted list) == 5 and len(sorted list) != 0:

’’’Some error fixes ’’’ roads.insert( 0, sorted list[0][1][amount]) max road = ... max road − sorted list[0][1][amount]["distance"] for location in locations: if location["name"] == roads[0]["end"]["name"]:

location["connected"] = True return locations, roads, max road def build the world(locations, roads, max road , ... depth , how many times ): ’ ’ ’ h o w m a n y times indicates the maximum ... of roads can be placed’’’ ’’’Calls upon create best iteratively ... to build the entire network’’’ shortest connection = find shortest combination(locations)[0] realdepth = deepcopy(depth) amount = 0 while max road > shortest connection and amount < how many times :

locations, roads, max road = create best( locations , roads ,

4 max road , realdepth , amount) shortest connection = find shortest combination(locations)[0] amount += 1 return locations, roads, max road def score network(locations): ’’’Defines score of the entire network.’’’ score = 0 for location in locations: if location["connected"]: score += location["score"] return score def length network(roads): ’’’Defines length of the entire network.’’’ length = 0 for road in roads: length += road[’distance’] return length

5