Multi‐objective highway alignment optimization using a genetic algorithm

The available highway alignment optimization algorithms use the total cost as the objective function. This is a single objective optimization process. In this process, travel‐time, vehicle operation accident earthwork land acquisition and pavement construction costs are the basic components of the total cost. This single objective highway alignment optimization process has limited capability in handling the cost components separately. Moreover, this process cannot yield a set of alternative solutions from a single run. This paper presents a multi‐objective approach to overcome these shortcomings. Some of the cost components of highway alignments are conflicting in nature. Minimizing some of them will yield a straighter alignment; whereas, minimizing others would make the alignment circuitous. Therefore, the goal of the multiobjective optimization approach is to handle the trade‐off amongst the highway alignment design objectives and present a set of near optimal solutions. The highway alignment objectives, i.e., cost functions, are not continuous in nature. Hence, a special genetic algorithm based multi‐objective optimization algorithm is suggested The proposed methodology is demonstrated via a case study at the end.     

Pareto-improving transportation network design and ownership regimes

Private provision of public roads signifies co-existence of free, public-tolled and private-tolled roads. This paper investigates the Pareto-improving transportation network design problem under various ownership regimes by allowing joint choice of road pricing and capacity enhancement on free links. The problem of interest is formulated as a bi-objective mathematical programming model that considers the travel cost of road users in each origin-destination pair and the investment return of the whole network. The non-dominated Pareto-improving solutions of toll and/or capacity enhancement schemes are sought for achieving a win-win situation. A sufficient condition is provided for the existence of the non-dominated Pareto-improving schemes and then the properties of those schemes are analyzed. It is found that, under some mild assumptions, the optimal capacity enhancement is uniquely determined by the link flow under any non-dominated Pareto-improving scheme. As a result, the joint road pricing and capacity enhancement problem reduces to a bi-objective second-best road pricing problem. A revenue distribution mechanism with return rate guarantee is proposed to implement the non-dominated Pareto-improving schemes.     

New technologies for transport route selection

Planning a new road or railway can be an expensive and time-consuming process. There are numerous environmental issues that need to be addressed, and the problem is exacerbated where the alignment is also influenced by the location of services, existing roads and buildings, and the financial, social and political costs of land resumption.A comprehensive approach to the problem is available through the recent convergence of: geospatial imaging, softcopy photogrammetry, regional significance analysis and alignment optimisation. The first technology is concerned with obtaining low cost data containing far more information than was available in the past. The second two are concerned with extracting from that data, information essential to the planning process. The final technology is about automating the way alignments are generated to produce low cost, high quality routes.The convergence of these enabling technologies can have a major impact on the way that various jobs are performed – or whether they are done at all. Separately, they can have a major influence on a large number of disciplines, but taken in combination they can change the paradigm of alignment planning completely. By taking tasks that were previously difficult, time-consuming and expensive, and making them easy, fast and cheap, they can change completely the way alignments are planned.     

A highway corridor planning model: QROAD

This model calculates an optimal investment plan for a highway corridor or number of corridors, subject to budget constraints. The available options include upgrading the current alignment, constructing a bypass highway over a different alignment, or various combinations. The budget constraints can be specified as a total budget restriction, or as an available budget each period. The highway system is described by K different road links. Each link consists of the current alignment which may be described by any number of sections, and a bypass section over a new alignment. The model finds the construction plan for each link that maximizes discounted benefits, subject to the financial constraints on the maintenance and capital expenditures. The problem is formulated as a large combinatorial optimization problem. A Lagrangian relaxation of the budget constraints is used, and the problem decomposes by link. A dynamic programming (DP) model is used to solve for the optimal expansion path for each link, given the dual variables. The sub-gradient dual optimization problem is a linear programming problem which is solved for the optimal dual variables. An application is presented based on the World Bank's Third National Highway Project in India, which is a US$1.3 billion project for upgrading approximately 2000 km of the Indian National Highway System. The project was approved based on results from this model.     

Applicability of highway alignment optimization models

This paper presents an intelligent optimization tool that assists planners and designers in finding preferable highway alignments, connecting specified endpoints or zones. It integrates genetic algorithms with a geographic information system (GIS) for optimizing highway alignments and processes massive amounts of relevant data associated with highway design and alternative evaluation. To show the applicability of the proposed model to a real-world problem, two actual highway projects in the state of Maryland have been analyzed using the model. An extensive analysis of sensitivity to key model parameters is also conducted to describe the model capabilities. The analysis results show that the model can effectively optimize highway alignments in an area combining complex terrain and various types of natural and cultural land-use patterns, and provide detailed information of optimized alignments as a model output. It is also found that the alignments optimized by the model are quite similar to those obtained through conventional manual methods by a state agency, but the model can greatly reduce the time required for highway planning and design as well as produce lower cost solutions. Finally, the results confirm that all dominating and alignment-sensitive costs should be simultaneously evaluated in the alignment optimization process because many trade-off opportunities exist among those costs. The proposed model can greatly contribute to the productivity of highway planners as well as to the quality of the resulting infrastructure.     

Optimization of horizontal alignment geometry in road design and reconstruction

This paper presents a general formulation for optimization of horizontal road alignment, composed of tangential segments and circular curves suitably connected with transition curves (clothoids). It consists of a constrained optimization problem where the objective function is given by a line integral along the layout. The integrand is a function representing the cost of the road going through each point and, by considering different costs, a wide range of problems can be included in this formulation. To show it, we apply this methodology to three different situations. The two first cases are related with the design of a new road layout and used to solve a pair of academic examples. The third problem deals with the improvement of a road adapting the old path to current legislation, and it is solved taking as case study the reconstruction project for a regional road (NA-601) in the north of Spain.     

Access control policies without inside queues: Their properties and public policy implications

An access control policy that eliminates all queues beyond the entry points to a network has obvious benefits, which include smooth travel and predictable travel times inside the network. Yet it has never been proven, to the best of our knowledge, whether excluding inside queues yields sub-optimal network performance or, in other words, allowing inside queues can actually further reduce the system travel cost. Moreover, it is not clear whether an optimal control policy derived from efficiency considerations can also be a fair policy to all road users. This paper provide answers to these questions in the context of a monocentric network. By analyzing the structure of the access control problem considering all feasible policies (with/without inside queues), we show that the minimal system cost realizable by access control can be obtained without directly solving a non-convex optimization program, and can indeed always be achieved by a control policy excluding all of the inside queues. These optimal policies are defined by a polyhedral set and a Finite Generation Algorithm can be applied to derive the analytical form of this set. The optimal policies are not unique in general, thus making it possible to achieve both minimal system cost and fairness simultaneously.     

Modelling route choice behaviour in a tolled road network with a time surplus maximisation bi-objective user equilibrium model

In this paper, we propose a novel approach to model route choice behaviour in a tolled road network with a bi-objective approach, assuming that all users have two objectives: (1) minimise travel time; and (2) minimise toll cost. We assume further that users have different preferences in the sense that for any given path with a specific toll, there is a limit on the time that an individual would be willing to spend. Different users can have different preferences represented by this indifference curve between toll and time. Time surplus is defined as the maximum time minus the actual time. Given a set of paths, the one with the highest (or least negative) time surplus will be the preferred path for the individual. This will result in a bi-objective equilibrium solution satisfying the time surplus maximisation bi-objective user equilibrium (TSmaxBUE) condition. That is, for each O–D pair, all individuals are travelling on the path with the highest time surplus value among all the efficient paths between this O–D pair.We show that the TSmaxBUE condition is a proper generalisation of user equilibrium with generalised cost function, and that it is equivalent to bi-objective user equilibrium. We also present a multi-user class version of the TSmaxBUE condition and demonstrate our concepts with illustrative examples.     

A bi-objective bi-level signal control policy for transport of hazardous materials in urban road networks

A bi-objective bi-level signal control optimization for hazardous material (hazmat) transport is considered to assess trade-offs between travel cost and environment impacts such as public risk exposure. A least maxi-sum risk model with explicit signal delay is presented to determine generalized travel cost for hazmat carriers. Since the bi-level signal control problem is generally a non-convex program, a bundle method using generalized gradients is proposed. A bounding strategy is developed to stabilize solutions of the bi-level program and reduce relative gaps between iterations. Numerical comparisons are made with other risk-averse models. The results indicate that the proposed bi-objective bi-level model becomes even amiable to signal control policy makers since provides flexible solutions whilst is acceptable to carriers since takes account of travel delay at signal-controlled junctions. Moreover, the trade-offs between public risk and generalized travel costs are empirically investigated among different risk models with a variety of weights. As a result, the proposed model consistently exhibits highly considerable advantage on mitigation of public risk whilst incurred less cost loss as compared to other alternatives.     

A cost and expected consequence approach to planning and managing railroad transportation of hazardous materials

Although hazardous materials (hazmat) account for around 140 million tons of all railroad freight traffic in the US, it has not received much attention from academic researchers. This is surprising especially when one considers the volume of hazmat moved by railroads in both North America and Europe. In this paper we develop a bi-objective optimization model, where cost is determined based on the characteristics of railroad industry and the determination of transport risk incorporates the dynamics of railroad accident. The optimization model and the solution framework is used to solve a realistic-size problem instance based in south-east US, which is then analyzed to gain managerial insights. In addition, a risk-cost frontier depicting non-dominated solutions is developed, followed by conclusion.     

Bi-objective optimization for the container terminal integrated planning

In this paper, we study the joint optimization of the tactical berth allocation and the tactical yard allocation in container terminals, which typically consist of berth side and yard side operations. The studied two objectives are: (i) the minimization of the violation of the vessels’ expected turnaround time windows with the purpose of meeting the timetables published by shipping liners, and (ii) the minimization of the total yard transportation distance with the aim to lower terminal operational cost. We propose a bi-objective integer program which can comprehensively address the import, export and transshipment tasks in port daily practice. Traditionally, a container transshipment task is performed as a couple of import and export tasks, called indirect-transshipment mode, in which the transit container are needed to be temporally stored in the yard. As the way of transferring containers directly from the incoming vessel to the outgoing vessel, called direct-transshipment mode, has potential to save yard storage resources, the proposed model also incorporates both indirect- and direct-transshipment modes. To produce Pareto solutions efficiently, we devise heuristic approaches. Numerical experiments have been conducted to demonstrate the efficiency of the approaches.     

A bi-objective approach to routing and scheduling maritime transportation of crude oil

Maritime transportation, the primary mode for intercontinental movement of crude oil, accounts for 1.7 billion tons annually – bulk of which are carried via a fleet of large crude oil tankers. Although spectacular episodes such as Exxon Valdez underline the significant risk and tremendous cost associated with marine shipments of hazardous materials, maritime literature has focused only on the cost-effective scheduling of these tankers. It is important that oil transport companies consider risk, since the insurance premiums is contingent on the expected claim. Hence through this work, we present a mixed-integer optimization program – with operating cost and transport risk objectives, which could be used to prepare routes and schedules for a heterogeneous fleet of crude oil tankers. The bi-objective model was tested on a number of problem instances of realistic size, which were further analyzed to conclude that the cheapest route may not necessarily yield the lowest insurance premiums, and that larger vessels should be used if risk is more important as it enables better exploitation of the risk structure.     

Large-scale evacuation network optimization: a bi-level control method with uncertain arterial demand

To improve the efficiency of large-scale evacuations, a network aggregation method and a bi-level optimization control method are proposed in this paper. The network aggregation method indicates the uncertain evacuation demand on the arterial sub-network and balances accuracy and efficiency by refining local road sub-networks. The bi-level optimization control method is developed to reconfigure the aggregated network from both supply and demand sides with contraflow and conflict elimination. The main purpose of this control method is to make the arterial sub-network to be served without congestion and interruption. Then, a corresponding bi-objective network flow model is presented in a static manner for an oversaturated network, and a Genetic Algorithm-based solution method is used to solve the evacuation problem. The numerical results from optimizing a city-scale evacuation network for a super typhoon justify the validity and usefulness of the network aggregation and optimization control methods.     

Modeling a rail transit alignment considering different objectives

An optimization model for station locations for an on-ground rail transit line is developed using different objective functions of demand and cost as both influence the planning of a rail transit alignment. A microscopic analysis is performed to develop a rail transit alignment in a given corridor considering a many-to-one travel demand pattern. A variable demand case is considered as it replicates a realistic scenario for planning a rail transit line. A Genetic Algorithm (GA) based on a Geographical Information System (GIS) database is developed to optimize the station locations for a rail transit alignment. The first objective is to minimize the total system cost per person, which is a function of user cost, operator cost, and location cost. The second objective is to maximize the ridership or the service coverage of the rail transit alignment. The user cost per person is minimized separately as the third objective because the user cost is one of the most important decision-making factors for planning a transit system from the users’ perspective. A transit planner can make an informed decision between various alternatives based on the results obtained using different objective functions. The model is applied in a case study in the Washington, DC area. The optimal locations and sequence of stations obtained using the three objective functions are presented and a comparative study between the results obtained is shown in the paper. In future works we will develop a combinatorial optimization problem using the aforementioned objectives for the rail transit alignment planning and design problem.     

Selection of roadway grades that minimize earthwork cost using linear programming

Roadway grades are normally established to satisfy the geometric specifications of the road. Once the grades are established, the earthwork allocations that minimize the cost are determined. This paper presents a model that links these two activities. The model selects the roadway grades that minimize the cost of earthwork and satisfy the geometric specifications. The geometric specifications pertain to the elements of the vertical alignment, elevation of grade line at specified stations, horizontal and vertical alignment relations, and type of vertical curve. The model enumerates all technically feasible grades and solves the linear programming problem to minimize earthwork allocation cost for those grade alternatives that satisfy borrow pit and landfill capacity constraints. The model incorporates important earthwork details and guarantees obtaining the global minimum earthwork cost. Application of the model is illustrated by a numerical example and model extensions to accomodate other design and construction aspects are presented.     

The independence of volume-capacity ratio of private toll roads in general networks

In a general traffic network under some widely used assumptions, this paper proves that the level of service, represented by the volume-capacity (v/c) ratio, offered by a profit-maximizing private firm on a private toll road is independent of another competitor’s choice of capacity and toll rate for another private toll road. The v/c ratio will be the same as the one provided by a centralized welfare-maximizing traffic authority. Moreover, the ratio remains the same even in a regulated market where the authority imposes a cap for the generalized travel cost on the private toll road.     

Electronic toll collection

Electronic toll collection (ETC) offers the opportunity for toll facility operators to supply a substantially greater amount of traffic capacity than any other currently available form of toll collection. The current interest in ETC derives from the proposals in a number of countries to introduce urban tollways, using the net toll receipts to recover the cost of the capital investment plus an acceptable profit margin for those taking the financial risk. This paper outlines the main economic, technical, and administrative features of ETC in the context of toll charges that are determined by the rules of capital cost recovery. Electronic road pricing (ERP) as a mechanism for implementing full road user charging (in line with economic principles of efficient use of road space) is not the topic of this paper, given the predominantly financial basis of setting tolls for private roads. The underlying rationale for toolroads in the political climate of most nations is not suggestive of any plan to revise the pricing regime in line with ERP upon reversion of the infrastructure to the public sector when the capital costs are repaid. It is assumed that the tollroads will revert to free roads in line with the existing road system, and that road users will continue to contribute towards the costs of maintaining the road system by the traditional pricing mechanisms (i.e. fuel taxes, vehicle registration, fees, etc.).     

Combining multicriteria analysis and tabu search for dial-a-ride problems

In the Dial-a-Ride Problem (DARP) the aim is to design vehicle routes for a set of users who must be transported between given origin and destination pairs, subject to a variety of side constraints. The standard DARP objective is cost minimization. In addition to cost, the objectives considered in this paper include three terms related to quality of service. This gives rise to a multicriteria problem. The problem is solved by means of a flexible and simple metaheuristic which efficiently integrates the reference point method for multicriteria optimization within a tabu search mechanism. Extensive tests were performed on randomly generated data and on real-life data provided by a major transporter in the Montreal area. Results indicate that the algorithm can yield a rich set of non-dominated solutions. It can also be employed to determine good trade-offs between cost and quality of service.     

Optimal road design through ecologically sensitive areas considering animal migration dynamics

With increasing land transportation requirements in both urban and rural areas, roads are encroaching ever more on animal habitats, where collisions with vehicles are a leading contributor to wildlife mortality. While road designers recognise the importance of accounting for such impacts at the design level, existing approaches simply either ignore viable habitat or avoid such regions entirely. Respectively, this can result in road alignments that are overly damaging to vulnerable species or prohibitively expensive to build and operate. The research presented in this paper investigates the effects of explicitly accounting for animal mortality on the design of a road through an ecologically sensitive area. The model presented achieves this by incorporating a spatially-explicit animal migration and road mortality model into an accepted optimal road alignment algorithm to propose low-cost roads that maintain the animal population above a minimum threshold by the end of a specified design horizon. The new method was applied to an example scenario to demonstrate the effect of setting a minimum required animal population on the road design. This model was able to consistently produce a road that met a minimum required species conservation benefit. This reflected a major improvement over the model that ignored animal habitats while only requiring a minor increase in construction and operating costs compared to the model that avoids habitat.     

Multi-objective bilevel construction material transportation scheduling in large-scale construction projects under a fuzzy random environment

Abstract

This paper investigates a transportation scheduling problem in large-scale construction projects under a fuzzy random environment. The problem is formulated as a fuzzy, random multi-objective bilevel optimization model where the construction company decides the transportation quantities from every source to every destination according to the criterion of minimizing total transportation cost and transportation time on the upper level, while the transportation agencies choose their transportation routes such that the total travel cost is minimized on the lower level. Specifically, we model both travel time and travel cost as triangular fuzzy random variables. Then the multi-objective bilevel adaptive particle swarm optimization algorithm is proposed to solve the model. Finally, a case study of transportation scheduling for the Shuibuya Hydropower Project in China is used as a real world example to demonstrate the practicality and efficiency of the optimization model and algorithm.