Log in

Relevant bibliographies by topics / Three-dimensional loading constraints

Contents

Journal articles
Dissertations / Theses
Book chapters
Conference papers

Academic literature on the topic 'Three-dimensional loading constraints'

Author: Grafiati

Published: 4 June 2021

Last updated: 16 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Three-dimensional loading constraints.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Three-dimensional loading constraints"

1

Fuellerer, Guenther, Karl F. Doerner, Richard F. Hartl, and Manuel Iori. "Metaheuristics for vehicle routing problems with three-dimensional loading constraints." European Journal of Operational Research 201, no. 3 (2010): 751–59. http://dx.doi.org/10.1016/j.ejor.2009.03.046.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Bortfeldt, Andreas, and Junmin Yi. "The Split Delivery Vehicle Routing Problem with three-dimensional loading constraints." European Journal of Operational Research 282, no. 2 (2020): 545–58. http://dx.doi.org/10.1016/j.ejor.2019.09.024.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Gzara, Fatma, Samir Elhedhli, and Burak C. Yildiz. "The Pallet Loading Problem: Three-dimensional bin packing with practical constraints." European Journal of Operational Research 287, no. 3 (2020): 1062–74. http://dx.doi.org/10.1016/j.ejor.2020.04.053.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Junqueira, Leonardo, Reinaldo Morabito, and Denise Sato Yamashita. "Three-dimensional container loading models with cargo stability and load bearing constraints." Computers & Operations Research 39, no. 1 (2012): 74–85. http://dx.doi.org/10.1016/j.cor.2010.07.017.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Chen, Zongyi, Mingkang Yang, Yijun Guo, Yu Liang, Yifan Ding, and Li Wang. "The Split Delivery Vehicle Routing Problem with Three-Dimensional Loading and Time Windows Constraints." Sustainability 12, no. 17 (2020): 6987. http://dx.doi.org/10.3390/su12176987.

Full text

Abstract:

Besides routing and packing plans, synthetically considering the requirements of customers about service time is absolutely necessary. An order split delivery plan can not only better satisfy the service time requirements, but also improve the full-load rate of vehicles. The split delivery vehicle routing problem with three-dimensional loading constraints (3L-SDVRP) combines vehicle routing and three-dimensional loading with additional packing constraints. In the 3L-SDVRP splitting deliveries of customers is basically possible, i.e., a customer can be visited in two or more tours. The vehicle routing problem with three-dimensional loading constraints that are based on the time window and considering split delivery of orders (3L-CVRPTWSDO) and its optimization algorithm are studied in this paper. We established mathematical model of the problem and designed the tabu search algorithm. Based on the examples used in Gendreau et al. (2006), examples was constructed to test our algorithm. The experimental results have expressed that, in the 3L-CVRP problem, the results of split delivery is better than those of non-split delivery, and it is easier to satisfy the time window constraints. The algorithm in this paper generates high quality solutions, it provides a effective method to solve the 3L-CVRPTWSDO problems.

APA, Harvard, Vancouver, ISO, and other styles

6

JIN, ZHIHONG, KATSUHISA OHNO, and JIALI DU. "AN EFFICIENT APPROACH FOR THE THREE-DIMENSIONAL CONTAINER PACKING PROBLEM WITH PRACTICAL CONSTRAINTS." Asia-Pacific Journal of Operational Research 21, no. 03 (2004): 279–95. http://dx.doi.org/10.1142/s0217595904000254.

Full text

Abstract:

This paper deals with the three-dimensional container packing problem (3DCPP), which is to pack a number of items orthogonally onto a rectangular container so that the utilization rate of the container space or the total value of loaded items is maximized. Besides the above objectives, some other practical constraints, such as loading stability, the rotation of items around the height axis, and the fixed loading (unloading) orders, must be considered for the real-life 3DCPP. In this paper, a sub-volume based simulated annealing meta-heuristic algorithm is proposed, which aims at generating flexible and efficient packing patterns and providing a high degree of inherent stability at the same time. Computational experiments on benchmark problems show its efficiency.

APA, Harvard, Vancouver, ISO, and other styles

7

Ruan, Qingfang, Zhengqian Zhang, Lixin Miao, and Haitao Shen. "A hybrid approach for the vehicle routing problem with three-dimensional loading constraints." Computers & Operations Research 40, no. 6 (2013): 1579–89. http://dx.doi.org/10.1016/j.cor.2011.11.013.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Lacomme, Philippe, Hélène Toussaint, and Christophe Duhamel. "A GRASP×ELS for the vehicle routing problem with basic three-dimensional loading constraints." Engineering Applications of Artificial Intelligence 26, no. 8 (2013): 1795–810. http://dx.doi.org/10.1016/j.engappai.2013.03.012.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Junqueira, Leonardo, José F. Oliveira, Maria Antónia Carravilla, and Reinaldo Morabito. "An optimization model for the vehicle routing problem with practical three-dimensional loading constraints." International Transactions in Operational Research 20, no. 5 (2012): 645–66. http://dx.doi.org/10.1111/j.1475-3995.2012.00872.x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Miao, Lixin, Qingfang Ruan, Kevin Woghiren, and Qi Ruo. "A hybrid genetic algorithm for the vehicle routing problem with three-dimensional loading constraints." RAIRO - Operations Research 46, no. 1 (2012): 63–82. http://dx.doi.org/10.1051/ro/2012008.

Full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Dissertations / Theses on the topic "Three-dimensional loading constraints"

1

Koch, Henriette [Verfasser]. "Vehicle routing problems with three-dimensional loading constraints and backhauls / Henriette Koch." Magdeburg : Universitätsbibliothek, 2018. http://d-nb.info/1167856570/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Santini, Luigi Tavolaro. "Meta-heurísticas para problemas integrados de roteamento e carregamento de veículos." Universidade Nove de Julho, 2017. http://bibliotecatede.uninove.br/handle/tede/1727.

Full text

Abstract:

Submitted by Nadir Basilio (nadirsb@uninove.br) on 2018-01-24T20:35:47Z No. of bitstreams: 1 Luigi Tavolaro Santini.pdf: 2357766 bytes, checksum: b70528f7db6bf88f1285744982eb4234 (MD5)<br>Made available in DSpace on 2018-01-24T20:35:47Z (GMT). No. of bitstreams: 1 Luigi Tavolaro Santini.pdf: 2357766 bytes, checksum: b70528f7db6bf88f1285744982eb4234 (MD5) Previous issue date: 2017-02-23<br>The present work deals with the Capacitated Vehicle Routing Problem with Three-Dimensional Loading Constraints. This problem is difficult to solve exactly, still relatively little studied, but important in the logistics activities of movement, warehousing and transportation. This problem consists in minimizing the total traveled distance by a homogeneous fleet of vehicles that address the issue of deliveries of customer demands, in which these demands are composed of items that have three relevant spatial dimensions. The objective of the present work is to develop heuristic and metaheuristic algorithms to solve the problem in question. The algorithms are based on the Clarke & Wright and George & Robinson heuristics, and on the Iterated Local Search and Adaptive Large Neighborhood Search metaheuristics. In the proposed algorithm, the routing problem is firstly addressed by adapting the Clarke & Wright heuristic, creating routes that are used to verify the loading pattern, thus obtaining an initial solution. In the following, an extensive search in the solution neighborhood is applied with the Iterated Local Search metaheuristic. For the best results of this search, it is checked if the loading pattern is feasible using an adapted George & Robinson algorithm. If it is not feasible, the Adaptive Large Neighborhood Search metaheuristic is executed in an attempt to find a feasible solution to the loading problem. Instances from the literature are used to evaluate the efficiency of the developed methods. The results obtained for the routing problem individually were of paramount importance to ensure the effectiveness of the Iterated Local Search metaheuristic. For the loading problem individually, the tests were also satisfactory, allowing for several feasible loading patterns using the adapted George & Robinson algorithm and the Adaptive Large Neighborhood Search metaheuristic. The results obtained with the proposed algorithm for the integrated problem were also good, being very close to those in the literature and with computational time relatively lower. As perspectives for future research, it is intended to investigate more efficient ways of exploring the solution space of the integrated problem, as well as the use of other metaheuristics.<br>O presente trabalho trata do Problema de Roteamento de Veículos Capacitado com Restrições de Carregamento Tridimensional. Este é um problema de difícil solução exata, ainda relativamente pouco estudado, porém importante nas atividades logísticas de movimentação, armazenagem e transporte de produtos. Este problema consiste em minimizar a distância total percorrida por uma frota homogênea de veículos que supram a questão das entregas das demandas de clientes, em que tais demandas são compostas por itens que possuem três dimensões espaciais relevantes. O objetivo do presente trabalho consiste em desenvolver algoritmos heurísticos e meta-heurísticos para resolver o problema em questão. Os algoritmos são baseados nas heurísticas de Clarke & Wright e de George & Robinson, e nas meta-heurísticas Iterated Local Search e Adaptive Large Neighborhood Search. No algoritmo proposto, primeiro trata-se o problema de roteamento adaptando-se a heurística de Clarke & Wright, criando roteiros que são utilizados para a verificação do padrão de carregamento, tendo-se assim uma solução inicial. Em seguida, é aplicada uma busca extensiva na vizinhança com a meta-heurística Iterated Local Search. Para os melhores resultados desta busca, verifica-se se o padrão de carregamento é viável utilizando o algoritmo de George & Robinson adaptado. Nos casos em que não é viável, a meta-heurística Adaptive Large Neighborhood Search é executada na tentativa de se encontrar soluções viáveis para o problema de carregamento. Instâncias da literatura são utilizadas para avaliar a eficiência dos métodos desenvolvidos. Os resultados obtidos para o problema de roteamento separadamente foram de suma importância para assegurar a eficiência do meta-heurística Iterated Local Search. Para o problema de carregamento separadamente, os testes utilizando o algoritmo de George & Robinson adaptado e a meta-heurística Adaptive Large Neighborhood Search também foram satisfatórios, permitindo a obtenção de vários padrões de carregamento factíveis. Os resultados obtidos com o algoritmo proposto para o problema integrado também foram bons, sendo bastante próximos aos da literatura e com tempo computacional relativamente menor. Como perspectivas de pesquisas futuras, pretende-se estudar formas mais eficientes de se explorar o espaço de busca do problema integrado, bem como a utilização de outras meta-heurísticas.

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Three-dimensional loading constraints"

1

Junqueira, Leonardo, Reinaldo Morabito, Denise Sato Yamashita, and Horacio Hideki Yanasse. "Optimization Models for the Three-Dimensional Container Loading Problem with Practical Constraints." In Springer Optimization and Its Applications. Springer New York, 2012. http://dx.doi.org/10.1007/978-1-4614-4469-5_12.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Yi, Junmin, and Andreas Bortfeldt. "The Capacitated Vehicle Routing Problem with Three-Dimensional Loading Constraints and Split Delivery—A Case Study." In Operations Research Proceedings 2016. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-55702-1_47.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Huang, Min-fang, and Yuan-kai Zhang. "A Solution Procedure for the Capacitated Vehicle Routing Problem with Three-Dimensional Loading Constraints in Online Supermarket Delivery." In The 19th International Conference on Industrial Engineering and Engineering Management. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-38427-1_122.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Mak-Hau, Vicky, I. Moser, and Aldeida Aleti. "An Exact Algorithm for the Heterogeneous Fleet Vehicle Routing Problem with Time Windows and Three-Dimensional Loading Constraints." In Lecture Notes in Management and Industrial Engineering. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-55914-8_7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Turky, Ayad, I. Moser, and Aldeida Aleti. "An Iterated Local Search with Guided Perturbation for the Heterogeneous Fleet Vehicle Routing Problem with Time Windows and Three-Dimensional Loading Constraints." In Lecture Notes in Computer Science. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-51691-2_24.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Sahun, Yelyzaveta Serhiyivna. "Perspective Directions of Artificial Intelligence Systems in Aircraft Load Optimization Process." In Handbook of Research on Artificial Intelligence Applications in the Aviation and Aerospace Industries. IGI Global, 2020. http://dx.doi.org/10.4018/978-1-7998-1415-3.ch018.

Full text

Abstract:

The chapter represents an overview of different approaches towards loading process and load planning. The algorithm and specificities of the current cargo loading process force the scientists to search for new methods of optimizing due to the time, weight, and size constraints of the cargo aircraft and consequently to cut the costs for aircraft load planning and handling procedures. These methods are based on different approaches: mix-integer linear programs, three-dimensional bin packing, knapsack loading algorithms, tabu-search approach, rule-based approach, and heuristics. The perspective direction of aircraft loading process improvement is a combination of multicriteria optimization method and heuristic approach using the expert system.

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Three-dimensional loading constraints"

1

Arena, Andrea, Arnaldo Casalotti, Walter Lacarbonara, and Matthew P. Cartmell. "Three-Dimensional Modeling of Container Cranes." In ASME 2013 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2013. http://dx.doi.org/10.1115/detc2013-13689.

Full text

Abstract:

This work deals with three-dimensional (3D) modeling of container cranes including the hoisting cable length commands. The proposed models allow to effectively study the 3D motion caused by the eccentricity of initial conditions or loading conditions such as those induced by wind. The container is modeled as a 3D rigid body while the hoisting cables are treated either as inextensible trusses or as linearly elastic straight, taut cables. The 3D model with inextensible cables is shown to coalesce into existing two-dimensional models under the relevant planarity constraints. Details about the treatment of the internal inextensibility constraints are discussed. Time-marching simulations are carried out to show representative 2D and 3D responses to initial conditions and commanded motion of the trolley. The main differences between the constrained model and that with the elasticity of the cables are highlighted in the framework of a few significant design scenarios.

APA, Harvard, Vancouver, ISO, and other styles

2

Koloch, Grzegorz, Bogumil Kaminski, Sio-Iong Ao, Hideki Katagir, Li Xu, and Alan Hoi-Shou Chan. "Vehicle Routing with Three-dimensional Container Loading Constraints—Comparison of Nested and Joint Algorithms." In IAENG TRANSACTIONS ON ENGINEERING TECHNOLOGIES VOLUME 5: Special Edition of the International MultiConference of Engineers and Computer Scientists 2009. AIP, 2010. http://dx.doi.org/10.1063/1.3510541.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Wu, Jiangqing, Ling Zheng, Can Huang, Sifan Cai, Shaorong Feng, and Defu Zhang. "An Improved Hybrid Heuristic Algorithm for Pickup and Delivery Problem with Three-Dimensional Loading Constraints." In 2019 IEEE 31st International Conference on Tools with Artificial Intelligence (ICTAI). IEEE, 2019. http://dx.doi.org/10.1109/ictai.2019.00233.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Yi Tao and Fan Wang. "A new packing heuristic based algorithm for Vehicle Routing Problem with Three-dimensional Loading constraints." In 2010 IEEE International Conference on Automation Science and Engineering (CASE 2010). IEEE, 2010. http://dx.doi.org/10.1109/coase.2010.5584159.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Peng, Bitao. "Hybrid Tabu Search Algorithm for Fleet Size and Mixed Vehicle Routing Problem with Three-Dimensional Loading Constraints." In 2018 11th International Symposium on Computational Intelligence and Design (ISCID). IEEE, 2018. http://dx.doi.org/10.1109/iscid.2018.00073.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Wei, Lijun, Zhenzhen Zhang, and Andrew Lim. "An evolutionary local search for the capacitated vehicle routing problem minimizing fuel consumption under three-dimensional loading constraints." In 2014 10th International Conference on Natural Computation (ICNC). IEEE, 2014. http://dx.doi.org/10.1109/icnc.2014.6975835.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Ji, Min, T. Q. Dang, and Michael J. Cave. "Fully Three-Dimensional Viscous Semi-Inverse Method for Subsonic Mixed-Flow and Radial Impeller Design." In ASME Turbo Expo 2009: Power for Land, Sea, and Air. ASMEDC, 2009. http://dx.doi.org/10.1115/gt2009-59679.

Full text

Abstract:

A new semi-inverse design method for turbomachinery blading is proposed in this paper. Built on a time-marching Reynolds-Averaged Navier-Stokes solver, the proposed design method takes pressure loading, blade tangential thickness, blade stacking line, and flow path contour as prescribed quantities and computes the corresponding three-dimensional blade camber surface. In order to have the option of imposing geometrical constraints on the designed blade shapes, a new algorithm is developed to solve the camber surface at specified spanwise grid-lines, after which the blade geometry is constructed through ruling (e.g. straight-line element) at the remaining spanwise stations. The new semi-inverse algorithm involves re-formulating the boundary condition on the blade surfaces as a hybrid inverse/analysis boundary condition while preserving the fully three-dimensional nature of the flow field. The new design method can be interpreted as a fully three-dimensional viscous semi-inverse method. The ruled camber surface design procedure ensures blade surface smoothness and some control of mechanical integrity, and results in cost reduction for the manufacturing process. The proposed fully three-dimensional semi-inverse method is demonstrated through design modifications of generic industrial mixed-flow and radial impellers which are typically used for gas process applications.

APA, Harvard, Vancouver, ISO, and other styles

8

Pullan, Graham, John Denton, and Eric Curtis. "Improving the Performance of a Turbine With Low Aspect Ratio Stators by Aft-Loading." In ASME Turbo Expo 2005: Power for Land, Sea, and Air. ASMEDC, 2005. http://dx.doi.org/10.1115/gt2005-68548.

Full text

Abstract:

Experimental data and numerical simulations are presented from a research turbine with low aspect ratio nozzle guide vanes (NGVs). The combined effects of mechanical and aerodynamic constraints on the NGV create very strong secondary flows. This paper describes three designs of NGV that have been tested in the turbine, using the same rotor row in each case. NGV 2 used three-dimensional design techniques in an attempt to improve the performance of the datum NGV 1 blade but succeeded only in creating an intense vortex shed from the trailing edge (as previously reported) and lowering the measured stage efficiency by 1.1% points. NGV 3 was produced to avoid the “shed vortex” while adopting a highly aft-loaded surface pressure distribution to reduce the influence of the secondary flows. The stage with NGV 3 had an efficiency 0.5% points greater than that with NGV 1. Detailed comparisons between experiment and CFD, including predicted entropy generation rates, are used to highlight the areas where the loss reduction has occurred and hence to quantify the effects of employing highly aft-loaded NGVs.

APA, Harvard, Vancouver, ISO, and other styles

9

van Rooij, M. P. C., T. Q. Dang, and L. M. Larosiliere. "Enhanced Blade Row Matching Capabilities via 3D Multistage Inverse Design and Pressure Loading Manager." In ASME Turbo Expo 2008: Power for Land, Sea, and Air. ASMEDC, 2008. http://dx.doi.org/10.1115/gt2008-50539.

Full text

Abstract:

Three-dimensional inverse design has become a reliable and powerful tool for facilitating the refinement of blading designs. Its main strength lies in the direct control offered over local aerodynamics and, when the method is based on pressure loading, net circulation. While the ability to specify pressure loading offers many advantages, it is often not obvious to a designer what loading distribution should be prescribed. Not only should a suitable blade shape be achieved, but also satisfactory performance and design constraints such as mass flow, exit flow angle distributions and compression ratio. This problem is exacerbated when applying inverse design in a multistage environment, where interactions between blade rows affect the design and the resulting flow field in ways that are often intractable. Thus, numerous revisions of the prescribed loading, with a careful examination of how changes to the prescribed loading influence the resulting design, can still be necessary before obtaining a satisfactory design. A pressure loading manager has been developed to alleviate these problems. This loading manager can automatically adjust pressure loading distributions during the inverse design process to achieve greater control over the aerodynamic design intent. In combination with a fully three-dimensional multistage viscous inverse design method, a powerful method for blading revision is obtained that offers enhanced aerodynamic matching capabilities and design point control. Increased aero-design quality and productivity in difficult design situations can be achieved. This is demonstrated with the redesign of a highly loaded 2.5-stage transonic compressor.

APA, Harvard, Vancouver, ISO, and other styles

10

Fisk, Justin P., and Jennifer S. Wayne. "Validation of a Computational Musculoskeletal Model of the Elbow." In ASME 2007 Summer Bioengineering Conference. American Society of Mechanical Engineers, 2007. http://dx.doi.org/10.1115/sbc2007-176509.

Full text

Abstract:

Musculoskeletal computational modeling can be a powerful and useful tool to study joint behavior, examine muscle and ligament function, measure joint contact pressures, simulate injury, and analyze the biomechanical results of reconstructive procedures. Commonly, biomechanical models are based on either finite element analysis (FEA) or three-dimensional rigid body dynamics. While each approach has advantages for specific applications, rigid body dynamics algorithms are highly efficient [1], thus significantly reducing solution time. Many musculoskeletal models of the elbow have been developed [2, 3], but all have constrained the articulations to have particular degrees of freedom and ignored the effects of ligaments. An accurate and robust model without these limitations has potential as a clinical tool to predict the outcome of injuries and/or surgical procedures. This work develops and validates an accurate computational model of the elbow joint whereby joint kinematics are dictated by three-dimensional bony geometry contact, ligamentous constraints, and muscle loading.

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!