Exploring Feasible and Infeasible Regions in the Vehicle Routing Problem with Time Windows Using a Multi-objective Particle Swarm Optimization Approach

被引：0
|
作者：
Castro, Juan P. [1 ]
Landa-Silva, Dario [1 ,2 ]
Moreno Perez, Jose A. [3 ]
机构：
[1] Univ Nottingham, Automated Scheduling Optimisat & Planning Res Grp, Nottingham NG7 2RD, England
[2] Univ Nottingham, Optimisat & Planning Res Grp, Automated Scheduling, Nottingham NG7 2RD, England
[3] Univ Laguna, Escuela Tecn Super Engn Informat, Grp Intelligent Comp, Dpto Estadist I O & Comp, Tenerife, Spain
来源：
NICSO 2008: NATURE INSPIRED COOPERATIVE STRATEGIES FOR OPTIMIZATION | 2009年 / 236卷
关键词：
Particle Swarm Optimization; PSO; Multi-Objective; Vehicle Routing Problem with Time Windows; VRPTW;
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
This paper investigates the ability of a discrete particle swarm optimization algorithm (DPSO) to evolve solutions from infeasibility to feasibility for the Vehicle Routing Problem with Time Windows (VRPTW). The proposed algorithm incorporates some principles from multi-objective optimization to allow particles to conduct a dynamic trade-off between objectives in order to reach feasibility. The main contribution of this paper is to demonstrate that without incorporating tailored heuristics or operators to tackle infeasibility, it is possible to evolve very poor infeasible route-plans to very good feasible ones using swarm intelligence.
引用
收藏
页码：103 / +
页数：3
相关论文
共 50 条
  • [31] A neighborhood comprehensive learning particle swarm optimization for the vehicle routing problem with time windows
    Wu, Qichao
    Xia, Xuewen
    Song, Haojie
    Zeng, Hui
    Xu, Xing
    Zhang, Yinglong
    Yu, Fei
    Wu, Hongrun
    [J]. SWARM AND EVOLUTIONARY COMPUTATION, 2024, 84
  • [32] A Combination of Genetic Algorithm and Particle Swarm Optimization for Vehicle Routing Problem with Time Windows
    Xu, Sheng-Hua
    Liu, Ji-Ping
    Zhang, Fu-Hao
    Wang, Liang
    Sun, Li-Jian
    [J]. SENSORS, 2015, 15 (09) : 21033 - 21053
  • [33] Particle Swarm Optimizations for Multi-type Vehicle Routing Problem with Time Windows
    Gan, Xiaobin
    Kuang, Junbiao
    Niu, Ben
    [J]. INTELLIGENT COMPUTING METHODOLOGIES, 2014, 8589 : 808 - 815
  • [34] A multi-objective approach for unmanned aerial vehicle routing problem with soft time-windows constraints
    Guerriero, F.
    Surace, R.
    Loscri, V.
    Natalizio, E.
    [J]. APPLIED MATHEMATICAL MODELLING, 2014, 38 (03) : 839 - 852
  • [35] An Improved Multi-Objective Particle Swarm Optimization Routing on MANET
    Rajeshkumar, G.
    Kumar, M. Vinoth
    Kumar, K. Sailaja
    Bhatia, Surbhi
    Mashat, Arwa
    Dadheech, Pankaj
    [J]. COMPUTER SYSTEMS SCIENCE AND ENGINEERING, 2023, 44 (02): : 1187 - 1200
  • [36] A decomposition based memetic algorithm for multi-objective vehicle routing problem with time windows
    Qi, Yutao
    Hou, Zhanting
    Li, He
    Huang, Jianbin
    Li, Xiaodong
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2015, 62 : 61 - 77
  • [37] Solving the multi-objective Vehicle Routing Problem with Soft Time Windows with the help of bees
    Iqbal, Sumaiya
    Kaykobad, M.
    Rahman, M. Sohel
    [J]. SWARM AND EVOLUTIONARY COMPUTATION, 2015, 24 : 50 - 64
  • [38] Robust multi-objective vehicle routing problem with time windows for hazardous materials transportation
    Men, Jinkun
    Jiang, Peng
    Xu, Huan
    Zheng, Song
    Kong, Yaguang
    Hou, Pingzhi
    Wu, Feng
    [J]. IET INTELLIGENT TRANSPORT SYSTEMS, 2020, 14 (03) : 154 - 163
  • [39] Multi-objective modeling of production and pollution routing problem with time window: A self-learning particle swarm optimization approach
    Kumar, Ravi Shankar
    Kondapaneni, Karthik
    Dixit, Vijaya
    Goswami, A.
    Thakur, L. S.
    Tiwari, M. K.
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2016, 99 : 29 - 40
  • [40] A hybrid multi-objective evolutionary optimization approach for the robust vehicle routing problem
    Bederina, Hiba
    Hifi, Mhand
    [J]. APPLIED SOFT COMPUTING, 2018, 71 : 980 - 993
12345