Solving the asymmetric traveling salesman problem with periodic constraints

Giuseppe Paletta, Chefi Triki

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

In this article we describe a heuristic algorithm to solve the asymmetrical traveling salesman problem with periodic constraints over a given m-day planning horizon. Each city i must be visited ri times within this time horizon, and these visit days are assigned to / by selecting one of the feasible combinations of ri visit days with the objective of minimizing the total distance traveled by the salesman. The proposed algorithm is a heuristic that starts by designing feasible tours, one for each day of the m-day planning horizon, and then employs an improvement procedure that modifies the assigned combination to each of the cities, to improve the objective function. Our heuristic has been tested on a set of test problems purposely generated by slightly modifying known test problems taken from the literature. Computational comparisons on special instances indicate encouraging results.

Original languageEnglish
Pages (from-to)31-37
Number of pages7
JournalNetworks
Volume44
Issue number1
DOIs
Publication statusPublished - Aug 2004

Fingerprint

Traveling salesman problem
Planning
Heuristic algorithms

Keywords

  • Asymmetric traveling salesman problem
  • Construction algorithm
  • Improvement procedure
  • Periodic constraints

ASJC Scopus subject areas

  • Hardware and Architecture

Cite this

Solving the asymmetric traveling salesman problem with periodic constraints. / Paletta, Giuseppe; Triki, Chefi.

In: Networks, Vol. 44, No. 1, 08.2004, p. 31-37.

Research output: Contribution to journalArticle

@article{b2fced67f3ff42d28b07d96f66965353,
title = "Solving the asymmetric traveling salesman problem with periodic constraints",
abstract = "In this article we describe a heuristic algorithm to solve the asymmetrical traveling salesman problem with periodic constraints over a given m-day planning horizon. Each city i must be visited ri times within this time horizon, and these visit days are assigned to / by selecting one of the feasible combinations of ri visit days with the objective of minimizing the total distance traveled by the salesman. The proposed algorithm is a heuristic that starts by designing feasible tours, one for each day of the m-day planning horizon, and then employs an improvement procedure that modifies the assigned combination to each of the cities, to improve the objective function. Our heuristic has been tested on a set of test problems purposely generated by slightly modifying known test problems taken from the literature. Computational comparisons on special instances indicate encouraging results.",
keywords = "Asymmetric traveling salesman problem, Construction algorithm, Improvement procedure, Periodic constraints",
author = "Giuseppe Paletta and Chefi Triki",
year = "2004",
month = "8",
doi = "10.1002/net.20011",
language = "English",
volume = "44",
pages = "31--37",
journal = "Networks",
issn = "0028-3045",
publisher = "Wiley-Liss Inc.",
number = "1",

}

TY - JOUR

T1 - Solving the asymmetric traveling salesman problem with periodic constraints

AU - Paletta, Giuseppe

AU - Triki, Chefi

PY - 2004/8

Y1 - 2004/8

N2 - In this article we describe a heuristic algorithm to solve the asymmetrical traveling salesman problem with periodic constraints over a given m-day planning horizon. Each city i must be visited ri times within this time horizon, and these visit days are assigned to / by selecting one of the feasible combinations of ri visit days with the objective of minimizing the total distance traveled by the salesman. The proposed algorithm is a heuristic that starts by designing feasible tours, one for each day of the m-day planning horizon, and then employs an improvement procedure that modifies the assigned combination to each of the cities, to improve the objective function. Our heuristic has been tested on a set of test problems purposely generated by slightly modifying known test problems taken from the literature. Computational comparisons on special instances indicate encouraging results.

AB - In this article we describe a heuristic algorithm to solve the asymmetrical traveling salesman problem with periodic constraints over a given m-day planning horizon. Each city i must be visited ri times within this time horizon, and these visit days are assigned to / by selecting one of the feasible combinations of ri visit days with the objective of minimizing the total distance traveled by the salesman. The proposed algorithm is a heuristic that starts by designing feasible tours, one for each day of the m-day planning horizon, and then employs an improvement procedure that modifies the assigned combination to each of the cities, to improve the objective function. Our heuristic has been tested on a set of test problems purposely generated by slightly modifying known test problems taken from the literature. Computational comparisons on special instances indicate encouraging results.

KW - Asymmetric traveling salesman problem

KW - Construction algorithm

KW - Improvement procedure

KW - Periodic constraints

UR - http://www.scopus.com/inward/record.url?scp=4043157743&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=4043157743&partnerID=8YFLogxK

U2 - 10.1002/net.20011

DO - 10.1002/net.20011

M3 - Article

AN - SCOPUS:4043157743

VL - 44

SP - 31

EP - 37

JO - Networks

JF - Networks

SN - 0028-3045

IS - 1

ER -