OpenGL Programming Guide: The Official Guide to Learning OpenGL, Release 1
OpenGL Programming Guide: The Official Guide to Learning OpenGL, Release 1
A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems
Computers and Operations Research
Core Problems in Knapsack Algorithms
Operations Research
The Three-Dimensional Bin Packing Problem
Operations Research
Guided Local Search for the Three-Dimensional Bin-Packing Problem
INFORMS Journal on Computing
Proceedings of the 2005 ACM symposium on Applied computing
Management Information Systems for the Information Age
Management Information Systems for the Information Age
A hybrid approach for the 0-1 multidimensional knapsack problem
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Some experiments with a simple tabu search algorithm for the manufacturer's pallet loading problem
Computers and Operations Research
| Hi-index | 0.00 |
The need to move various items from one location to another has become a primary need of most companies. Items are usually boxed and arranged inside containers to be transported from one location to the other. Most companies pay shipments by the number of containers being transported; therefore, it is in the interest of the company to minimize that number. Furthermore, some items might have properties, which force special constraints on how and where they are stored inside the container. In this work, we propose an agent based solution for maximizing the use of a single container; thus, reducing the transportation cost for the companies having their items transported, as well as increasing transportation performance for transportation companies. Separate agents are used for packing, tracking, loading and unloading items. Also, artificial intelligence is provided through the use of the PROLOG programming language to specify rules and constraints on items loaded as well as on the container itself.