Heuristic Algorithms Based on Column Generation for an Online Product Shipping Problem
COMPUTERS & OPERATIONS RESEARCH（2024）
3-5-1 Johoku
Abstract
In this paper, we consider a product shipping problem (PSP). Given a time horizon and a set of products, each with a weight, a release date, and a due date, the PSP calls for product shipping to be planned between a fixed origin–destination pair so as to minimize the total shipping cost. Given several types of boxes with different sizes and shipping costs, packing several products into one larger box may lead to cheaper shipping costs than sending them separately in smaller boxes. The online PSP is a problem with an online constraint that requires a decision to be made for each day without knowing about future demands or being able to change boxes that have already been packed and shipped. For the online PSP, we propose column-generation-based algorithms with six different criteria, incorporating ideas such as iterative surplus reduction, and heuristic column generation. In the computational experiments, we tested 15 types of online algorithms under each criterion. Computational results on three different sets of instances show that one type of the proposed algorithms with one of the six criteria called “regret with cost of remaining capacity” obtains high-quality solutions with average gaps of 3.4% over all the tested instances.
MoreTranslated text
Key words
Column generation,Online problem,Product shipping problem,Column evaluation criteria,Cutting stock problem
求助PDF
上传PDF
View via Publisher
AI Read Science
AI Summary
AI Summary is the key point extracted automatically understanding the full text of the paper, including the background, methods, results, conclusions, icons and other key content, so that you can get the outline of the paper at a glance.
Example
Background
Key content
Introduction
Methods
Results
Related work
Fund
Key content
- Pretraining has recently greatly promoted the development of natural language processing (NLP)
- We show that M6 outperforms the baselines in multimodal downstream tasks, and the large M6 with 10 parameters can reach a better performance
- We propose a method called M6 that is able to process information of multiple modalities and perform both single-modal and cross-modal understanding and generation
- The model is scaled to large model with 10 billion parameters with sophisticated deployment, and the 10 -parameter M6-large is the largest pretrained model in Chinese
- Experimental results show that our proposed M6 outperforms the baseline in a number of downstream tasks concerning both single modality and multiple modalities We will continue the pretraining of extremely large models by increasing data to explore the limit of its performance
Upload PDF to Generate Summary
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Data Disclaimer
The page data are from open Internet sources, cooperative publishers and automatic analysis results through AI technology. We do not make any commitments and guarantees for the validity, accuracy, correctness, reliability, completeness and timeliness of the page data. If you have any questions, please contact us by email: report@aminer.cn
Chat Paper
Summary is being generated by the instructions you defined