Improved ITO Algorithm for Multiobjective Real-time Vehicle Routing Problem with Customers' Satisfaction

YI Yun-fei; CAI Yong-le; DONG Wen-yong; LIN Xiao-dong

doi:10.3969/j.issn.0372-2112.2015.10.026

您当前的位置：

首页 >

文章列表页 >

Improved ITO Algorithm for Multiobjective Real-time Vehicle Routing Problem with Customers' Satisfaction

更新时间：2025-07-16

- Improved ITO Algorithm for Multiobjective Real-time Vehicle Routing Problem with Customers' Satisfaction
- Acta Electronica Sinica Vol. 43, Issue 10, Pages: 2053-2061(2015)
- 作者机构：
  
  1. 武汉大学计算机学院,湖北,武汉,430079
  2. 河池学院计算机与信息工程学院, 广西宜州,546300
  3. 广西高校系统控制与信息处理重点实验室, 广西宜州,546300
  4. 武汉大学计算机学院,湖北,武汉,430079
  5. 河池学院计算机与信息工程学院广西宜州,546300
  6. 广西高校系统控制与信息处理重点实验室广西宜州,546300
- 作者简介：
- 基金信息：
- DOI：10.3969/j.issn.0372-2112.2015.10.026
  CLC： TP14
- Published：2015
- 稿件说明：
移动端阅览
YI Yun-fei, CAI Yong-le, DONG Wen-yong, et al. Improved ITO Algorithm for Multiobjective Real-time Vehicle Routing Problem with Customers' Satisfaction[J]. Acta Electronica Sinica, 2015, 43(10): 2053-2061.
DOI：

YI Yun-fei, CAI Yong-le, DONG Wen-yong, et al. Improved ITO Algorithm for Multiobjective Real-time Vehicle Routing Problem with Customers' Satisfaction[J]. Acta Electronica Sinica, 2015, 43(10): 2053-2061. DOI： 10.3969/j.issn.0372-2112.2015.10.026.

摘要

基于对标准车辆路径问题的分析

本文构建了一种包括交通因素、客户需求动态改变、用户满意度的多目标动态车辆路径问题模型.针对伊藤算法在求解离散组合优化问题时效率较低、收敛性较差等缺陷

本文以具有通用性的伊藤算法为框架

参考蚁群算法

设计了伊藤-蚂蚁优化算法

并采用正交实验的方法

分析了改进算法参数的设置问题.为了验证改进算法的有效性

文章对标准测试数据集中的数据进行了测试.最后

将标准测试数据改编成符合带用户满意度的多目标实时车辆路径问题模型的测试数据

并用改进算法进行求解.实验结果表明

本文提出的问题模型和改进算法是可行的、有效的.

Abstract

Based on the analysis of the standard vehicle routing problem

we proposed a multiobjective real-time vehicle routing problem model

referred as MR-VRPCS.The MR-VRPCS considers the traffic factors

customer demand dynamic change and customers' satisfaction.As we know

the ITO algorithm has low efficiency and poor convergence performance on the discrete combinatorial optimization problems.Therefore

we apply the universal framework of ITO and introduce the Ant Colony Optimization algorithm

which has got depth studied in vehicle routing problem

to design the ITO-Ant Optimization algorithm.We analyze the IAO algorithm's parameter setting problem by the method of orthogonal experiment.Finally

we use the Solomon benchmark test data to prove the effectiveness of the IAO algorithm

and adjust the standard test data to the MR-VRPCS model's

and resolve it with IAO.The experimental results show the feasibility and effectiveness of the proposed model and algorithm.

关键词

Keywords

references

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Detection of Weak Fault Signals for EMU Bearings Under Strong Noise

Solving QoS Multicast Routing Problem Based on the Combination of ant Colony Algorithm and Genetic Algorithm

A New Network Traffic Prediction Model Based on Ant Colony Algorithm in Cognitive Networks

Ant Colony Chaos Genetic Algorithm for Mapping Task Graphs to a Network on Chip

Related Author

JI Ai-min

CHEN Xi-hui

LIN Xin-hai

XU Xing

SUN Xin-wei

HUANG Jing-xiong

XIE Wei-xin

KANG Li

Related Institution

CSR Qishuyan Locomotive and Vehicle Technology Research Institute Co.， Ltd.

School of Mechanical and Electrical Engineering， Hohai University

Air Defence InstituteZhengzhouHenan 450052China

ATR Key Laboratory of National DefenseShenzhen UniversityShenzhenGuangdong 518060China

School of Electronic EngineeringGuilin Institute of Electronic TechnologyGuilinGuangxi 541004China

⁰