Skip to main content
SpringerLink
Log in

Heuristic for the Asymmetric Travelling Salesman Problem

  • Technical Note
  • Published:
Journal of the Operational Research Society

Abstract

The paper describes a heuristic algorithm for the asymmetric travelling salesman problem. The procedure is a generalization of Webb's Simple Loss 1 Method and is of the sequential type, i.e. in each step one link of the tour is fixed. The method proved to produce "high quality" near optimal solutions in a computing time, which only grows proportional to n1.82.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Department of Mathematics, U.I.A., Antwerp, Belgium

    P. van der Cruyssen & M. J. Rijckaert

Authors
  1. P. van der Cruyssen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. J. Rijckaert
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

van der Cruyssen, P., Rijckaert, M. Heuristic for the Asymmetric Travelling Salesman Problem. J Oper Res Soc 29, 697–701 (1978). https://doi.org/10.1057/jors.1978.147

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1057/jors.1978.147

Search

Navigation