Search results for "structural"
showing 10 items of 5047 documents
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
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…
The Chinese Postman Problem with Load-Dependent Costs
2018
[EN] We introduce an interesting variant of the well-known Chinese postman problem (CPP). While in the CPP the cost of traversing an edge is a constant (equal to its length), in the variant we present here the cost of traversing an edge depends on its length and on the weight of the vehicle at the moment it is traversed. This problem is inspired by the perspective of minimizing pollution in transportation, since the amount of pollution emitted by a vehicle not only depends on the travel distance but also on its load, among other factors. We define the problem, study its computational complexity, provide two mathematical programming formulations, and propose two metaheuristics for its soluti…
Improved polyhedral descriptions and exact procedures for a broad class of uncapacitated p-hub median problems
2019
Abstract This work focuses on a broad class of uncapacitated p-hub median problems that includes non-stop services and setup costs for the network structures. In order to capture both the single and the multiple allocation patterns as well as any intermediate case of interest, we consider the so-called r-allocation pattern with r denoting the maximum number of hubs a terminal can be allocated to. We start by revisiting an optimization model recently proposed for the problem. For that model, we introduce several families of valid inequalities as well as optimality cuts. Moreover, we consider a relaxation of the model that contains several sets of set packing constraints. This motivates a pol…
The Split Delivery Vehicle Routing Problem with Time Windows and Customer Inconvenience Constraints
2019
In classical routing problems, each customer is visited exactly once. By contrast, when allowing split deliveries, customers may be served through multiple visits. This potentially results in substantial savings in travel costs. Even if split deliveries are beneficial to the transport company, several visits may be undesirable on the customer side: At each visit the customer has to interrupt his primary activities and handle the goods receipt. The contribution of the present paper consists in a thorough analysis of the possibilities and limitations of split delivery distribution strategies. To this end, we investigate two different types of measures for limiting customer inconvenience (a m…
Multivariate modeling and analysis of regional ocean freight rates
2018
Abstract In this paper, we propose a new multivariate model for the dynamics of regional ocean freight rates. We show that a cointegrated system of regional spot freight rates can be decomposed into a common non-stationary market factor and stationary regional deviations. The resulting integrated CAR process is new to the literature. By interpreting the common market factor as the global arithmetic average of the regional rates, both the market factor and the regional deviations are observable which simplifies the calibration of the model. Moreover, forward contracts on the market factor can be traded in the Forward Freight Agreement (FFA) market. We calibrate the model to historical spot r…
System Dynamics in the Predictive Analytics of Container Freight Rates
2021
This study proposes a two-tier cross-validation and backtesting procedure, including expanding and rolling-window test metrics in predictive analytics of container freight rates by utilizing the system dynamics approach. The study utilized system dynamics to represent the nonlinear complex structure of container freight rates for predictive analytics and performed univariate and multivariate time-series analysis as benchmarks of the conventional approach. In particular, the China containerized freight index (CCFI) has been investigated through various parametric methodologies (both conventional time-series and system dynamics approaches). This study follows a strict validation process cons…
A practical approach to estimate the degree of binder activity of reclaimed asphalt materials
2019
Using Reclaimed Asphalt (RA) in new asphalt mixtures can reduce the amount of new material required thereby saving money and natural resources. In addition, asphalt mixtures with RA have shown comparable properties and performance to that generally associated with asphalt mixtures made with 100% virgin material. However, RA content in pavement surface layers is still limited due to specification and technical limitations. For higher contents, the aged RA binder must be analysed to accurately determine the requirements for virgin binders and additives while the degree of blending (DOB) between the RA binder and the virgin binder also needs to be quantified. This is not a simple process and g…