An evolutionary algorithm for the bi-objective multiple traveling salesman problem

被引：0
|
作者：
Labadie, Nacima [1 ]
Melechovsky, Jan [1 ]
Prins, Christian [1 ]
机构：
[1] Univ Technol Troyes, Inst Charles Delaunay, BP 2060, F-10010 Troyes, France
来源：
PROCEEDINGS OF INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND SYSTEMS MANAGEMENT (IESM'2011): INNOVATIVE APPROACHES AND TECHNOLOGIES FOR NETWORKED MANUFACTURING ENTERPRISES MANAGEMENT | 2011年
关键词：
multiple TSP; multi-objective optimization; evolutionary algorithm; GENETIC ALGORITHM; METAHEURISTICS; SOLVE;
D O I：
暂无
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
This paper deals with the bi-objective variant of the multiple Traveling Salesman Problem (m-TSP). This problem generalizes the classical TSP with profits (TSPP). Depending of the nature of the objective function, three well known kinds of problems constitute the TSPP family: the Orienteering Problems (OP), the Profitable Tour Problems (PTP) and the Prize Collecting TSP (PCTSP). In the bi-objective m-TSP considered here, the aim is to build m cycles covering a subset of potential customers so that the total collected profit is maximized and the overall traveling distance is minimized. This paper presents an effective evolutionary algorithm to solve this problem.
引用
收藏
页码：1253 / 1260
页数：8
相关论文
共 50 条
  • [41] An Improved Genetic Algorithm for Multiple Traveling Salesman Problem
    Zhou, Wei
    Li, Yuanzong
    2010 2ND INTERNATIONAL ASIA CONFERENCE ON INFORMATICS IN CONTROL, AUTOMATION AND ROBOTICS (CAR 2010), VOL 1, 2010, : 493 - 495
  • [42] Firefly Algorithm Solving Multiple Traveling Salesman Problem
    Li, Mingfu
    Ma, Jianhua
    Zhang, Yuyan
    Zhou, Houming
    Liu, Jingang
    JOURNAL OF COMPUTATIONAL AND THEORETICAL NANOSCIENCE, 2015, 12 (07) : 1277 - 1281
  • [43] An improved genetic algorithm for the multiple traveling salesman problem
    Zhao, Fanggeng
    Dong, Jinyan
    Li, Sujian
    Yang, Xirui
    2008 CHINESE CONTROL AND DECISION CONFERENCE, VOLS 1-11, 2008, : 1935 - 1939
  • [44] A Grid-Based Two-Stage Parallel Matching Framework for Bi-Objective Euclidean Traveling Salesman Problem
    Lin, Fandel
    Hsieh, Hsun-Ping
    ACM TRANSACTIONS ON SPATIAL ALGORITHMS AND SYSTEMS, 2022, 8 (04)
  • [45] A Hybrid Estimation of Distribution Algorithm for Solving the Multi-objective Multiple Traveling Salesman Problem
    Shim, V. A.
    Tan, K. C.
    Tan, K. K.
    2012 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2012,
  • [46] AN ALGORITHM FOR THE TRAVELING SALESMAN PROBLEM
    LITTLE, JDC
    MURTY, KG
    SWEENEY, DW
    KAREL, C
    OPERATIONS RESEARCH, 1963, 11 (06) : 972 - 989
  • [47] Hybrid Genetic Algorithm for Bi-objective Assignment Problem
    Ratli, Mustapha
    Eddaly, Mansour
    Jarboui, Bassem
    Lecomte, Sylvain
    Hanafi, Said
    PROCEEDINGS OF 2013 INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND SYSTEMS MANAGEMENT (IEEE-IESM 2013), 2013, : 35 - 40
  • [48] Evolutionary bi-objective optimisation in the elevator car routing problem
    Tyni, T
    Ylinen, J
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2006, 169 (03) : 960 - 977
  • [49] AN EVOLUTIONARY APPROACH TO THE TRAVELING SALESMAN PROBLEM
    FOGEL, DB
    BIOLOGICAL CYBERNETICS, 1988, 60 (02) : 139 - 144
  • [50] An Algorithm for Bi-Objective Integer Linear Programming Problem
    Prerna
    Sharma, Vikas
    FILOMAT, 2022, 36 (16) : 5641 - 5651
12345