A hybrid genetic algorithm for the vehicle routing problem with time windows

1998 ◽  
pp. 114-127 ◽  
Author(s):  
Jean Berger ◽  
Martin Salois ◽  
Regent Begin
Keyword(s):  
Genetic Algorithm ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Time Windows ◽  
Hybrid Genetic Algorithm ◽  
Routing Problem

A Parallel Hybrid Genetic Algorithm on Cloud Computing for the Vehicle Routing Problem with Time Windows

2013 ◽  
Author(s):  
Andre Siqueira Ruela ◽  
Frederico Gadelha Guimaraes ◽  
Ricardo Augusto Rabelo Oliveira ◽  
Brayan Neves ◽  
Vicente Peixoto Amorim ◽  
...  
Keyword(s):  
Genetic Algorithm ◽  
Cloud Computing ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Time Windows ◽  
Hybrid Genetic Algorithm ◽  
Routing Problem ◽  
Parallel Hybrid

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.

A Hybrid Genetic Algorithm-Simulated Annealing Approach for the Multi-Objective Vehicle Routing Problem with Time Windows

2011 ◽  
pp. 79-97
Author(s):  
Gülfem Tuzkaya ◽  
Bahadir Gülsün ◽  
Ender Bildik ◽  
E. Gözde Çaglar
Keyword(s):  
Genetic Algorithm ◽  
Simulated Annealing ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Time Windows ◽  
Hybrid Genetic Algorithm ◽  
Benchmark Problems ◽  
Routing Problem ◽  
Solution Approach ◽  
Multi Objective

In this study, the vehicle routing problem with time windows (VRPTW) is investigated and formulated as a multi-objective model. As a solution approach, a hybrid meta-heuristic algorithm is proposed. Proposed algorithm consists of two meta-heuristics: Genetic Algorithm (GA) and Simulated Annealing (SA). In this algorithm, SA is used as an improvement operator in GA. Besides, a hypothetical application is presented to foster the better understanding of the proposed model and algorithm. The validity of the algorithm is tested via some well-known benchmark problems from the literature.

Sign in / Sign up

Export Citation Format

Share Document