This article presents a probabilistic technique to diversify, intensify, and parallelize a local search adapted for solving vehicle routing problems. This technique may be applied to a very wide variety of vehicle routing problems and local searches. It is shown that efficient first-level tabu searches for vehicle routing problems may be significantly improved with this technique. Moreover, the solutions produced by this technique may often be improved by a postoptimization technique presented in this article, too. The solutions of nearly forty problem instances of the literature have been improved.
%0 Journal Article
%1 citeulike:10349883
%A Rochat, Yves
%A Taillard, Éric D.
%D 1995
%I Springer Netherlands
%J Journal of Heuristics
%K imported
%N 1
%P 147--167
%R 10.1007/BF02430370
%T Probabilistic diversification and intensification in local search for vehicle routing
%U http://dx.doi.org/10.1007/BF02430370
%V 1
%X This article presents a probabilistic technique to diversify, intensify, and parallelize a local search adapted for solving vehicle routing problems. This technique may be applied to a very wide variety of vehicle routing problems and local searches. It is shown that efficient first-level tabu searches for vehicle routing problems may be significantly improved with this technique. Moreover, the solutions produced by this technique may often be improved by a postoptimization technique presented in this article, too. The solutions of nearly forty problem instances of the literature have been improved.
@article{citeulike:10349883,
abstract = {{This article presents a probabilistic technique to diversify, intensify, and parallelize a local search adapted for solving vehicle routing problems. This technique may be applied to a very wide variety of vehicle routing problems and local searches. It is shown that efficient first-level tabu searches for vehicle routing problems may be significantly improved with this technique. Moreover, the solutions produced by this technique may often be improved by a postoptimization technique presented in this article, too. The solutions of nearly forty problem instances of the literature have been improved.}},
added-at = {2012-03-02T03:39:18.000+0100},
author = {Rochat, Yves and Taillard, \'{E}ric D.},
biburl = {https://www.bibsonomy.org/bibtex/275fa0e7c98e4e7f730940b035b3b4b2b/baby9992006},
citeulike-article-id = {10349883},
citeulike-linkout-0 = {http://dx.doi.org/10.1007/BF02430370},
citeulike-linkout-1 = {http://www.springerlink.com/content/q601l84v35632413},
day = 1,
doi = {10.1007/BF02430370},
interhash = {caf15bdb8dbb68d5a5a93e5b3da69cdd},
intrahash = {75fa0e7c98e4e7f730940b035b3b4b2b},
issn = {1381-1231},
journal = {Journal of Heuristics},
keywords = {imported},
month = sep,
number = 1,
pages = {147--167},
posted-at = {2012-02-14 03:51:49},
priority = {2},
publisher = {Springer Netherlands},
timestamp = {2012-03-02T03:39:23.000+0100},
title = {{Probabilistic diversification and intensification in local search for vehicle routing}},
url = {http://dx.doi.org/10.1007/BF02430370},
volume = 1,
year = 1995
}