Library

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • Key words: Arc Routing Problems – Undirected Rural Postman Problem – branch-and-cut – polyhedral analysis – facets  (1)
  • clustered traveling salesman problem  (1)
  • 1
    Electronic Resource
    Electronic Resource
    A tabu search heuristic using genetic diversification for the clustered traveling salesman problem (1997)
    Springer
    Journal of heuristics 2 (1997), S. 187-200 
    Details
    ISSN: 1572-9397
    Keywords: clustered traveling salesman problem ; tabu search ; diversification ; genetic algorithms ; crossover
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The clustered traveling salesman problem is an extension of the classical traveling salesman problem where the set of vertices is partitioned into clusters. The objective is to find a least cost Hamiltonian cycle such that the vertices of each cluster are visited contiguously and the clusters are visited in a prespecified order. A tabu search heuristic is proposed to solve this problem. This algorithm periodically restarts its search by merging two elite solutions to form a new starting solution (in a manner reminiscent of genetic algorithms). Computational results are reported on sets of Euclidean problems with different characteristics.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00127356
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    A branch-and-cut algorithm for the Undirected Rural Postman Problem (2000)
    Springer
    Mathematical programming 87 (2000), S. 467-481 
    Details
    ISSN: 1436-4646
    Keywords: Key words: Arc Routing Problems – Undirected Rural Postman Problem – branch-and-cut – polyhedral analysis – facets ; Mathematics Subject Classification (1991): 05c45
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract. The well-known Undirected Rural Postman Problem is considered and a binary linear problem using new dominance relations is presented. Polyhedral properties are investigated and a branch-and-cut algorithm is developed. Extensive computational results indicate that the algorithm is capable of solving much larger instances than previously reported.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/s101070050007
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...