참고문헌
- Aldaihani, M. and M. M. Dessouky, "Hybrid scheduling methods for paratransit operations," Computers and Industrial Engineering 45 (2003), 75-96. https://doi.org/10.1016/S0360-8352(03)00032-9
- Andersson, H., M. Christiansen, and K. Fagerholt, "The maritime pickup and delivery problem with time windows and split loads," INFOR 49 (2011), 79-91.
- Archetti, C., A. Hertz, and M. G. Speranza, "A tabu search algorithm for the split delivery vehicle routing problems," Transportation Science 40, 11 (2006), 64-73. https://doi.org/10.1287/trsc.1040.0103
- Archetti, C., M. W. P. Savelsbergh, and M. G. Speranza, "An optimization-based heuristic for the split delivery vehicle routing problem," Transportation Science, 42, 1 (2008), 22-31. https://doi.org/10.1287/trsc.1070.0204
- Archetti, C., M. W. P. Savelsbergh, and M. G. Speranza, "To split or not to split: That is the question," Transportation Research Part E 44 (2008), 114-123. https://doi.org/10.1016/j.tre.2006.04.003
- Belenguer, J., M. Martinez, and E. Mota, "A lower bound for the split delivery vehicle routing problem," Operations Research 48, 5 (2000), 801-810. https://doi.org/10.1287/opre.48.5.801.12407
- Belfiofre, P. and H. T. Y. Yoshizaki, "Scatter search for a real-life heterogeneous fleet vehicle routing problem with time windows and split deliveries in Brazil," European Journal of Ops. Res. (2009), 750-758.
- Bolduc, M.-C., G. Laporte, J. Renaud, and F. F. Bocktor, "A tabu search heuristic for the split delivery vehicle routing problem with production and demand calendars," European Journal of Ops. Res. 202 (2010), 122-130. https://doi.org/10.1016/j.ejor.2009.05.008
- Caricato, P., G. Ghiani, A. Grieco, and E. Guerriero, "Parallel tabu search for a pickup and delivery problem under track contention," Parallel Computing 29 (2003), 631-639. https://doi.org/10.1016/S0167-8191(03)00046-2
- Chen, S., B. Golden, and E. Wasil, "The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results," Networks 49, 4 (2007), 318-329. https://doi.org/10.1002/net.20181
- Clarke, C. and J. Q. Wright, "Scheduling of vehicle from a central depot to a number of delivery points," Operations Res. 12 (1964), 568-581. https://doi.org/10.1287/opre.12.4.568
- Cordeau, J. and G. Laporte, "A tabu search heuristic for the static multi-vehicle dial-a-ride problem," Transportation Res. B 37 (2003), 579-594. https://doi.org/10.1016/S0191-2615(02)00045-0
- Dell'Amico, M. D., G. Righini, and M. Salani, "A branch-and-price approach to the vehicle routing problem with simulta-neous distribution and collection," Transportation Science 40, 2 (2006), 235- 247. https://doi.org/10.1287/trsc.1050.0118
- Desaulniers, G., F. Lessard, and A. Hadjar, "Tabu Search, Partial Elementarity, and Generalized k- Path Inequalities for the Vehicle Routing Problem with Time Windows," Transportation Science 42, 3 (2008), 387-404. https://doi.org/10.1287/trsc.1070.0223
- Desrochers, M., G. Desaulniers, and M. Solomon, "A new optimization algorithm for the vehicle routing problem with time windows," Operations Research 40 (1992), 342-354. https://doi.org/10.1287/opre.40.2.342
- Dror, M., G. Laporte, and P. Trudeau, "Vehicle routing with split deliveries," Discrete Appl. Math. 50 (1994), 239-254. https://doi.org/10.1016/0166-218X(92)00172-I
- Dror, M. and P. Trudeau, "Saving by split delivery routing," Transportation Science 23 (1989), 141-145. https://doi.org/10.1287/trsc.23.2.141
- Dror, M. and P. Trudeau, "Split delivery routing," Naval Research Logistics 37, 3 (1990), 383-402. https://doi.org/10.1002/nav.3800370304
- Frizzell, P. W. and J. W. Giffin, "The bounded split delivery vehicle routing problem with grid networks distances," Asia Pacific Journal of Operational Research 9 (1992), 101-116.
- Frizzell, P. W. and J. W. Giffin, "The split delivery vehicle scheduling problem with time windows and grid network distances," Computers Ops. Res. 22, 6 (1995), 655-667. https://doi.org/10.1016/0305-0548(94)00040-F
- Gendreau, M., P. Dejax, D. Feillet, and C. Gueguen, "Vehicle routing with time windows and split deliveries," working paper, 2003.
- Ho, S. C. and D. Haugland, "A tabu search heuristic for the vehicle routing problem with time windows and split deliveries," Computers and Operations Research 31 (2004), 1947-1964. https://doi.org/10.1016/S0305-0548(03)00155-2
- Indra-Payoong, N., A. Sumalee, K. Vanitchakornpong, and W.Y. Szeto, "A hybrid column generation and local search algorithm for pickup and delivery problem," Transportation Research Boards 88th Annual Meeting, 2009.
- Jin, M., K. Liu, and R. B. Bowden, "A two-state alrorithm with valid inequalities for the split delivery vehicle routing problem," Int. J. Production Economics 105 (2007), 228-242. https://doi.org/10.1016/j.ijpe.2006.04.014
- Jin, M., K. Liu, and B. Eksioglu, "A column generation approach for the split delivery vehicle routing problem," OR Letters 36 (2008), 265-270.
- Korsvik, J. E., K. Fagerholt, and G. Laporte, "A large neighbourhood search heuristic for ship routing and scheduling with split loads," Computers Ops. Res. 38 (2011), 474-483. https://doi.org/10.1016/j.cor.2010.07.005
- Landrieu, A., Y. Mati, and Z. Binder, "A tabu search heuri-stic for the single vehicle pickup and delivery problem with time window," Journal of Intelligent Manufacturing 12 (2001), 497-508. https://doi.org/10.1023/A:1012204504849
- Lee, C., M. A. Epelman, C. C. White, and Y. A. Bozer, "A shortest path approach to the multiple-vehicle routing problem with split pick-ups," Transportation Research Part B 40, 4 (2006), 265-284. https://doi.org/10.1016/j.trb.2004.11.004
- Li, F., B. Golden, and E. Wasil, "Very large-scale vehicle routing: New test problems, algorithms, and results," Computers Ops. Res. 32 (2005), 1197-1212. https://doi.org/10.1016/j.cor.2003.10.004
- Moreno, L., M. Poggi de Aragao, and E. Uchoa, "Column generation based heuristic for a helicopter routing problem," LNCS 4007 (2006), 219-230.
- Mullaseril, P., M. Dror, and J. Leung, "Split delivery routing heuristics in livestock feed distribution," J. Oper. Res. Soc. 48, 2 (1997), 107-116. https://doi.org/10.1057/palgrave.jors.2600338
- Nanry, W. P. and J. W. Barnes, "Solving the pickup and delivery problem with time windows using reactive tabu search," Transportation Research Part B 34 (2000), 107-121. https://doi.org/10.1016/S0191-2615(99)00016-8
- Nowak, M., O. Ergun, and C. White, "An empirical study on the benefit of split loads with the pickup and delivery problem," European Journal of Operational Research, 2008.
- Nowak, M., O. Ergun, and C. White, "Pickup and delivery with split loads," Transportation science 42, 1 (2008), 32-43. https://doi.org/10.1287/trsc.1070.0207
- Savelsbergh, M. W. P. and M. Sol, "Drive: Dynamic routing of independent vehicles," Oper. Res. 46 (1998), 474-490. https://doi.org/10.1287/opre.46.4.474
- Sierksma, G. and G. Tijssen, "Routing helicopters for crew exchanges on off-shore locations," Annals of Oper. Res. 76 (1998), 261-286. https://doi.org/10.1023/A:1018900705946
- Subramanian, A., L. M. A. Drummond, C. Bentes, L. S. Ochi, and R. Farias, "A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery," Computers Ops. Res. 37 (2010), 1899- 1911. https://doi.org/10.1016/j.cor.2009.10.011
- Toth, P. and D. Vigo, "Heuristic algorithm for the handicapped person transportation problem," Transportation Science 31, 1 (1997), 60-71. https://doi.org/10.1287/trsc.31.1.60
- Toth, P. and D. Vigo, "The granular tabu search and its application to the vehicle-routing problem," INFORMS Journal on Computing 15 (2003), 333-346. https://doi.org/10.1287/ijoc.15.4.333.24890
- Verweij, B. and K. Aardal, "The merchant subtour problem," Mathematical Programming Ser. B, 94 (2003), 295-322. https://doi.org/10.1007/s10107-002-0321-2
- Xu, H., Z. Chen, S. Rajagopal, and S. Arunapuram, "Solving a practical pickup and delivery problem," Transportation Science 37, 3 (2003), 347-364. https://doi.org/10.1287/trsc.37.3.347.16044
피인용 문헌
- Effective Route Scheduling for Military Cargo-Plane Operation vol.33, pp.1, 2016, https://doi.org/10.7737/KMSR.2016.33.1.089