The vehicle routing problem with hard time windows and stochastic travel and service time

2016 ◽  
Vol 64 ◽  
pp. 104-116 ◽  
Author(s):  
Douglas Moura Miranda ◽  
Samuel Vieira Conceição
Keyword(s):  
Vehicle Routing ◽  
Service Time ◽  
Vehicle Routing Problem ◽  
Time Windows ◽  
Routing Problem ◽  
Hard Time

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.

scholarly journals The vehicle routing problem with hard time windows and stochastic service times

2018 ◽  
Vol 7 (3) ◽  
pp. 223-251 ◽  
Author(s):  
F. Errico ◽  
G. Desaulniers ◽  
M. Gendreau ◽  
W. Rei ◽  
L.-M. Rousseau
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Time Windows ◽  
Routing Problem ◽  
Hard Time ◽  
Service Times

Multi-depot open vehicle routing problem with fuzzy time windows

2021 ◽  
Vol 40 (1) ◽  
pp. 427-438
Author(s):  
Xiaolong Diao ◽  
Houming Fan ◽  
Xiaoxue Ren ◽  
Chuanying Liu
Keyword(s):  
Genetic Algorithm ◽  
Vehicle Routing ◽  
Service Time ◽  
Vehicle Routing Problem ◽  
Time Windows ◽  
Hybrid Genetic Algorithm ◽  
Routing Problem ◽  
Maximum Time ◽  
Open Vehicle Routing Problem ◽  
Open Vehicle Routing

This paper presents one method and one hybrid genetic algorithm for multi-depot open vehicle routing problem with fuzzy time windows (MDOVRPFTW) without maximum time windows. For the method, the degree of customers’ willingness to accept goods (DCWAG) is firstly proposed, it’s one fuzzy vague and determines maximum time windows. Referring to methods to determine fuzzy membership function, the function between DCWAG and the starting service time is constructed. By setting an threshold for DCWAG, the starting service time that the threshold corresponds can be treated as the maximum time window, which meets the actual situation. The goal of the model is to minimize the total cost. For the algorithm, MDOVRPFTW without maximum time windows is an extension of the NP-hard problem, the hybrid genetic algorithm was designed, which is combination of genetic algorithm and Hungarian algorithm. When the hybrid genetic algorithm applied to one pharmaceutical logistics company in Beijing City, China, one optimal scheme is determined. Then the rationality and the stability of solutions by the hybrid genetic algorithm are proved. Finally, sensitivity analyses are performed to investigate the impact of someone factor on DCWAG and some suggestions are proposed.

Sign in / Sign up

Export Citation Format

Share Document