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 条
  • [31] A Dynamic Tasking-Based Evolutionary Algorithm for Bi-Objective Feature Selection
    Xu, Hang
    MATHEMATICS, 2024, 12 (10)
  • [32] MEALS: A multiobjective evolutionary algorithm with local search for solving the bi-objective ring star problem
    Calvete, Herminia I.
    Gale, Carmen
    Iranzo, Jose A.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2016, 250 (02) : 377 - 388
  • [33] An Efficient Evolutionary Algorithm for Chance-Constrained Bi-Objective Stochastic Optimization
    Liu, Bo
    Zhang, Qingfu
    Fernandez, Francisco V.
    Gielen, Georges G. E.
    IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2013, 17 (06) : 786 - 796
  • [34] A bi-objective evolutionary algorithm scheduled on uniform parallel batch processing machines
    Li, Kai
    Zhang, Han
    Chu, Chengbin
    Jia, Zhao-hong
    Chen, Jianfu
    EXPERT SYSTEMS WITH APPLICATIONS, 2022, 204
  • [35] An Interpolation-Based Evolutionary Algorithm for Bi-Objective Feature Selection in Classification
    Xu, Hang
    MATHEMATICS, 2024, 12 (16)
  • [36] Evolutionary Algorithms for the Traveling Salesman with Multiple Passengers and High Occupancy Problem
    Martins Bastos, Ranmses Emanuel
    Goldbarg, Marco Cesar
    Gouvea Goldbarg, Elizabeth Ferreira
    Menezes, Matheus da Silva
    2020 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2020,
  • [37] A weighted-sum method for solving the bi-objective traveling thief problem
    Chagas, Jonatas B. C.
    Wagner, Markus
    COMPUTERS & OPERATIONS RESEARCH, 2022, 138
  • [38] Evolutionary, constructive and hybrid procedures for the bi-objective set packing problem
    Delorme, Xavier
    Gandibleux, Xavier
    Degoutin, Fabien
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 204 (02) : 206 - 217
  • [39] On the Traveling Salesman Problem with Hierarchical Objective Function
    Tien Thanh Dam
    Duy Thinh Nguyen
    Quoc Trung Bui
    Trung Kien Do
    PROCEEDINGS OF 2019 11TH INTERNATIONAL CONFERENCE ON KNOWLEDGE AND SYSTEMS ENGINEERING (KSE 2019), 2019, : 192 - 196
  • [40] A Memetic Algorithm for the Traveling Salesman Problem
    Arango, M. D.
    Serna, C. A.
    IEEE LATIN AMERICA TRANSACTIONS, 2015, 13 (08) : 2674 - 2679
12345