DocumentCode
1897637
Title
The Fixed Routes Assignment Considering Fluctuant Customer Demand
Author
Chiang, Chih-Ping
Author_Institution
Graduate Sch. of Ind. Eng. & Manage., Cheng Shiu Univ., Kaohsiung
fYear
2006
fDate
21-23 June 2006
Firstpage
615
Lastpage
620
Abstract
A variant VRP problem is introduced by considering available multi-period customer demand and split delivery, where the split delivery strategy is used to cope the periodic fluctuation of customer demand, that the demand exceeded the vehicle capacity may be fulfilled by the identical fixed route traveled in different period. The objective is to minimize the total operational cost including the traveling cost, the split delivery cost, and the fixed cost of fleet size. A genetic algorithm-based approach augmented with the dynamic programming is developed to solve the described problem. This paper is unique in considering multi-period demand of customers and addressing the reduction of workload variation by the split delivery strategy. Computational results find the proposed approach significantly outperforms in the reduction of total distance traveled and the number of vehicles utilized over the planning horizon
Keywords
cost reduction; customer services; dynamic programming; genetic algorithms; minimisation; supply and demand; vehicles; dynamic programming; fixed route assignment; fluctuant multiperiod customer demand; genetic algorithm; split delivery strategy; traveling cost minimization; vehicle capacity; Computational modeling; Costs; Genetic algorithms; Linear programming; NP-hard problem; Neural networks; Routing; Simulated annealing; Time factors; Vehicles; Dynamic programming; Genetic algorithm; Split delivery; and Vehicle routing problem;
fLanguage
English
Publisher
ieee
Conference_Titel
Service Operations and Logistics, and Informatics, 2006. SOLI '06. IEEE International Conference on
Conference_Location
Shanghai
Print_ISBN
1-4244-0317-0
Electronic_ISBN
1-4244-0318-9
Type
conf
DOI
10.1109/SOLI.2006.329009
Filename
4125651
Link To Document