An Effective Genetic Algorithm for the Vehicle Routing Problem with Multiple Depots

2011 ◽  
Vol 204-210 ◽  
pp. 283-287 ◽  
Author(s):  
Yun Yao Li ◽  
Chang Shi Liu
Keyword(s):  
Genetic Algorithm ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Computing Time ◽  
Travel Distance ◽  
Computational Results ◽  
High Quality ◽  
Routing Problem ◽  
Multiple Depots ◽  
Reasonable Computing

The vehicle routing problem with multiple depots was considered in this paper, and a genetic algorithm for the proposed problem was designed to minimize the vehicle number and total travel distance. Performances are compared with other heuristics recently published in the literature, the computational results show that the proposed approaches produce high quality results within a reasonable computing time.

An Effective Tabu Search for Vehicle Routing Problem with Pickup and Delivery Service

2011 ◽  
Vol 181-182 ◽  
pp. 760-764
Author(s):  
Yun Yao Li ◽  
Chang Shi Liu
Keyword(s):  
Tabu Search ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Computing Time ◽  
Bench Mark ◽  
Pickup And Delivery ◽  
Data Sets ◽  
Routing Problem ◽  
Optimal Set ◽  
Reasonable Computing

The vehicle routing problem with delivery and pick-up service was considered in this paper. A tabu search was proposed to determine the optimal set of routes to totally satisfy both the delivery and pick-up demand. Performances are compared with other heuristics appeared in the literature recently by the bench-mark data sets. The computational results show that the proposed approaches produce high quality results within a reasonable computing time.

An Effective Genetic Algorithm for the Vehicle Routing Problem with Time Windows

2010 ◽  
Vol 439-440 ◽  
pp. 247-250
Author(s):  
Chang Shi Liu ◽  
Fu Hua Huang
Keyword(s):  
Genetic Algorithm ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Time Windows ◽  
Travel Distance ◽  
Experimental Results ◽  
Test Set ◽  
Routing Problem

The vehicel routing problem with time windows (VRPTW) was considered in this paper, and a genetic algorithm (GA) for the proposed problem was designed to minimize total travel distance. Finally we tested the proposed approach with Solomon’s test set, the experimental results show that the proposed GA is very effective compared with other approaches pulished recently.

scholarly journals EODVGA: An Enhanced ODV Based Genetic Algorithm for Multi-Depot Vehicle Routing Problem

2019 ◽  
Vol 6 (21) ◽  
pp. 159099
Author(s):  
Prabu U ◽  
Ravisasthiri P ◽  
Sriram R ◽  
Malarvizhi N ◽  
Amudhavel J
Keyword(s):  
Genetic Algorithm ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Routing Problem
Sign in / Sign up

Export Citation Format

Share Document