Scribd
Upload
10 views

Logistics and Supply Chain Management - Summary2

Uploaded by

uraga
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
10 views

Logistics and Supply Chain Management - Summary2

Uploaded by

uraga
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

2.

Transport Logistics
2.1. Transportation problem
Rebalancing of empty containers. You need some empty containers somewhere but they are at another place where
they take up space. Standard problem from Management science. You have capacity and demand and need to find
the cheapest/ fastest way to fulfil as much demand as possible.

Excel Solver:
 Objective Function is SUMPRODUCT of costs and to be filled cells
 Constraints: To be filled cells must be smaller than the capacities and >= than the demands

2.2 Traveling Salesman problem (TSP)


Assumptions:
For a higher number of nodes, a numerical
 n locations to be visited approach becomes impossible
 Distances/ Travel times between the locations: cij
Objective: Find shortest path of all nodes that also gives a round trip
Examples:
 Delivery of goods – sequence of delivery, sub-problem of vehicle routing
 Order picking in warehouses
 Vehicle deployment problems e.g. fastest way through supermarket, or the order of
 Production control production, laser cutter should be cutting most of the time

 Cutting stock problems

Optimization problem:
Decision variables: xij = 1 if there is a trip from i to j, 0 otherwise;position variable zi

Constraints:
Each location is reached
Each location is left
Sub-tour elimination, i.e. all nodes must be connected
Variable domains

Number of possible tours = n!


Symmetric: Distance 1-5 = 5-1  fewer calculations, easier to solve
Asymmetric: Distance 1-5 ≠ 5-1  need to also calculate the distance of the flipped arcs, more calculations

Nearest Neighbour Successive Insertion (Heuristic): 2-opt heuristic:


method (Heuristic): 1. Start with path of 2 nodes 1. Consider any route
start at 1, check 2. Add next node at every point of 2. Choose two arcs
shortest the existing sequence 3. Flip the order of all the nodes in between
connection for 3. Choose the shortest total distance 4. Choose shorter path
every node 4. Repeat step 2 – 3 5. Repeat steps 2 – 4

You might also like