An improved ant colony algorithm and its application in vehicle routing problem

DOI10.1155/2013/785383MaRDI QIDQ474637zbMATH OpenOpenAlexWikidataFDO

Authors Ping Ding, Min Huang

Publication date 24 November 2014

Published in Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1155/2013/785383

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Review text

Summary: Optimal path planning is an important issue in vehicle routing problem. This paper proposes a new vehicle routing path planning method which adds path weight matrix and save matrix. The method uses a new transition probability function adding the angle factor function and visibility function, while setting penalty function in a new pheromone updating model to improve the accuracy of the route searching. Finally, after each cycle, we use 3-opt method to update the optimal solution to optimize the path length. The results of comparison also confirm that this method is better than the traditional ant colony algorithm for vehicle routing path planning method. The result of computer simulation confirms that the method can plan a more rational rescue path focused on the real traffic situation.

Recommendations

• An improved ant colony algorithm for solving the path planning problem of the omnidirectional mobile vehicle
• An improved ant colony optimization for vehicle routing problem
• Study on the ant colony algorithm for solving the vehicle routing problem with time windows
• scientific article; zbMATH DE number 6178764
• scientific article; zbMATH DE number 6263322

Cites work

• Beam-ACO for the travelling salesman problem with time windows
• scientific article; zbMATH DE number 3643061 (Why is no real title available?)
• scientific article; zbMATH DE number 2209651 (Why is no real title available?)
• Solving real-life vehicle routing problems efficiently using tabu search
• The vehicle routing problem
• Waste collection vehicle routing problem with time windows

Cited in

(13)

• An improved ant colony algorithm for solving the path planning problem of the omnidirectional mobile vehicle
• An improved ant system algorithm for the vehicle routing problem
• Ant colony optimization for path planning in search and rescue operations
• scientific article; zbMATH DE number 5951511 (Why is no real title available?)
• scientific article; zbMATH DE number 5669925 (Why is no real title available?)
• Artificial Intelligence and Soft Computing - ICAISC 2004
• scientific article; zbMATH DE number 6178764 (Why is no real title available?)
• Key route planning of patrol based on ant colony algorithm
• Path planning based on optimized ant colony algorithm in multi-machine cooperative operations
• scientific article; zbMATH DE number 6263322 (Why is no real title available?)
• Ant Colonies Optimization (ACO) for the solution of the Vehicle Routing Problem (VRP)
• Comparing backhauling strategies in vehicle routing using ant colony optimization
• Ant colony optimization for the two-dimensional loading vehicle routing problem

Describes a project that uses

Uses Software

• VRP
• MACS-VRPTW

This page was built for publication: An improved ant colony algorithm and its application in vehicle routing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q474637)