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
tsp_solver.h
1
12#ifndef _TSP_SOLVER_H_
13#define _TSP_SOLVER_H_
14
15#include "WarehousePickingOpt.h"
16
18 namespace tsp_solver
19{
25 int nearestNeighbour(vector<CartOItem> item_vect, Warehouse &warehouse, vector<CartOItem> *res_vect, SECTOR_ADDR_T starting_point, SECTOR_ADDR_T end_point);
26
32 int bruteForce(vector<CartOItem> item_vect, Warehouse &warehouse, vector<CartOItem> *res_vect, SECTOR_ADDR_T starting_point, SECTOR_ADDR_T end_point);
33
38 int justMeasureDistance(vector<CartOItem> item_vect, Warehouse &warehouse, SECTOR_ADDR_T starting_point, SECTOR_ADDR_T end_point);
39
45 int greedyAlgorithm(vector<CartOItem> item_vect, Warehouse &warehouse, vector<CartOItem> *res_vect, SECTOR_ADDR_T starting_point, SECTOR_ADDR_T end_point);
46 int greedyAlgorithmTmp(vector<CartOItem> item_vect, Warehouse &warehouse, vector<CartOItem> *res_vect, SECTOR_ADDR_T starting_point, SECTOR_ADDR_T end_point);
47};
48
49#endif
WarehousePickingOpt.h
translated with gcc version 12.2.1
Warehouse
warehouse representation, distance computation
Definition: WarehousePickingOpt.h:209
tsp_solver
namespace covering all functions for solving tsp problem (sorting items in cart)
Definition: tsp_solver.h:19
tsp_solver::bruteForce
int bruteForce(vector< CartOItem > item_vect, Warehouse &warehouse, vector< CartOItem > *res_vect, SECTOR_ADDR_T starting_point, SECTOR_ADDR_T end_point)
brute force implementation for solver of TSP problem
Definition: tsp_solver.cpp:95
tsp_solver::nearestNeighbour
int nearestNeighbour(vector< CartOItem > item_vect, Warehouse &warehouse, vector< CartOItem > *res_vect, SECTOR_ADDR_T starting_point, SECTOR_ADDR_T end_point)
sort item in cart - TSP problem - to create the shortest path through all of them using nearest neigh...
Definition: tsp_solver.cpp:17
tsp_solver::justMeasureDistance
int justMeasureDistance(vector< CartOItem > item_vect, Warehouse &warehouse, SECTOR_ADDR_T starting_point, SECTOR_ADDR_T end_point)
just measuring distance between given points
Definition: tsp_solver.cpp:149
tsp_solver::greedyAlgorithm
int greedyAlgorithm(vector< CartOItem > item_vect, Warehouse &warehouse, vector< CartOItem > *res_vect, SECTOR_ADDR_T starting_point, SECTOR_ADDR_T end_point)
greedy algorithm implementation for TSP solving
Definition: tsp_solver.cpp:254
SECTOR_ADDR_T
this structure stores parsed address in usable form in computation
Definition: WarehousePickingOpt.h:164