The Travelling Salesman Problem with Precedence Constraints

被引：0
|
作者：
Zakir Hussain Ahmed
S. N. Narahari Pandit
机构：
[1] Tezpur University,Dept. of Mathematical Sciences
[2] Osmania University,Navigational Electronics Research and Training Unit, College of Engineering
来源：
OPSEARCH | 2001年 / 38卷 / 3期
关键词：
Travelling salesman; precedence constraint; heuristic; tour; genetic algorithm; lexi-search;
D O I：
10.1007/BF03398638
中图分类号：
学科分类号：
摘要：
The Travelling Salesman Problem with Precedence Constraints (TSP-PC) is the usual Travelling Salesman Problem with the restrictions that the salesman should start from a prescribed node (i.e., a headquarters) and each admissible tour is to satisfy k precedence relations denoted by ir < jr; r=1,2,...,k. That is the node jr should not be visited unless node ir is already visited. This problem is NP-hard and arises in practical transportation and sequencing problems. In this paper, a lexisearch algorithm has been developed for obtaining exact optimal solution. Also, simple and hybrid genetic algorithms have been developed for obtaining heuristically optimal solution to the problem. The efficiency of the genetic algorithms to the TSP-PC as against lexi-search approach has been examined for a variety of randomly generated test problems.
引用
收藏
页码：299 / 318
页数：19
相关论文
共 50 条
  • [1] An efficient genetic algorithm for the traveling salesman problem with precedence constraints
    Moon, C
    Kim, J
    Choi, G
    Seo, Y
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2002, 140 (03) : 606 - 617
  • [2] An Adaptive Evolutionary Algorithm for Traveling Salesman Problem with Precedence Constraints
    Sung, Jinmo
    Jeong, Bongju
    [J]. SCIENTIFIC WORLD JOURNAL, 2014,
  • [3] Optimization of Travelling Salesman Problem with Precedence Constraint Using Modified GA Encoding
    Ab Rashid, M. F. F.
    Jusop, M.
    Mohamed, N. M. Z. Nik
    Romlay, F. R. M.
    [J]. ADVANCED SCIENCE LETTERS, 2018, 24 (02) : 1484 - 1487
  • [4] A Branch & Cut Algorithm for the Asymmetric Traveling Salesman Problem with Precedence Constraints
    Norbert Ascheuer
    Michael Jünger
    Gerhard Reinelt
    [J]. Computational Optimization and Applications, 2000, 17 : 61 - 84
  • [5] A branch & cut algorithm for the asymmetric traveling salesman problem with precedence constraints
    Ascheuer, N
    Jünger, M
    Reinelt, G
    [J]. COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2000, 17 (01) : 61 - 84
  • [6] Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin-Marsten bounding
    Salii, Yaroslav. V.
    Sheka, Andrey S.
    [J]. OPTIMIZATION METHODS & SOFTWARE, 2021, 36 (06): : 1128 - 1154
  • [7] Spatial Transformation of Equality - Generalized Travelling Salesman Problem to Travelling Salesman Problem
    Zia, Mohammed
    Cakir, Ziyadin
    Seker, Dursun Zafer
    [J]. ISPRS INTERNATIONAL JOURNAL OF GEO-INFORMATION, 2018, 7 (03):
  • [8] The travelling salesman problem with positional consistency constraints: An application to healthcare services
    Gouveia, Luis
    Paias, Ana
    Ponte, Mafalda
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2023, 308 (03) : 960 - 989
  • [9] Dynamic programming strategies for the traveling salesman problem with time window and precedence constraints
    Mingozzi, A
    Bianco, L
    Ricciardelli, S
    [J]. OPERATIONS RESEARCH, 1997, 45 (03) : 365 - 377
  • [10] The intermittent travelling salesman problem
    Tu-San Pham
    Leyman, Pieter
    De Causmaecker, Patrick
    [J]. INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2020, 27 (01) : 525 - 548
12345