Declarative Modeling of a Milk-Run Vehicle Routing Problem for Split and Merge Supply Streams Scheduling

2018 ◽  
pp. 157-172 ◽  
Author(s):  
G. Bocewicz ◽  
P. Nielsen ◽  
Z. Banaszak
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Routing Problem ◽  
Declarative Modeling ◽  
Split And Merge ◽  
Milk Run

scholarly journals Mutation Ant Colony Algorithm of Milk-Run Vehicle Routing Problem with Fastest Completion Time Based on Dynamic Optimization

2013 ◽  
Vol 2013 ◽  
pp. 1-6 ◽  
Author(s):  
Jianhua Ma ◽  
Guohua Sun
Keyword(s):  
Vehicle Routing ◽  
Dynamic Optimization ◽  
Vehicle Routing Problem ◽  
Completion Time ◽  
Ant Colony Algorithm ◽  
Ant Colony ◽  
Routing Problem ◽  
Numerical Examples ◽  
Customer Order ◽  
Milk Run

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 given to solve MRVRP with fastest completion time in this paper. The milk-run VRP with fastest completion time is introduced first, and then the customer division method based on dynamic optimization and split algorithm is given to transform this problem into finding the optimal customer order. At last the mutation ACO is given and the numerical examples verify the effectiveness of the algorithm.

scholarly journals The Modeling of Milk-run Vehicle Routing Problem Based on Improved C-W Algorithm that Joined Time Window

2017 ◽  
Vol 25 ◽  
pp. 716-728 ◽  
Author(s):  
Huang Mei ◽  
Yang Jingshuai ◽  
MA Teng ◽  
LI Xiuli ◽  
Wang Ting
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Time Window ◽  
Routing Problem ◽  
Milk Run
Sign in / Sign up

Export Citation Format

Share Document