Please use this identifier to cite or link to this item: http://localhost/handle/Hannan/441614
Title: A tabu search algorithm using the Voronoi diagram for the capacitated vehicle routing problem
Authors: Kwon, Y J;Kim, J G;Seo, J;Lee, D H;Kim, D S
subject: circle set;point set
Year: 2007
Abstract: We consider the capacitated vehicle routing problem that determines the routes of vehicles in such a way that each customer can be visited exactly once by one vehicle, starting and terminating at the depot while the vehicle capacity and the travel time constraints must be satisfied The objective is to minimize the total traveling cost. Due to the complexity of the problem, we suggest a tabu search algorithm that combines the features of the exiting local search heuristics. In particular, our tabu search algorithm incorporates the method to reduce the neighborhoods using the proximity, information of the Voronoi diagram corresponding to each problem instance. Computational experiments are done on the benchmark problems and the test results are reported.
Description: 
URI: <Go to ISI>://000250751800070
http://localhost/handle/Hannan/353102
http://localhost/handle/Hannan/441614
Appears in Collections:2002-2008

Files in This Item:
File SizeFormat 
AL536941.pdf375.2 kBAdobe PDF
Title: A tabu search algorithm using the Voronoi diagram for the capacitated vehicle routing problem
Authors: Kwon, Y J;Kim, J G;Seo, J;Lee, D H;Kim, D S
subject: circle set;point set
Year: 2007
Abstract: We consider the capacitated vehicle routing problem that determines the routes of vehicles in such a way that each customer can be visited exactly once by one vehicle, starting and terminating at the depot while the vehicle capacity and the travel time constraints must be satisfied The objective is to minimize the total traveling cost. Due to the complexity of the problem, we suggest a tabu search algorithm that combines the features of the exiting local search heuristics. In particular, our tabu search algorithm incorporates the method to reduce the neighborhoods using the proximity, information of the Voronoi diagram corresponding to each problem instance. Computational experiments are done on the benchmark problems and the test results are reported.
Description: 
URI: <Go to ISI>://000250751800070
http://localhost/handle/Hannan/353102
http://localhost/handle/Hannan/441614
Appears in Collections:2002-2008

Files in This Item:
File SizeFormat 
AL536941.pdf375.2 kBAdobe PDF
Title: A tabu search algorithm using the Voronoi diagram for the capacitated vehicle routing problem
Authors: Kwon, Y J;Kim, J G;Seo, J;Lee, D H;Kim, D S
subject: circle set;point set
Year: 2007
Abstract: We consider the capacitated vehicle routing problem that determines the routes of vehicles in such a way that each customer can be visited exactly once by one vehicle, starting and terminating at the depot while the vehicle capacity and the travel time constraints must be satisfied The objective is to minimize the total traveling cost. Due to the complexity of the problem, we suggest a tabu search algorithm that combines the features of the exiting local search heuristics. In particular, our tabu search algorithm incorporates the method to reduce the neighborhoods using the proximity, information of the Voronoi diagram corresponding to each problem instance. Computational experiments are done on the benchmark problems and the test results are reported.
Description: 
URI: <Go to ISI>://000250751800070
http://localhost/handle/Hannan/353102
http://localhost/handle/Hannan/441614
Appears in Collections:2002-2008

Files in This Item:
File SizeFormat 
AL536941.pdf375.2 kBAdobe PDF