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] 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
  • [3] 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
  • [4] Bi-Objective Colored Traveling Salesman Problems
    Xu, Xiangping
    Li, Jun
    Zhou, MengChu
    IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, 2022, 23 (07) : 6326 - 6336
  • [5] Pareto memetic algorithm with path relinking for bi-objective traveling salesperson problem
    Jaszkiewicz, Andrzej
    Zielniewicz, Piotr
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2009, 193 (03) : 885 - 890
  • [6] Bi-objective parameter setting problem of a genetic algorithm: an empirical study on traveling salesperson problem
    Akduran, Yavuzhan
    Dasdemir, Erdi
    Testik, Murat Caner
    APPLIED INTELLIGENCE, 2023, 53 (22) : 27148 - 27162
  • [7] Bi-objective parameter setting problem of a genetic algorithm: an empirical study on traveling salesperson problem
    Yavuzhan Akduran
    Erdi Dasdemir
    Murat Caner Testik
    Applied Intelligence, 2023, 53 : 27148 - 27162
  • [8] The bi-objective traveling purchaser problem with deliveries
    Palomo-Martinez, Pamela J.
    Angelica Salazar-Aguilar, M.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2019, 273 (02) : 608 - 622
  • [9] A Novel Evolutionary Algorithm for the Homogeneous Probabilistic Traveling Salesman Problem
    Smith, Michael Manuel
    Chen, Yun Shiow
    2016 IEEE/ACIS 15TH INTERNATIONAL CONFERENCE ON COMPUTER AND INFORMATION SCIENCE (ICIS), 2016, : 307 - 312
  • [10] A Memetic Algorithm for the Bi-Objective Quadratic Assignment Problem
    Cubukcuoglu, Cemre
    Tasgetiren, M. Fatih
    Sariyildiz, I. Sevil
    Gao, Liang
    Kucukvar, Murat
    25TH INTERNATIONAL CONFERENCE ON PRODUCTION RESEARCH MANUFACTURING INNOVATION: CYBER PHYSICAL MANUFACTURING, 2019, 39 : 1215 - 1222
12345