Vehicle Routing Optimization in Logistics Distribution using Hybrid Ant Colony Algorithm
نویسنده
چکیده
The Vehicle Routing Problem (VRP) is an important management problem in the field of physical distribution and logistics. Good vehicle routing can not only increase the profit of logistics but also make logistics management more scientific. The Capacitated Vehicle Routing Problem (CVRP) constrained by the capacity of a vehicle is the extension of VRP. Our research applies a two-phase algorithm to address CVRP. It takes the advantages of Simulated Annealing (SA) and ant colony optimization for solving the capacitated vehicle routing problem. In the first phase of proposed algorithm, simulated annealing provides a good initial solution for ant colony optimization. In the second phase, Iterative Local Search (ILS) method is employed to seeking the close-to-optimal solution in local scope based on the capacity of the vehicle. Experimental results show that the proposed algorithm is superior to original ant colony optimization and simulated annealing separately reported on partial benchmark problems.
منابع مشابه
An Exponential Entropy-based Hybrid Ant Colony Algorithm for Vehicle Routing Optimization
Vehicle routing problem(VRP) is important combinatorial optimization problems which have received considerable attention in the last decades. The optimization of vehicle routing problem is a well-known research problem in the logistics distribution. In order to overcome the prematurity of Ant Colony Algorithm (ACA) for logistics distribution routing optimization, a hybrid algorithm combining im...
متن کاملSolving the vehicle routing problem by a hybrid meta-heuristic algorithm
The vehicle routing problem (VRP) is one of the most important combinational optimization problems that has nowadays received much attention because of its real application in industrial and service problems. The VRP involves routing a fleet of vehicles, each of them visiting a set of nodes such that every node is visited by exactly one vehicle only once. So, the objective is to minimize the to...
متن کاملA Hybrid Ant Colony Optimization(HACO) for Solving Capacitated Vehicle Routing Problem(CVRP)
The Capacitated Vehicle Routing Problem (CVRP) is a combinatorial optimization and nonlinear problem seeking to service a number of customers with a fleet of vehicles. CVRP is an important problem in the fields of transportation, distribution and logistics. Usually, the goal is delivering goods located at a central depot to customers who have placed orders. This transportation optimization prob...
متن کاملAPPLICATION of HYBRID ANT COLONY OPTIMIZATION (HACO) AlGORITHM for SOLVING CAPACITATED VEHICLE ROUTING PROBLEM (CVRP)
The Capacitated Vehicle Routing problem (CVRP) is a combinatorial optimization and nonlinear problem seeking to service a number of customers with a fleet of vehicles. CVRP isan important problem in the fields of transportation, distribution and logistics . Usually, the goal is delivering goods located at a central depot to customers who have placed orders. This transportation optimization prob...
متن کاملSolving the Vehicle Routing Problem with Simultaneous Pickup and Delivery by an Effective Ant Colony Optimization
One of the most important extensions of the capacitated vehicle routing problem (CVRP) is the vehicle routing problem with simultaneous pickup and delivery (VRPSPD) where customers require simultaneous delivery and pick-up service. In this paper, we propose an effective ant colony optimization (EACO) which includes insert, swap and 2-Opt moves for solving VRPSPD that is different with common an...
متن کامل