文献类型：期刊文献

英文题名：Vehicle routing problem using colony and markov algorithm

作者：Zhao, Fang[1]; Ma, Yulei[1]

通讯作者：Zhao, Fang

机构：[1] Xinxiang University, Henan, China

第一机构：新乡学院

年份：2014

卷号：32

期号：6

起止页码：7879-7884

外文期刊名：Energy Education Science and Technology Part A: Energy Science and Research

收录：EI(收录号：20143900076071);Scopus(收录号：2-s2.0-84907249139)

语种：英文

外文关键词：Computation theory - Routing algorithms - Logistics - Vehicle routing - Vehicles

摘要：There exist several limitations associated with the traditional theory. Releasing the restricted conditions of traditional VRP has become a research focus in the past few decades. The vehicle routing problem is a well-known optimization issue in transportation and logistics network systems. The vehicle routing problem with split deliveries and pickups is particularly proposed to release the constraints on the visiting times per customer and vehicle capacity, that is, to allow the deliveries and pickups for each customer to be simultaneously split more than once. Few studies have focused on the VRPSPDP problem. In this paper we propose colony and Markov algorithm method integrating the initial colony algorithm to study the VRPSPDP problem. The computational results indicated that the proposed algorithm is superior to these three algorithms in terms of total travel cost and average loading rate. ? Sila Science. All Rights Reserved.