The correlated vehicle routing problem
This paper presents a variant vehicle routing problem (VRP) to tackle the routes assignment in a lumpy demand environment, where the required capacity is affected by demand variability and the correction between the demands assigned to the routes. The correlated VRP is defined by a TSP-based formulation to minimize the distance traveled and the number of vehicles. A genetic algorithm approach is developed for solving practical problems. The computational results reveal that the correlation between the demand of customers should be evaluated and taken into consideration in the vehicle routing assigning process, which can prevent leading to either additional over or under capacity during the planning period.
Vehicle routing problem Correlation Genetic algorithm TSP
Chih-Ping Chiang
Institute of Industrial Engineering and Management, Cheng Shiu University, 840 Chengcing Road, Niaosong, Kaohsiung County 833, Taiwan
国际会议
上海
英文
2007-09-21（万方平台首次上网日期，不代表论文的发表时间）