Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników
2006 | Mathematical, econometrical and computational methods in finance and insurance | 223--229
Tytuł artykułu

Lagrangian Heuristic for Fastidious Travelling Salesman Problem

Warianty tytułu
Języki publikacji
We presented a new integer formulation for the Fastidious Travelling Salesman Problem and Lagrangean decomposition for this formulation. We proposed an aproximation algorithm for special case of the problem in which we investigated the specific updating of the Lagrangean multipliers. With this algorithm we can obtaine a lower bound of the problem for branch and bound algorithm. We can see from computational results that the improvement of the lower bound is indispensable. The limited computational results show that formulation has promise. There is a need, therefore, for extensive computational studies. The authors are currently working on a more elaborate algorithm which will exploit the structure of the formulation. (fragment of text)
  • University of Zilina, Slovakia
  • University of Zilina, Slovakia
  • Palúch S.: The Fastidious Travelling Problem (to appear).
  • Pončák M.: The Fastidious Travelling Problem. Transcom 2003, University of Zilina, 5-th European Conference of Young Research and Science Workers in Transport and Telecommunication, ISBN 80-8070-079-6.
  • Pončák M.: The Fastidious Assignment Problem. "Journal of Information, Control and Management System" 2004, Vol. 2, No 1.
  • Millar, Harvey H.: An Alternate Formulation and Lagrangean Heuristic for the Traveling Salesperson Problem. 1999, /millar99alternate. Html
  • Lawler E.L., Lenstra J.K., Rinnooy Kan A.H.G., Shmoys D.B.: The Traveling Salesman Problem. Wiley, Chichester 1985.
  • Holmberg K.: A Convergence Proof for Linear Mean Value Cross Decomposition. LiTH-MAT-R, 1991.
Typ dokumentu
Identyfikator YADDA

Zgłoszenie zostało wysłane

Zgłoszenie zostało wysłane

Musisz być zalogowany aby pisać komentarze.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.