Bin packing/covering with delivery, solved with the evolution of algorithms

Attila Benko, György Dósa, Zsolt Tuza

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

3 Citations (Scopus)

Abstract

We deal with a new problem that we call Bin Packing/Covering with Delivery. Mainly we mean under this expression that we look for not only a good, but a "good and fast" packing or covering. In a recent manuscript defined several ways to treat such a problem, and investigate here one of them. We design polynomial-time algorithms finding exact offline solutions on a large class of problem instances, prove non-approximability in general, and also propose a new method that we call the "Evolution of Algorithms" for the online setting, to solve this (algorithmically very hard) problem. In case of such methods a neighborhood structure is defined among algorithms, and using a metaheuristic (simulated annealing in this paper) in some sense the best algorithm is chosen to solve the problem. We show the efficiency of the proposed method by several computer tests.

Original languageEnglish
Title of host publicationProceedings 2010 IEEE 5th International Conference on Bio-Inspired Computing
Subtitle of host publicationTheories and Applications, BIC-TA 2010
Pages298-302
Number of pages5
DOIs
Publication statusPublished - Dec 31 2010
Event2010 IEEE 5th International Conference on Bio-Inspired Computing: Theories and Applications, BIC-TA 2010 - Changsha, China
Duration: Sep 23 2010Sep 26 2010

Publication series

NameProceedings 2010 IEEE 5th International Conference on Bio-Inspired Computing: Theories and Applications, BIC-TA 2010

Other

Other2010 IEEE 5th International Conference on Bio-Inspired Computing: Theories and Applications, BIC-TA 2010
CountryChina
CityChangsha
Period9/23/109/26/10

ASJC Scopus subject areas

  • Biotechnology
  • Computational Theory and Mathematics
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Bin packing/covering with delivery, solved with the evolution of algorithms'. Together they form a unique fingerprint.

  • Cite this

    Benko, A., Dósa, G., & Tuza, Z. (2010). Bin packing/covering with delivery, solved with the evolution of algorithms. In Proceedings 2010 IEEE 5th International Conference on Bio-Inspired Computing: Theories and Applications, BIC-TA 2010 (pp. 298-302). [5645312] (Proceedings 2010 IEEE 5th International Conference on Bio-Inspired Computing: Theories and Applications, BIC-TA 2010). https://doi.org/10.1109/BICTA.2010.5645312