scholarly journals Optimizing Route for Hazardous Materials Logistics Based on Hybrid Ant Colony Algorithm

2013 ◽  
Vol 2013 ◽  
pp. 1-6 ◽  
Author(s):  
Haixing Wang ◽  
Guiping Xiao ◽  
Zhen Wei
Keyword(s):  
Optimization Model ◽  
Network Flow ◽  
Road Network ◽  
Ant Colony Algorithm ◽  
Hazardous Materials ◽  
Construction Rule ◽  
Ant Colony ◽  
Route Optimization ◽  
Total Cost ◽  
Risk Limits

Optimizing Route for Hazardous Materials Logistics (ORHML) belongs to a class of problems referred to as NP-Hard, and a strict constraint of it makes it harder to solve. In order to dealing with ORHML, an improved hybrid ant colony algorithm (HACA) was devised. To achieve the purpose of balancing risk and cost for route based on the principle of ACA that used to solve TSP, the improved HACA was designed. Considering the capacity of road network and the maximum expected risk limits, a route optimization model to minimize the total cost is established based on network flow theory. Improvement on route construction rule and pheromone updating rule was adopted on the basis of the former algorithm. An example was analyzed to demonstrate the correctness of the application. It is proved that improved HACA is efficient and feasible in solving ORHML.

An Improved Ant Colony Algorithm for the Shortest Path in City’s Road Network

2011 ◽  
Vol 121-126 ◽  
pp. 1296-1300 ◽  
Author(s):  
Jun Bi ◽  
Jie Zhang ◽  
Wen Le Xu
Keyword(s):  
Shortest Path ◽  
Road Network ◽  
Ant Colony Algorithm ◽  
Road Traffic ◽  
Global Optimum ◽  
Ant Colony ◽  
Selection Strategy ◽  
Ant Colony System ◽  
Local Optimum ◽  
Information Quantity

The shortest path between the start node and end node plays an important role in city’s road traffic network analysis system. The basic ant colony system algorithm which is a novel simulated evolutionary algorithm is studied to solve the shortest path problem. But the basic ant colony system algorithm is easy to run into the local optimum solution for shortest path. In order to solve the problem, the improved ant colony system algorithm is proposed. The improvement methods for selection strategy, local search, and information quantity modification of basic ant colony system are discussed in detail. The experiments are done in Beijing road network in China. The results of experiments show that comparing with the basic ant colony algorithm, the improved algorithm can easily converge at the global optimum for the shortest path.

Optimization Design of Self-Balacing Torsion Bar Diameter

2011 ◽  
Vol 308-310 ◽  
pp. 2486-2489
Author(s):  
Zhi Qi Huang
Keyword(s):  
Optimization Model ◽  
Optimization Design ◽  
Ant Colony Algorithm ◽  
The Self ◽  
Ant Colony ◽  
New Method ◽  
C Language ◽  
Torsion Bar ◽  
Bar Diameter ◽  
Theoretical Results

The thesis builds the optimization model for the self-balacing torsion bar, On the basis of the Ant Colony Algorithm, designs the Ant Colony Algorithm procedure using C Language and optimizes torsion bar diameter. Results show the Ant Colony Algorithm is feasible and provides a new method choosing torsion bar diameter. The max difference value is 1.12% between optimizing results and theoretical results.

scholarly journals Optimization of Gantry Cranes’ Operation Path for Transshipment Based on Improved TSP

2020 ◽  
Vol 2020 ◽  
pp. 1-13
Author(s):  
Qi Zhang ◽  
Hongjin Dong ◽  
Mingjun Ling ◽  
Leyi Duan ◽  
Yuguang Wei
Keyword(s):  
Optimization Model ◽  
Ant Colony Algorithm ◽  
Ant Colony ◽  
Gantry Crane ◽  
Railway Network ◽  
Basic Model ◽  
Loading And Unloading ◽  
Container Freight ◽  
Gantry Cranes

In order to improve the transshipment efficiency of transit containers in the port or the port-type railway network container freight station (PRNCS) with the condition that each transit container matches a railway flat-car, this paper studied the optimization of operation path of the rail mounted gantry crane (RMG) in the loading and unloading track for containers transshipped directly from highway to railway. Based on the basic model of TSP, the paper constructed the optimization model for the operation path of RMG, and designed the Ant Colony Algorithm (ACA) to solve it, and then obtained the operation scheme of RMG having the highest efficiency. Finally, the validity and correctness of the model and algorithm were verified by a case.

scholarly journals Road Network Vulnerability Analysis Based on Improved Ant Colony Algorithm

2014 ◽  
Vol 2014 ◽  
pp. 1-9
Author(s):  
Yunpeng Wang ◽  
Yuqin Feng ◽  
Wenxiang Li ◽  
William Case Fulcher ◽  
Li Zhang
Keyword(s):  
Road Network ◽  
Large Scale ◽  
Ant Colony Algorithm ◽  
Ant Colony ◽  
Critical Infrastructures ◽  
Traffic Demand ◽  
The Road ◽  
Utility Index ◽  
Decision Supporting ◽  
Improved Ant Colony Algorithm

We present an improved ant colony algorithm-based approach to assess the vulnerability of a road network and identify the critical infrastructures. This approach improves computational efficiency and allows for its applications in large-scale road networks. This research involves defining the vulnerability conception, modeling the traffic utility index and the vulnerability of the road network, and identifying the critical infrastructures of the road network. We apply the approach to a simple test road network and a real road network to verify the methodology. The results show that vulnerability is directly related to traffic demand and increases significantly when the demand approaches capacity. The proposed approach reduces the computational burden and may be applied in large-scale road network analysis. It can be used as a decision-supporting tool for identifying critical infrastructures in transportation planning and management.

Sign in / Sign up

Export Citation Format

Share Document