Skip to content

Using tabu search and dynamic programming to optimally place items in a pallet racket so as to minimize the time it takes for a Robotic Palletizer to pick up the items given som distributions of common orders (read list of different items from the pallet racket)

bolibomp/OptimalPalletRackPlacement

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

4 Commits
 
 
 
 

Repository files navigation

Optimal placement to minimize the time it takes for a pallet rack machine to pick up items for different orders.

A machine that goes through a pallet rack to pick up items for an order can be seen as a traveling salesman problem. Which path should the machine take to minimize the distance? But we need also to take into an account that there could be several types of orders containing a different set of items, and that we can choose the placement of the items in the pallet rack. We get a bilevel optimization problem. First must choose an item placement that in turn optimizes the length the machine has to travel to be able to safices all the orders.

About

Using tabu search and dynamic programming to optimally place items in a pallet racket so as to minimize the time it takes for a Robotic Palletizer to pick up the items given som distributions of common orders (read list of different items from the pallet racket)

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published