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 条
  • [1] An novel evolutionary algorithm for bi-objective Symmetric traveling salesman problem
    Jia Liping
    Zou Guocheng
    Zou Jin
    PROCEEDINGS OF THE 2008 7TH IEEE INTERNATIONAL CONFERENCE ON CYBERNETIC INTELLIGENT SYSTEMS, 2008, : 176 - 179
  • [2] A novel multi-objective evolutionary algorithm based on subpopulations for the bi-objective traveling salesman problem
    Moraes, Deyvid Heric
    Sanches, Danilo Sipoli
    Rocha, Josimar da Silva
    Caldonazzo Garbelini, Jader Maikol
    Castoldi, Marcelo Favoretto
    SOFT COMPUTING, 2019, 23 (15) : 6157 - 6168
  • [3] A novel multi-objective evolutionary algorithm based on subpopulations for the bi-objective traveling salesman problem
    Deyvid Heric Moraes
    Danilo Sipoli Sanches
    Josimar da Silva Rocha
    Jader Maikol Caldonazzo Garbelini
    Marcelo Favoretto Castoldi
    Soft Computing, 2019, 23 : 6157 - 6168
  • [4] An Evolutionary Algorithm Applied to the Bi-Objective Travelling Salesman Problem
    Pauleti Mendes, Luis Henrique
    Usberti, Fabio Luiz
    San Felice, Mario Cesar
    METAHEURISTICS, MIC 2022, 2023, 13838 : 519 - 524
  • [5] Genetic algorithm to the bi-objective multiple travelling salesman problem
    Linganathan, Shayathri
    Singamsetty, Purusotham
    ALEXANDRIA ENGINEERING JOURNAL, 2024, 90 : 98 - 111
  • [6] Exact Formulation and Analysis for the Bi-Objective Insular Traveling Salesman Problem
    Miranda-Gonzalez, Pablo A.
    Maturana-Ross, Javier
    Blazquez, Carola A.
    Cabrera-Guerrero, Guillermo
    MATHEMATICS, 2021, 9 (21)
  • [7] Bi-Objective Colored Traveling Salesman Problems
    Xu, Xiangping
    Li, Jun
    Zhou, MengChu
    IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, 2022, 23 (07) : 6326 - 6336
  • [8] A hybrid genetic algorithm for solving bi-objective traveling salesman problems
    Ma, Mei
    Li, Hecheng
    2ND ANNUAL INTERNATIONAL CONFERENCE ON INFORMATION SYSTEM AND ARTIFICIAL INTELLIGENCE (ISAI2017), 2017, 887
  • [9] A Transgenetic Algorithm for the Bi-objective Traveling Purchaser Problem
    Almeida, Carolina P.
    Goncalves, Richard A.
    Delgado, Myriam R.
    Goldbarg, Elizabeth F.
    Goldbarg, Marco C.
    2010 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2010,
  • [10] Probabilistic Based Evolutionary Optimizers in Bi-objective Travelling Salesman Problem
    Shim, Vui Ann
    Tan, Kay Chen
    Chia, Jun Yong
    SIMULATED EVOLUTION AND LEARNING, 2010, 6457 : 588 - 592
12345