Library to optimise picking in the warehouse This library includes algorithms that should lead to improvements in picking path optimization in the warehouse. Any specifications that

Loading...
Searching...
No Matches
Classes | Typedefs | Enumerations
WarehousePickingOpt.h File Reference

translated with gcc version 12.2.1 More...

`#include <string>`
`#include <list>`
`#include <vector>`
`#include <map>`
`#include <math.h>`

Go to the source code of this file.

## Classes
class | SolverConfiguration
| object representing the setup for problem solving More...
class | BoxConfiguration
| the configuration of the boxes, which will be used More...
class | CartConfiguration
struct | SECTOR_ADDR_T
| this structure stores parsed address in usable form in computation More...
class | WAddress
| class representing the WAddress of product in warehouse More...
class | Warehouse
| warehouse representation, distance computation More...
class | ItemSpecification
class | OItem
| class representing the item in order (with its address, and all description) -> Order Item More...
class | BoxItem
| class which serves as representation of item in the box unlike OItem it doesn't represent order item of N units - instead of this BoxItem represents only one unit of OItem or a package of N units of OItem More...
struct | items_into_boxes_decomposition
| structure More...
class | CartShelf
| the shelf in cart, which contains boxes More...
class | Customer
| class representing the customer object (containing its items in warehouse - in order) More...
class | CartOItem
| class representing part or whole of order item in cart, differ from OItem only by added RealQty integer member, which gives an information of how many pieces of order item is realy in the cart More...
class | Cart
| class representing one Cart loaded with items from customers More...
class | Box
| Box that can be loaded to the cart and which contains picked items in the warehouse. More...
class | CartsLoader
| main class representing something like an interface for it More...

## Typedefs
typedef struct items_into_boxes_decomposition | ITEMS_IN_BOXES_DECOMP_T
| structure

## Enumerations
enum | BPAlgorithms { FFD_1D_ORDER_ITEMS_NO_SPLIT , FFD_1D_ORDER_ITEMS_SPLIT_ONE_BOX_TYPE , FFDS_1D_ORDER_ITEMS_SPLIT_MULTI_BOX_TYPE , PYLIB_3D_ORDER_ITEMS_SPLIT_ONE_BOX_TYPE , PYLIB_3D_FFDSEnhance_ORDER_ITEMS_SPLIT_MULTI_BOX_TYPE , PYLIB_3D_ORDER_ITEMS_SPLIT_MULTI_BOX_TYPE_COUNT_DEFINED , FFD_1D_ORDER_ITEMS_NO_SPLIT , FFD_1D_ORDER_ITEMS_SPLIT_ONE_BOX_TYPE , FFDS_1D_ORDER_ITEMS_SPLIT_MULTI_BOX_TYPE , PYLIB_3D_ORDER_ITEMS_SPLIT_ONE_BOX_TYPE , PYLIB_3D_FFDSEnhance_ORDER_ITEMS_SPLIT_MULTI_BOX_TYPE , PYLIB_3D_ORDER_ITEMS_SPLIT_MULTI_BOX_TYPE_COUNT_DEFINED }
| type for specifing algorithm for solving BPP
enum | GroupingCustomersAlgorithms { AVG_DISTANCES , LEAST_SQUARE_APPROXIMATION , K_MEANS_CLUSTERING , AUTO , AVG_DISTANCES , LEAST_SQUARE_APPROXIMATION , K_MEANS_CLUSTERING , AUTO }
| type for specifing algorithm for solving grouping of customers items to carts
enum | ShortestPathAlgorithms { NEAREST_NEIGHBOUR , NEAREST_NEIGHBOUR_BRUTE_FORCE_OPTIMIZATION , GREEDY , GREEDY_BRUTE_FORCE_OPTIMIZATION , JUST_MEASURE_DISTANCE , NONE , NEAREST_NEIGHBOUR , NEAREST_NEIGHBOUR_BRUTE_FORCE_OPTIMIZATION , GREEDY , GREEDY_BRUTE_FORCE_OPTIMIZATION , JUST_MEASURE_DISTANCE , NONE }
| type for specifing algorithm for solving shortest path problem while sorting items in cart

## Detailed Description

translated with gcc version 12.2.1

Author
  Jan Holáň, xholan11 (xhola.nosp@m.n11@.nosp@m.vutbr.nosp@m..cz)

Version
  0.1

Date
  2023-05-01

Copyright
  Copyright (c) 2023