检索结果-内蒙古大学图书馆

The development of the refrigerated-container loading problem model for perishable fishery products considering internal temperature distribution

引用

INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE-OPERATIONS & LOGISTICS 2023年第1期10卷

作者： Rusdiansyah, Ahmad Adetio, Irza Rachmadiar Dewi, Ratna Sari Inst Teknol Sepuluh Nopember Dept Ind & Syst Engn Surabaya Indonesia

The paper aims to develop a refrigerated-container loading problem (R-CLP) model for perishable fishery products in a cold chain. The novelty of this study is to enhance the models and algorithms of CLP to deal with two different temperatures in reefers: those of cargoes and those of containers. This research considers synchronising the required optimum temperature of products and the internal temperature distribution of reefers to minimise the quality deterioration of the products. The objective of the R-CLP is to minimise total loading costs while fulfiling quality requirement of the products. The quality requirement is based on the temperature distribution inside the reefer, which was obtained by computational fluid dynamics (CFD) simulation. The model includes traditional loading constraints of CLP. Moreover, this research has developed a heuristics algorithm that deals with various types of products, cargo box dimensions and temperature distribution data. A prototype application has been developed to simulate the loading plan visually using an application prototype named REFLOAD. The numerical experiment shows the ability of the model to minimise the quality loss while maintaining the utilisation of the reefer. The R-CLP algorithm can reduce the total loading costs to about 16% compared with those of CLP algorithm.

关键词： container loading problem refrigerated container perishable products computational fluid dynamics fishery products quality deterioration

来源：评论

学校读者我要写书评

暂无评论

A GRASP approach to the container-loading problem

引用

IEEE INTELLIGENT SYSTEMS 2005年第4期20卷 50-57页

作者： Moura, A Oliveira, JF ESTiG IPB P-5301857 Braganca Portugal FEUP P-4200465 Oporto Portugal Inst Engn Sistemas & Comp Porto Oporto Portugal

In this article, the authors present GRModGrasp, a new GRASP (greedy randomized adaptive search procedure) algorithm for the single container-loading problem. The CLP aims to pack a set of boxes into a container, minimizing wasted space and satisfying other constraints related to the physical loading and transportation of the boxes. This GRASP algorithm, based on a wall-building constructive heuristic, aims to achieve high levels of cargo stability without compromising the container volume use. The authors evaluated GRModGrasp's performance both in terms of volume use and load stability and compared it with nine well-known algorithms. No other approaches can produce solutions that are simultaneously better in terms of volume use and better cargo *** article is part of a special issue on advanced heuristics in transportation and logistics.

关键词： container loading problem GRASP Greedy Randomized Adaptive Search Procedure Cargo Stability

来源：评论

学校读者我要写书评

暂无评论

Ant Colony Optimization Algorithm Based on Space Division for container loading problem

Ant Colony Optimization Algorithm Based on Space Division fo...

引用

2010 Chinese Control and Decision Conference

作者： Li Wang~1,Hui Zhang~1,Yan Xiong~2,Dawei Li~2 1.School of Information and Electronic Engineering,University of Science and Technology Liaoning,Anshan,114051,China 2.School of Science,University of Science and Technology Liaoning,Anshan,114051,China

This paper studies container loading optimization *** problem is a subset of rectangular boxes loaded into a rectangular container with fixed dimensions such that maximize container's utilization ratio.A mathematical model is *** principles which include space division,space merger,residual subspace omitted and loading rule are presented.A hybrid algorithm which integrate ant colony optimization algorithm with above principles is used to solve the container loading *** simulation results show that the model and the algorithm are effective.

关键词： container loading problem Ant Colony Optimization Algorithm Space Utilization Space Division

来源：评论

学校读者我要写书评

暂无评论

Graphical User Interface for the container loading problem: [An aproach using JavaScript] 14

Graphical User Interface for the Container Loading Problem: ...

引用

Proceedings of the XV International Conference on Human Computer Interaction

作者： Yanira González Coromoto León Gara Miranda Javier Villamonte University of La Laguna E.T.S. Ingeniería Informática La Laguna Spain

ISBN: (纸本)9781450328807

This paper presents a Graphical User Interface for a service used to solve the container loading problem as applied to the logistic industry, commonly encountered in transportation and wholesaling industries. This interface allows users to see how items (boxes) are to be placed in the container. In order to decide where exactly to locate each item, we used two evaluation heuristics based on a fill-by-levels strategy in which the items are storaged into the container. The user must choose the input file with the definition of the problem and the solution with the coordinates for each item inside the container. This information is then used by the GUI to arrange the boxes. However, the solutions given by evaluation heuristics can be modified using the mouse. The users can remove or exchange the items inside the container. Between of the features presented by this interface is the ability to keep track of all solutions that were rejected by the heuristics in its search for the final solution. The GUI was implemented using JavaScript and ***, a 3D library. While the heuristics were coded using C/C++.

关键词： Graphical User Interface container loading problem Javascript

来源：评论

学校读者我要写书评

暂无评论

Ant Colony Optimization Algorithm Based on Space Division for container loading problem

Ant Colony Optimization Algorithm Based on Space Division fo...

引用

The 22nd China Control and Decision Conference(2010年中国控制与决策会议)

作者： Hui Zhang Li Wang Yan Xiong Dawei Li School of Information and Electronic Engineering University of Science and Technology Liaoning Ans School of Science University of Science and Technology Liaoning Anshan 114051 China

This paper studies container loading optimization problem. This problem is a subset of rectangular boxes loaded into a rectangular container with fixed dimensions such that maximize container's utilization ratio. A mathematical model is given. Some principles which include space division, space merger, residual subspace omitted and loading rule are presented. A hybrid algorithm which integrate ant colony optimization algorithm with above principles is used to solve the container loading problem. The simulation results show that the model and the algorithm are effective.

关键词： container loading problem Ant Colony Optimization Algorithm Space Utilization Space Division

来源：评论

学校读者我要写书评

暂无评论

A Parallel Genetic Algorithm for Solving the container loading problem

引用

International Transactions in Operational Research 2002年第4期9.0卷 497-511页

作者： Gehring, Hermann Bortfeldt, Andreas Fern Universitat University of Hagen Germany

This paper presents a parallel genetic algorithm (PGA) for the container loading problem with a single container to be loaded. The emphasis is on the case of a strongly heterogeneous load. The PGA follows a migration model. Several separate sub-populations are subjected to an evolutionary process independently of each other. At the same time the best individuals are exchanged between the sub-populations. The evolution of the different sub-populations is carried out on a corresponding number of LAN workstations. The quality of the PGA is demonstrated by an extensive comparative test including well-known reference problems and loading procedures from other authors. International Federation of Operational Research Societies 2002.

关键词： container container loading problem Genetic algorithm Migration model Parallel search Transport

来源：评论

学校读者我要写书评

暂无评论

A parallel hybrid local search algorithm for the container loading problem

引用

International Transactions in Operational Research 2004年第5期11卷 511-533页

作者： Mack, D. Bortfeldt, A. Gehring, H. University of Hagen Germany

In this contribution, a parallel hybrid local search algorithm for the three-dimensional container loading problem (CLP) is proposed. First a simulated annealing method for the CLP is developed, which is then combined with an existing tabu search algorithm to form a hybrid metaheuristic. Finally, parallel versions are introduced for these algorithms. The emphasis is on CLP instances with a weakly heterogeneous load. Numerical tests based on the well-known 700 test instances from Bischoff and Ratcliff are performed, and the outcome is compared with methods from other authors. The results show a high solution quality obtained with reasonable computing time. © 2004 Wiley Periodicals, Inc.

关键词： container loading problem Cutting and packing Distributed-parallel search Hybrid algorithm Local search Metaheuristic Simulated annealing Tabu search

来源：评论

学校读者我要写书评

暂无评论

A mixed-integer linear model for the multiple heterogeneous knapsack problem with realistic container loading constraints and bins' priority

引用

INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH 2021年第6期28卷 3244-3275页

作者： Deplano, Igor Lersteau, Charly Trung Thanh Nguyen Liverpool John Moores Univ Dept Maritime & Mech Engn Liverpool Logist Offshore & Marine Res Inst Liverpool L3 3AF Merseyside England

We propose a mixed-integer linear model that solves the multiple heterogeneous knapsack problem, minimising the wasted space of the bins, taking into account their priority and considering the following constraints: non-overlapping, boundaries and positioning (both constrained and free), rotations (around the vertical axis), orthogonal displacement, weight limit, static stability, weight distribution in a pyramidal region and load bearing considering items' arbitrary centre of mass (CoM). In the experiments, the priority parameter is set to prioritise smaller bins, but the model is generic to cover other cases. We study the trade-off of adding more constraints to make the problem more realistic and the complexity of finding a solution. We introduce new metrics that facilitate the comparison of datasets used in experiments. These metrics allow the export of theoretical results in the industry. We also propose a constructive heuristic named weight first best fit to handle large-scale instances in a reasonable time.

关键词： linear programming multiple heterogeneous knapsack problem container loading problem physical Internet packing heuristic

来源：评论

学校读者我要写书评

暂无评论

The exact solutions of several types of container loading problems

引用

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2020年第1期284卷 87-107页

作者： Kurpel, Deidson Vitorio Scarpin, Cassius Tadeu Pecora Junior, Jose Eduardo Schenekemberg, Cleder Marcos Coelho, Leandro C. Univ Fed Parana Programa Posgrad Metodos Numer Engn Curitiba Parana Brazil Univ Fed Parana GTAO Curitiba Parana Brazil Univ Laval Canada Res Chair Integrated Logist Quebec City PQ Canada CIRRELT Montreal PQ Canada

In this paper, we address multiple container loading problems, consisting of placing rectangular boxes, orthogonally and without overlapping, inside containers in order to optimize a given objective function, generally maximizing the value of the packed boxes or minimizing the number of containers required to pack all available boxes. Four techniques to enumerate the possible locations of boxes inside a container, some of them not yet tested in the literature, are evaluated. We also propose new techniques to obtain primal and dual bounds for these problems. In addition, we study the constraints related to box orientation, load stability, and separation of boxes. Detailed analysis on well-known benchmark instances shows that our method is very competitive, generating mathematical models containing significantly fewer variables and constraints than the traditional approach existing in the literature. We test our methods on five different benchmark sets. We provide a detailed comparison with different approaches from the CLP literature, proving new optimal solutions and improving the best-known results for several instances. (C) 2019 Elsevier B.V. All rights reserved.

关键词： Packing container loading problem Practical constraints Mathematical formulation Discretizations

来源：评论

学校读者我要写书评

暂无评论

Solution validator and visualizer for (combined) vehicle routing and container loading problems

引用

ANNALS OF OPERATIONS RESEARCH 2023年第1期326卷 561-579页

作者： Krebs, Corinna Ehmke, Jan Fabian Otto von Guericke Univ Management Sci Univ Pl 2 D-39106 Magdeburg Germany Univ Vienna Business Decis & Analyt Kolingasse 14-16 A-1090 Vienna Austria

The optimization of cargo loading and transportation are two highly considered optimization problems (namely "3L-CVRP"). The combination of both has attracted increasing interest in the past decades. Hereby, 2D or 3D items have to be transported from one depot to a given set of customers using a homogeneous fleet of vehicles. Each route must be provided with a feasible packing plan taking various constraints into account. Combining the two optimization problems increases the complexity of the solution approaches, leading to a higher difficulty to check the results for correctness. To support the research progress and to enable transparency of solution structures, this paper provides an overview of recent literature, problem formulations, and best-known solutions. Furthermore, we introduce two open-source tools: The "Solution Validator" checks the feasibility of solutions in terms of considered constraints. The "Visualizer" provides two views and visualizes solutions. In the vehicle routing view, the tour plan and the corresponding schedule are displayed. In the loading view, the position of each item in the cargo space is demonstrated. In both views, it is possible to check the feasibility of the solution and highlight violated items. Besides the combined problem, the tool can be used also for one optimization problem (e.g. vehicle routing problem or container loading). The source codes for both tools are available at GitHub in C++ and Java and can be easily integrated into other researchers' code.

关键词： Open source tools Vehicle routing problem container loading problem

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：