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 条
  • [21] 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
  • [22] 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
  • [23] A new genetic algorithm for the asymmetric traveling salesman problem
    Nagata, Yuichi
    Soler, David
    EXPERT SYSTEMS WITH APPLICATIONS, 2012, 39 (10) : 8947 - 8953
  • [24] 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,
  • [25] Evolutionary algorithm and decisional DNA for multiple travelling salesman problem
    Wang, Peng
    Sanin, Cesar
    Szczerbicki, Edward
    NEUROCOMPUTING, 2015, 150 : 50 - 57
  • [26] 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
  • [27] An Efficient Conical Area Evolutionary Algorithm for Bi-objective Optimization
    Ying, Weiqin
    Xu, Xing
    Feng, Yuxiang
    Wu, Yu
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2012, E95A (08) : 1420 - 1425
  • [28] A reduction dynamic programming algorithm for the bi-objective integer knapsack problem
    Rong, Aiying
    Figueira, Jose Rui
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2013, 231 (02) : 299 - 313
  • [29] A Fast Evolutionary Algorithm for Dynamic Bi-objective Optimization Problems
    Liu, Min
    Zeng, Wenhua
    PROCEEDINGS OF 2012 7TH INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE & EDUCATION, VOLS I-VI, 2012, : 130 - 134
  • [30] Maximum Entropy Bi-Objective Model and its Evolutionary Algorithm for Portfolio Optimization
    Liu, Chun-An
    Lei, Qian
    Jia, Huamin
    ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2022, 39 (06)
12345