Home » Source Code » Designing and solving open vehicle routing problem with multiple depots by efficient meta-heuristic algorithms

Designing and solving open vehicle routing problem with multiple depots by efficient meta-heuristic algorithms

maryam
2014-04-19 10:34:01
The author
View(s):
Download(s): 3
Point (s): 1 
Category Category:
Driver DevelopmentDriver Development MatlabMatlab

Description

“Transportation Management” is one of the hot major in different scientific areas such
as Operations Research, Industrial Engineering, Civil Engineering, Healthcare Management
and etc. The main objective is “minimizing the total transportation cost” among supplier to
the client in the way that demand of each client must be satisfied. When the “Transportation
Problem” tries to generate a tour or a set of sub tours aiming to optimize some objectives,
then it is called “Routing Problem”. Routing Problem consists of 5 components as:
Network, Demand, Fleet, Cost and the Objectives. One of the most famous examples of
“Routing Problem” is “Traveling Salesman Problem” abbreviated as “TSP”. When there is
more than one server (server such as vehicle), then “TSP” is converted to a new problem
called “Vehicle Routing Problem” or “VRP”. This is one of the most challenging problems
in the area of “Combinatorial Optimization”. A very simple definition of “VRP” is: Given a
set of customers with known demands that must be satisfied by a fleet of vehicle based at a
central depot”. In some distribution systems, vehicle does not have to return to the depot.
The recent problem is known as the “Open Vehicle Routing Problem” or “OVRP”. Since
the real-world situation forces companies to use more than one depot to manage their
distribution systems, here it is considered multiple depot. Regarding the complexity of this
problem, classical optimization methods will not be useful in the medium to large size of
the problem. So, the thesis introduced two new meta heuristic respectively Hybrid Variable
Neighborhood Search (HVNS) and Parallel Simulated Annealling (PSA). The validity of
both proposal model and algorithm studied in this thesis. To the best of the author’s
knowledge this thesis is the first OVRP with Multiple-Depots. Another contribution of the
thesis is “applying Miller-Tucker-Zemillin sub tour elimination constraints”.

Sponsored links

File list

Tips: You can preview the content of files by clicking file names^_^
Name Size Date
code.docx11.25 kB2014-04-19 18:56
...
Sponsored links

Comments

(Add your comment, get 0.1 Point)
Minimum:15 words, Maximum:160 words
vikasmeche
2015-06-17

its good website for developers

gcmswm
2016-05-24

这个网站挺好的,能有效的解决我现在面临的问题,以后会常来

jxwazxx
2017-03-23

这个网站挺好的,代码也非常有用

sherylaidah
2019-01-19

its benefit for researchers

  • 1
  • Page 1
  • Total 1

Designing and solving open vehicle routing problem with multiple depots by efficient meta-heuristic algorithms (8.80 kB)

Need 1 Point(s)
Your Point (s)

Your Point isn't enough.

Get 22 Point immediately by PayPal

Point will be added to your account automatically after the transaction.

More(Debit card / Credit card / PayPal Credit / Online Banking)

Submit your source codes. Get more Points

LOGIN

Don't have an account? Register now
Need any help?
Mail to: support@codeforge.com

切换到中文版?

CodeForge Chinese Version
CodeForge English Version

Where are you going?

^_^"Oops ...

Sorry!This guy is mysterious, its blog hasn't been opened, try another, please!
OK

Warm tip!

CodeForge to FavoriteFavorite by Ctrl+D