No label defined (Q4939283)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1406245
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 1406245

      Statements

      0 references
      0 references
      0 references
      28 May 2000
      0 references
      constraints programming
      0 references
      vehicle routing problem
      0 references
      The authors propose three operators that make use of methods of constraint programming to perform the search in a large neighborhood for solving the vehicle routing problem. The first operator is a modified version of Shaw's large neighborhood search, which retires some of the clients from the current solution and reinserts them thereafter in a better manner. The second and the third operators consist of retiring certain arcs of the current solution in order to obtain a smaller problem that can exactly be solved. The method of this paper has been tested on Solomon's problems set and a comparison of the results obtained by using three operators above is also given. For the entire collection see [Zbl 0930.00067].
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references