Stochastic Approach to Vehicle Routing Problem: Development and Theories
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 deter...
Main Author: | |
---|---|
Format: | Article |
Language: | English |
Published: |
Iran University of Science & Technology
2013-12-01
|
Series: | International Journal of Industrial Engineering and Production Research |
Subjects: | |
Online Access: | http://ijiepr.iust.ac.ir/browse.php?a_code=A-10-137-13&slc_lang=en&sid=1 |
id |
doaj-39dc004b1e2a49de95d31abd9925f30c |
---|---|
record_format |
Article |
spelling |
doaj-39dc004b1e2a49de95d31abd9925f30c2020-11-24T22:40:17ZengIran University of Science & TechnologyInternational Journal of Industrial Engineering and Production Research2008-48892345-363X2013-12-01244285293Stochastic Approach to Vehicle Routing Problem: Development and TheoriesYahia Zare Mehrjerdi0 Yazd University 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.http://ijiepr.iust.ac.ir/browse.php?a_code=A-10-137-13&slc_lang=en&sid=1Vehicle Routing Problem Chance Constrained Programming Linear approximation Optimization. |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Yahia Zare Mehrjerdi |
spellingShingle |
Yahia Zare Mehrjerdi Stochastic Approach to Vehicle Routing Problem: Development and Theories International Journal of Industrial Engineering and Production Research Vehicle Routing Problem Chance Constrained Programming Linear approximation Optimization. |
author_facet |
Yahia Zare Mehrjerdi |
author_sort |
Yahia Zare Mehrjerdi |
title |
Stochastic Approach to Vehicle Routing Problem: Development and Theories |
title_short |
Stochastic Approach to Vehicle Routing Problem: Development and Theories |
title_full |
Stochastic Approach to Vehicle Routing Problem: Development and Theories |
title_fullStr |
Stochastic Approach to Vehicle Routing Problem: Development and Theories |
title_full_unstemmed |
Stochastic Approach to Vehicle Routing Problem: Development and Theories |
title_sort |
stochastic approach to vehicle routing problem: development and theories |
publisher |
Iran University of Science & Technology |
series |
International Journal of Industrial Engineering and Production Research |
issn |
2008-4889 2345-363X |
publishDate |
2013-12-01 |
description |
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. |
topic |
Vehicle Routing Problem Chance Constrained Programming Linear approximation Optimization. |
url |
http://ijiepr.iust.ac.ir/browse.php?a_code=A-10-137-13&slc_lang=en&sid=1 |
work_keys_str_mv |
AT yahiazaremehrjerdi stochasticapproachtovehicleroutingproblemdevelopmentandtheories |
_version_ |
1725705063321567232 |