Sequential and parallel local search for the time-constrained traveling salesman problem

DOI10.1016/0166-218X(93)90047-RzbMATH Open0780.90102MaRDI QIDQ1803676FDOQ1803676

Authors: Jan Karel Lenstra, G. A. P. Kindervater, Martin W. P. Savelsbergh 

Publication date: 29 June 1993

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 4131978
• An efficient implementation of local search algorithms for constrained routing problems
• New classes of efficiently solvable generalized traveling salesman problems
• Technical Note—An Exact Algorithm for the Time-Constrained Traveling Salesman Problem
• Publication:4870332

zbMATH Keywords

local searchtime windowstraveling salesmanlocal optimalitysequential and parallel algorithms

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Programming involving graphs or networks (90C35)

Cites Work

• Title not available (Why is that?)
• How easy is local search?
• Computer Solutions of the Traveling Salesman Problem
• Title not available (Why is that?)
• Binary Trees and Parallel Scheduling Algorithms
• Title not available (Why is that?)

Cited In (7)

• Symmetric weight constrained traveling salesman problem: Local search
• Variable neighbourhood search based on Metropolis criterion for crowdsourced delivery scheduling problem in dispatch model
• Title not available (Why is that?)
• Parallel local search
• An efficient implementation of local search algorithms for constrained routing problems
• Seeking global edges for traveling salesman problem in multi-start search
• Analysing the run-time behaviour of iterated local search for the travelling salesman problem.

This page was built for publication: Sequential and parallel local search for the time-constrained traveling salesman problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1803676)