期刊論文1. | Cordeau, J. F.、Laporte, G.(2007)。The Dial-a-Ride Problem: Models and Algorithms。Annals of Operations Research,153(1),29-46。 |
2. | Ropke, S.、Cordeau, J.-F.、Laporte, G.(2007)。Models and Branch-and-Cut Algorithms for Pickup and Delivery Problems with Time Windows。Networks,49(4),258-272。 |
3. | Coslovich, L.、Pesenti, R.、Ukovich, W.(2006)。A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem。European Journal of Operational Research,175(3),1605-1615。 |
4. | Yan, S.、Chen, C. Y.(2011)。A Model and a Solution Algorithm for the Car Pooling Problem with Pre-matching Information。Computers and Industrial Engineering,61(3),512-524。 |
5. | Diana, M.、Dessouky, M. M.(2004)。A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows。Transportation Research Part B,38(6),539-557。 |
6. | Attanasio, A.、Cordeau, J. F.、Ghiani, G.、Laporte, G.(2004)。Parallel Tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem。Parallel Computing,30,377-387。 |
7. | Cordeau, J. F.(2006)。A branch-and-cut algorithm for the dial-a-ride problem。Operations Research,54,573-586。 |
8. | Cordeau, J. F.、Laporte, G.(2003)。The dial-a-ride Problem (DARP): variants, modeling issues and algorithms。Quarterly Journal of the Belgian French and Italian Operations Research Societies,1(2),89-101。 |
9. | Jørgensen, R. M.、Larsen, J.、Bergvinsdottir, K. B.(2006)。Solving the dial-a-ride problem using genetic algorithms。Journal of the Operational Research Society,58(10),1321-1331。 |
10. | Luo, Y.、Schonfeld, P.(2011)。Online rejected-reinsertion heuristics for dynamic multivehicle dial-a-ride problem。Transportation Research Record: Journal of the Transportation Research Board,2218(1),59-67。 |
11. | Parragh, S. N.、Doerner, K. F.、Hartl, R. F.(2010)。Variable neighborhood search for the dial-a-ride problem。Computers & Operations Research,37(6),1129-1138。 |
12. | Ho, S. C.、Haugland, D.(2011)。Local search heuristics for the probabilistic dial-a-ride problem。OR Spectrum,33(4),961-988。 |
13. | Wong, K. I.、Bell, M. G. H.(2006)。Solution oh the dial-a-ride problem with multi-dimensional capacity constraints。International Transaction in Operational Research,13,195-208。 |
14. | Xiang, Z.、Chu, C.、Chen, H.(2006)。A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints。European Journal of Operational Research,174,1117-1139。 |
15. | Yan, S.、Chen, C. Y.(2011)。An Optimization Model and a Solution Algorithm for the Many-to-Many Car Pooling Problem。Annals of Operations Research,191(1),37-71。 |
16. | Yan, S.、Chen, C. Y.、Wu, C. C.(2012)。Solution method for the taxi pooling problem。Transportation,39(3),723-748。 |
17. | Yan, S.、Chen, C. Y.、Lin, Y. F.(2011)。A model with a heuristic algorithm for solving the long term many-to-many car pooling problem。IEEE Transactions on Intelligent Transportation Systems,12(4),1362-1373。 |
18. | 張學孔、郭瑜堅(20070600)。都市旅次總成本模式構建之研究。運輸計劃,36(2),147-182。 延伸查詢 |
19. | Cordeau, J. F.、Laporte, G.(2003)。A Tabu Search Heuristic for the Static Multi-vehicle Dial-a-ride Problem。Transportation Research, Part B,37(6),579-594。 |
20. | Melachrinoudis, E.、Ilhan, A. B.、Min, H.(2007)。A Dial-a-Ride Problem for Client Transportation in a Healthcare Organization。Computers and Operations Research,34,742-759。 |
21. | Rekiek, B.、Delchambre, A.、Saleh, H. A.(2006)。Handicapped Person Transportation: An Application of the Grouping Genetic Algorithm。Engineering Application of Artificial Intelligence,19,511-520。 |