Customers' satisfaction in a dial-a-ride problem
暂无分享,去创建一个
[1] Paolo Toth,et al. Heuristic Algorithms for the Handicapped Persons Transportation Problem , 1997, Transp. Sci..
[2] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.
[3] Gilbert Laporte,et al. The dial-a-ride problem: models and algorithms , 2006, Ann. Oper. Res..
[4] G. Laporte,et al. The diala-ride problem : models and algorithms , .
[5] Gilbert Laporte,et al. Models and branch-and-cut algorithms for pickup and delivery problems with time windows , 2007 .
[6] Alberto Colorni,et al. An effective and fast heuristic for the Dial-a-Ride problem , 2007, 4OR.
[7] Gilbert Laporte,et al. A Tabu Search Heuristic for the Static Multi-Vehicle Dial-a-Ride Problem , 2002 .
[8] Jean-François Cordeau,et al. A Branch-and-Cut Algorithm for the Dial-a-Ride Problem , 2006, Oper. Res..
[9] Walter Ukovich,et al. A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem , 2006, Eur. J. Oper. Res..
[10] Martin W. P. Savelsbergh,et al. The Vehicle Routing Problem with Time Windows: Minimizing Route Duration , 1992, INFORMS J. Comput..
[11] R M Jorgensen,et al. Solving the Dial-a-Ride problem using genetic algorithms , 2007, J. Oper. Res. Soc..