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 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
  • [32] A Discrete Bacterial Memetic Evolutionary Algorithm for the Traveling Salesman Problem
    Koczy, Laszlo T.
    Foeldesi, Peter
    Tueu-Szabo, Boldizsar
    2016 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2016, : 3261 - 3267
  • [33] Solving traveling salesman problem using combinational evolutionary algorithm
    Bonyadi, Mohammad Reza
    Azghadi, S. Mostafa Rahimi
    Shah, Harried
    ARTIFICIAL INTELLIGENCE AND INNOVATIONS 2007: FROM THEORY TO APPLICATIONS, 2007, : 37 - +
  • [34] Solving traveling salesman problem by using a local evolutionary algorithm
    Xuan, W
    Li, YX
    2005 IEEE International Conference on Granular Computing, Vols 1 and 2, 2005, : 318 - 321
  • [35] An Adaptive Evolutionary Algorithm for Traveling Salesman Problem with Precedence Constraints
    Sung, Jinmo
    Jeong, Bongju
    SCIENTIFIC WORLD JOURNAL, 2014,
  • [36] Nature-Inspired Computational Model for Solving Bi-objective Traveling Salesman Problems
    Chen, Xuejiao
    Chen, Zhengpeng
    Xin, Yingchu
    Li, Xianghua
    Gao, Chao
    PRICAI 2018: TRENDS IN ARTIFICIAL INTELLIGENCE, PT II, 2018, 11013 : 219 - 227
  • [37] Multi-objective ant colony optimization based on decomposition for bi-objective traveling salesman problems
    Jixang Cheng
    Gexiang Zhang
    Zhidan Li
    Yuquan Li
    Soft Computing, 2012, 16 : 597 - 614
  • [38] Multi-objective ant colony optimization based on decomposition for bi-objective traveling salesman problems
    Cheng, Jixang
    Zhang, Gexiang
    Li, Zhidan
    Li, Yuquan
    SOFT COMPUTING, 2012, 16 (04) : 597 - 614
  • [39] Solving conflicting bi-objective facility location problem by NSGA II evolutionary algorithm
    Bhattacharya, Ranjan
    Bandyopadhyay, Susmita
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2010, 51 (1-4): : 397 - 414
  • [40] Solving conflicting bi-objective facility location problem by NSGA II evolutionary algorithm
    Ranjan Bhattacharya
    Susmita Bandyopadhyay
    The International Journal of Advanced Manufacturing Technology, 2010, 51 : 397 - 414
12345