Two natural heuristics for 3D packing with practical loading constraints

Lei Wang, Songshan Guo, Shi Chen, Wenbin Zhu, Andrew Lim

    Research output: Chapters, Conference Papers, Creative and Literary WorksRGC 32 - Refereed conference paper (with host publication)peer-review

    35 Citations (Scopus)

    Abstract

    In this paper, we describe two heuristics for the Single Vehicle Loading Problem (SVLP), which can handle practical constraints that are frequently encountered in the freight transportation industry, such as the servicing order of clients; item fragility; and the stability of the goods. The two heuristics, Deepest-Bottom-Left-Fill and Maximum Touching Area, are 3D extensions of natural heuristics that have previously only been applied to 2D packing problems. We employ these heuristics as part of a two-phase tabu search algorithm for the Three-Dimensional Loading Capacitated Vehicle Routing Problem (3L-CVRP), where the task is to serve all customers using a homogeneous fleet of vehicles at minimum traveling cost. The resultant algorithm produces mostly superior solutions to existing approaches, and appears to scale better with problem size. © 2010 Springer-Verlag Berlin Heidelberg.
    Original languageEnglish
    Title of host publicationPRICAI 2010: Trends in Artificial Intelligence
    Subtitle of host publication11th Pacific Rim International Conference on Artificial Intelligence, Proceedings
    PublisherSpringer Verlag
    Pages256-267
    Volume6230 LNAI
    ISBN (Print)3642152457, 9783642152450
    DOIs
    Publication statusPublished - 2010
    Event11th Pacific Rim International Conference on Artificial Intelligence, PRICAI 2010 - Daegu, Korea, Republic of
    Duration: 30 Aug 20102 Sept 2010

    Publication series

    NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volume6230 LNAI
    ISSN (Print)0302-9743
    ISSN (Electronic)1611-3349

    Conference

    Conference11th Pacific Rim International Conference on Artificial Intelligence, PRICAI 2010
    PlaceKorea, Republic of
    CityDaegu
    Period30/08/102/09/10

    Fingerprint

    Dive into the research topics of 'Two natural heuristics for 3D packing with practical loading constraints'. Together they form a unique fingerprint.

    Cite this