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
  • 1
    Electronic Resource
    Electronic Resource
    A hybrid approach to vehicle routing using neural networks and genetic algorithms (1996)
    Springer
    Applied intelligence 6 (1996), S. 241-252 
    Details
    ISSN: 1573-7497
    Keywords: vehicle routing ; time windows ; neural networks ; genetic algorithms
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract A competitive neural network model and a genetic algorithm are used to improve the initialization and construction phase of a parallel insertion heuristic for the vehicle routing problem with time windows. The neural network identifies seed customers that are distributed over the entire geographic area during the initialization phase, while the genetic algorithm finds good parameter settings in the route construction phase that follows. Computational results on a standard set of problems are also reported.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00126629
    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 genetic algorithm for vehicle routing with backhauling (1996)
    Springer
    Applied intelligence 6 (1996), S. 345-355 
    Details
    ISSN: 1573-7497
    Keywords: vehicle routing ; backhauling ; time windows ; genetic algorithms ; heuristics
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract In this paper, a greedy route construction heuristic for a vehicle routing problem with backhauling is described. This heuristic inserts customers one by one into the routes using a fixed a priori ordering of customers. Then, a genetic algorithm is used to identify an ordering that produces good routes. Numerical comparisons are provided with an exact algorithm and with other heuristic approaches.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00132738
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    A computer assistant for vehicle dispatching with learning capabilities (1995)
    Springer
    Annals of operations research 61 (1995), S. 189-211 
    Details
    ISSN: 1572-9338
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract In this paper, we describe an expert consulting system for a dispatcher working in a courier service company. The system integrates interactive-graphic features and a learning module to support the dispatcher in his(her) task, and to suggest appropriate decisions when new requests come in. An experiment with a professional dispatcher is also reported.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02098288
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Electronic Resource
    Electronic Resource
    Genetic algorithms for the traveling salesman problem (1996)
    Springer
    Annals of operations research 63 (1996), S. 337-370 
    Details
    ISSN: 1572-9338
    Keywords: Traveling salesman problem ; genetic algorithms ; stochastic search
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract This paper is a survey of genetic algorithms for the traveling salesman problem. Genetic algorithms are randomized search techniques that simulate some of the processes observed in natural evolution. In this paper, a simple genetic algorithm is introduced, and various extensions are presented to solve the traveling salesman problem. Computational results are also reported for both random and classical problems taken from the operations research literature.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02125403
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 5
    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
  • 6
    Electronic Resource
    Electronic Resource
    Tabu Search for a Network Loading Problem with Multiple Facilities (2000)
    Springer
    Journal of heuristics 6 (2000), S. 253-267 
    Details
    ISSN: 1572-9397
    Keywords: network design ; telecommunications ; tabu search ; k-shortest paths
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract This paper examines a network design problem that arises in the telecommunications industry. In this problem, communication between a gateway vertex and a number of demand vertices is achieved through a network of fiber optic cables. Since each cable has an associated capacity (bandwidth), enough capacity must be installed on the links of the network to satisfy the demand, using possibly different types of cables. Starting with a network with no capacity or some capacity already installed, a tabu search heuristic is designed to find a solution that minimizes the cost of installing any additional capacity on the network. This tabu search applies a k-shortest path algorithm to find alternative paths from the gateway to the demand vertices. Numerical results are presented on different types of networks with up to 200 vertices and 100 demand vertices.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1009679511137
    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...