A Voronoi Tabu Search Algorithm for the Capacitated Vehicle Routing Problem |
Kwon, Yong-Ju
(PIC center, Nexerve Co., Ltd.)
Kim, Jun-Gyu (Department of Industrial Engineering, Hanyang University) Seo, Jeongyeon (Department of Industrial Engineering, Hanyang University) Lee, Dong-Ho (Department of Industrial Engineering, Hanyang University) Kim, Deok-Soo (Department of Industrial Engineering, Hanyang University) |
1 | Laporte, G. (1992), The vehicle routing problem: an overview of exact and approximation algorithms, European Journal of Operational Research, 59, 345-358 DOI ScienceOn |
2 | Lenstra, J. and Rinnooy Kan, A. (1981), Complexity of vehicle routing and scheduling problems, Networks, 11, 221-228 DOI |
3 | Oh, S. C., Yee, S. T., and Kim, T. Y, (2006), Agent-based Shipment Algorithm for Capacitated Vehicle Routing Problem with Load Balancing, Journal of the Korean Institute of Industrial Engineers, 32, 200-209 |
4 | Okabe, A., Boots, B., and Sugihara, K. (1992), Spatial Tessellations: Concepts and Applications of Voronoi Diagrams, John Wiley & Sons |
5 | Osman, I. H. (1993), Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problems, Annals of Operations Research, 41, 421-452 DOI ScienceOn |
6 | Barbarosoglu, G. and Ozgur, D. (1999), A tabu search algorithm for the vehicle routing problem, Computers and Operations Research, 26, 255-270 DOI ScienceOn |
7 | Lee, S.-H. and Lee, J. M. (2005), Study on the Heterogeneous Fleet Vehicle Routing Problem with Customer Restriction, Journal of the Korean Institute of Industrial Engineers, 31, 228-239 |
8 | Toth, P. and Vigo, D. (2003), The granular tabu search and its application to the vehicle routing problem, INFORMS Journal on Computing, 15, 333-348 DOI ScienceOn |
9 | Gendreau, M., Hertz, A., and Laporte, G. (1992), New insertion and post-optimization procedures for the traveling salesman problem, Operations Research, 40, 1086-1094 DOI ScienceOn |
10 | Dantzig, G. B. and Ramser, J. H. (1959), The truck dispatching problem, Management Science, 6, 80-91 DOI ScienceOn |
11 | Gendreau, M., Hertz, A., and Laporte, G. (1994), A tabu search heuristic for the vehicle routing problem, Management Science, 40, 1276-1290 DOI ScienceOn |
12 | Golden, B. L., Wasil, E. A., Kelly, J. P., and Chao, I.-M. (1998), The impact of metaheuristics on solving the vehicle routing problem: algorithms, problem sets, and computational results. In: Crainic, T. G., Laporte, G., editors, Fleet Management and Logistics, Boston: Kluwer, 33-56 |
13 | Rochat, Y. and Taillard, E. (1995), Probabilistic diversification and intensification in local search for vehicle routing, Journal of Heuristics, 1, 147-167 DOI |
14 | Christofides, N., Mingozzi, A., and Toth, P. (1979), The vehicle routing problem. In: Christofides, N., Mingozzi, A., Toth, P., Sandi, C., editors, Combinatorial Optimization, Chichester: Wiley, 315-338 |
15 | Gillett, B. and Miller, L. (1974), A heuristic algorithm for the vehicle dispatch problem, Operations Research, 22, 340-349 DOI ScienceOn |
16 | Glover, F. (1990), Tabu Search: Part II, ORSA Journal of Computing, 2, 4-32 DOI |
17 | Seong, J. and Moon, I. K. (2006), Vehicle Routing Problem with Time Windows considering Outsourcing Vehicles, Journal of the Korean Institute of Industrial Engineers, 32, 91-97 |
18 | Cordeau, J.-F. and Laporte, G. (2002), Tabu search heuristics for the vehicle routing problem, Technical Report, GERAD, Ecole des Hautes Etudes Comrnerciales, Montreal, Canada |
19 | Glover, F. (1989), Tabu Search: Part I, ORSA Journal of Computing, 1, 190-206 DOI |
20 | Laporte, G., Gendreau, M., Potvin, J.-Y., and Semet, F. (2000), Classical and modern heuristics for the vehicle routing problem, International Transactions in Operations Research, 7, 285-300 DOI ScienceOn |
21 | Tarantilis, C. D. and Kiranoudis, C. T. (2002), Boneroute: an adaptive memory-based method for effective fleet management, Annals of Operations Research, 115, 227-241 DOI |
22 | Kim, D.-S., Kim, D.-U and Sugihara, K (2001b), Voronoi diagram of a circle set from voronoi diagram of a point set: II. Geometry, Computer Aided Geometric Design, 18, 563-585 DOI ScienceOn |
23 | Lin, S. and Kernighan, B. W. (1973), An effective heuristic algorithm for the traveling salesman problem, Operations Research, 21, 503-511 |
24 | Kim, D.-S., Kim, D.-U and Sugihara, K. (2001a), Voronoi diagram of a circle set from voronoi diagram of a point set: I. Topology, Computer Aided Geometric Design, 18, 541-562 DOI ScienceOn |
25 | Osman, I. H. and Christofides, N. (1989), Simulated annealing and descent algorithms for capacitated clustering problems, presented as EURO-XI, Beograd, Yugoslavia |
26 | Glover, F. and Laguna, M. (1993), Tabu search. In: Reeves, C., editor, Modern Heuristic Techniques for Combinatorial Problems, Blackwell Scientific Publications, Oxford, 70-150 |
27 | Clarke, G. and Wright, J. W. (1964), Scheduling of vehicles from a central depot to a number delivery points, Operations Research, 12, 568-581 DOI ScienceOn |