scholarly journals Development of an Efficient Genetic Algorithm for the Time Dependent Vehicle Routing Problem with Time Windows

2017 ◽  
Vol 07 (01) ◽  
pp. 1-25 ◽  
Author(s):  
Suresh Nanda Kumar ◽  
Ramasamy Panneerselvam
Keyword(s):  
Genetic Algorithm ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Time Windows ◽  
Time Dependent ◽  
Routing Problem

scholarly journals TDGVRPSTW of Fresh Agricultural Products Distribution: Considering Both Economic Cost and Environmental Cost

2021 ◽  
Vol 11 (22) ◽  
pp. 10579
Author(s):  
Daqing Wu ◽  
Chenxiang Wu
Keyword(s):  
Genetic Algorithm ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Time Windows ◽  
Economic Cost ◽  
Agricultural Products ◽  
Time Dependent ◽  
Environmental Cost ◽  
Routing Problem ◽  
Measure Function

The time-dependent vehicle routing problem of time windows of fresh agricultural products distribution have been studied by considering both economic cost and environmental cost. A calculation method for road travel time across time periods is designed in this study. A freshness measure function of agricultural products and a measure function of carbon emission rate are employed by considering time-varying vehicle speeds, fuel consumptions, carbon emissions, perishable agricultural products, customers’ time windows, and minimum freshness. A time-dependent green vehicle routing problem with soft time windows (TDGVRPSTW) model is formulated. The object of the TDGVRPSTW model is to minimize the sum of economic cost and environmental cost. According to the characteristics of the model, a new variable neighborhood adaptive genetic algorithm is designed, which integrates the global search ability of the genetic algorithm and the local search ability of the variable neighborhood descent algorithm. Finally, the experimental data show that the proposed approaches effectively avoid traffic congestions, reduce total distribution costs, and promote energy conservation and emission reduction.

Grid Platform Applied to the Vehicle Routing Problem with Time Windows for the Distribution of Products

2012 ◽  
pp. 52-81
Author(s):  
Marco Antonio Cruz-Chávez ◽  
Abelardo Rodríguez-León ◽  
Rafael Rivera-López ◽  
Fredy Juárez-Pérez ◽  
Carmen Peralta-Abarca ◽  
...  
Keyword(s):  
Genetic Algorithm ◽  
Grid Computing ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Time Windows ◽  
Solution Space ◽  
Routing Problem ◽  
Computing Platform ◽  
Hard Problems ◽  
Computing Platforms

Around the world there have recently been new and more powerful computing platforms created that can be used to work with computer science problems. Some of these problems that are dealt with are real problems of the industry; most are classified by complexity theory as hard problems. One such problem is the vehicle routing problem with time windows (VRPTW). The computational Grid is a platform which has recently ventured into the treatment of hard problems to find the best solution for these. This chapter presents a genetic algorithm for the vehicle routing problem with time windows. The algorithm iteratively applies a mutation operator, first of the intelligent type and second of the restricting type. The algorithm takes advantage of Grid computing to increase the exploration and exploitation of the solution space of the problem. The Grid performance is analyzed for a genetic algorithm and a measurement of the latencies that affect the algorithm is studied. The convenience of applying this new computing platform to the execution of algorithms specially designed for Grid computing is presented.

Sign in / Sign up

Export Citation Format

Share Document