Search results for " Transportation"
showing 10 items of 511 documents
Reclaimed asphalt binders and mortars fatigue behaviour
2017
Fatigue cracking is one of the most important failure mechanisms occurring in asphalt pavements, especially when mixtures incorporate considerable amount of rReclaimed asphalt pavement (RAP). In fact, aged binders contained in RAP generally make asphalt more brittle and specifically reduce fatigue resistance of the resulting asphalt mixtures. Binders and mortars play a key role in this phenomenon, considering fatigue cracking usually starts within these asphalt components. However, performance-related tests and specifications commonly regard binders and there are no sound methodologies allowing the use of mortars to predicting fatigue performance of asphalts containing RAP. For this reason,…
Microstructure and shear strength evolution of a lime-treated clay for use in road construction
2020
The results of a comprehensive experimental programme are presented for assessing the long-term microstructural modifications and evaluating the effects of microstructural rearrangement on the stress–strain behaviour of a lime-treated high-plasticity clay for road embankments. The stress–strain behaviour at different lime content and curing time was investigated by means of direct shear tests; microstructural analyses were carried out combining Scanning Electron Microscope observations and Mercury Intrusion Porosimetry tests. The results show that the stress–strain behaviour of treated clay is strongly dilatant with a high peak of strength, which increases with time and lime content. Furthe…
Rheological characterisation of cold bitumen emulsion slurries
2021
The performance of cold bitumen emulsion (CBE) mixtures is strongly linked to an optimised design of the binder blends and mastics. Types and dosages of bitumen, mineral additions and the workability must be characterised and optimised. This study aims at providing an approach for the fundamental characterisation of CBE materials using rotational viscometry. Firstly, a procedure for measuring the viscosity of CBE slurries using the Brookfield viscometer was investigated by comparing results obtained by using a traditional spindle geometry and a novel impeller engineered to avoid phase separation: the dual helical ribbon (DHR). Afterwards, the effect of mineral additions and bitumen emulsion…
A New Branch-and-Cut Algorithm for the Generalized Directed Rural Postman Problem
2016
The generalized directed rural postman problem, also known as the close-enough arc routing problem, is an arc routing problem with some interesting real-life applications, such as routing for meter reading. In this article we introduce two new formulations for this problem as well as various families of new valid inequalities that are used to design and implement a branch-and-cut algorithm. The computational results obtained on test bed instances from the literature show that this algorithm outperforms the existing exact methods
A more efficient cutting planes approach for the green vehicle routing problem with capacitated alternative fuel stations
2021
AbstractThe Green Vehicle Routing Problem with Capacitated Alternative Fuel Stations assumes that, at each station, the number of vehicles simultaneously refueling cannot exceed the number of available pumps. The state-of-the-art solution method, based on the generation of all feasible non-dominated paths, performs well only with up to 2 pumps. In fact, it needs cloning the paths between every pair of pumps. To overcome this issue, in this paper, we propose new path-based MILP models without cloning paths, for both the scenario with private stations (i.e., owned by the fleet manager) and that with public stations. Then, a more efficient cutting plane approach is designed for addressing both…
Branch-and-Cut for the Split Delivery Vehicle Routing Problem with Time Windows
2019
The split delivery vehicle routing problem with time windows (SDVRPTW) is a notoriously hard combinatorial optimization problem. First, it is hard to find a useful compact mixed-integer programming (MIP) formulation for the SDVRPTW. Standard modeling approaches either suffer from inherent symmetries (mixed-integer programs with a vehicle index) or cannot exactly capture all aspects of feasibility. Because of the possibility to visit customers more than once, the standard mechanisms to propagate load and time along the routes fail. Second, the lack of useful formulations has rendered any direct MIP-based approach impossible. Up to now, the most effective exact algorithms for the SDVRPTW hav…
Adaptive Large Neighborhood Search with a Constant-Time Feasibility Test for the Dial-a-Ride Problem
2019
In the dial-a-ride problem, user-specified transport requests from origin to destination points have to be served by a fleet of homogeneous vehicles. The problem variant we consider aims at finding a set of minimum-cost routes satisfying constraints on vehicle capacity, time windows, maximum route duration, and maximum user ride times. We propose an adaptive large neighborhood search (ALNS) for its solution. The key novelty of the approach is an exact amortized constant-time algorithm for evaluating the feasibility of request insertions in the repair steps of the ALNS. In addition, we use two optional improvement techniques: a local-search-based intraroute improvement of routes of promisin…
Heuristics for the capacitated modular hub location problem
2017
Abstract In this paper we study the hub location problem, where the goal is to identify an optimal subset of facilities (hubs) to minimize the transportation cost while satisfying certain capacity constraints. In particular, we target the single assignment version, in which each node in the transportation network is assigned to only one hub to route its traffic. We consider here a realistic variant introduced previously, in which the capacity of edges between hubs is increased in a modular way. This reflects the practical situation in air traffic where the number of flights between two locations implies a capacity in terms of number of passengers. Then, the capacity can be increased in a mo…
Exact solution of the soft-clustered vehicle-routing problem
2020
Abstract The soft-clustered vehicle-routing problem (SoftCluVRP) extends the classical capacitated vehicle-routing problem by one additional constraint: The customers are partitioned into clusters and feasible routes must respect the soft-cluster constraint, that is, all customers of the same cluster must be served by the same vehicle. In this article, we design and analyze different branch-and-price algorithms for the exact solution of the SoftCluVRP. The algorithms differ in the way the column-generation subproblem, a variant of the shortest-path problem with resource constraints (SPPRC), is solved. The standard approach for SPPRCs is based on dynamic-programming labeling algorithms. We s…
Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks
2016
Abstract This paper proposes models and algorithms for the pickup and delivery vehicle routing problem with time windows and multiple stacks. Each stack is rear-loaded and is operated in a last-in-first-out (LIFO) fashion, meaning that when an item is picked up, it is positioned at the rear of a stack. An item can only be delivered if it is in that position. This problem arises in the transportation of heavy or dangerous material where unnecessary handling should be avoided, such as in the transportation of cars between car dealers and the transportation of livestock from farms to slaughterhouses. To solve this problem, we propose two different branch-price-and-cut algorithms. The first sol…