.png){kind=icon}
Return
Genetic algorithm for a delivery problem with mixed time windows
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2021.107478.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This research aims to improve transportation planning decisions for a production company, which produces seasoning powder in Thailand and the logistics provider. Due to restrictions in Bangkok and its metropolitan area, the routing problem becomes one with two types of time windows. A mixed integer programming model is formulated, which aims to minimize a cost function which consists of fixed vehicle costs, variable vehicle costs and fuel costs. This approach has its limits in terms of problem size. Therefore a genetic algorithm (GA) has been developed to approximate the optimal solution. The proposed GA has a specific initialization algorithm which generates feasible random solutions. A partial factorial design of GA parameters is implemented to determine the suitable parameter values, which guide the genetic algorithm. The solution of the GA and the mixed integer programming model of the current problems were compared. The maximum optimal gap was between 0 and 0.21%, while the computational time was reduced between 67.78 and 99.45%. The results show that the planning time by a dispatcher is reduced significantly and the cost is strongly reduced, due to the fact that less vehicles are used.
Keywords:
Vehicle routing problem with time window
Mixed integer programming
Genetic algorithm
Construction heuristic
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.5
Papers:
1.0W
Citations:
3.8W
Organization
View more organizations
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSave
ShareSaveShareSave View more