Optimization of Distribution Routing Problem Based on Travel Time Reliability
Author:
- Jie GaoJGJie Gao
- 1 January 2009
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1 (21551456) , 19-22
Abstract
As part of solutions to the technical problem of logistics distribution, vehicle routing problem (VRP) is getting more and more attention in academics and enterprises, it belongs to the NP-hard problem theoretically. VRP with time windows and capacity constraint in stochastic traffic network was studied based on travel time reliability . Firstly, travel time was expressed as a random variable according to previous collected data, and travel time reliability was obtained using the Monte-Carlo method. Then multi-objective optimization model satisfying travel time reliability constrain as well as multi-objective chance-constraints was presented for optimization of distribution routing, and modified genetic algorithm for the model was proposed. At last, numerical results were provided to demonstrate the feasibility and validity of the proposed model and algorithm.Keywords
This publication has 3 references indexed in Scilit:
- Solving multiobjective vehicle routing problem with stochastic demand via evolutionary computationEuropean Journal of Operational Research, 2007
- Effective Local Search Algorithms for Routing and Scheduling Problems with General Time-Window ConstraintsTransportation Science, 2005
- Models, relaxations and exact approaches for the capacitated vehicle routing problemDiscrete Applied Mathematics, 2002