Search results for "Time"
showing 10 items of 12336 documents
Contributions to Branch-and-Price-and-Cut Algorithms for Routing Problems
2019
This article deals with new exact branch-and-price-and-cut algorithms for the solution of routing problems. Specialized methods for the pickup-and-delivery problem (PDP), the truck-and-trailer routing problem (TTRP), the periodic vehicle routing problem (PVRP) and a service network design and hub location problem (SNDHLP) are presented. We develop a new technique for the acceleration of bidirectional labeling algorithms by a dynamic choice of the merge point. Moreover, for variants of the PDP, the bidirectional labeling can be effectively applied for the first time. In the TTRP, we model the extension to a 2 days planning horizon and the consideration of a quantity-dependent transfer time. …
Traffic Flow Variables Estimation: An Automated Procedure Based on Moving Observer Method. Potential Application for Autonomous Vehicles
2019
Abstract The estimation of traffic flow variables (flow, space mean speed and density) plays a fundamental role in highways planning and designing, as well as in traffic control strategies. Moving Observer Method (MOM) allows traffic surveys in a road, or in a road network. This paper proposes a novel automated procedure, called MOM-AP based on Moving Observer Method and Digital Image Processing (DIP) Technique able to automatically detect (without human observers) and calculate flow q, space mean speed vs and density k in case of stationary and homogeneous traffic conditions. In order to evaluate how reliable is the MOM-AP, an experiment has been carried out in a segment of one two-lane si…
GIS Infomobility for Travellers
2016
Geographical Information Systems (GIS) are essential systems to support decisions on territorial and environmental aspects. But they not always have been properly used for this purpose. Only in recent years GIS have been getting better used for the planning, management and control of the territory. The application of GIS to the transport sector has become relevant both for management and decision-making in support of Public Administration (PA) and citizens. GIS are particularly useful for roads and routing graphs management capabilities as well as for searching the most suitable path. The results achieved in this research activity aimed to evaluate different road graphs, proprietary and fre…
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,…
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…
Determining the best shipper sizes for sending products to customers
2014
A distribution company has to send products, packed into shippers, from the warehouse to retail shops. The number of different shipper types is regarded as a parameter given by the user, who is looking for a balance between transportation costs and stock and procurement costs. The problem is to decide the sizes of the shipper types to keep at the warehouse so as to minimize the cost of meeting the forecasted demand over the planning horizon. In this paper, we describe an integer linear programming formulation for the problem and obtaining feasible solutions. Other models, based on multiknapsack and p-median and facility location models, are for obtaining lower bounds. We study several ways …
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…
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…
Using a hazard-independent approach to understand road-network robustness to multiple disruption scenarios
2021
Abstract A range of predictable and unpredictable events can cause road perturbations, disrupting traffic flows and more generally the functioning of society. To manage this threat, stakeholders need to understand the potential impact of a multitude of predictable and unpredictable events. The present paper adopts a hazard-independent approach to assess the robustness (ability to maintain functionality despite disturbances) of the Sioux Falls network to all possible disruptions. This approach allows understanding the impact of a wide range of disruptive events, including random, localised, and targeted link failures. The paper also investigates the predictability of the link combinations wh…
Branch-and-Price-and-Cut for the Periodic Vehicle Routing Problem with Flexible Schedule Structures
2019
This paper addresses the periodic vehicle routing problem with time windows (PVRPTW). Therein, customers require one or several visits during a planning horizon of several periods. The possible visiting patterns (schedules) per customer are limited. In the classical PVRPTW, it is common to assume that each customer requires a specific visit frequency and offers all corresponding schedules with regular intervals between the visits. In this paper, we permit all kinds of schedule structures and the choice of the service frequency. We present an exact branch-and-price-and-cut algorithm for the classical PVRPTW and its variant with flexible schedules. The pricing problems are elementary shortes…