Comparison of different grasp algorithms for the heterogeneous vector bin packing problem

Dorde Stakic, Ana Anokic, Raka Jovanovic

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this paper, we address the practical problem of packing multiple items into containers for further transport. Dense packing of containers can significantly decrease supply chain costs, since transport fees are related to the the number of used containers and not the content. This practical problem is generally modeled using the vector bin packing problem (VBPP) and its variations. In the recent years, the heterogeneous VBPP with two sets of constraints has proven to be a good representation of container packing related problems. In this work we extend this model to a more realistic setting, by allowing multiple containers of the same type. To solve this problem, an integer program is designed. To be able to find feasible solutions for large scale problem instances, a greedy constructive algorithm is developed. With the intention of improving the solutions generated in this way, a local search is developed and used to extend the greedy algorithm to the Greedy Randomized Adaptive Search Procedure (GRASP) metaheuristic. To evaluate the potential of using GRASP on this problem, several variations are designed and implemented. In our computational experiments, we have generated test instances based on real-world data. Experimental results show that the designed metaheuristic approaches provide high quality solutions compared to solutions obtained by the CPLEX solver. Further, one of the proposed GRASP variants has been adapted for the homogeneous VBPP and tested on standard benchmark instances in order to evaluate its performance against existing metaheuristic. The final conclusion is that the GRASP presents a promising approach for more challenging instances for which CPLEX cannot find feasible solution within a reasonable time limit.

Original languageEnglish
Title of host publication2019 China-Qatar International Workshop on Artificial Intelligence and Applications to Intelligent Manufacturing, AIAIM 2019
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages63-70
Number of pages8
ISBN (Electronic)9781538664452
DOIs
Publication statusPublished - 31 Jan 2019
Event2019 China-Qatar International Workshop on Artificial Intelligence and Applications to Intelligent Manufacturing, AIAIM 2019 - Doha, Qatar
Duration: 1 Jan 20194 Jan 2019

Publication series

Name2019 China-Qatar International Workshop on Artificial Intelligence and Applications to Intelligent Manufacturing, AIAIM 2019

Conference

Conference2019 China-Qatar International Workshop on Artificial Intelligence and Applications to Intelligent Manufacturing, AIAIM 2019
CountryQatar
CityDoha
Period1/1/194/1/19

Fingerprint

Bins
Containers
Supply chains
Costs
Experiments

Keywords

  • Container packing problem
  • Container transport
  • GRASP
  • Vector bin packing

ASJC Scopus subject areas

  • Artificial Intelligence
  • Software
  • Industrial and Manufacturing Engineering

Cite this

Stakic, D., Anokic, A., & Jovanovic, R. (2019). Comparison of different grasp algorithms for the heterogeneous vector bin packing problem. In 2019 China-Qatar International Workshop on Artificial Intelligence and Applications to Intelligent Manufacturing, AIAIM 2019 (pp. 63-70). [8632779] (2019 China-Qatar International Workshop on Artificial Intelligence and Applications to Intelligent Manufacturing, AIAIM 2019). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/AIAIM.2019.8632779

Comparison of different grasp algorithms for the heterogeneous vector bin packing problem. / Stakic, Dorde; Anokic, Ana; Jovanovic, Raka.

2019 China-Qatar International Workshop on Artificial Intelligence and Applications to Intelligent Manufacturing, AIAIM 2019. Institute of Electrical and Electronics Engineers Inc., 2019. p. 63-70 8632779 (2019 China-Qatar International Workshop on Artificial Intelligence and Applications to Intelligent Manufacturing, AIAIM 2019).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Stakic, D, Anokic, A & Jovanovic, R 2019, Comparison of different grasp algorithms for the heterogeneous vector bin packing problem. in 2019 China-Qatar International Workshop on Artificial Intelligence and Applications to Intelligent Manufacturing, AIAIM 2019., 8632779, 2019 China-Qatar International Workshop on Artificial Intelligence and Applications to Intelligent Manufacturing, AIAIM 2019, Institute of Electrical and Electronics Engineers Inc., pp. 63-70, 2019 China-Qatar International Workshop on Artificial Intelligence and Applications to Intelligent Manufacturing, AIAIM 2019, Doha, Qatar, 1/1/19. https://doi.org/10.1109/AIAIM.2019.8632779
Stakic D, Anokic A, Jovanovic R. Comparison of different grasp algorithms for the heterogeneous vector bin packing problem. In 2019 China-Qatar International Workshop on Artificial Intelligence and Applications to Intelligent Manufacturing, AIAIM 2019. Institute of Electrical and Electronics Engineers Inc. 2019. p. 63-70. 8632779. (2019 China-Qatar International Workshop on Artificial Intelligence and Applications to Intelligent Manufacturing, AIAIM 2019). https://doi.org/10.1109/AIAIM.2019.8632779
Stakic, Dorde ; Anokic, Ana ; Jovanovic, Raka. / Comparison of different grasp algorithms for the heterogeneous vector bin packing problem. 2019 China-Qatar International Workshop on Artificial Intelligence and Applications to Intelligent Manufacturing, AIAIM 2019. Institute of Electrical and Electronics Engineers Inc., 2019. pp. 63-70 (2019 China-Qatar International Workshop on Artificial Intelligence and Applications to Intelligent Manufacturing, AIAIM 2019).
@inproceedings{4055bf36141a45ccba6cfe6d395c41a6,
title = "Comparison of different grasp algorithms for the heterogeneous vector bin packing problem",
abstract = "In this paper, we address the practical problem of packing multiple items into containers for further transport. Dense packing of containers can significantly decrease supply chain costs, since transport fees are related to the the number of used containers and not the content. This practical problem is generally modeled using the vector bin packing problem (VBPP) and its variations. In the recent years, the heterogeneous VBPP with two sets of constraints has proven to be a good representation of container packing related problems. In this work we extend this model to a more realistic setting, by allowing multiple containers of the same type. To solve this problem, an integer program is designed. To be able to find feasible solutions for large scale problem instances, a greedy constructive algorithm is developed. With the intention of improving the solutions generated in this way, a local search is developed and used to extend the greedy algorithm to the Greedy Randomized Adaptive Search Procedure (GRASP) metaheuristic. To evaluate the potential of using GRASP on this problem, several variations are designed and implemented. In our computational experiments, we have generated test instances based on real-world data. Experimental results show that the designed metaheuristic approaches provide high quality solutions compared to solutions obtained by the CPLEX solver. Further, one of the proposed GRASP variants has been adapted for the homogeneous VBPP and tested on standard benchmark instances in order to evaluate its performance against existing metaheuristic. The final conclusion is that the GRASP presents a promising approach for more challenging instances for which CPLEX cannot find feasible solution within a reasonable time limit.",
keywords = "Container packing problem, Container transport, GRASP, Vector bin packing",
author = "Dorde Stakic and Ana Anokic and Raka Jovanovic",
year = "2019",
month = "1",
day = "31",
doi = "10.1109/AIAIM.2019.8632779",
language = "English",
series = "2019 China-Qatar International Workshop on Artificial Intelligence and Applications to Intelligent Manufacturing, AIAIM 2019",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "63--70",
booktitle = "2019 China-Qatar International Workshop on Artificial Intelligence and Applications to Intelligent Manufacturing, AIAIM 2019",

}

TY - GEN

T1 - Comparison of different grasp algorithms for the heterogeneous vector bin packing problem

AU - Stakic, Dorde

AU - Anokic, Ana

AU - Jovanovic, Raka

PY - 2019/1/31

Y1 - 2019/1/31

N2 - In this paper, we address the practical problem of packing multiple items into containers for further transport. Dense packing of containers can significantly decrease supply chain costs, since transport fees are related to the the number of used containers and not the content. This practical problem is generally modeled using the vector bin packing problem (VBPP) and its variations. In the recent years, the heterogeneous VBPP with two sets of constraints has proven to be a good representation of container packing related problems. In this work we extend this model to a more realistic setting, by allowing multiple containers of the same type. To solve this problem, an integer program is designed. To be able to find feasible solutions for large scale problem instances, a greedy constructive algorithm is developed. With the intention of improving the solutions generated in this way, a local search is developed and used to extend the greedy algorithm to the Greedy Randomized Adaptive Search Procedure (GRASP) metaheuristic. To evaluate the potential of using GRASP on this problem, several variations are designed and implemented. In our computational experiments, we have generated test instances based on real-world data. Experimental results show that the designed metaheuristic approaches provide high quality solutions compared to solutions obtained by the CPLEX solver. Further, one of the proposed GRASP variants has been adapted for the homogeneous VBPP and tested on standard benchmark instances in order to evaluate its performance against existing metaheuristic. The final conclusion is that the GRASP presents a promising approach for more challenging instances for which CPLEX cannot find feasible solution within a reasonable time limit.

AB - In this paper, we address the practical problem of packing multiple items into containers for further transport. Dense packing of containers can significantly decrease supply chain costs, since transport fees are related to the the number of used containers and not the content. This practical problem is generally modeled using the vector bin packing problem (VBPP) and its variations. In the recent years, the heterogeneous VBPP with two sets of constraints has proven to be a good representation of container packing related problems. In this work we extend this model to a more realistic setting, by allowing multiple containers of the same type. To solve this problem, an integer program is designed. To be able to find feasible solutions for large scale problem instances, a greedy constructive algorithm is developed. With the intention of improving the solutions generated in this way, a local search is developed and used to extend the greedy algorithm to the Greedy Randomized Adaptive Search Procedure (GRASP) metaheuristic. To evaluate the potential of using GRASP on this problem, several variations are designed and implemented. In our computational experiments, we have generated test instances based on real-world data. Experimental results show that the designed metaheuristic approaches provide high quality solutions compared to solutions obtained by the CPLEX solver. Further, one of the proposed GRASP variants has been adapted for the homogeneous VBPP and tested on standard benchmark instances in order to evaluate its performance against existing metaheuristic. The final conclusion is that the GRASP presents a promising approach for more challenging instances for which CPLEX cannot find feasible solution within a reasonable time limit.

KW - Container packing problem

KW - Container transport

KW - GRASP

KW - Vector bin packing

UR - http://www.scopus.com/inward/record.url?scp=85062854881&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85062854881&partnerID=8YFLogxK

U2 - 10.1109/AIAIM.2019.8632779

DO - 10.1109/AIAIM.2019.8632779

M3 - Conference contribution

T3 - 2019 China-Qatar International Workshop on Artificial Intelligence and Applications to Intelligent Manufacturing, AIAIM 2019

SP - 63

EP - 70

BT - 2019 China-Qatar International Workshop on Artificial Intelligence and Applications to Intelligent Manufacturing, AIAIM 2019

PB - Institute of Electrical and Electronics Engineers Inc.

ER -