[1] |
Ball, M.; Golden, B.; Assad, A.; Bodin, L.: Planning for truck fleet size in the presence of common-carrier options. Decision sciences 14, No. 1, 103-120 (1983) |

[2] |
Bodin, L.; Mingozzi, A.; Baldacci, R.; Ball, M.: The roll-on, roll-off vehicle routing problem. Transportation science 34, No. 3, 271-288 (2000) · Zbl 1004.90017 |

[3] |
Bräysy, O.; Gendreau, M.: Vehicle routing problem with time windows. Part ii: Metaheuristics. Transportation science 39, No. 1, 119-139 (2000) · Zbl 1038.90005 |

[4] |
Campbell, A.; Savelsbergh, M.: Efficiently handling practical complexities in insertion heuristics. Transportation science 38, No. 3, 369-378 (2004) |

[5] |
Carreto, C., Baker, B., 1999. A GRASP interactive approach to the vehicle routing problem with backhauls. In: Proceedings of the Third Metaheuristics International Conference, pp. 125 -- 128. · Zbl 1005.90512 |

[6] |
Combs, T.; Moore, J.: A hybrid tabu search/set partitioning approach to tanker crew scheduling. Military operations 9, No. 1, 43-56 (2004) |

[7] |
Corinescu, E.: Drayage data files from 2002. (2003) |

[8] |
Cullen, F.; Jarvis, J.; Ratliff, H.: Set partitioning based heuristics for interactive routing. Networks 11, 125-143 (1981) |

[9] |
Dahnke, B., 2003. Drayage data files from 1998. Laser Trucking, personal communication. |

[10] |
De Meulemeester, L.; Laporte, G.; Louveaux, F.; Semet, F.: Optimal sequencing of skip collections. Journal of operational research society 48, 57-64 (1997) · Zbl 0881.90046 |

[11] |
Desrochers, M.; Desrosiers, J.; Solomon, M.: A new optimization algorithm for the vehicle routing problem with time windows. Operations research 40, No. 2, 342-354 (1992) · Zbl 0749.90025 |

[12] |
Dror, M.: Note on the complexity of the shortest path problem with resource constraints for column generation in VRPTW. Operations research 42, 977-978 (1994) · Zbl 0815.90064 |

[13] |
Dror, M.; Fortin, D.; Roucairol, C.: Complexity issues for a redistribution problem. Mathematics and computer science: algorithms, trees, combinatorics, and probabilities, 165-176 (2000) · Zbl 0973.90018 |

[14] |
Dror, M., Fortin, D., Parent, M., Roucairol, C., 2001. Split pickup and delivery: The management of a fleet of free usage electric cars. Preprint submitted to Elsevier Preprint. |

[15] |
Dumas, Y.; Desrosiers, J.; Soumis, F.: The pickup and delivery problem with time windows. European journal of operational research 54, 7-22 (1991) · Zbl 0736.90028 |

[16] |
Feo, T.; Resende, M.: A probabilistic heuristic for a computationally difficult set covering problem. Operations research letters 8, 67-71 (1989) · Zbl 0675.90073 |

[17] |
Feo, T.; Venkatraman, K.; Bard, J.: A GRASP for a difficult single machine scheduling problem. Computers and operations research 18, 635-643 (1991) · Zbl 0741.90033 |

[18] |
Grosz, J.: Personal communications. (2003) |

[19] |
Kontoravdis, G.; Bard, J.: A GRASP for the vehicle routing problem with time windows. ORSA journal on computing 7, 10-23 (1995) · Zbl 0822.90055 |

[20] |
Matejcik, F.; Nelson, B.: Two-stage multiple comparisons with the best for computer simulation. Operations research 43, 633-640 (1995) · Zbl 0860.65149 |

[21] |
Morlok, E.K., Spasovic, L.N., 1994. Approaches for improving drayage in rail-truck intermodal service. Research Report, University of Pennsylvania. |

[22] |
Nanry, W.; Barnes, J.: Solving the pickup and delivery problem with time windows using reactive tabu search. Transportation research B 34, 107-121 (2000) |

[23] |
Ólafsson, S., Kim, J., 2002. Simulation optimization. In: Proceedings of the 2002 Winter Simulation Conference, pp. 79 -- 84. |

[24] |
Savelsbergh, M.; Sol, M.: The general pickup and delivery problem. Transportation science 29, 17-29 (1995) · Zbl 0826.90049 |

[25] |
Savelsbergh, M.; Sol, M.: DRIVE: dynamic routing of independent vehicles. Operations research 46, 474-490 (1998) · Zbl 0987.90511 |

[26] |
Shi, L., Ólafsson, S., 1997. An integrated framework for deterministic and stochastic optimization. In: Proceedings of the 1997 Winter Simulation Conference, pp. 358 -- 365. |

[27] |
Sinha, P.; Zoltners, A.: The multiple choice knapsack problem. Operations research 27, 503-515 (1979) · Zbl 0406.90052 |

[28] |
Smilowitz, K.: Multi-resource routing with flexible tasks: an application in drayage operations. IIE transactions 38, No. 7, 577-590 (2006) |

[29] |
Xu, H.; Chen, Z. -L.; Rajagopal, S.; Arunapuram, S.: Solving a practical pickup and delivery problem. Transportation science 37, No. 3, 347-364 (2003) |