Title of article
Competitive vehicle routing problem projects with t ime windows and stochastic demands
Author/Authors
Shojaie Amir Abbas نويسنده School of Industrial Engineering, Islamic Azad Univ ersity, South Tehran Branch, Tehran, Iran Shojaie Amir Abbas , Shariatmadaria Mohammad نويسنده School of Industrial Engineering, Islamic Azad Univ ersity, South Tehran Branch, Tehran, Iran Shariatmadaria Mohammad , Moradia Mojtaba نويسنده School of Industrial Engineering, Islamic Azad Univ ersity, South Tehran Branch, Tehran, Iran Moradia Mojtaba
Issue Information
فصلنامه با شماره پیاپی سال 2016
Pages
11
From page
102
Abstract
The vehicle routing problem is one of the most impo
rtant issues in transportation.
Among these issues, competitive VRP is one of the n
ew concepts that have
attracted the attention of many researchers. In thi
s study we introduced a new
method for competitive VRP. In this method three ti
me boundaries are given and
the probability of arrival time between each time b
ound is assumed to be 1/3.
Based on this information, demands of each customer
will differ in each time
window. Therefore, the revenue given in each time w
indow is different. In this
paper we consider a project with two companies in a
city with eight customers
and the best routing with maximum revenue is determ
ined.
Journal title
Astroparticle Physics
Serial Year
2016
Record number
2406140
Link To Document