A hybrid ant colony optimization algorithm for multi-compartment vehicle routing problem
From MaRDI portal
Publication:2223244
DOI10.1155/2020/8839526zbMath1453.90044OpenAlexW3094194273MaRDI QIDQ2223244
Huai P. Jin, Rong Hu, Bin Qian, Ning Guo, Feng H. Xiang
Publication date: 28 January 2021
Published in: Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2020/8839526
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Traffic problems in operations research (90B20)
Cites Work
- An ant colony system for responsive dynamic vehicle routing
- The multi-compartment vehicle routing problem with flexible compartment sizes
- A variable neighborhood search for the multi-period collection of recyclable materials
- A heuristic for the multi-period petrol station replenishment problem
- The petrol station replenishment problem with time windows
- On the benefits of co-collection: experiments with a multi-compartment vehicle routing algorithm
- Tank allocation problems in maritime bulk shipping
- Solving a fuel delivery problem by heuristic and exact approaches.
- Scheduling deliveries in vehicles with multiple compartments
- An iterated tabu search for the multi-compartment vehicle routing problem
- Product-oriented time window assignment for a multi-compartment vehicle routing problem
- Vehicle selection for a multi-compartment vehicle routing problem
- Heuristics for the multi-depot petrol station replenishment problem with time windows
- A branch-and-cut algorithm for the multi-compartment vehicle routing problem with flexible compartment sizes
- Routing and scheduling in a liquefied natural gas shipping problem with inventory and berth constraints
- An exact algorithm for the petrol station replenishment problem
This page was built for publication: A hybrid ant colony optimization algorithm for multi-compartment vehicle routing problem
