0% found this document useful (0 votes)
8 views4 pagesPrinciples For Good Programming and
The document outlines principles for effective programming and route design, emphasizing the importance of grouping stops that are close together, using larger vehicles, and minimizing crossing paths. It discusses methods such as the sweeping method and Clarke-Wright savings method for optimizing routes while considering vehicle capacity and minimizing total distance traveled. Additionally, it highlights the need for efficient sequencing of stops and continuous vehicle assignments to maximize utilization.
Uploaded by
ScribdTranslationsCopyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
8 views4 pagesPrinciples For Good Programming and
The document outlines principles for effective programming and route design, emphasizing the importance of grouping stops that are close together, using larger vehicles, and minimizing crossing paths. It discusses methods such as the sweeping method and Clarke-Wright savings method for optimizing routes while considering vehicle capacity and minimizing total distance traveled. Additionally, it highlights the need for efficient sequencing of stops and continuous vehicle assignments to maximize utilization.
Uploaded by
ScribdTranslationsCopyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
/ 4
Principles for good programming and route design
1. Load the trucks with stop volumes that are available.
closer to each other.
The truck routes should be formed around groupings.
of stops that are close to each other to reduce the time of
journey between them.
2. The stops on different days should be arranged in such a way
so that they form closer groupings.
When the stops should be made during different days of the
Week should be segmented into programming problems and designs.
of routes separated by each of the days of the week.
3. Build routes starting with the farthest stop of the
deposit.
Efficient routes can be developed through the construction of
groupings of stops around the farthest stop from the depot
and then working back to the warehouse.
4. The sequence of stops on a road route should
to form a teardrop shape.
The stops should continue in such a way that no path of
the route crosses, and the route seems to have the shape of a tear.
The most efficient routes are built using the vehicles
larger available.
Ideally, use a vehicle large enough to
handle all the stops. Therefore, it will be necessary to assign first the
larger vehicles, among the multiples of a fleet.
6. The collections should be mixed within the routes of
distribution, instead of being assigned at the end of the routes.
The collections should be made, whenever possible, during the
course of the distributions, to minimize the number of paths that are
crossing, what can happen when such stops are attended to afterwards
to make all the deliveries.
A stop that is located far from a grouping
as a route is a good candidate for an alternative means of
distribution.
The stops that were isolated from the groups of stops,
especially those with low volume, are addressed at great cost
driving time and vehicle expenses. Use small trucks
to manage such stops can be more economical.
8. Restricted stops should be limited by times.
timely.
The restrictions on timely moments in stops, when they are
limited, they can force the sequence of stops to deviate from
the ideal patterns. Given that the restrictions at times
timely are often not absolute, any should be renegotiated
stop that needs to be attended in a route design pattern
least desired.
Programming methods and route designs
The problem of finding good solutions for the problem of the
programming and route design for vehicles becomes difficult
when additional limitations are placed on the problem.
The sweeping method
The sweeping method for vehicle routing design is the
simple enough to perform manual calculations even
in large-scale problems. When programming in the software of
the computer, this method solves problems quickly.
The precision is projected to produce an error rate of 10%
this level of error is acceptable.
The disadvantage of this method has to do with the way in which
shape the routes.
The process has two stages: first, the stops are assigned to the
vehicles, and then the sequence of the stops is determined within
the routes. Given this two-step process, the topic of
synchronization, such as the total time spent on a route and the
permission of the right moment.
The sweeping method can be described as follows:
Locate the stops, including the depot, on a map or
grid.
Draw a straight line in any direction. Rotate the line.
clockwise or counterclockwise,
until it intersects a stop. Ask the question If the stop
is inserted is included in the route, will it exceed the capacity
of the vehicle? If the answer is no, proceed with the rotation of
the line until it intersects the next stop. Ask the question:
Will the accumulated volume exceed the vehicle's capacity?
they use bigger trucks first. If the answer is yes, then
exclude the last point and define the route. Continuing the scanning
From the line, a new route starts with the last point that was
excluded from the previous route. Scanning continues until
all points have been assigned to the routes.
Within each route, a sequence of stops is made to
minimize the distance. The sequence can be achieved by applying the
teardrop method or using any algorithm that
solve the traveling salesman problem.
Savings method
The Clarke-Wright savings valuation method has remained a
Over the years for being flexible enough to handle
a wide range of practical restrictions, being relatively fast
to calculate on a computer for problems with a number
moderate stops and able to solve those that are near the
optimal. Generating solutions that are 2% away from optimal.
The goal of the savings method is to minimize the total distance traveled.
for all vehicles and indirectly minimize the number of
vehicles necessary to serve all the stops. The logic of
The method is to start with a simulated vehicle that covers each stop and
return to the deposit. This gives the maximum distance to be
experienced in route processing. Then, two stops are combined.
on the same route for a vehicle to be removed and the distance
the travel time is reduced. To determine the stops that are going to be combined
on a route, the distance saved is calculated, before and after the
combination. The distance saved by combining two points (a and b) that
do not be in any other way on a route with any stop, it is located
subtracting algebraically the distance of the route. The result is a value
of savings S=d 0A +d B ,0−d A , B This calculation is performed for all
stop pairs. The stop pair with the highest savings value
is selected.
Sequence of the routes
The routes are designed by programming methods and designs of
routes have been described previously assume that a route is assigned to you a
specific vehicle. If the route is of short duration, the vehicle is
underutilized for the rest of the available time. In practice, however,
if another route starts after the first, the vehicle will be available for
to be assigned to a second route. Therefore, the number of vehicles
necessary is determined by continuous assignments of end routes
to the extreme, so that the vehicle has a minimum of rest.