Road Inspection Scheduling Model Using Constraint Programming

2013 ◽  
Vol 357-360 ◽  
pp. 2720-2725
Author(s):  
Hsi Sung Wang ◽  
Shu Shun Liu

The research objective is to support the maintenance unit with route planning prior to performing road inspection, the model is based on VRP problem settings, and with the addition of compulsory road sections and allowing shortcuts through small pathways during the inspection to reduce time consumption. By employing Constraint Programming (CP) technology and optimization solution mechanism to construct inspection scheduling model, and the objective is to minimize time consumption of the road inspection. The province and county roads in Douliou city are chosen as examples for analysis, plans out best routes for inspection process, and also displays all the road sections passed by inspection vehicle. Thus this model can be used as reference to support the authorities to efficiently allocate resources for the inspection process, and achieve the objective as shorten the inspection time consumption.

2017 ◽  
Vol 12 (1) ◽  
pp. 38-47 ◽  
Author(s):  
Marcin Staniek

The paper presents the stereo vision method for the mapping of road pavement. The mapped road is a set of points in three-dimensional space. The proposed method of measurement and its implementation make it possible to generate a precise mapping of a road surface with a resolution of 1 mm in transverse, longitudinal and vertical dimensions. Such accurate mapping of the road is the effect of application of stereo images based on image processing technologies. The use of matching measure CoVar, at the stage of images matching, help eliminate corner detection and filter stereo images, maintaining the effectiveness of the algorithm mapping. The proper analysis of image-based data and application of mathematical transformations enable to determine many types of distresses such as potholes, patches, bleedings, cracks, ruts and roughness. The paper also aims at comparing the results of proposed solution and reference test-bench. The statistical analysis of the differences permits the judgment of error types.


2014 ◽  
Vol 681 ◽  
pp. 265-269
Author(s):  
Yan Li ◽  
Zhi Run Xiao

The problem of multi-skilled project scheduling (MSPSP) is a complex problem of task scheduling and resource assignment that comes up in the daily management of many software company. In this paper we present a constraint programming (CP) approach for the MSPSP. We extend the project scheduling literature by developing a project scheduling model that accounts for differing skills among workers. The computational results for the MSPSP show that the constraint programming approach increases the performance of the model solving processes. The results for the MSPSP is effective in solving the proposed problem.


Agriculture ◽  
2020 ◽  
Vol 10 (10) ◽  
pp. 434
Author(s):  
Martin Filip ◽  
Tomas Zoubek ◽  
Roman Bumbalek ◽  
Pavel Cerny ◽  
Carlos E. Batista ◽  
...  

This paper considers the evolution of processes applied in agriculture for field operations developed from non-organized handmade activities into very specialized and organized production processes. A set of new approaches based on the application of metaheuristic optimization methods and smart automatization known as Agriculture 4.0 has enabled a rapid increase in in-field operations’ productivity and offered unprecedented economic benefits. The aim of this paper is to review modern approaches to agriculture machinery movement optimization with applications in sugarcane production. Approaches based on algorithms for the division of spatial configuration, route planning or path planning, as well as approaches using cost parameters, e.g., energy, fuel and time consumption, are presented. The combination of algorithmic and economic methodologies including evaluation of the savings and investments and their cost/benefit relation is discussed.


Author(s):  
Nilanjan Roy Choudhury ◽  
Sankar Sengupta ◽  
Robert P. Van Til

A touch-based probe of a coordinate measurement machine (CMM) is generally used to validate the dimensions of the artifacts and associated features which come out of the manufacturing line against its dimensions to ensure to be within prescribed GD&T [Wilson 14] limits. Although there could be other applications using a CMM like reverse engineering, however the stated inspection process is quite crucial for maintaining quality factor and to regulate merits of the manufacturing process especially with the continuous wear-tear of the involved tooling. However this inspection process, which is considered as auxiliary process, needs to have minimum cycle time in order to effectively have more quality units to be produced. In this paper we describe Computer Aided Process Planning (CAPP) in order to complete Computer Aided Inspection (CAI) process using CMM on the work-piece which is created through Computer Aided Design (CAD) and Manufacturing (CAM). This leads to Computer Integrated Manufacturing (CIM) process. As a result, the features, which need to be inspected, could be recognized from its corresponding CAD file and appropriate information could be culled out by the Dassault Software System to calculate the approach and retract points to inspect the features [Choudhury 03]. The main objective of this research paper is to determine the shortest collision free trajectory from the retract point of one feature being inspected to the approach point of another feature being inspected so that the sequencing for the set of trajectories could be calculated through existing Traveling Sales Person (TSP) algorithm in order to shorten the total distance travelled by the CMM probe, which in turn would linearly reflect in reducing the cycle inspection time. Further since different features in the work-piece might need to be inspected by different probes, an overhead time and displacement for probe change, needs to consider in order to shorten the cycle time. These include clustering of similar type of features, which can be inspected by the same probe. Also clustering of similar type of features need to be assessed against spatial distance of separation between the clusters that the probe has to travel. Since the CMM travels at a constant low speed and the different probes are of similar shape, size and comparatively very small weight, the motion dynamics of the CMM does not influence the total distance travelled for the inspection process. Our main contribution is in the development of a spatial algorithm which not only reduces the inter-feature distance but also does that by avoiding the potential for any collision with the feature or the artifact without the use of any computer vision or collision avoidance sensor information. The resulting spatial algorithm has implicit embedded information of feature clustering, which when fed into an optimization algorithm generates a path planning which would eventually shorten the cycle time. The illustration is done with two separate simulations.


2014 ◽  
Vol 568-570 ◽  
pp. 807-811
Author(s):  
Kai Kuang Zhang ◽  
Hong Ling Meng ◽  
Ming Ting Ba

The express traffic system could divide into highway traffic system and ordinary road traffic system, which have different linkage attributes and traffic attributes for segments and nodes. The time consumption space of traveling in the system is a non-Euclidean distance space. From the traffic condition of the express traffic system, the foundation data, principles and methods of NEDS algorithm are introduced. The steps and methods of optimum route planning in the express traffic system are deeply discussed. At the end, an example of optimum route planning in Henan express traffic system is given.


2021 ◽  
Vol 6 (1) ◽  
pp. 74
Author(s):  
Christophe Boucher ◽  
Hiba Al-Assaad ◽  
Ali Daher ◽  
Ahmad Shahin ◽  
Jean-Charles Noyer

Given the boom linked to smart mobility, transport systems require increasingly precise and relevant navigation applications to offer optimized journeys in terms of time and energy consumption, such as for HEV. Most of these navigation applications are based on the processing of 2D digital road maps, while taking into account the GNSS location of vehicles. These localization systems also integrate sensors such as accelerometers and gyroscopes to overcome the well-known problems of GPS positioning, even if the current limited introduction of IoT in the transport industry has made it possible to develop new aided-GPS methods such as geofencing. This paper focuses on one important parameter in the journey optimization of land vehicles: the road slope. We propose a method to estimate the roads’ inclination parameters by fusing GNSS, INS, OSM and ASTER GDEM data through a nonlinear filter. The incremental estimate of the slope will complement the 2D modeling of the roads already available in OpenStreetMap and could be used in route planning optimization. The scientific novelty lies more specifically in the statistical map-matching approaches that we develop both for OSM and DEM data. Estimation results of the roads slopes are shown in experimental conditions.


Author(s):  
M. Moradi ◽  
M. R. Delavar ◽  
A. Moradi

Being one of the natural disasters, earthquake can seriously damage buildings, urban facilities and cause road blockage. Post-earthquake route planning is problem that has been addressed in frequent researches. The main aim of this research is to present a route planning model for after earthquake. It is assumed in this research that no damage data is available. The presented model tries to find the optimum route based on a number of contributing factors which mainly indicate the length, width and safety of the road. The safety of the road is represented by a number of criteria such as distance to faults, percentage of non-standard buildings and percentage of high buildings around the route. An integration of genetic algorithm and ordered weighted averaging operator is employed in the model. The former searches the problem space among all alternatives, while the latter aggregates the scores of road segments to compute an overall score for each alternative. Ordered weighted averaging operator enables the users of the system to evaluate the alternative routes based on their decision strategy. Based on the proposed model, an optimistic user tries to find the shortest path between the two points, whereas a pessimistic user tends to pay more attention to safety parameters even if it enforces a longer route. The results depicts that decision strategy can considerably alter the optimum route. Moreover, post-earthquake route planning is a function of not only the length of the route but also the probability of the road blockage.


Sign in / Sign up

Export Citation Format

Share Document