參考文獻 |
全國貨運聯網,http://www.tolacu.com.tw/board_list.asp,(2012)。
李洪鑫,「含時窗車輛途程問題各演算法適用範圍之探討」,碩士論文,東海大學工業工程研究所 (2000)。
余秀梅,「多元商品模式應用在動態貨櫃調度問題之研究」,碩士論文,國立成功大學交通管理科學研究所 (1994)。
邱明琦,陳春益,林佐鼎,「海運貨櫃排程模式之研究」,運輸計劃季刊,第三十一卷,第三期,第495-522頁 (2002)。
陳春益,邱明琦,「貨櫃航線網路設計模式之研究」,運輸計劃季刊,第三十一卷,第二期,第267-298頁 (2002)。
顏上堯、何淑萍,「飛航排程暨班次表之建立」,運輸計劃季刊,第二十三卷,第一期,第73-90頁 (1994)。
顏上堯、翁綵穗,「季節轉換間緩衝期飛航排程之研究」,運輸計劃季刊,第三十卷,第四期,第891- 922頁 (2001)。
顏上堯、周容昌、李其灃 (2002),「交通建設計畫評選模式及其解法之研究以中小型交通建設計畫的評選為例」,運輸計畫季刊,第三十一卷,第一期,第1- 28 頁。
Abara, J. (1989), “Applying integer linear programming to the fleet assignment problem,” Interfaces, Vol. 19, pp. 20-28.
Ai, T.J., Kachitvichyanukul, V. (2009), “A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery,” Computers and Operations Research, Vol. 36, pp.1693-1702.
Alfa, A. S., Heragu, S. S. and Chen, M. (1991), “A 3-opt based simulated annealing algorithm for vehicle routing problem,” Computers and Industrial Engineering, Vol. 21, pp. 635-639.
Baker, E. K. and J. R. Schaffer (1986), “Solution Improvement Heuristics for the Vehicle Routing and Scheduling Problem with Time Window Constrations,” American Journal of Mathematical and Management Sciences, Vol. 6(3.4), pp. 261-300.
Berbeglia. G., Cordeau, J.F., Gribkovskaia, I., Laporte, G. (2007), “Static pickup and delivery problems: a classification scheme and survey,” TOP, Vol. 15, pp. 1-31.
Bianchessi, N., Righini, G. (2007), “Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery,” Computers and Operations Research, Vol. 34, pp.578-594.
Chen, J.-F., Wu, T.-H. (2006), “Vehicle routing problem with simultaneous deliveries and pickups, ” Journal of the Operational Research Society, Vol. 57, pp.579-587.
Charon, I. and Hurdy, O. (1993), “The noising method: a new method for combinatorial optimization,” Operations Research Letters, Vol. 14, pp. 133-137.
Clarke, L. W., Hane, C. A., Johnson, E. L., and Nemhauser, G. L. (1996), “Maintenance and crew considerations in fleet assignment, ” Transportation Science, Vol. 30, pp. 249-260.
Crispim, J., Brandao, J. (2005), “Metaheuristics applied to mixed and simultaneous extension of vehicle routing problens with backhauls, ” Journal of the Operational Research Society, Vol. 56, pp.1296-1302.
Dell′Amico, M., Righini, G., Salani, M. (2006), “A branch-and-price approach to the vehicle routing problem with simultaneous distribution and collection,” Transportation Science, Vol. 40, pp.235-247.
Dethloff, J. (2001), “Vehicle routing and reverse logistics: the vehicle routing Problem with simultaneous delivery and pick-up, ” OR Spectrum, Vol. 23, pp.79-96.
Dorigo, M., Maniezzo, V. and Colorni, A. (1996), “The ant system: optimization by a colony of cooperating agents,” IEEE Transactions on Systems, Man, and Cybernetics Part B, Vol. 26, No. 1, pp. 29-41.
Dueck, G. (1993), “New optimization heuristics: the great deluge algorithm and the record-to-record travel,” Journal of Computational Physics, Vol. 104, pp. 86-92.
Dueck, G. and Scheuer, T. (1990), “Threshold accepting: a general purpose optimization algorithm appearing superior to simulated annealing,” Journal of Computational Physics, Vol. 90, pp. 161-175.
Fisher, M. L., “The Lagrangian relaxation method for solving integer programming problem,” Management Science, Vol. 27, pp. 1-18 (1981).
Goldberg, D. E. (1989), Genetic algorithms in search, optimization, and machine Learning, Addison-Wesley, Reading, MA.
Golden, B. L. and Skiscim, C. C. (1986), “Using stimulated annealing to solve routingand location problems,” Naval Research Logistic Quarterly, Vol. 33, pp.261-279.
Gribkovskaia, I., Laporte, G.and Shyshou, A. (2008), “The single vehicle routing problem with deliveries and selective pickups,” Computers and Operations Research, Vol. 35, pp.2908-2924.
Gu, J. and Huang, X. (1994), “Efficient local search with search space smoothing: a case study of the traveling salesman problem (TSP),” IEEE Transaction on Systems, Man and Cybernetics, Vol. 24, pp. 728-739.
Hane, C. A., Barnhart, C., Johnson, E. L., Marsten, R., Nemhauser, G. L., and Sigismondi, G. (1995), “The fleet assignment problem: solving a large-scale integer program,” Mathematical Programming Study, Vol. 70, pp. 211-232.
Hu, N. (1992), “Tabu search method with random moves for globally optimal design,” International Journal for Numerical Methods in Engineering, Vol. 35, pp. 1055-1070.
Kirkpatrick, S., Gelatt, C. D. and Vecchi, M.P. (1983), “Optimization by simulated annealing,” Science, Vol. 220, pp. 671-680.
Min, H. (1989), “The multiple vehicle routing problem with simultaneous delivery and pick-up points, ” Transportation Research A, Vol. 23(5), pp.377-386.
Mingozzi, A., Giorgi, S. (1999), “An exact method for the vehicle routing problem with backhauls,” Transportation Science, Vol. 33(3), pp.315-329.
Montané, F.A.T., Galvao, R.D. (2006), “A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service, ” Computers and Operations Research, Vol. 33(3), pp.595-619.
Nagy, G., Salhi, S. (2005), “Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries,” European Journal of Operational Research, Vol. 162(1), pp.126-141.
Reeves, C. R. (1993), “Improving the efficiency of tabu search for machine sequencing problems,” Journal of the Operation Research Society, Vol. 44, No. 4,pp. 375-382.
Robuste, F., Daganzo, C. F. and Souleyrette, R. (1990), “Implementing vehicle routing models,” Transportation Research Part B, Vol. 24, No. 4, pp. 263-286.
Ropke, S., Pisinger, D. (2006), “A unified heuristic for a large class of Vehicle Routing Problems with Backhauls,” European Journal of Operational Research, Vol. 171, pp.750-775.
Sinclair, M. (1993), “Comparison of the performance of modern heuristic for combinatorial optimization on real data, ” Computers and Operations Research, Vol. 20, No. 7, pp. 687-695.
Solomon, M. M. and J. Desrosiers (1988), “Time Windows Constrained Routing and Scheduling Problems,” Transportation Science, Vol. 22(1), pp.1-13.
Subramanian, R., Scheff, R. P., Quillinan, J. D., Wiper, D. S., and Marsten, R. E. (1994), “Coldstart: fleet assignment at Delta Air Lines,” Interface, Vol. 24, pp. 104-120.
Sutcliffe, C. and J. Board (1990), “Optimal Solution of a Vehicle-routing Problem:Transporting Mentally Handicapped Adults to an Adult Training Centre,” Journal of Operational Research Society, Vol. 14(1), pp. 61-67.
Tütüncüa, G.Y., Carreto, C.A.C., Baker, B.M. (2009), “A visual interactive approach to classical and mixed vehicle routing problems with backhauls, ” Omega, Vol. 37, pp.138-154.
Wade, A.C., Salhi, S. (2002), “An investigation into a new class of vehicle routing problem with backhauls,” Omega, Vol. 30, pp.479-487.
Yan, S., Chen, S. C., and Chen, C. H. (2006a), “Air cargo fleet routing and timetable setting with multiple on-time demands,” Transportation Research Part E, Vol. 42(5), pp. 409-430.
Yan, S., Chi, C. J., and Tang, C. H. (2006b), “Inter-city bus routing and timetable setting under stochastic demands,” Transportation Research Part A, Vol. 40, pp. 572-586.
Yan, S. and Chen, C.H. (2007), “Coordinated flight scheduling models for allied airlines,” Transportation Research Part C, Vol. 15, pp. 246-264.
Yan, S. and Chen, H. L. (2002), “A scheduling model and a solution algorithm for inter-city bus carriers,” Transportation Research Part A, Vol. 36, pp. 805-825.
Yan, S. and Luo, S.C. (1999), “Probabilistic local search algorithms for concave cost transportation network problems,” European Journal of Operational Research,Vol. 117, pp. 511-521.
Yan, S. and Shih, Y. L. (2006), “A time-space network model for work team scheduling after a major disaster,” Journal of Chinese Institute of Engineers, Vol. 30(1), pp. 63-75.
Yan, S., Tang, C. H., and Shieh, C. N. (2005), “A simulation framework for evaluating airline temporary schedule adjustments following incidents,” Transportation Planning and Technology, Vol. 28(3), pp. 189-211.
|