scholarly journals Modeling of Spare Parts Supply Route Optimization with Hard Time Windows

2019 ◽  
Author(s):  
Ming Han ◽  
Yabin Wang ◽  
Zhonghua Cheng
Keyword(s):  
Time Windows ◽  
Spare Parts ◽  
Route Optimization ◽  
Hard Time

scholarly journals Route Optimization for the Distribution Network of a Confectionary Chain

2015 ◽  
Vol 27 (6) ◽  
pp. 497-503
Author(s):  
Anıl İnanlı ◽  
Başak Ünsal ◽  
Deniz Türsel Eliiyi
Keyword(s):  
Time Windows ◽  
Distribution Network ◽  
Real Data ◽  
Route Optimization ◽  
Routing Problem ◽  
Hard Time ◽  
Np Hard Problem ◽  
Commercial Solver ◽  
High Level ◽  
The Cost

This study considers the distribution network of a well-known perishable food manufacturer and its franchises in Turkey. As the countrywide number of stores is increasing fast, the company is facing problems due to its central distribution of products from a single factory. The objective is to decrease the cost of transportation while maintaining a high level of customer satisfaction. Hence, the focus is on the vehicle routing problem (VRP) of this large franchise chain within each city. The problem is defined as a rich VRP with heterogeneous fleet, site-dependent and compartmentalized vehicles, and soft/hard time windows. This NP-hard problem is modelled and tried with real data on a commercial solver. A basic heuristic procedure which can be used easily by the decision makers is also employed for obtaining quick and high-quality solutions for large instances.

scholarly journals A hybrid ant colony algorithm based on multiple strategies for the vehicle routing problem with time windows

2021 ◽  
Author(s):  
Hongguang Wu ◽  
Yuelin Gao ◽  
Wanting Wang ◽  
Ziyu Zhang
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Ant Colony Algorithm ◽  
Time Window ◽  
Time Windows ◽  
Ant Colony ◽  
Routing Problem ◽  
Multiple Strategies ◽  
Hard Time ◽  
Mutation Operation

AbstractIn this paper, we propose a vehicle routing problem with time windows (TWVRP). In this problem, we consider a hard time constraint that the fleet can only serve customers within a specific time window. To solve this problem, a hybrid ant colony (HACO) algorithm is proposed based on ant colony algorithm and mutation operation. The HACO algorithm proposed has three innovations: the first is to update pheromones with a new method; the second is the introduction of adaptive parameters; and the third is to add the mutation operation. A famous Solomon instance is used to evaluate the performance of the proposed algorithm. Experimental results show that HACO algorithm is effective against solving the problem of vehicle routing with time windows. Besides, the proposed algorithm also has practical implications for vehicle routing problem and the results show that it is applicable and effective in practical problems.

Sign in / Sign up

Export Citation Format

Share Document