There are many practical applications where efficient distribution
and/or collection are desired and necessary.Fromaware-
house different products must be distributed to several retailers.
Milk must be collected from different farmers to a dairy;bread
must be distributed from a depot to different shops or retailers;an
automatic truck shall pick out an assembly order in an automatic
storehouse;garbage must be collected from households and
industries to a destructor.An efficient collection or distribution
of goods keeps transport inventories low,it saves resources and
energy,making th eworld more sustainable.Therefore vehicle
routing is an important topic.
If a vehicle distributing bread should visit 9 different grocery
shops in a specific order,the or etically the different possible orders
(routes)in which the shops can be visited area huge number,
362,880 (¼9!). That means it is difficult to quickly find the best,
optimal,solution .In a practical case when you want to minimise
the travelling distance just a look at them apmay eliminate many
of the routes as too long and uneconomical;but to find the
shortest route is far from trivial.If you want to find the shortest
or at least a fairly short route that will visit all the shops you have
to systematise your thinking.Of ten the case is that not all loads
can be carried in one vehicle,and so several routes have to be
found. This article shows a variant of the famous Clarkeand
Wright'ssaving method for transport or route planning.The
original Clarke and Wright(1964) article is note specially straight-
forward and easy to understand and implement for students;this
article makes an easier approach to this important topic and
presents a variant of the saving method.
The article has the following outline.First a simple numerical
example,distribution to 6 customers and how the distribution
routings a resettled,is presented.Then the rules of the search
procedure are expressed in more general terms.This search
procedure is also applied to and demonstrated by the truck
dispatching problem from Dantzig andRamser(1959); to which
it, to the best of our knowledge, finds the best known solution.
Then our search procedure is compared to some descriptions in
textbooks and the literature. Finally a summary and some possible
extensions are discussed.
There are many practical applications where efficient distribution and/or collection are desired and necessary.Fromaware-house different products must be distributed to several retailers.Milk must be collected from different farmers to a dairy;breadmust be distributed from a depot to different shops or retailers;anautomatic truck shall pick out an assembly order in an automaticstorehouse;garbage must be collected from households andindustries to a destructor.An efficient collection or distributionof goods keeps transport inventories low,it saves resources andenergy,making th eworld more sustainable.Therefore vehiclerouting is an important topic.If a vehicle distributing bread should visit 9 different groceryshops in a specific order,the or etically the different possible orders(routes)in which the shops can be visited area huge number,362,880 (¼9!). That means it is difficult to quickly find the best,optimal,solution .In a practical case when you want to minimisethe travelling distance just a look at them apmay eliminate manyof the routes as too long and uneconomical;but to find theshortest route is far from trivial.If you want to find the shortestor at least a fairly short route that will visit all the shops you haveto systematise your thinking.Of ten the case is that not all loadscan be carried in one vehicle,and so several routes have to befound. This article shows a variant of the famous ClarkeandWright'ssaving method for transport or route planning.Theoriginal Clarke and Wright(1964) article is note specially straight-forward and easy to understand and implement for students;thisarticle makes an easier approach to this important topic andpresents a variant of the saving method.The article has the following outline.First a simple numericalexample,distribution to 6 customers and how the distributionroutings a resettled,is presented.Then the rules of the searchprocedure are expressed in more general terms.This searchprocedure is also applied to and demonstrated by the truckdispatching problem from Dantzig andRamser(1959); to whichit, to the best of our knowledge, finds the best known solution.Then our search procedure is compared to some descriptions intextbooks and the literature. Finally a summary and some possibleextensions are discussed.
การแปล กรุณารอสักครู่..