On the convergence of a new time window discretization method for the traveling salesman problem with time window constraints Academic Article

abstract

• In this paper, we discuss convergence of a time window discretization method for the traveling salesman problem with time window constraints. This recently proposed discretization method leads to a lower bound to the minimization problem. Analysis shows that this method always guarantees convergence to the optimal solution. We also illustrate that the traditional method that gives feasible solutions does not always provide such a guarantee. 2008 Elsevier Ltd. All rights reserved.

authors

• Wang, Xiubin

published proceedings

• COMPUTERS & INDUSTRIAL ENGINEERING

altmetric score

• 0.5

author list (cited authors)

• Wang, X., & Regan, A. C.

citation count

• 22

complete list of authors

• Wang, Xiubin||Regan, Amelia C

publication date

• January 2009

publisher

• Elsevier  Publisher

published in

• Computers and Industrial Engineering  Journal

keywords

• Convergence
• Lower Bound
• Time Window Discretization
• Traveling Salesman Problem

Digital Object Identifier (DOI)

• 10.1016/j.cie.2008.04.011

start page

• 161

end page

• 164

volume

• 56

issue

• 1

URL

• http%3A%2F%2Fdx.doi.org%2F10.1016%2Fj.cie.2008.04.011