Mutation Ant Colony Algorithm of Milk-Run Vehicle Routing Problem with Fastest Completion Time Based on Dynamic Optimization
The objective of vehicle routing problem is usually to minimize the total traveling distance or cost. But in practice, there are a lot of problems needed to minimize the fastest completion time. The milk-run vehicle routing problem (MRVRP) is widely used in milk-run distribution. The mutation ACO is...
Saved in:
Main Authors: | Jianhua Ma, Guohua Sun |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2013-01-01
|
Series: | Discrete Dynamics in Nature and Society |
Online Access: | http://dx.doi.org/10.1155/2013/418436 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
A Hybrid Ant Colony Optimization Algorithm for Multi-Compartment Vehicle Routing Problem
by: Ning Guo, et al.
Published: (2020-01-01) -
A Hybrid Ant Colony Optimization for Dynamic Multidepot Vehicle Routing Problem
by: Haitao Xu, et al.
Published: (2018-01-01) -
Multiconstrained Network Intensive Vehicle Routing Adaptive Ant Colony Algorithm in the Context of Neural Network Analysis
by: Shaopei Chen, et al.
Published: (2017-01-01) -
Routing optimization method of WSN based on improved ant colony algorithm
by: Han ZHAO, et al.
Published: (2016-03-01) -
Electric Vehicle Charging Route Planning for Shortest Travel Time Based on Improved Ant Colony Optimization
by: Aiping Tan, et al.
Published: (2024-12-01)