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
    Book
    Book
    Vehicle routing: methods and studies; Vol. 16 (1988)
    Amsterdam u.a. :North-Holland,
    Details
    Title: Vehicle routing: methods and studies; Vol. 16
    Contributer: Golden, Bruce L. , Assad, Arjang A.
    Publisher: Amsterdam u.a. :North-Holland,
    Year of publication: 1988
    Pages: 479 S.
    Series Statement: Studies in management science and systems Vol. 16
    Type of Medium: Book
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    ZIB Catalog
    Zuse Institute Berlin get availability status
  • 2
    Electronic Resource
    Electronic Resource
    Using artificial neural networks to solve the orienteering problem (1995)
    Springer
    Annals of operations research 61 (1995), S. 111-120 
    Details
    ISSN: 1572-9338
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract In the orienteering problem, we are given a transportation network in which a start point and an end point are specified. Other points have associated scores. Given a fixed amount of time, the goal is to determine a path from start to end through a subset of locations in order to maximize the total path score. This problem has received a considerable amount of attention in the last ten years. The traveling salesman problem is a variant of the orienteering problem. This paper applies a modified, continuous Hopfield neural network to attack this NP-hard optimization problem. In it, we design an effective energy function and learning algorithm. Unlike some applications of neural networks to optimization problems, this approach is shown to perform quite well.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02098284
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    Designing and reporting on computational experiments with heuristic methods (1995)
    Springer
    Journal of heuristics 1 (1995), S. 9-32 
    Details
    ISSN: 1572-9397
    Keywords: heuristics ; algorithms ; experimental design ; computational testing
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract This article discusses the design of computational experiments to test heuristic methods and provides reporting guidelines for such experimentation. The goal is to promote thoughtful, well-planned, and extensive testing of heuristics, full disclosure of experimental conditions, and integrity in and reproducibility of the reported results.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02430363
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Electronic Resource
    Electronic Resource
    Solvingk-shortest and constrained shortest path problems efficiently (1989)
    Springer
    Annals of operations research 20 (1989), S. 249-282 
    Details
    ISSN: 1572-9338
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract In this paper, we examine the problems of finding thek-shortest paths, thek-shortest paths without repeated nodes, and the shortest path with a single side constraint between an origin and destination pair. Distances are assumed to be non-negative, but networks may be either directed or undirected. Two versions of algorithms for all these problems are compared. The computational results show that, in each case, the advantage of the adaptive version (as measured by total number of permanent labels) grows with the problem size.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02216932
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 5
    Electronic Resource
    Electronic Resource
    Large-scale controlled rounding using tabu search with strategic oscillation (1993)
    Springer
    Annals of operations research 41 (1993), S. 69-84 
    Details
    ISSN: 1572-9338
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract When publishing tabular data, the United States Bureau of the Census must sometimes round fractional data to integer values or round integer data to multiples of a prespecified base. Data integrity can be maintained by rounding tabular data subject to additivity constraints while minimizing the overall perturbation of the data. In this paper, we describe a heuristic based on tabu search with strategic oscillation for solving this NP-hard problem. A lower-bounding technique is developed in order to evaluate the quality of the solutions and provide a starting solution for the tabu search. Numerical results demonstrate the effectiveness of the procedure when applied to extremely large tables with up to 27,000 randomly generated entries. Additionally, the algorithm is shown to perform extremely well when applied to actual data obtained from the United States Bureau of the Census.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02022563
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 6
    Electronic Resource
    Electronic Resource
    A transportation problem formulation for the MAC Airlift Planning problem (1994)
    Springer
    Annals of operations research 50 (1994), S. 505-523 
    Details
    ISSN: 1572-9338
    Keywords: Transportation problem ; logistics ; military ; computational analysis
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract The Military Airlift Command (MAC) is responsible for planning the allocation of airlift resources for the movement of cargo and passengers. A heuristic algorithm, the Airlift Planning Algorithm (APA), has recently been developed under subcontract to the Oak Ridge National Laboratory to assist MAC in scheduling airlift resources. In this paper, we present a transportation problem formulation which can be used as a preprocessor to the APA or as an estimator for the APA. This paper examines the robustness and sensitivity of the transportation problem formulation. In particular, the performance of the APA improves by approximately 10% when the transportation problem is used as a preprocessor for two hypothetical problems and improves by up to 50% for derived airlift constrained problems.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02085656
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 7
    Electronic Resource
    Electronic Resource
    A hierarchical strategy for solving traveling salesman problems using elastic nets (1995)
    Springer
    Journal of heuristics 1 (1995), S. 67-76 
    Details
    ISSN: 1572-9397
    Keywords: neural networks ; traveling salesman problem
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In this article, we focus on implementing the elastic net method to solve the traveling salesman problem using a hierarchical approach. The result is a significant speed-up, which is studied both analytically and experimentally.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02430366
    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...