Search results for "Information"
showing 10 items of 14916 documents
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…
Novel Distance Estimation Methods Using 'Stochastic Learning on the Line' Strategies
2018
In this paper, we consider the problem of Distance Estimation (DE) when the inputs are the $x$ and $y$ coordinates (or equivalently, the latitudinal and longitudinal positions) of the points under consideration. The aim of the problem is to yield an accurate value for the real (road) distance between the points specified by the latter coordinates. 1 This problem has, typically, been tackled by utilizing parametric functions called the “Distance Estimation Functions” (DEFs). The parameters are learned from the training data (i.e., the true road distances) between a subset of the points under consideration. We propose to use Learning Automata (LA)-based strategies to solve the problem. In par…
Methodology and trends for an intelligent transport system in developing countries
2018
Abstract Increasingly, the technologies that are used in telecommunications contribute to improve intelligent transport systems. These technologies are systems that offer several concepts like vehicular ad hoc networks, which allow reduction of traffic accidents, traffic congestion and consequently increase road safety and the comfort of road users. Developing countries in general and those of sub-Sahara in particular do not have telecommunication infrastructures, even road infrastructures for the implementation of an intelligent transport system. Moreover, with the serious increase in vehicles in these countries, the problem of traffic regulation arise especially in the inter-urban context…
Measuring foreland container port connectivity disaggregated by destination markets: An index for Short Sea Shipping services in Spanish ports
2020
Abstract The present research aims to develop a Foreland Port Connectivity Index (FPCI) including both qualitative and quantitative variables related to the characteristics of the maritime services provided. To that end, the FPCI incorporates two discount factors—the number of shipping services and destination countries—as penalties to correct for the quality of a port connection. After defining the FPCI, the index is applied to Spanish ports to study their connectivity in terms of container Short Sea Shipping (SSS) services. Although the connectivity of SSS traffic has not been widely studied, it is an interesting case study as small ports play a more relevant role in facilitating access t…
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…
Solving a large cutting problem in the glass manufacturing industry
2020
Abstract The glass cutting problem proposed by Saint Gobain for the 2018 ROADEF challenge includes some specific constraints that prevent the direct application of procedures developed for the standard cutting problem. On the one hand, the sheets to be cut have defects that make them unique and they must be used in a given order. On the other hand, pieces are grouped in stacks and the pieces in each stack must be cut in order. There are also some additional characteristics due to the technology being used, especially the requirement for a three-stage guillotine cutting process. Taking into account the sequencing constraints on sheets and pieces, we have developed a beam search algorithm, us…
Nested branch-and-price-and-cut for vehicle routing problems with multiple resource interdependencies
2019
Abstract This paper considers vehicle routing problems (VRPs) with multiple resource interdependencies and addresses the development and computational evaluation of an exact branch-and-price-and-cut algorithm for their solution. An interdependency between two resources means that the two resource consumptions influence one another in such a way that a tradeoff exists between them. This impacts the feasibility and/or the cost of a solution. The subproblem in branch-and-price-and-cut procedures for VRPs is very often a variant of the shortest-path problem with resource constraints (SPPRC). For the exact solution of many SPPRC variants, dynamic-programming based labeling algorithms are predomi…
Stabilized branch-price-and-cut for the commodity-constrained split delivery vehicle routing problem
2019
Abstract In the commodity-constrained split delivery vehicle routing problem (C-SDVRP), customer demands are composed of sets of different commodities. The C-SDVRP asks for a minimum-distance set of routes such that all customer demands are met and vehicle capacities are respected. Moreover, whenever a commodity is delivered by a vehicle to a customer, the entire amount requested by this customer must be provided. Different commodities demanded by one customer, however, can be delivered by different vehicles. Thus, the C-SDVRP is a relaxation of the capacitated vehicle routing problem and a restriction of the split delivery vehicle routing problem. For its exact solution, we propose a branc…