Freight Operations, Routing and Scheduling

Introduction and Context

Freight operations convert customer requirements into physical movements of goods. They include order release, dispatching, vehicle and driver allocation, route planning, loading, pickup and delivery, in-transit monitoring, proof of delivery, and exception resolution. Although these activities are often treated as a transport department’s operational concerns, they directly affect inventory, customer service, working capital, carbon emissions, safety, and commercial reputation.

A transport plan is therefore not simply a list of stops. It is a constrained decision system. The planner must reconcile shipment quantities, vehicle capacity, delivery commitments, driver regulations, road conditions, loading compatibility, depot resources, costs, and uncertainty. A low-cost route that misses a time window or overloads a vehicle is not an effective plan.

The central managerial challenge is to achieve an appropriate balance among cost, service, asset utilization, resilience, and compliance. This chapter develops the concepts and tools required to manage that balance.

Learning Objectives

After studying this chapter, the learner should be able to:

1. Explain the structure and control of freight-dispatch operations.
2. Distinguish major vehicle-routing and pickup-and-delivery problems.
3. Construct feasible delivery schedules using capacity, time-window, and working-time constraints.
4. Apply principles of load building, backhaul planning, and fleet utilization.
5. Evaluate driver and asset scheduling decisions using operational and financial measures.
6. Design reliable proof-of-delivery and exception-management processes.
7. Assess the uses and limitations of transportation-management systems, optimization, and artificial intelligence.

1. Freight Operations as a Control System

Freight operations can be understood as a repeated control loop:

Demand and orders → planning → dispatch → execution → visibility → proof of delivery → performance feedback.

The process begins when orders are released for transport. Orders are consolidated by geography, service requirement, product type, and promised date. A transport plan then assigns shipments to vehicles and sequences stops. Dispatchers communicate the plan to drivers and facilities. During execution, actual events are compared with the plan. Deviations trigger corrective action, and completed delivery data supports invoicing, claims handling, customer service, and future planning.

A mature operation separates three related decisions:

• Strategic decisions: fleet ownership, depot locations, outsourcing, service territories, and network design.
• Tactical decisions: carrier selection, transport budgets, standard routes, fleet size, and driver rosters.
• Operational decisions: daily order allocation, route sequencing, dispatching, replanning, and exception response.

The quality of operational decisions depends on data quality. Essential master data includes customer addresses and geocodes, shipment dimensions and weights, vehicle capacities, driver qualifications, service times, delivery windows, road restrictions, and product compatibility rules.

Dispatching

Dispatching is the release and control of transport work. A dispatcher confirms that an order is transport-ready, selects a vehicle and driver, issues route instructions, verifies documentation, and monitors completion. Dispatching should not be reduced to assigning the nearest vehicle. The selected resource must be legally available, physically suitable, and capable of completing the route within its constraints.

A useful dispatch checklist includes:

• order priority and promised delivery time;
• pickup and delivery addresses;
• shipment weight, cube, handling-unit count, and special requirements;
• vehicle capacity and equipment requirements;
• driver hours, qualifications, and availability;
• loading sequence and compatibility restrictions;
• route restrictions, tolls, weather, and security risks;
• customer instructions and contact details;
• required delivery documents and electronic proof-of-delivery method.

2. Routing and Scheduling Concepts

Routing determines which customers or shipments are served by each vehicle and the geographical sequence of travel. Scheduling assigns times to departures, arrivals, loading, unloading, breaks, and returns. Routing without scheduling may produce infeasible plans; scheduling without routing ignores distance and network structure.

A practical route is composed of travel time, service time, waiting time, breaks, and possible recovery allowances. For a route with travel legs and customer stops, planned elapsed time can be represented as:

where each term is measured in hours or minutes. The equation is an operational decomposition, not a universal cost formula. It assumes that the components are measured consistently and that overlapping activities have not been double-counted.

If a vehicle travels distance d at average speed v, travel time is:

Distance must be expressed in the same length unit as the speed denominator. This is an estimate: congestion, road grade, weather, vehicle type, and time of day may cause actual travel time to differ materially.

Time Windows

A time window specifies when service may begin or must be completed. Let a customer’s allowable arrival interval be [aᵢ, bᵢ], where aᵢ is the earliest permitted arrival and bᵢ is the latest permitted arrival. If the vehicle reaches the customer at rᵢ:

• early arrival requires waiting: wᵢ = max(0, aᵢ − rᵢ);
• service begins at sᵢ = max(rᵢ, aᵢ);
• lateness occurs when sᵢ > bᵢ.

Here, all times use the same clock convention. Some operations permit early arrival followed by waiting; others treat early arrival as a service failure because the customer cannot receive the vehicle.

Vehicle-Routing Problem Families

The classical Vehicle Routing Problem (VRP) seeks routes for a fleet serving a set of customers from one or more depots. Important variants include:

Most realistic freight problems are combinations. For example, a grocery distributor may face a heterogeneous-fleet pickup-and-delivery problem with time windows and temperature constraints.

Exact optimization can find an optimal solution for small instances, but routing problems become computationally difficult as the number of customers and constraints increases. Industry practice therefore combines optimization software with heuristics, operational rules, and human review.

Common heuristic approaches include:

• Nearest neighbor: repeatedly visit the nearest feasible next stop. It is fast but can produce poor overall routes.
• Savings method: begin with separate depot-to-customer routes and combine routes when the combination creates a distance saving without violating constraints.
• Local search: improve a route through moves such as swapping two stops, relocating a stop, or reversing a sequence.
• Cluster-first, route-second: group customers geographically or by service requirements, then sequence each group.
• Rolling-horizon planning: plan the near future in detail while retaining flexibility for later orders and disruptions.

A heuristic is not automatically good because it is fast. Its performance should be evaluated against feasibility, cost, service, robustness, and computational time.

3. Pickup-and-Delivery and Backhaul Operations

In a pickup-and-delivery operation, a vehicle collects freight at an origin and delivers it to a destination. The pickup must precede the associated delivery, and the vehicle must have sufficient residual capacity throughout the route. This creates precedence and load-balance constraints.

The load on a vehicle after stop k can be represented as:

where Lₖ is the load after stop k, Pₖ is the quantity picked up at stop k, and Dₖ is the quantity delivered at stop k. Feasibility requires:

where Q is the vehicle’s usable capacity, expressed in a consistent unit such as kilograms, pallets, cubic metres, or loading positions. If both weight and volume constrain the vehicle, both inequalities must be checked; satisfying one does not guarantee satisfying the other.

Backhauls

A backhaul is freight carried on a return movement that would otherwise be empty. Backhauls improve asset productivity by using capacity on the return leg. They may involve supplier pickups, customer returns, recyclable materials, or loads for another shipper.

Backhaul design must consider:

• pickup time windows and route compatibility;
• residual weight and volume capacity;
• loading and unloading sequence;
• product segregation and contamination risks;
• required equipment, such as tail lifts or temperature control;
• additional service time and route delay;
• commercial and contractual responsibilities.

A return load is not beneficial if it causes a late outbound delivery, excessive detour, unsafe loading, or an unprofitable handling requirement. The correct objective is contribution to total route performance, not merely elimination of empty kilometres.

4. Load Building and Vehicle Utilization

Load building combines shipments into vehicle loads while respecting physical, operational, and regulatory restrictions. Weight utilization and cube utilization are different measures:

These percentages require consistent units and should use usable rather than theoretical capacity. Usable capacity may be lower because of axle limits, pallet geometry, access space, load-securing requirements, or hazardous-material segregation.

A vehicle may be weight-constrained when carrying dense materials and cube-constrained when carrying light, bulky products. Poor load building may also create unusable residual space even when total volume appears adequate.

Important load-building principles include:

1. Place heavy goods low and distribute weight across axles.
2. Load deliveries in a sequence that supports safe and efficient unloading.
3. Protect fragile items and separate incompatible products.
4. Preserve access to intermediate deliveries where rehandling would be unsafe or costly.
5. Secure freight against movement using approved equipment.
6. Account for packaging, pallets, roll cages, and returnable assets.
7. Validate both dimensional and mass constraints.

Fleet Utilization

Fleet utilization should be measured across several dimensions rather than through one percentage. Useful indicators include vehicle availability, distance utilization, capacity utilization, productive driving time, and revenue-generating or load-carrying hours.

A basic distance utilization measure is:

The numerator must be defined consistently. If “loaded kilometres” means kilometres carrying any freight, it differs from kilometres carrying a commercially profitable load. Empty kilometres, repositioning, maintenance travel, and personal use should be classified explicitly.

A vehicle can show high distance utilization but poor financial performance if its loads are low-margin or if waiting time is excessive. Consequently, operational dashboards should combine utilization with cost, service, safety, and environmental indicators.

5. Driver and Asset Scheduling

Driver scheduling must integrate legal requirements, competence, availability, fatigue management, and customer service. It is not sufficient to assign a driver to a route merely because the driver is present at the depot.

Relevant constraints may include:

• maximum driving and duty periods under applicable law;
• mandatory rest and break requirements;
• vehicle and equipment qualifications;
• dangerous-goods or temperature-control certification;
• leave, sickness, and training;
• depot start and end requirements;
• collective agreements and fair rostering;
• secure parking and overnight location.

Asset scheduling includes tractors, rigid vehicles, trailers, containers, swap bodies, refrigeration units, loading equipment, and maintenance slots. An apparently available vehicle may be unavailable because of preventive maintenance, inspection, cleaning, damage, or a prior delayed return.

A practical scheduling process is:

1. Forecast transport demand and identify fixed commitments.
2. Determine available drivers and assets by time period.
3. Reserve resources for priority, specialist, or emergency work.
4. Build feasible shifts and routes.
5. Test legal, capacity, and time-window constraints.
6. Publish schedules with clear change-control rules.
7. Monitor actual completion and update the next planning cycle.

The schedule should include buffers. A plan that uses every available minute may have a low theoretical cost but a high probability of failure. Robust schedules distinguish planned activity time from recovery capacity.

6. Proof of Delivery and Data Integrity

Proof of delivery (POD) establishes that a shipment was presented and received under defined conditions. It may include recipient identity, date and time, location, shipment identifiers, quantities, condition, signature, photograph, barcode scan, or an electronic acceptance record.

A strong POD process should ensure:

• the document is linked to the correct order and stop;
• quantity and exception codes are recorded at the point of delivery;
• signatures or electronic confirmation are attributable to an authorized person;
• photographs and location data are collected lawfully and securely;
• amendments are traceable through an audit trail;
• data is transmitted promptly to invoicing and customer-service systems.

POD is not merely an administrative record. It supports revenue recognition, dispute resolution, claims investigation, inventory accuracy, and carrier performance management. A signed document may still be weak evidence if it does not identify shortages, damage, or the receiving party.

Digital POD systems commonly use mobile applications, barcode scanning, electronic signatures, geolocation, and image capture. Governance is required for personal data, retention periods, access rights, cybersecurity, and cross-border data transfer. Organizations should establish fallback procedures for poor connectivity, device failure, or customer refusal to sign.

7. Operational Exception Management

An exception is a deviation that threatens service, cost, compliance, safety, or data integrity. Examples include a vehicle breakdown, missed time window, inaccessible site, damaged freight, wrong quantity, rejected delivery, traffic disruption, temperature excursion, or missing POD.

Effective exception management has five stages:

1. Detect: identify the deviation through telematics, driver communication, customer contact, scan events, or system alerts.
2. Classify: determine severity, owner, affected shipments, and required response time.
3. Contain: protect safety, product, customer commitments, and legal compliance.
4. Recover: reassign a vehicle, resequence stops, arrange cross-dock support, reschedule the customer, or initiate a return.
5. Learn: record root cause, financial impact, and preventive action.

A useful exception record includes event time, location, shipment, responsible party, immediate action, revised ETA, customer communication, final disposition, and evidence. Exception codes should be specific enough for analysis. “Delivery failed” is less useful than “customer closed,” “vehicle breakdown,” “incorrect address,” or “receiver refused due to visible damage.”

Root-cause analysis may distinguish planning errors, execution errors, external disruptions, master-data defects, and customer-caused failures. Corrective actions should address the system cause rather than merely instructing an individual to “be more careful.”

8. Performance Measurement and Cost Analysis

Transport performance should be assessed as a balanced set of indicators. Examples include:

On-time delivery should have an explicit definition. For example, if the agreed delivery window is 10:00–12:00, an arrival at 12:05 is late even if the vehicle completed the route that day. Metrics should distinguish controllable from uncontrollable causes, otherwise managers may create incentives to manipulate reporting.

A route-cost estimate may include fixed and variable components:

where C_fixed is allocated vehicle or trip cost, cₖₘ is variable cost per kilometre, d is route distance, cₜᵢₘₑ is cost per operating hour, h is operating time, and the remaining terms represent tolls, handling, and exception costs. The formula is a managerial costing model, not a universal accounting rule. Each organization must define whether driver wages, depreciation, overhead, and outsourced-carrier charges are fixed or variable for the decision being made.

9. Technology, Optimization, and Artificial Intelligence

Transportation-management systems integrate order management, routing, dispatch, carrier tendering, telematics, freight audit, and performance reporting. A route-optimization engine can evaluate thousands of combinations more quickly than manual planning, but it depends on accurate inputs and appropriate objective weights.

Artificial intelligence and machine learning can support:

• travel-time prediction;
• estimated-time-of-arrival updates;
• demand and volume forecasting;
• anomaly detection;
• dynamic re-routing;
• image-based damage assessment;
• driver-risk and maintenance prediction.

These tools should augment, not obscure, managerial accountability. Important controls include explainable constraints, human approval for high-impact decisions, monitoring for biased driver or carrier scores, cybersecurity, model-performance testing, and fallback procedures. An algorithm trained on historically successful routes may reproduce historical inefficiencies or disadvantage particular locations if the data reflects unequal service conditions.

Real-time optimization also has a practical limit: excessive replanning can destabilize operations. Drivers, depots, and customers need credible instructions. A plan should be changed when the expected improvement exceeds the operational disruption and communication cost.

10. Illustrative Case: NorthStar Foods Distribution

Background

NorthStar Foods operates one depot and serves six retail stores each morning. It has two refrigerated vehicles. Vehicle A has a usable capacity of 8 pallets; Vehicle B has a usable capacity of 12 pallets. Each vehicle must return to the depot by 14:00. Store delivery windows, pallet requirements, and approximate one-way travel times from the depot are as follows:

The total requirement is 19 pallets, while combined capacity is 20 pallets. A naive allocation based only on total capacity would appear feasible.

Problem and Analysis

The planner must account for route capacity, time windows, travel between stores, service time, and the return deadline. Suppose the initial plan assigns P, S, and T to Vehicle B: 4 + 5 + 3 = 12 pallets. Vehicle A receives Q, R, and U: 3 + 2 + 2 = 7 pallets.

A possible sequence for Vehicle B is Depot → P → S → T → Depot. It may reach P at 07:30 after departing at 07:00, serve until 07:45, then require travel to S. If travel from P to S takes approximately 0.55 hours, arrival is about 08:18, before S’s window; the vehicle must wait until 09:00, serve until 09:18, travel to T, and serve within T’s window. The route may be feasible, but the early waiting and long geography create risk.

Vehicle A’s sequence Depot → Q → R → U → Depot may also be feasible, but it requires careful timing because R opens at 08:30. If Vehicle A departs at 07:15, it reaches Q at 08:00, serves until 08:15, reaches R at approximately 08:45, serves until 09:00, then reaches U at about 09:35. This is before U’s window, creating waiting until 10:00.

Approach and Solution

The planner evaluates alternative sequences and considers a cross-route swap. Moving R to Vehicle B and T to Vehicle A changes pallet totals to 13 for Vehicle B and 6 for Vehicle A, which violates Vehicle B’s capacity. Moving U to Vehicle B and R to Vehicle A gives Vehicle B 14 pallets and is also infeasible. Thus capacity limits restrict simple geographic improvements.

A better operational response is to retain the capacity-feasible allocation but adjust departure times and use planned waiting as a controlled buffer. Vehicle B departs at 07:00 for P, then serves S and T. Vehicle A departs at 07:15 for Q, R, and U. Dispatchers communicate the expected arrival times, monitor traffic, and reserve contingency capacity through an emergency third-party carrier if a vehicle fails.

The case demonstrates that total capacity is not enough. Feasibility depends on the capacity of each route, precedence of stops, windows, service times, and return requirements. It also illustrates why a planner should compare a mathematically shorter route with a more robust route. Waiting is not automatically waste: it may be necessary to respect a customer’s operating window, although persistent waiting can indicate poor departure timing or route design.

Outcome and Learning Points

The plan achieves delivery feasibility without overloading either vehicle. Performance should subsequently be assessed using actual arrival times, waiting, fuel consumption, pallet utilization, and customer acceptance. NorthStar should improve its data by recording store-specific unloading times and travel-time distributions rather than using single averages. It should also investigate whether some stores can accept earlier deliveries or whether a backhaul from a nearby supplier can be added without jeopardizing the morning schedule.

Challenges, Governance, and Best Practices

Freight operations face uncertainty from traffic, weather, demand changes, breakdowns, labour shortages, inaccurate addresses, and customer behaviour. The following practices improve resilience:

• maintain clean location, capacity, and service-time master data;
• use feasible plans rather than nominally optimal but fragile plans;
• define escalation thresholds and decision rights;
• communicate revised ETAs early and accurately;
• separate safety-critical decisions from cost-minimization decisions;
• retain auditable records of route changes and POD amendments;
• train drivers and planners in fatigue, load security, privacy, and incident reporting;
• review exceptions by root cause and financial impact;
• validate optimization outputs through operational pilots;
• ensure procurement contracts specify service, data, liability, and evidence requirements.

Ethical management requires that productivity monitoring not become disproportionate surveillance. Driver telematics should have a legitimate purpose, transparent policies, limited access, and appropriate retention. Safety must take precedence over delivery targets. Organisations must also comply with applicable transport, labour, dangerous-goods, vehicle, data-protection, and electronic-record regulations in each jurisdiction.

Chapter Summary

Freight operations are an integrated control system linking orders, resources, routes, schedules, execution, visibility, and proof of delivery. Routing determines the allocation and sequence of stops, while scheduling assigns feasible times under travel, service, capacity, driver, and customer constraints. Vehicle-routing problems include capacitated, time-window, pickup-and-delivery, multi-depot, heterogeneous-fleet, and dynamic forms.

Load building must consider weight, cube, axle distribution, handling sequence, compatibility, and safety. Backhauls can reduce empty movement but must be evaluated against detour, service, handling, and capacity consequences. Driver and asset scheduling requires legal compliance, competence, maintenance planning, and recovery capacity. POD provides evidence for billing, claims, and customer service, while exception management converts operational deviations into controlled recovery and organizational learning.

Technology, optimization, and AI can improve prediction and planning, but their value depends on data quality, transparent constraints, human accountability, cybersecurity, and disciplined change management. Effective freight management therefore combines quantitative analysis with operational judgement, governance, communication, and continuous improvement.

Key Terms

Backhaul: Return movement carrying freight that would otherwise travel empty.

Capacity utilization: The proportion of usable vehicle capacity occupied by a load.

Dispatching: Releasing and controlling transport work for drivers, vehicles, and shipments.

Dynamic VRP: A vehicle-routing problem in which orders, travel conditions, or constraints change during execution.

Exception: A deviation from the planned or required transport process.

Fleet utilization: The extent to which available vehicles generate productive transport activity.

Heuristic: A practical problem-solving method that seeks a good solution without guaranteeing an optimum.

Load building: Combining shipments into a vehicle load subject to physical and operational constraints.

On-time delivery: Delivery completed within the agreed service-time definition.

Pickup-and-delivery problem: A routing problem involving collection and delivery activities, usually with precedence requirements.

Proof of delivery: Evidence that goods were delivered and accepted, including relevant quantity, condition, time, and identity information.

Route buffer: Deliberate time or capacity reserved to absorb operational uncertainty.

Routing: Determining vehicle assignments and the sequence of locations served.

Scheduling: Assigning times to departures, arrivals, service, breaks, and returns.

Service time: Time spent loading, unloading, checking, or otherwise serving a stop.

Time window: The permitted interval for beginning or completing service.

Transportation-management system: Software supporting transport planning, execution, visibility, settlement, and analysis.

Vehicle Routing Problem: The problem of designing feasible and efficient routes for a fleet serving specified locations.

Review Questions

5 Short Answer Questions

1. Distinguish routing from scheduling in freight operations.
2. What is the operational purpose of dispatching?
3. Why must both weight and cube utilization be considered in load building?
4. Identify four types of operational exceptions.
5. State two governance requirements for digital proof of delivery.

5 Long Answer Questions

1. Explain the control loop from order release through proof of delivery and performance feedback.
2. Compare capacitated VRP, VRP with time windows, and pickup-and-delivery problems.
3. Discuss the benefits and limitations of backhaul planning.
4. Explain how driver, vehicle, and maintenance constraints should be integrated into daily scheduling.
5. Evaluate the role of optimization and AI in transportation management, including risks and controls.

3 Analytical / Application Questions

1. A vehicle has usable capacity of 10 pallets and carries 7 pallets outbound. A planned supplier pickup requires 4 pallets. Determine whether the pickup is feasible before considering any other constraints, and identify additional information required for a final decision.
2. A route has 2.5 hours of travel, 1.75 hours of service, 0.5 hours of waiting, and a 0.75-hour break. Calculate planned elapsed time and explain why a manager might add a further buffer.
3. Design an exception-response procedure for a refrigerated vehicle breakdown while two customers remain within their delivery windows. Specify detection, containment, recovery, communication, and learning actions.

Multiple Choice Questions with Answers

Question 1

Which statement best distinguishes routing from scheduling?

A. Routing assigns times, while scheduling selects customers

B. Routing determines vehicle-stop allocation and sequence, while scheduling assigns times

C. Routing records proof of delivery, while scheduling calculates freight bills

D. Routing manages drivers’ payroll, while scheduling manages vehicle maintenance

Correct Answer: B. Routing determines vehicle-stop allocation and sequence, while scheduling assigns times

Question 2

A vehicle has a usable capacity of 12 pallets and carries 9 pallets. What is its pallet-capacity utilization?

A. 25%

B. 33%

C. 75%

D. 133%

Correct Answer: C. 75%

Question 3

In a pickup-and-delivery route, which condition is generally required?

A. Delivery must occur before pickup

B. Pickup and delivery must occur at the same location

C. The associated pickup must precede its delivery

D. The vehicle must return to the depot after every pickup

Correct Answer: C. The associated pickup must precede its delivery

Question 4

If a vehicle arrives before a customer’s earliest permitted time and early service is not allowed, what should normally occur?

A. The vehicle should record a delivery failure immediately

B. The vehicle should wait until service may begin

C. The driver should deliver to the next customer and abandon the stop

D. The shipment should automatically be returned to the depot

Correct Answer: B. The vehicle should wait until service may begin

Question 5

Which measure most directly evaluates empty movement?

A. Loaded kilometres divided by total kilometres

B. Total pallets divided by number of drivers

C. Number of stops divided by vehicle capacity

D. Service time divided by waiting time

Correct Answer: A. Loaded kilometres divided by total kilometres

Question 6

Which is the strongest purpose of proof of delivery?

A. To replace route planning

B. To establish evidence of delivery and support billing and dispute resolution

C. To guarantee that no vehicle breakdown occurs

D. To eliminate the need for customer communication

Correct Answer: B. To establish evidence of delivery and support billing and dispute resolution

Question 7

What is the first stage in a disciplined exception-management process?

A. Learn

B. Recover

C. Detect

D. Invoice

Correct Answer: C. Detect

Question 8

A route has 3 hours of travel, 2 hours of service, and 0.5 hours of waiting. Ignoring breaks and buffers, what is its elapsed time?

A. 4.5 hours

B. 5 hours

C. 5.5 hours

D. 6 hours

Correct Answer: C. 5.5 hours

Question 9

Why can a backhaul be operationally undesirable despite reducing empty kilometres?

A. It always reduces vehicle capacity to zero

B. It may create detours, delay deliveries, or introduce incompatible freight

C. It cannot be recorded in a transport-management system

D. It is legally identical to an empty return in every jurisdiction

Correct Answer: B. It may create detours, delay deliveries, or introduce incompatible freight

Question 10

Which control is most appropriate when deploying AI for route decisions?

A. Allow the model to override safety rules automatically

B. Remove human review from all high-impact decisions

C. Monitor data quality, constraints, explainability, and model performance

D. Use historical routes without checking whether conditions have changed

Correct Answer: C. Monitor data quality, constraints, explainability, and model performance