Volume 24, Issue 4 (IJIEPR 2013)                   IJIEPR 2013, 24(4): 285-293 | Back to browse issues page

XML Print

Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
Zare Mehrjerdi Y. Stochastic Approach to Vehicle Routing Problem: Development and Theories. IJIEPR 2013; 24 (4) :285-293
URL: http://ijiepr.iust.ac.ir/article-1-331-en.html
Stochastic Approach to Vehicle Routing Problem: Development and Theories
Yahia Zare Mehrjerdi
Yazd University , yazm2000@yahoo.com
Abstract:   (6769 Views)
Stochastic Approach to Vehicle Routing Problem: Development and Theories Abstract In this article, a chance constrained (CCP) formulation of the Vehicle Routing Problem (VRP) is proposed. The reality is that once we convert some special form of probabilistic constraint into their equivalent deterministic form then a nonlinear constraint generates. Knowing that reliable computer software for large scaled complex nonlinear programming problem with 0-1 type decision variables for stochastic vehicle routing problem (SVRP) is not easily available merely then the value of an approximation technique becomes imperative. In this article, theorems which build a foundation for moving toward the development of an approximate methodology for solving SVRP are stated and proved. Key Words: Vehicle Routing Problem, Chance Constrained Programming, Linear approximation, Optimization.
Keywords: Vehicle Routing Problem, Chance Constrained Programming, Linear approximation, Optimization.
Full-Text [PDF 374 kb]   (2313 Downloads)    
Type of Study: Research | Subject: Logistic & Apply Chain
Received: 2011/11/4 | Accepted: 2014/02/2 | Published: 2014/02/2
Add your comments about this article : Your username or Email:
CAPTCHA
Send email to the article author

Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.