Professional Documents
Culture Documents
Transport
Transport
Dr M MATHIRAJAN
Department of Management Studies
Indian Institute of Science
Bangalore
The Increased Importance of Logistics
• A Reduction in Economic Regulation
• Recognition by Prominent Non-Logisticians
• Technological Advances
• The Growing Power of Retailers
• Globalization of Trade
Production
Storage
Transportation
Focus: Best way to overcome space and time that separates acquisition
and consumption.
}
Systems Strategic Product Process
Decisions Design Design
Decisions Decisions
Engineering
Measurement Systems
}
Decisions
Product
Decisions
Reward
Decisions Price
Decisions
Promotion
Decisions
Marketing
Systems
Place (How,
{ }
where, how
much)
Production
Inventory Capacity
Decisions Decisions
Examples of Decisions
Type Strategic Tactical Operational
Where?, How
many? What size?
Allocation?
Transport Fundamentals
Most important component of logistics cost.
Usually 1/3 - 2/3 of total cost.
• Transport involves
– equipment (trucks, planes, trains, boats, pipeline),
– people (drivers, loaders & un-loaders), and
– decisions (routing, timing, quantities, equipment size,
transport mode).
When deciding the transport mode for a given product
there are several things to consider:
• Mode price
• Transit time and variability (reliability)
• Potential for loss or damage.
Pipeline
•Primarily for oil & refined oil products
•Slurry lines carry coal or kaolin
•High capital investment
•Low operating costs
•Can cross difficult terrain
•Highly reliable; Low product losses
Transport Cost Characteristics
– Fixed costs:
• Terminal facilities
• Transport equipment
• Carrier administration
• Roadway acquisition and maintenance
[Infrastructure (road, rail, pipeline,
navigation, etc.)]
– Variable costs:
• Fuel
• Labor
• Equipment maintenance
• Handling, pickup & delivery, taxes
x
i I
ij 1, j J
x ij
( i , j ) E (U )
U 1, U N
xij {0,1}, i I , j J
123 29 50
44 112
90 58 76
88
77 Depot
57 59 176 39
89
124 65
115 (Outlier)
98 125
Truck Capacity = 250
What is the minimum # of trucks we would need? Maximum?
Vehicle Routing
• Find best vehicle route(s) to serve a set of orders from
customers.
• Orders may be
– Delivery from depot to customer.
– Pickup at customer and return to depot.
– Pickup at one place and deliver to another place.
Complications
–Pure Pickup or Delivery Problems.
–Mixed Pickups and Deliveries.
–Pickup-Delivery Problems.
–Backhauls
• Many Costs:
– Fixed charge.
– Variable costs per loaded mile & per empty mile.
– Waiting time; Layover time.
– Cost per stop (handling).
– Loading and unloading cost.
• Compatibility
– Vehicles and customers.
– Vehicles and orders.
– Order types.
– Drivers and vehicles.
• Homogeneous vehicles.
• Minimize distance.
• No compatibility constraints.
• No DOT rules.
VRP Solutions
• Heuristics
– Construction: build a feasible route.
– Improvement: improve a feasible route.
• Not necessarily optimal, but fast.
• Performance depends on problem.
• Worst case performance may be very poor.
• Exact algorithms
– Integer programming.
– Branch and bound.
• Optimal, but usually slow and applicable for small size
problem
• Difficult to include complications.
APPLICATIONS OF VRP
A DSS
Employee Bus Routing
Commodity Distribution
In COVERS
Efficient Heuristic Procedures
NNH
MNNH
MSCWH
Simulation Features
Manipulate the System Generated Routes
Completely User Generated Routes
COVERS Handles
Multi-Depot VRP
Heterogeneous VRP
EMPLOYEE PICKUP VEHICLE ROUTING PROBLEM (EPVRP) –
BANGALORE, KARNATAKA, INDIA
………
AS A PROBLEM IN OR, A SIMPLIFIED EPVRP CAN BE DESCRIBED AS FOLLOWS:
GIVEN
A set (fixed number) of pick-up or delivery points,
The demand at every pick-up or delivery points (deterministic),
A set (fixed number) of vehicles (homogeneous) and
All relevant distance information across pick-up points.
ASSUMPTIONS
Vehicle capacity is known and constant (homogenous)
The number of vehicles available is known (at least the minimum
number of vehicles required is known)
The demand at every pick-up point is known (deterministic)
Maximum distance to be traveled by each vehicle is known and
constant for all vehicles
Demand at every pick-up point is less than or equal to vehicle
capacity
Every pick-up point is served by only one vehicle
Further, keeping in line with Water’s formulation, the model formulation is
oriented towards routing during drop-back rather than pick-up. It is assumed
that the reverse logic holds good for pick-up.
4 61 48 16 60 13.2 1 45 2
5 71 75 25 85 26.4 2 330 3
Sutcliffe and Board (1990) estimated that a simple extrapolation of Waters’ (1988) ILP approach using
the SCICONIC software might take nearly 1,20,000 years of CPU time on a VAX 8600 machine to solve
a VRP with 38 pick-up points!
Optimal Solution of VRP: Transporting Mentally Handicapped Adults to an Adult Training Center. JORS, 41(1), 61-67.
HEURISTIC ALGORITHMS
Procedures Shift – 1 Shift – 2 Shift – 3 Shift – 4 Total Distance Savings CPU Time
A FG AG B (Km.) (in %) PC/AT – 486
@ 33 MHz
(Minutes)
Existing 1977.0 2163.0 1808.3 1056.7 7005.0 ----- ----
Practice
(Manual)
NIH 1875.8 2047.7 1734.1 890.3 6547.9 6.5 12
CIH 65 69 52 27 213 0
CONTROL MODULE
COMPUTER SYSTEM
USER