The author examines methods for a special class of path planning problems in which the routes are constrained. General search algorithms assume that we can move around in the traffic network freely, so they extend the partial paths from the very last location to each of its neighbors to form more partial paths. The best partial paths are then selected to expand, unless the selected partial path...

This paper developed a mathematical model framework using the single allocation strategy for hub covering location problem. The model encompassed the transportation time covering under gradual decay function. Within a certain transportation time for the origin and destination nodes among two hubs, the route is fully covered, and beyond another specified transportation time the route is not cove...

For oversized cargo transportation, traditional transportation schemes only consider road length, road width, the transportation cost as weight values in analysis and calculation of route selection. However, for oversized trucks, turning direction at road intersections is also a factor worth considering. By introducing the classical algorithm of Dijkstra into the model of road network, this res...

Singapore is the third largest oil-refining centre in the world, with a large petrochemical hub located at Jurong Island. In view of the increasing concern for transportation security, there is an urgent need to improve the way trucks carrying hazardous materials (HAZMATs) are being routed on urban and suburban road networks. Routing of such vehicles should not only ensure the safety of travele...

Rapid developments of mobile technologies, data acquisition and big data analytics, and their integration with critical application domains such as transportation systems have the potential to produce more efficient, real-time, intelligent and safe transportation infrastructure. To increase the quality of transportation services, wireless sensor networks, mobile phones, crowd sourcing, RFID and...

This article deals with the intermodal transportation problem for the commodities delivery between different locations. The time – dependent shortest path planning, in which the travel time along each arc is a known function of the departure time along the arc, is a very important problem and arises in many practical application such as a routing system of a container used in the time – depende...

A risk assessment model is constructed for the hazardous materials (hazmat) road transportation combining features of TransCAD traffic forecasts, and based on traffic planning network of spatial analysis and attribute process, the database for path planning of hazmat transportation was set up. Based on the TransCAD platform, this research analyzes the risk value of hazmat transportation in each...

In this paper, we introduce an autonomous decentralized method for multiple Automated Guided Vehicles (AGVs). In our proposed system, each AGV as an agent computes its transportation route by referring to the static path information. route. Once potential collisions are detected, one of the two agents chosen by a negotiation rule modifies its route plan. The rules are improved by reinforcement ...