1 |
Toth, P. and Vigo, D. (2001), The vehicle routing problem. Monographs on Discrete Mathematics and Applications, SIAM, Philadelphia
|
2 |
Blasum, U. and Hochstattler, W. (2000), Application of the branch and cut method to the vehicle routing problem. Technical Report zaik2000-386, Centre of Applied Computer Science, University of Cologne, Germany
|
3 |
Clarke, G. and Wright J. (1964), Scheduling of vehicles from a central depot to a number of delivery points. Operations Research, 12(4), 568-581
DOI
ScienceOn
|
4 |
Kim, J. (2005), Heterogeneous vehicle routing problem with tabu search. Ph.D. dissertation, The graduate school of Yonsei university
|
5 |
Lin, S. and Kernighan, B. (1973), An efficient heuristic for the traveling salesman problem. Operations Research, 21(2), 498-516
DOI
ScienceOn
|
6 |
Rosenkrantz, D. J., Stearns, R. E., and Lewis, P. M. (1974), Approximate algorithms for the traveling salesperson problem. Proceedings of the 15th Annual Symposium on Foundations of Computer Science(FOCS 1974),33-42
|
7 |
Tavakkoli-Moghaddam, R., Safaei, N., Kah, M. M. O. and Rabbani, M. (2006b), A new capacitated vehicle routing problem with split service for minimizing fleet cost by simulated annealing. Journal of the Franklin Institute, In Press, Corrected Proof, Available online 28 February 2006
|
8 |
Breedam. A. (1994), An analysis of the behavior of heuristics for the vehicle routing problem for a selection of problems with vehicle-related. customer-related, and time-related constraints. Ph.D. dissertation, University of Antwerp. 1994
|
9 |
Rodolfo, D. and Jaime, C. (2006), A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows, European Journal of Operational Research, 176(3), 1478-1507
DOI
ScienceOn
|
10 |
ILOG. (2002), ILOG Dispatcher 3.3 user's manual. ILOG, 49-92
|
11 |
Fisher, M. L. (1994), Optimal solution of vehicle routing problems using minimum K-trees. Operations Research, 42, 626-642
DOI
ScienceOn
|
12 |
Mosheiov, G. (1998), Vehicle Routing with Pick-up and Delivery : Tour-partitioning heuristics. Computers and Industrial Engineering, 34(3), 669-684
DOI
ScienceOn
|
13 |
George I., Manolis, K., and Gregory, P. (2003), A problem generator-solver heuristic for vehicle routing with soft time windows, Omega, 31(1), 41-51
DOI
ScienceOn
|
14 |
Salhi, S. and Rand, G. K. (1993), Incorporating vehicle routing into the vehicle fleet composition problem. European Journal of Operational Research, 66(3), 313-330
DOI
ScienceOn
|
15 |
Alfredo O. and Omar V. (2005), Adaptive memory programming for the vehicle routing problem with multiple trips, Computers and Operations Research, 34(1), 28-47
DOI
ScienceOn
|
16 |
Herminia I. C., Carmen, G., Maria-Jose O. and Belen, S. (2005), A goal programming approach to vehicle routing problems with soft time windows, European Journal of Operational Research, 177(3), 1720-1731
DOI
ScienceOn
|
17 |
Malandraki, C. and Dial, R. B. (1996), A restricted dynamic programming heuristic algorithm for the traveling salesman problem. European Journal of Operational Research, 90(1), 45-55
DOI
ScienceOn
|
18 |
Timon C. D., Eldon, Y. L. and Defrose, C. (2005), Dynamic vehicle routing for online B2C delivery. Omega, 33(1), 33-45
DOI
ScienceOn
|
19 |
Ladanyi, L., Ralphs, T. K., and Trotter Jr., L. E. (2001), Branch, cut, and price: sequential and parallel, in Computational Combinatorial Optimization. D. Naddef and M. Juenger, eds., Springer, Berlin
|
20 |
Gillett, B and Miller, L. (1974), A heuristic algorithm for the vehicle dispatching problem. Operations Research, 22, 340-349
DOI
ScienceOn
|
21 |
Gendreau, M., Laporte, G., Musaraganyi, C., and Taillard, E. D. (1999), A tabu search heuristics for the heterogeneous fleet vehicle routing problem. Computers and Operations Research, 26(12), 1153-1171
DOI
ScienceOn
|
22 |
Lee, Y. H., Kim, J. I., Kang, K. H., and Kim, K. H. (2006), A heuristic for vehicle fleet mix problem using tabu search and set partitioning, Journal of the Operational Research Society, In the 3rd review
|
23 |
Fagerholt, K. (1999), Optimal fleet design in a ship routing problem. International Transactions In Operational Research, 6(5), 453-464
DOI
ScienceOn
|
24 |
Hideki H., Toshihide I., Shinji I., and Mutsunori Y. (2006), The vehicle routing problem with flexible time windows and traveling times, Discrete Applied Mathematics, 154(16), 2271-2290
DOI
ScienceOn
|
25 |
Lee, C. G., Epelman, M., White III, C. C., and Bozer, Y. A. (2006), A shortest path approach to the multiple-vehicle routing problem with split picks-up. Transportation Research Part B : Methodological, 40(4), 265-284
DOI
ScienceOn
|
26 |
Lee, E. K. and Mitchell, J. E. (1998), Branch-and-bound methods for integer programming. in the Encyclopedia of Optimization, Kluwer Academic Publishers
|
27 |
Tavakkoli-Moghaddam, R., Safaei, N., and Gholipour, Y. (2006a), A hybrid simulated annealing for capacitated vehicle routing problems with the independent route length. Applied Mathematics and Computation, 176(2),445-454
DOI
ScienceOn
|
28 |
Lin, S. (1965), Computer solutions on the traveling salesman problem. Bell Systems Technical Journal, 44, 2245-2269
DOI
|
29 |
Kang, K. H. (2006), Vehicle routing/scheduling models considering customer satisfaction and vehicle availability, Ph.D. dissertation, The graduate school of Yonsei university
|
30 |
Olli, B., Geir, H., and Wout, D. (2004), A multi-start local search algorithm for the vehicle routing problem with time windows, European Journal of Operational Research, 159(3), 586-605
DOI
ScienceOn
|
31 |
Ochi, L. S. (1998), A parallel evolutionary algorithm for the vehicle routing problem with heterogeneous fleet. Future Generation Computer Systems, 14(5-6), 285-292
DOI
ScienceOn
|
32 |
David M. and OlIi B. (2005), Active-guided evolution strategies for large-scale capacitated vehicle routing problems, Computers and Operations Research, In Press, Corrected Proof, Available online
|