Development and analysis of heuristic algorithms for a two-stage supply chain allocation problem with a fixed transportation cost

Vinay, V.; Sridharan, R.

doi:10.1504/ijsom.2012.047107

Cited by 6 publications

(1 citation statement)

References 40 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Additionally, another previous study generated modified obstacle-avoidance manoeuvring for the Ant Colony Optimization (ACO) algorithm. A fast two-stage ACO algorithm was presented based on the scent pervasion principle, and its basic theory splits heuristic search into two stages (preprocess stage and path-planning stage), and simulation shows that the algorithm performs well in the case of the high grid resolution (Chen et al , 2013; Hong and Murray, 2015; Vinay and Sridharan, 2012). Particle Swarm Optimization (PSO) and ACO were also combined for eliminating the randomness of the classic ACO algorithm in the initial stage and for improving the rate of convergence (Dilmac et al , 2014; Elloumi et al , 2013, 2014).…”

Section: Introductionmentioning

confidence: 99%

Autonomous obstacle avoidance of an unmanned surface vehicle based on cooperative manoeuvring

Xie

Liu

et al. 2017

View full text Add to dashboard Cite

Purpose Autonomous obstacle avoidance is important in unmanned surface vehicle (USV) navigation. Although the result of obstacle detection is often inaccurate because of the inherent errors of LIDAR, conventional methods typically emphasize on a single obstacle-avoidance algorithm and neglect the limitation of sensors and safety in a local region. Conventional methods also fail in seamlessly integrating local and global obstacle avoidance algorithms. This paper aims to present a cooperative manoeuvring approach including both local and global obstacle avoidance. Design/methodology/approach The global algorithm used in our USV is the Artificial Potential Field-Ant Colony Optimization (APF-ACO) obstacle-avoidance algorithm, which plans a relative optimal path on the specified electronic map before the cruise of USV. The local algorithm is a multi-layer obstacle-avoidance framework based on a single LIDAR to present an efficient solution to USV path planning in the case of sensor errors and collision risks. When obstacles are within a layer, the USV uses a corresponding obstacle-avoidance algorithm. Then the USV moves towards the global direction according to fuzzy rules in the fuzzy layer. Findings The presented method offers a solution for obstacle avoidance in a complex environment. The USV follows the global trajectory planed by the APF-ACO algorithm. While, the USV can bypass current obstacle in the local region based on the multi-layer method effectively. This fact was validated by simulations and field trials. Originality/value The method presented in this paper takes advantage of algorithm integration that remedies errors of obstacle detection. Simulation and experiments were also conducted for performance evaluation.

show abstract