International Conference A genetic algorithm based approach for the periodic vehicle routing problem
2015.07.31 14:28
| author | Joon Yung Moon |
|---|---|
| 2nd author | Youngwoo Kim Jinwoo Park |
| presenter | |
| info | This conference paper has been presented by Joon Yung Moon on the Asia-Pacific Conference on Industrial Engineering and Management System. The conference has been held in Kitakyusyu, Japan, 2009/12/14 ~ 2009/12/16 . |
| year | 2009 |
| category | IC |
| start / end date | |
| city / nation | |
| 학회 | APIEMS |
| keywords | periodic vehicle routing; logistics; genetic algorithm; heuristics; assignment problem; TSP |
| abstract | This paper deals with periodic vehicle routing problem (PVRP) which is a challenging variant of the traditional single-day vehicle routing problem (VRP). The PVRP is the problem of planning routes for delivery vehicles for days of a given T-day horizon. In this problem, not all customers require delivery on everyday. The problem has to be designed for each customer, calculating how often this customer must be visited for a given T-day planning horizon. In other words, each customer has a proper frequency for being visited. To solve this problem, customers have to be assigned to a combination of days and then the vehicle routing problems have to be solved for every single day. So, the PVRP is a complex combinatorial problem combining two classical problems: the assignment problem and the vehicle routing problem. Up to now, few solution procedures for the PVRP using genetic algorithm appear in the literature. The objective of this paper is to minimize the total costs of all routes over the planning horizon, thereby finding routes for each day and each vehicle. This paper uses the genetic algorithm to solve this problem. By using this algorithm, the solution of PVRP can reduce the total cost of delivery vehicles and improve the routing efficiency. |
Download :