Documentos de Académico
Documentos de Profesional
Documentos de Cultura
1 / 319
Introduction
2 / 319
Logistics Processes
Transport
• External: procurement, distribution
• Internal: between production sites, storage locations
• Mode of transport (rail, vessel, barge, truck)
Handling
• Loading and unloading, sorting, stocking and releasing
• Combining transport modes
• Interface between internal and external transport
Consignment
• assemble items into orders
Storage
Packaging
3 / 319
Designing Transport Networks
4 / 319
Designing Transport Networks
Facility location problem
-Single-commodity single-echelon continuous location problems:
Ex:Weiszfeld heuristic
-Single-commodity single-echelon discrete location problems:
Ex: capacitated plant location (CPL) problem.
simple plant location (SPL) model
p-median model
*As a rule, capacitated problems are harder than uncapacitated ones.
A Lagrangian heuristic for the capacitated plant location problem
5 / 319
Planning Transport Paths and
Modes
Transportation problem
[ς,c] f 3 [3,4]
v1 v2
3 [5,2] [3,2] 3
[2,6]
s [1,1] t
b(s)= 5 b(t)=
2 [3,4] −5
[7,3] 2
v3
6 / 319
Vehicle Use and Tour Planing
Pick-up-and-delivery problem
Dial-a-ride problem:
7 / 319
Vehicle Use and Tour Planing
Pickup and delivery problems constitute an important class of vehicle routing
problems in which objects or people have to be collected and distributed.
Berbeglia, G., Cordeau, J. F., Gribkovskaia, I., & Laporte, G. (2007). Static pickup and
delivery problems: a classification scheme and survey. Top, 15(1), 1-31.
The Dial-a-Ride Problem (DARP) consists of designing vehicle routes and schedules for n users
who specify pickup and delivery requests between origins and destinations. Very often the
same user will have two requests during the same day: an outbound request from home to a
destination (e.g., a hospital), and an inbound request for the return trip. In the standard version,
transport is supplied by a fleet of m identical vehicles based at the same depot. The aim is to
plan a set of minimum cost vehicle routes capable of accommodating as many requests as
possible, under a set of constraints. The most common example arises in door-to-door
transportation services for elderly or disabled people. From a modeling point of view, the DARP
generalizes a number of vehicle routing problems such as the Pickup and Delivery Vehicle
Routing Problem (PDVRP) and the Vehicle Routing Problem with Time Windows (VRPTW).
What makes the DARP different from most such routing problems is the human perspective.
The dial-a-ride problem: models and algorithms.
Cordeau, J. F., & Laporte, G. (2007). The dial-a-ride problem: models and algorithms. Annals of
Operations Research, 153(1), 29-46. 8 / 319
Heuristics
9 / 319
Heuristics
1 Local Search and
Metaheuristics Local Search
Variable Neighborhood Search
Evolutionary Algorithms
2 Capacitated Vehicle
Routing Construction
heuristics Two-Phase
Heuristics Improvement
Heuristics Evolutionary
Algorithm
3 Vehicle Routing Problem with Time Windows
(VRPTW) Construction Heuristics
Improvement Heuristics
Metaheuristics
4 Pickup and Delivery Problems
(PDP) Tabu Search 10 / 319
Why Do We Need Heuristics
11 / 319
Heuristics
Improvement heuristics:
on top of construction heuristics (require some solution),
try stepwise improvement of solution with small changes,
possibly based on problem independent principles
12 / 319
Metaheuristics
Improvement heuristics usually result in local optima.
Hard problems often have several local optima that are not
globally optimal.
13 / 319
Metaheuristics
Some Metaheuristics:
• Simulated Annealing
• Variable Neighbourhood Search
• Very Large Neighbourhood Search
• Tabu Search
• Ant Colony Optimization
• Genetic Algorithms
14 / 319
Simple Local Search
Local Search
begin
x ← initial solution;
repeat:
choose an x r ∈ N(x );
if f (x r) ≤ f (x ) then
x ← x r;
until termination criterion met;
end
N(x ): Neighborhood of x
Initial solution
Termination criterion
16 / 319