A hybrid ant colony optimization algorithm for multi-compartment vehicle routing problem
Summary: The multi-compartment vehicle routing problem (MCVRP) has been applied in fuel or food delivery, waste collection, and livestock transportation. Ant colony optimization algorithm (ACO) has been recognized as an efficient method to solve the VRP and its variants. In this paper, an improved hybrid ant colony optimization algorithm (IHACO) is proposed to minimize the total mileage of the MCVRP. First, a probabilistic model is designed to guide the algorithm search towards high-quality regions or solutions by considering both similar blocks of customers and customer permutations. Then, a heuristic rule is presented to generate initial individuals to initialize the probabilistic model, which can drive the search to the high-quality regions faster. Moreover, a new local search using the geometry optimization is developed to execute exploitation from the promising regions. Finally, two types of variable neighborhood descent (VND) techniques based on the speed-up search strategy and the first move strategy are devised to further enhance the local exploitation ability. Comparative numerical experiments with other algorithms and statistical analyses are carried out, and the results show that IHACO can achieve better solutions.
- A hybrid ant colony algorithm for the vehicle routing problem with compatibility constraints
- A hybrid algorithm based on ACO and PSO for capacitated vehicle routing problems
- An improved ant colony optimization for vehicle routing problem
- scientific article; zbMATH DE number 6501402
- An iterated tabu search for the multi-compartment vehicle routing problem
- A branch-and-cut algorithm for the multi-compartment vehicle routing problem with flexible compartment sizes
- A heuristic for the multi-period petrol station replenishment problem
- A variable neighborhood search for the multi-period collection of recyclable materials
- An ant colony system for responsive dynamic vehicle routing
- An exact algorithm for the petrol station replenishment problem
- An iterated tabu search for the multi-compartment vehicle routing problem
- Heuristics for the multi-depot petrol station replenishment problem with time windows
- On the benefits of co-collection: experiments with a multi-compartment vehicle routing algorithm
- Product-oriented time window assignment for a multi-compartment vehicle routing problem
- Routing and scheduling in a liquefied natural gas shipping problem with inventory and berth constraints
- Scheduling deliveries in vehicles with multiple compartments
- Solving a fuel delivery problem by heuristic and exact approaches.
- Tank allocation problems in maritime bulk shipping
- The multi-compartment vehicle routing problem with flexible compartment sizes
- The petrol station replenishment problem with time windows
- Vehicle selection for a multi-compartment vehicle routing problem
- Solving the vehicle routing problem with multi-compartment vehicles for city logistics
- scientific article; zbMATH DE number 6545534 (Why is no real title available?)
- Artificial Intelligence and Soft Computing - ICAISC 2004
- An ant colony optimization algorithm for capacitated vehicle routing problems based on multiple neighborhood descent searching
- A hybrid ant colony algorithm for the vehicle routing problem with compatibility constraints
- scientific article; zbMATH DE number 6027569 (Why is no real title available?)
- Ant colony optimization for the two-dimensional loading vehicle routing problem
This page was built for publication: A hybrid ant colony optimization algorithm for multi-compartment vehicle routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2223244)
