scholarly journals Modeling and Solution of Vehicle Routing Problem with Grey Time Windows and Multiobjective Constraints

2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Xiaojian Yuan ◽  
Qishan Zhang ◽  
Jiaoyan Zeng
Keyword(s):  
Customer Satisfaction ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Time Windows ◽  
Algorithm Analysis ◽  
Quantum Evolution ◽  
Delivery Time ◽  
Routing Problem ◽  
The Impact ◽  
Distribution Cost

Purpose. In order to study the impact of grey delivery time uncertainty on customer satisfaction and delivery costs, a vehicle routing problem with grey delivery time windows and multiobjective constraints is defined. Method. The paper first defines the uncertainty of the delivery vehicle’s arrival time to the customer as grey uncertainty and then whitens the grey time windows; at the same time, the customer’s hard time windows is expanded into a soft time windows to measure customer satisfaction when the vehicle arrives. Experiment. In order to verify the validity of the established model, numerical experiments are carried out in two groups based on the Solomon example, and the solution is solved based on the improved quantum evolution algorithm. Analysis. Distribution cost fluctuations and customer satisfaction fluctuations with grey time windows are relatively small; under different satisfaction threshold conditions, the distribution cost is increased gently with the satisfaction threshold. Conclusion. The grey delivery time windows have certain advantages in solving the random travel time vehicle routing problem.

A Bi-Objective Vehicle Routing Problem with Time Window by Considering Customer Satisfaction

2016 ◽  
Vol 7 (2) ◽  
pp. 16-39 ◽  
Author(s):  
Masoud Rabbani ◽  
Mahyar Taheri ◽  
Mohammad Ravanbakhsh
Keyword(s):  
Customer Satisfaction ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Minimum Distance ◽  
Time Window ◽  
Time Windows ◽  
Time Frame ◽  
Capacity Constraint ◽  
Routing Problem ◽  
Bender's Decomposition

The Vehicle Routing Problem (VRP) by considering Time Windows is an essential and a reality optimization problem consisting in the determination of the set of routes with minimum distance to carry goods, by using some vehicles with capacity constraint; vehicles must visit customers within a time frame. In the recent years, many numbers of algorithm have been considered to solve a single objective formulate of VRPTW problem, such as Meta-heuristic, bender's decomposition, column generation and so on. This paper considers not only the minimum distance and the number of vehicles used to carry goods for customers. The customer satisfaction by considering the priority of the customers is considered which leads to service the customer as soon as possible. In this paper, the MOPSO and NSGAII approaches applied to solve the problem and then the authors compare the results of them; finally, they analysis the sensitivity of the capacity constraint for the vehicles

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