期刊名称:Journal of Emerging Trends in Computing and Information Sciences
电子版ISSN:2079-8407
出版年度:2015
卷号:6
期号:7
页码:334-339
出版社:ARPN Publishers
摘要:The problem of designing a set of routes with minimum cost to serve a collection of customers with a fleet of vehicles is a fundamental challenge, when the number of customers to be dropped or picked up is not known during the planning horizon. The purpose of this paper is to develop a vehicle routing Problem (VRP) model that addresses stochastic simultaneous pickup and delivery in the urban public transport systems. To this effect, the model is fitted with real data collected from Anbessa City Bus Service Enterprise (ACBSE) and solved using Clark-Wright saving algorithm. The findings of the study show that, the model is feasible and showed an improvement on the current routes both on the number of buses used and the total kilometer covered.
关键词:Stochastic VRP; Simultaneous Pickup and Delivery; VRP