Log in

Relevant bibliographies by topics / Loading and unloading Heuristic programming

Contents

Journal articles
Dissertations / Theses
Book chapters
Conference papers

Academic literature on the topic 'Loading and unloading Heuristic programming'

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 'Loading and unloading Heuristic programming.'

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 "Loading and unloading Heuristic programming"

1

Hansen, Jone R., Kjetil Fagerholt, Magnus Stålhane, and Jørgen G. Rakke. "An adaptive large neighborhood search heuristic for the planar storage location assignment problem: application to stowage planning for Roll-on Roll-off ships." Journal of Heuristics 26, no. 6 (2020): 885–912. http://dx.doi.org/10.1007/s10732-020-09451-z.

Full text

Abstract:

Abstract This paper considers a generalized version of the planar storage location problem arising in the stowage planning for Roll-on/Roll-off ships. A ship is set to sail along a predefined voyage where given cargoes are to be transported between different port pairs along the voyage. We aim at determining the optimal stowage plan for the vehicles stored on a deck of the ship so that the time spent moving vehicles to enable loading or unloading of other vehicles (shifting), is minimized. We propose a novel mixed integer programming model for the problem, considering both the stowage and shif

APA, Harvard, Vancouver, ISO, and other styles

2

Baou, Evangelia, Vasilis P. Koutras, Vasileios Zeimpekis, and Ioannis Minis. "Emergency evacuation planning in natural disasters under diverse population and fleet characteristics." Journal of Humanitarian Logistics and Supply Chain Management 8, no. 4 (2018): 447–76. http://dx.doi.org/10.1108/jhlscm-11-2017-0066.

Full text

Abstract:

PurposeThe purpose of this paper is to formulate and solve a new emergency evacuation planning problem. This problem addresses the needs of both able and disabled persons who are evacuated from multiple pick-up locations and transported using a heterogeneous fleet of vehicles.Design/methodology/approachThe problem is formulated using a mixed integer linear programming model and solved using a heuristic algorithm. The authors analyze the selected heuristic with respect to key parameters and use it to address theoretical and practical case studies.FindingsEvacuating people with disabilities has

APA, Harvard, Vancouver, ISO, and other styles

3

Alonso-Pecina, Federico, and David Romero. "A Simulated Annealing Approach for the Train Design Optimization Problem." Mathematical Problems in Engineering 2017 (2017): 1–11. http://dx.doi.org/10.1155/2017/4703106.

Full text

Abstract:

The Train Design Optimization Problem regards making optimal decisions on the number and movement of locomotives and crews through a railway network, so as to satisfy requested pick-up and delivery of car blocks at stations. In a mathematical programming formulation, the objective function to minimize is composed of the costs associated with the movement of locomotives and cars, the loading/unloading operations, the number of locomotives, and the crews’ return to their departure stations. The constraints include upper bounds for number of car blocks per locomotive, number of car block swaps, a

APA, Harvard, Vancouver, ISO, and other styles

4

Mathur, Kamlesh. "An integer-programming-based heuristic for the balanced loading problem." Operations Research Letters 22, no. 1 (1998): 19–25. http://dx.doi.org/10.1016/s0167-6377(97)00044-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Luo, Tian, Daofang Chang, and Yinping Gao. "Optimization of Gantry Crane Scheduling in Container Sea-Rail Intermodal Transport Yard." Mathematical Problems in Engineering 2018 (October 4, 2018): 1–11. http://dx.doi.org/10.1155/2018/9585294.

Full text

Abstract:

In the face of rising container throughput and the tasks associated with collecting and dispatching these containers, contributions to the development of sea-rail intermodal transport are required to improve the capacity of container transportation. According to the characteristics and the requirements of the operation of sea-rail intermodal transport, this paper puts forward a design for the transport yard which facilitates container loading and unloading. Through the establishment of a mixed integer programming model, a flexible schedule for gantry crane operation can be realized, so that, d

APA, Harvard, Vancouver, ISO, and other styles

6

Juárez Pérez, Marco Antonio, Rodolfo Eleazar Pérez Loaiza, Perfecto Malaquias Quintero Flores, Oscar Atriano Ponce, and Carolina Flores Peralta. "A Heuristic Algorithm for the Routing and Scheduling Problem with Time Windows: A Case Study of the Automotive Industry in Mexico." Algorithms 12, no. 5 (2019): 111. http://dx.doi.org/10.3390/a12050111.

Full text

Abstract:

This paper investigates a real-world distribution problem arising in the vehicle production industry, particularly in a logistics company, in which cars and vans must be loaded on auto-carriers and then delivered to dealerships. A solution to the problem involves the loading and optimal routing, without violating the capacity and time window constraints for each auto-carrier. A two-phase heuristic algorithm was implemented to solve the problem. In the first phase the heuristic builds a route with an optimal insertion procedure, and in the second phase the determination of a feasible loading. T

APA, Harvard, Vancouver, ISO, and other styles

7

Sadeghian, Seyed Hamidreza, M. K. A. M. Ariffin, S. H. Tang, and N. Ismail. "Integrated Dispatching Model of Automated Lifting Vehicles, Quay Cranes and Yard Cranes at Automated Container Terminal." Applied Mechanics and Materials 564 (June 2014): 678–83. http://dx.doi.org/10.4028/www.scientific.net/amm.564.678.

Full text

Abstract:

Integration of various types of handling equipment is one of the important methods to improve the efficiency of processes and productivity of a container terminal. Using ALVs, because of their ability in lifting a container from the ground by themselves, can reduce the delay of loading and unloading tasks in automatic container terminals.In this paper, a mixed-integer programming model, which considers the integration of ALVs, Quay Cranes and Yard Cranes, is developed. This model minimizes the makespan of the loading and unloading activities in an Automatic Container Terminal with limited buff

APA, Harvard, Vancouver, ISO, and other styles

8

MOHAMMED, SHARIF, HUSAIN AZHAR, LATEEF MOHAMMED, and DAYOUB M. "Optimization of Makespan of Container Loading -Unloading Problem Using Mixed Integer Programming." International Journal of Earth Sciences and Engineering 10, no. 01 (2017): 53–57. http://dx.doi.org/10.21276/ijee.2017.10.0108.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Lin and Zhao. "The Systematic Optimization of Train Formation in Loading Stations." Symmetry 11, no. 10 (2019): 1238. http://dx.doi.org/10.3390/sym11101238.

Full text

Abstract:

This paper presents the formulation of a train formation problem in rail loading stations (TFLS) from the systematic perspective. Several patterns of train formation are analyzed thoroughly before modeling, including direct single-commodity trains, direct multi-commodity trains created in the loading stations, and direct trains originating from reclassification yards. One of the crucial preconditions is that the loading and unloading efficiencies in the loading stations and the relational unloading stations are symmetric. Based on this, a non-linear 0–1 programming model is designed with the a

APA, Harvard, Vancouver, ISO, and other styles

10

Ivan, Andrei Mario, Florin Adrian Nicolescu, Georgia Cezara Avram, and Adrian Theodor Mantea. "Off-Line Programming and Functioning Simulation of Robotic Flexible Manufacturing Cell for Part's Turning." Applied Mechanics and Materials 760 (May 2015): 213–18. http://dx.doi.org/10.4028/www.scientific.net/amm.760.213.

Full text

Abstract:

This paper presents the works performed by the authors in the field of robotic flexible manufacturing cell offline programming and simulation. The study includes a manufacturing cell structure which includes a part transport system, a CNC lathe / turning centre and an articulated arm type industrial robot. The robot performs the task of loading / unloading the CNC lathe / manufacturing centre and manipulating the parts inside the cell, while the machining operations are performed by the CNC manufacturing centre. After briefly presenting the layout of the cell, the paper focuses on describing t

APA, Harvard, Vancouver, ISO, and other styles

More sources

Dissertations / Theses on the topic "Loading and unloading Heuristic programming"

1

Koo, Wai-yip. "Container loading problem by a multi-stage heuristics approach /." Hong Kong : University of Hong Kong, 1997. http://sunzi.lib.hku.hk/hkuto/record.jsp?B19471245.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

古偉業 and Wai-yip Koo. "Container loading problem by a multi-stage heuristics approach." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1997. http://hub.hku.hk/bib/B31215397.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Billings, Roger L. "Scheduling ammunition loading and unloading for U.S. Navy ships in San Diego." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2005. http://library.nps.navy.mil/uhtbin/hyperion/05Mar%5FBillings.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Loading and unloading Heuristic programming"

1

Skaf, Ali, Sid Lamrous, Zakaria Hammoudan, and Marie-Ange Manier. "Mixed-Integer Linear Programming Model for the Simultaneous Unloading and Loading Processes in a Maritime Port." In Transactions on Computational Science and Computational Intelligence. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-70873-3_37.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Cruz-Reyes, Laura, Arturo Lam Alvarez, Marcela Quiroz-Castellanos, et al. "A Hybrid Metaheuristic Algorithm for the Quay Crane Scheduling Problem." In Handbook of Research on Military, Aeronautical, and Maritime Logistics and Operations. IGI Global, 2016. http://dx.doi.org/10.4018/978-1-4666-9779-9.ch012.

Full text

Abstract:

This chapter presents a novel hybrid algorithm for the quay crane scheduling problem (QCSP). QCSP consists of scheduling a sequence of unloading and loading movements for cranes assigned to a vessel, minimizing the total completion time of all the tasks. The proposed algorithm integrates two well-known metaheuristics: Greedy Randomized Adaptive Search Procedure and Ant Colony System; it also incorporates a repositioning strategy of idle cranes to reduce the interference generated by the quay cranes. The experimental results show that the proposed method is able to find quality solutions in short times. In experiments reported in the literature with crafted instances of QCSP, heuristic running time varies from seconds in small instances to hours in instances of medium size. Currently, the industry requirements are up to a maximum of approximately five minutes. The hybrid algorithm presented in this chapter allows addressing these requirements, by finding good quality solutions in significantly shorter time for larger problems, which represents an advantage in real environments.

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Loading and unloading Heuristic programming"

1

De S. Neto, Amaro José, Dalessandro S. Vianna, and Marcilene De Fátima D. Vianna. "Uma Heurística ILS para Resolução do Problema de Carregamento e Descarregamento de Contêineres em Navios Porta-contêineres." In VII Simpósio Brasileiro de Sistemas de Informação. Sociedade Brasileira de Computação, 2011. http://dx.doi.org/10.5753/sbsi.2011.14563.

Full text

Abstract:

When docking at a port terminal it may be necessary to perform various operations of loading and unloading containers. Sometimes, when unloading, the target container which needs to be unloaded may be positioned below other containers that will not be unloaded at this time. These ones need to be removed to unload the target container. The goal is to find the best loading sequence minimizing thus the number of "rearrangements". The proposed heuristic was compared with a greedy heuristic and a local search method. The results show the adequacy of ILS heuristic to the problem addressed.

APA, Harvard, Vancouver, ISO, and other styles

2

Abd El-Aziz, Khalid M., and Sayed M. Metwalli. "Optimum Design of Pressure Vessels Using Hybrid HGP and Genetic Algorithm." In ASME 2017 Pressure Vessels and Piping Conference. American Society of Mechanical Engineers, 2017. http://dx.doi.org/10.1115/pvp2017-65538.

Full text

Abstract:

This paper presents research work about the design and optimization of pressure vessels using Hybrid Heuristic Gradient Projection (HGP), Sequential Quadratic Programming (SQP) and Genetic Algorithms (GA). The design is concerned with the pressure loading conditions, intended internal utility volume, geometrical dimensions and the induced stresses. Cylindrical pressure vessels with hemispherical ends are considered. They are required to hold a definite volume under a specific pressure. The thicknesses of each hemispherical part and the cylindrical part satisfy the recommended ASME code. The de

APA, Harvard, Vancouver, ISO, and other styles

3

Achar P. L., Sukshitha, Huanyu Liao, and Ganesh Subbarayan. "Comparative Evaluation of Algorithms for Achieving Ultrapacked Thermal Greases: Microstructural Models and Effective Behavior." In ASME 2019 International Technical Conference and Exhibition on Packaging and Integration of Electronic and Photonic Microsystems. American Society of Mechanical Engineers, 2019. http://dx.doi.org/10.1115/ipack2019-6501.

Full text

Abstract:

Abstract As device power density increases, there is a need to dissipate generated heat by increasing particle volume loading in thermal interface materials. In this work, we develop and evaluate algorithms for generating ultrapacked microstructures of particles. Simulated microstructures reported in the literature rarely contain particle volume fractions greater than 60%. However, commercially available thermal greases claim to achieve volume fractions in the range of 60–80%. Therefore, to analyze effectiveness of commercially available particle-filled thermal interface materials, there is a

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!