Multi-depot and multi-task and multi-type Vehicle Routing Problem in city distribution

Computer Engineering and Applications ›› 2013, Vol. 49 ›› Issue (10): 243-246.

Previous Articles Next Articles

Multi-depot and multi-task and multi-type Vehicle Routing Problem in city distribution

YANG Haoxiong1，3, HU Jing2, HE Mingke1，3

1.Business School, Beijing Technology and Business University, Beijing 100048, China
2.Computer and Information Engineering College, Beijing Technology and Business University, Beijing 100048, China
3.Capital Circulation Industry Research Base, Beijing 100048, China

Online:2013-05-15 Published:2013-05-14

配送中多车场多任务多车型车辆调度研究

杨浩雄1，3，胡静2，何明珂1，3

1.北京工商大学商学院，北京 100048
2.北京工商大学计算机与信息工程学院，北京 100048
3.首都流通业研究基地，北京 100048

Abstract

Abstract: The multi-depot and multi-task and multi-type vehicle routing problem is the typical problem in city distribution. For this issue, a VRP model is constructed based on deadheading cost, transport cost and time cost. To solve this mathematical model, a self-Adaptive and Polymorphic Ant Colony Algorithm（APACA） has been introduced. A case study is presented to compare the results based on APACA with that under stochastic condition.

Key words: city distribution, Vehicle Routing Problem（VRP）, self-Adaptive and Polymorphic Ant Colony Algorithm（APACA）

摘要： 多车场多车型多任务的车辆调度优化是城市配送中的典型问题。针对该问题从空驶成本、运输成本和时间成本三个维度构建了一个VRP的数学模型，并采用自适应多态蚁群算法对模型加以求解。通过实例仿真，将仿真优化结果与未优化的随机结果进行了比较。结果发现优化后的成本比未优化的成本低，并且证明了对多车场多车型多任务的VRP模型进行优化非常必要。

关键词: 城市配送, 车辆调度, 自适应多态蚁群算法

YANG Haoxiong1，3, HU Jing2, HE Mingke1，3. Multi-depot and multi-task and multi-type Vehicle Routing Problem in city distribution[J]. Computer Engineering and Applications, 2013, 49(10): 243-246.

杨浩雄1，3，胡静2，何明珂1，3. 配送中多车场多任务多车型车辆调度研究[J]. 计算机工程与应用, 2013, 49(10): 243-246.

[1]	DENG Ye, ZHU Wanhong, WANG Fengshan, LIU Huali. Research on Multi-Objective Robust Vehicle Routing Problem in Emergency Logistics [J]. Computer Engineering and Applications, 2019, 55(1): 248-255.
[2]	ZHANG Qinghua, LV Xiaodan. Research on vehicle routing problem with return and replacement in e-commerce environment and its solution to ant colony algorithm [J]. Computer Engineering and Applications, 2018, 54(22): 239-245.
[3]	SHI Jianli1, ZHANG Jin2. Particle swarm optimization for split delivery vehicle routing problem with stochastic demands [J]. Computer Engineering and Applications, 2018, 54(21): 230-239.
[4]	ZHANG Liyi1, WANG Ying2, FEI Teng1, ZHOU Xiufei2. Research on low carbon logistics routing optimization based on chaotic-simulated annealing ant colony algorithm [J]. Computer Engineering and Applications, 2017, 53(1): 63-68.
[5]	CUI Li, WANG Xiaocong. Demand-driven dynamic configuration of vehicles on city distribution [J]. Computer Engineering and Applications, 2015, 51(2): 241-244.
[6]	WANG Jun. Differential evolution hybrid algorithm for vehicle routing problem with time windows [J]. Computer Engineering and Applications, 2013, 49(2): 24-28.
[7]	WU Kaijun1, WANG Tiejun2. Vehicle Routing Problem algorithm based on improved differential evolution [J]. Computer Engineering and Applications, 2013, 49(13): 17-20.
[8]	YANG Jin¹，MA Liang². Wasp colony algorithm for vehicle routing problem [J]. Computer Engineering and Applications, 2010, 46(5): 214-216.
[9]	BIE Wen-qun¹，LI Yong-jun². Study on multiple vehicle routing problem integrated terminal cargo based on improved tabu search in distribution center [J]. Computer Engineering and Applications, 2010, 46(4): 216-218.
[10]	ZHANG Jian-qiang，FANG Wei-guo. Improved genetic algorithm for vehicle routing problem with time window [J]. Computer Engineering and Applications, 2010, 46(32): 228-231.
[11]	WU Yao-hua，ZHANG Nian-zhi. Modified Particle Swarm Optimization algorithm for vehicle routing problem with time windows [J]. Computer Engineering and Applications, 2010, 46(15): 230-234.
[12]	GE Hong-Yi，ZHEN Tong，JIANG Yu-Ying. Study on grain logistics Vehicle Routing Problem with Time Windows [J]. Computer Engineering and Applications, 2009, 45(35): 212-215.
[13]	MA Xuan，PENG Peng，LIU Qing. Improved Particle Swarm Optimization for Vehicle Routing Problem with time windows [J]. Computer Engineering and Applications, 2009, 45(27): 200-202.
[14]	CHEN Ming-hua¹，LI Ying-qiu¹，LUO Yao-qi². Research on emergency logistics distribution Vehicle Routing Problems [J]. Computer Engineering and Applications, 2009, 45(24): 194-197.
[15]	WANG Pei-chong ^1，2，QIAN Xu1，ZHOU Yu¹. Hybrid artificial fish school algorithm to solve Vehicle Routing Problem（VRP） [J]. Computer Engineering and Applications, 2009, 45(24): 201-203.

Multi-depot and multi-task and multi-type Vehicle Routing Problem in city distribution

配送中多车场多任务多车型车辆调度研究

PDF

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 15

Recommended Articles

Metrics