Log in

Relevant bibliographies by topics / Loading and unloading Heuristic programming / Journal articles

To see the other types of publications on this topic, follow the link: Loading and unloading Heuristic programming.

Journal articles 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 top 50 journal articles for your research 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.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

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

11

Bian, Zhan, Qianqian Shao, and Zhihong Jin. "OPTIMIZATION ON THE CONTAINER LOADING SEQUENCE BASED ON HYBRID DYNAMIC PROGRAMMING." TRANSPORT 31, no. 4 (2015): 440–49. http://dx.doi.org/10.3846/16484142.2014.994563.

Full text

Abstract:

Retrieving export containers from a container yard is an important part of the ship loading process during which arranging the retrieving sequence to enhance port efficiency has become a vital issue. This paper presents a twophase hybrid dynamic algorithm aiming at obtaining an optimized container loading sequence for a crane to retrieve all the containers from the yard to the ship. The optimization goal is to minimize the number of relocation operations which has a direct impact upon container loading operation efficiency. The two phases of the proposed dynamic algorithms are designed as foll

APA, Harvard, Vancouver, ISO, and other styles

12

Zhong, Meisu, Yongsheng Yang, Yamin Zhou, and Octavian Postolache. "Adaptive Autotuning Mathematical Approaches for Integrated Optimization of Automated Container Terminal." Mathematical Problems in Engineering 2019 (November 27, 2019): 1–14. http://dx.doi.org/10.1155/2019/7641670.

Full text

Abstract:

With the development of automated container terminals (ACTs), reducing the loading and unloading time of operation and improving the working efficiency and service level have become the key point. Taking into account the actual operation mode of loading and unloading in ACTs, a mixed integer programming model is adopted in this study to minimize the loading and unloading time of ships, which can optimize the integrated scheduling of the gantry cranes (QCs), automated guided vehicles (AGVs), and automated rail-mounted gantries (ARMGs) in automated terminals. Various basic metaheuristic and impr

APA, Harvard, Vancouver, ISO, and other styles

13

Krile, Srećko. "Efficient heuristic for non-linear transportation problem on the route with multiple ports." Polish Maritime Research 20, no. 4 (2013): 80–86. http://dx.doi.org/10.2478/pomr-2013-0044.

Full text

Abstract:

ABSTRACT We need a better transport planning tool for loading maximization and transport cost minimization on the voyage route with multiple loading/unloading (discharging) ports. The implemented heuristic algorithm is able to find out an appropriate routing sequence with maximal earnings and profit. In the same time it looks for minimal loading/discharging and transshipment costs, but with fulfillment of cargo demands in a number of ports on the route. The efficient algorithm for optimal transport of N cargo loads (e.g. contingent of containers) for ships with limited capacity is being develo

APA, Harvard, Vancouver, ISO, and other styles

14

Prata, Bruno, Leise Oliveira, and Thiago Holanda. "Locating on-street loading and unloading spaces by means of mixed integer programming." TRANSPORTES 26, no. 1 (2018): 16–30. http://dx.doi.org/10.14295/transportes.v26i1.1051.

Full text

Abstract:

Em um sistema de distribuição de carga urbana, é necessária a determinação do número e da localização dos locais de carga e descarga para regular as operações de carga e descarga. Este artigo apresenta modelos matemáticos para a localização do espaço de carga e descarga na rua com base no problema de cobertura e formulação de problemas de p-mediana. A abordagem foi testada com dados reais: uma área tem 160 quadras e 60 áreas de carga e descarga, em Fortaleza, Brasil. Avaliamos quatro cenários considerando diferentes raios de influência das áreas de carga/descarga. Os resultados indicam que est

APA, Harvard, Vancouver, ISO, and other styles

15

Pan, Xiao Yong, Jiang Wu, Quan Wei Zhang, Dong Lai, Hai Long Xie, and Chen Zhang. "A Case Study of AGV Scheduling for Production Material Handling." Applied Mechanics and Materials 411-414 (September 2013): 2351–54. http://dx.doi.org/10.4028/www.scientific.net/amm.411-414.2351.

Full text

Abstract:

This paper studies the scheduling problem of material handling by AGV in complex stochastic production lines. We establish the AGV distribution rule that each AGV is responsible for only one zone, thus reduce the muti-vehicle problem to single-vehicle problem. Its difficult to use exact model to solve the problem since the scheduling problem is related to the time issue. Most literature adopts heuristic or meta-heuristic methods. We build discrete model to solve the problem based on the special structure of our problem, adding constraints only when loading and unloading events happen. The comp

APA, Harvard, Vancouver, ISO, and other styles

16

Yang, Ang, Yu Cao, Kang Chen, Qingcheng Zeng, and Zigen Chen. "An Optimization Model for Tramp Ship Scheduling considering Time Window and Seaport Operation Delay Factors." Journal of Advanced Transportation 2021 (March 22, 2021): 1–19. http://dx.doi.org/10.1155/2021/6650097.

Full text

Abstract:

The quantity of electrical coal transported through the tramp shipping network is increasing due to the high demands. This trend has increased the scheduling difficulty combined with the underdevelopment of the private thermal power plant port. The high coal consumption and low port storage capacity requires the scheduling of the tramp ship to be on a strict time window to ensure the continuous operation of the thermal power plant. The low port unloading capacity often leads to the port congestion and delay of the unloading operation. This paper develops a mixed-integer-programming model for t

APA, Harvard, Vancouver, ISO, and other styles

17

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 fle

APA, Harvard, Vancouver, ISO, and other styles

18

Liu, Yi, Sabina Shahbazzade, and Jian Wang. "The AFSA-GA Algorithm for the Quay Crane Scheduling Problem of the Loading and Unloading Operations." International Journal of Software Science and Computational Intelligence 9, no. 3 (2017): 59–71. http://dx.doi.org/10.4018/ijssci.2017070104.

Full text

Abstract:

In order to improve the efficiency of container terminals, eliminate the empty quay cranes movements, the simultaneous loading and unloading operations in same ship-bay is advanced. The AFSA-GA algorithm is proposed to solve the mixed integer programming model of the dual-cycle operation, which take advantage of the strong local search ability of GA and the global optimum search ability of AFSA. The experiment shows that AFSA-GA algorithm can improve the operation efficiency of quay crane significantly.

APA, Harvard, Vancouver, ISO, and other styles

19

Martynov, I., V. Martynov, I. Biziuk, and R. Petrova. "ANALYTICAL DESCRIPTION OF SITUATIONAL - HEURISTIC METHOD OF THE CONSTRUCTION OF THE MODEL OF PLANNING OF LOADING-UNLOADING WORKS." Collection of scientific works of the State University of Infrastructure and Technologies series "Transport Systems and Technologies" 32, no. 2 (2018): 167–74. http://dx.doi.org/10.32703/2617-9040-2018-32-2-167-174.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Tang, Qiong, Zhuo Fu, and Meng Qiu. "A Bilevel Programming Model and Algorithm for the Static Bike Repositioning Problem." Journal of Advanced Transportation 2019 (June 2, 2019): 1–19. http://dx.doi.org/10.1155/2019/8641492.

Full text

Abstract:

In this paper, by taking the outsourcing transportation mode into account, a bilevel programming model is proposed to formulate the static bike repositioning (SBR) problem, which can be used to determine the number of bikes loaded and unloaded at each station and the optimal truck routes in bike sharing systems (BSS). The upper-level BSS providers determine the optimal loading and unloading quantities at stations to minimize the total penalties. The lower-level truck owner pursues the minimum transportation route cost. An iterated local search and tabu search are developed to solve the model.

APA, Harvard, Vancouver, ISO, and other styles

21

Tang, Qiong, Zhuo Fu, Dezhi Zhang, Hao Guo, and Minyi Li. "Addressing the Bike Repositioning Problem in Bike Sharing System: A Two-Stage Stochastic Programming Model." Scientific Programming 2020 (May 20, 2020): 1–12. http://dx.doi.org/10.1155/2020/8868892.

Full text

Abstract:

In this paper, a bike repositioning problem with stochastic demand is studied. The problem is formulated as a two-stage stochastic programming model to optimize the routing and loading/unloading decisions of the repositioning truck at each station and depot under stochastic demands. The goal of the model is to minimize the expected total sum of the transportation costs, the expected penalty costs at all stations, and the holding cost of the depot. A simulated annealing algorithm is developed to solve the model. Numerical experiments are conducted on a set of instances from 20 to 90 stations to

APA, Harvard, Vancouver, ISO, and other styles

22

Magiera, M. "A relaxation heuristic for scheduling flowshops with intermediate buffers." Bulletin of the Polish Academy of Sciences: Technical Sciences 61, no. 4 (2013): 929–42. http://dx.doi.org/10.2478/bpasts-2013-0100.

Full text

Abstract:

Abstract The paper presents a two-level relaxation heuristic for production planning for multistage flowshop systems with intermediate buffers. The method concerns unidirectional multistage systems where tasks with respect to many various types of products are performed simultaneously. The fixed and the alternative production routes are regarded in the method. The top-level is a stage loading, i.e., allocation of tasks among the stages. The base-level is a task scheduling - allocation of tasks among the stations. The linear mathematical models of mixed integer programming are used in the metho

APA, Harvard, Vancouver, ISO, and other styles

23

Wang, Zhan Zhong, Jing Fu, Lan Fang Liu, and Rui Rui Liu. "Three Dimensional Offline Packing Optimization Problem Based on Genetic Simulated Annealing Algorithm." Applied Mechanics and Materials 744-746 (March 2015): 1919–23. http://dx.doi.org/10.4028/www.scientific.net/amm.744-746.1919.

Full text

Abstract:

In this paper, we try to solve 3D offline packing optimization problem by combining two methods-genetic algorithm’ global performance and simulated annealing algorithm’ local performance. Given Heuristic rules in loading conditions, we use the optimal preservation strategy and the roulette wheel method to choose selection operator, integrating simulated annealing algorithm into genetic algorithm , and achieving code programming and algorithms by Matlab.This paper carries out an actual loading in a vehicle company in Changchun City, then makes a contrast between the final optimization results a

APA, Harvard, Vancouver, ISO, and other styles

24

Parreño-Torres, Consuelo, Ramon Alvarez-Valdes, and Francisco Parreño. "Solution Strategies for a Multiport Container Ship Stowage Problem." Mathematical Problems in Engineering 2019 (May 23, 2019): 1–12. http://dx.doi.org/10.1155/2019/9029267.

Full text

Abstract:

The multiport container ship stowage problem consists in determining the position of the containers on board a ship along its route with the objective of minimizing the number of unproductive moves required in the loading and unloading operations at each port. This paper presents an integer programming model for the problem and proposes several sets of valid constraints that bring its LP-relaxation closer to an integer solution. Moreover, it presents a GRASP algorithm that generates stowage plans with a minimal number of unproductive moves in a high percentage of medium and large-size instance

APA, Harvard, Vancouver, ISO, and other styles

25

Nagarjuna, N., O. Mahesh, and K. Rajagopal. "A heuristic based on multi-stage programming approach for machine-loading problem in a flexible manufacturing system." Robotics and Computer-Integrated Manufacturing 22, no. 4 (2006): 342–52. http://dx.doi.org/10.1016/j.rcim.2005.07.006.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Khazaei, Soroush, and Yashar Pourrahimian. "Mathematical Programming Application in Sublevel Caving Production Scheduling." Mining 1, no. 2 (2021): 180–91. http://dx.doi.org/10.3390/mining1020012.

Full text

Abstract:

Production scheduling determines the most beneficial mining sequence over the life of a mine. Developing a schedule that meets all mining aspects can substantially reduce mining costs and increase profitability. Among all underground mining methods, the sublevel caving method is a common method with moderate development requirements, a high production rate, and a high degree of mechanization and flexibility. None of the manual planning methods and heuristic algorithms used in commercial software will lead to a truly optimal schedule. Mathematical programming models, particularly mixed-integer

APA, Harvard, Vancouver, ISO, and other styles

27

Angalaeswari, S., P. Sanjeevikumar, K. Jamuna, and Zbigniew Leonowicz. "Hybrid PIPSO-SQP Algorithm for Real Power Loss Minimization in Radial Distribution Systems with Optimal Placement of Distributed Generation." Sustainability 12, no. 14 (2020): 5787. http://dx.doi.org/10.3390/su12145787.

Full text

Abstract:

This paper proposes the hybrid sequential quadratic programming (SQP) technique based on active set method for identifying the optimal placement and rating of distribution generation (DG) incorporated in radial distribution systems (RDS) for minimizing the real power loss satisfying power balance equations and voltage limits. SQP runs quadratic programming sequentially as a sub-program to obtain the best solution by using an active set method. In this paper, the best optimal solution is selected with less computation time by combining the benefits of both classical and meta-heuristic methods.

APA, Harvard, Vancouver, ISO, and other styles

28

Xu, Y. G., W. Tiu, and Y. Z. Xu. "Numerical Simulation of Crack Tip Behavior under Fatigue Loading." Key Engineering Materials 525-526 (November 2012): 517–20. http://dx.doi.org/10.4028/www.scientific.net/kem.525-526.517.

Full text

Abstract:

Fatigue damage is a localized phenomenon controlled by the near-tip crack behavior. This paper presents an application of a dislocation distribution technique to the simulation of crack tip behavior under fatigue loading. A centre-cracked tension specimen under uni-axial fatigue loading is used in the study. Crack opening and plastic deformation around the crack tip are simulated by distributions of dislocation dipoles in crack plane and four inclined planes ahead of the crack tip. Climb dislocation dipole is used to model the opening and closing of the crack while glide dislocation dipole is

APA, Harvard, Vancouver, ISO, and other styles

29

Krile, Srećko, Marina Krile, and Petr Průša. "NON-LINEAR MINI-MAX PROBLEM OF MULTI-STOP FLIGHT ROUTES." TRANSPORT 30, no. 3 (2015): 361–71. http://dx.doi.org/10.3846/16484142.2015.1091984.

Full text

Abstract:

The major change in trends of air transport development is to increase operating efficiency, productivity and profitability. Airline companies (air operators or carriers) can ensure significant fuel savings and better utilization of airplanes capacity. So they need better transport planning tool for costs minimization on a voyage route with multiple loading/unloading airports (multi-stop routes).The existing routes can be re-optimized (improved) or alternative routes can be offered instead. In this research the efficient heuristic algorithm for optimal transportation of N different loads (e.g.

APA, Harvard, Vancouver, ISO, and other styles

30

Frómeta Moya, Jorge Israel, Daniel René Tasé Velázquez, Lorena Hernández Mastrapa, and Yosvany Orlando Lao León. "Integrated mathematical model based on a heuristic method for loading and routing of vehicles: application in a tobacco company." Independent Journal of Management & Production 11, no. 6 (2020): 2091. http://dx.doi.org/10.14807/ijmp.v11i6.1209.

Full text

Abstract:

The vehicle-routing problem (VRP) combined with freight-loading problem is a complex and relatively recent issue studied by the scientific literature. This paper presents the formulation of a mathematical model and a procedure to solve this problem in a Cuban tobacco company aiming to determine the quantity of merchandise to be loaded on vehicles and the best route to be taken. For this purpose, a decomposition’s heuristic method was used and it was integrated with multiobjective programming by-goals and mixed binary quadratic programming. This approach allowed simplifying the problem and offe

APA, Harvard, Vancouver, ISO, and other styles

31

Arabzad, S. Mohammad, Hadi Shirouyehzad, Mahdi Bashiri, Reza Tavakkoli-Moghaddam, and Esmaeil Najafi. "REBALANCING STATIC BIKE-SHARING SYSTEMS: A TWO-PERIOD TWO-COMMODITY MULTI-DEPOT MATHEMATICAL MODEL." Transport 33, no. 3 (2018): 718–26. http://dx.doi.org/10.3846/transport.2018.1558.

Full text

Abstract:

In this paper, an Integer Linear Programming (ILP) has been developed for rebalancing the stations of a Periodic Bike Relocation Problem (PBRP) in multiple periods. The objective function of the mathematical model is reducing costs of implementing trucks, transportation between stations and holding bikes on trucks during rebalancing. The variables we are following them in this model are conducting the optimal route in several periods, using the most appropriate trucks for these routes, and determining the best program for loading/unloading bikes for stations. The distinguishing features of the

APA, Harvard, Vancouver, ISO, and other styles

32

Nguyen, D. A., and Long Le Ngoc Bao. "Applying A* Algorithm in routing for Inter-Terminal Transport System at Busan Port." Maritime Technology and Research 2, no. 4 (2020): Manuscript. http://dx.doi.org/10.33175/mtr.2020.240342.

Full text

Abstract:

This paper proposes a heuristic approach named A* algorithm to find shortest route for Inter-Terminal Transport Monorail System (ITT system) that are being applied in Busan Port (Korea). In every transport system, vehicle routing and task assignment are significant problems that affects strongly the overall system’s efficiency, especially the travel cost and the time taking. The proposed ITT system will use shuttles to carry containers along a monorail that links the internal terminals. A* algorithm is used to guide the shuttles in a shortest way automatically from a known loading position to

APA, Harvard, Vancouver, ISO, and other styles

33

Sadeghian, Seyed Hamidreza, Mohd Khairol Anuar Bin Mohd Ariffin, Say Hong Tang, and Napsiah Binti Ismail. "A New Dispatching Model of Automated Lifting Vehicles in Automated Container Terminal with Limited Buffer Space." Applied Mechanics and Materials 446-447 (November 2013): 1334–39. http://dx.doi.org/10.4028/www.scientific.net/amm.446-447.1334.

Full text

Abstract:

Automation of the processes at the quays of the world's large container ports is one of the answers to the required ever-increasing transshipment volumes within the same timeframe. For such purpose, using new generation of vehicles is unavoidable. One of the automatic vehicles that can be used in container terminals is Automated Lifting Vehicle (ALV). Integrated scheduling of handling equipments with quay cranes can increase the efficiency of automated transport systems in container. In this paper, an integrated scheduling of quay cranes and automated lifting vehicles with limited buffer space

APA, Harvard, Vancouver, ISO, and other styles

34

Awais, Hafiz Muhammad, Tahir Nadeem Malik, and Aftab Ahmad. "Artificial Algae Algorithm with Multi-Light Source Movement for Economic Dispatch of Thermal Generation." Mehran University Research Journal of Engineering and Technology 39, no. 3 (2020): 564–82. http://dx.doi.org/10.22581/muet1982.2003.12.

Full text

Abstract:

Economic Dispatch (ED) is one of the major concerns for the efficient and economical operation of the modern power system. Actual ED problem is non-convex in nature due to Ramp Rate Limits (RRL), Valve-Point Loading Effects (VPLE), and Prohibited Operating Zones (POZs). It is generally converted into a convex problem as mathematical programming based approaches cannot handle the non-convex cost functions except dynamic programming, which also suffers from the curse of dimensionality. Heuristic techniques are potential solution methodologies for solving the non-convex ED problem. Artificial Alg

APA, Harvard, Vancouver, ISO, and other styles

35

Qiu, Mengning, Mashor Housh, and Avi Ostfeld. "A Two-Stage LP-NLP Methodology for the Least-Cost Design and Operation of Water Distribution Systems." Water 12, no. 5 (2020): 1364. http://dx.doi.org/10.3390/w12051364.

Full text

Abstract:

This paper presents a two-stage method for simultaneous least-cost design and operation of looped water distribution systems (WDSs). After partitioning the network into a chord and spanning trees, in the first stage, a reformulated linear programming (LP) method is used to find the least cost design of a WDS for a given set of flow distribution. In the second stage, a non-linear programming (NLP) method is used to find a new flow distribution that reduces the cost of the WDS operation given the WDS design obtained in stage one. The following features of the proposed two-stage method make it mo

APA, Harvard, Vancouver, ISO, and other styles

36

Wang, Shuaian, Xiaobo Qu, Tingsong Wang, and Wen Yi. "Optimal Container Routing in Liner Shipping Networks Considering Repacking 20 ft Containers into 40 ft Containers." Journal of Advanced Transportation 2017 (2017): 1–9. http://dx.doi.org/10.1155/2017/8608032.

Full text

Abstract:

The volume of a 40 ft container is twice as large as that of a 20 ft container. However, the handling cost (loading, unloading, and transshipment) of a 40 ft container is much lower than twice the corresponding handling cost of two 20 ft containers. Enlightened by this observation, we propose a novel container routing with repacking problem in liner shipping, where two 20 ft containers can be repacked to a 40 ft container in order to reduce the handling cost. We develop a mixed-integer linear programming model that formulates the routing decisions and the repacking decisions in a holistic mann

APA, Harvard, Vancouver, ISO, and other styles

37

Atkočiūnas, Juozas. "KUHN-TUCKER CONDITIONS IN SHAKEDOWN PROBLEMS." JOURNAL OF CIVIL ENGINEERING AND MANAGEMENT 2, no. 5 (1996): 14–28. http://dx.doi.org/10.3846/13921525.1996.10531545.

Full text

Abstract:

An elastic perfectly plastic structure at shakedown to given cyclić loading is under consideration. The stress-strain field of dissipative system in general is related to the history of loading. And only in a particular case, i.e. at the moment prior to the failure of an elastic perfectly plastic structure the distribution of the actual residual forces is unique for each prescribed history of loading (the safety factor of shakedown approaches unity). Nevertheless, there exist some domains where the plastic strains are equal to zero. The residual forces in the statically indeterminate parts of

APA, Harvard, Vancouver, ISO, and other styles

38

Cai, Xiao Ning, Shao Ping Meng, Jia Jia Chen, and Wei Wei Sun. "Numerical Analysis of Post-Tensioned Coupled Wall." Advanced Materials Research 163-167 (December 2010): 1935–39. http://dx.doi.org/10.4028/www.scientific.net/amr.163-167.1935.

Full text

Abstract:

Based on OpenSEES, nonlinear beam-column element based on fiber model and considered nonlinear shear deformation was used to simulate wall limb; zero-length elements were used to simulate action of prestressing tendon and connecting reinforcement in the interface between coupling beam and wall limb; the hysteretic models of the zero-length elements were established by programming. The low-cyclic loading tests of two PCW specimens were introduced. Results of the numerical analysis and the tests indicate that elasto-plastic performances of PCW can be well simulated by numerical analysis, analysi

APA, Harvard, Vancouver, ISO, and other styles

39

Andriansyah, Nissa Prasanti, and Prima Denny Sentia. "Pickup and delivery problem with LIFO, time duration, and limited vehicle number." MATEC Web of Conferences 204 (2018): 07003. http://dx.doi.org/10.1051/matecconf/201820407003.

Full text

Abstract:

This study discusses pickup and delivery problem with last-in-first-out, time duration, and limited vehicle number which is usually experienced by door to door courier service. In this problem, company’s vehicles will pick customer’s goods and deliver them from one location to another. Technically, LIFO policy is enforced when the assigned vehicles for transporting the goods have a single access point to loading-unloading process. This study develops integer linear programming formulation based on three index formulation. The model is solved by branch-and-bound algorithm. From experimental stu

APA, Harvard, Vancouver, ISO, and other styles

40

Gong, Chaoqi, Baohua Mao, Min Wang, and Tong Zhang. "Equity-Oriented Train Timetabling with Collaborative Passenger Flow Control: A Spatial Rebalance of Service on an Oversaturated Urban Rail Transit Line." Journal of Advanced Transportation 2020 (September 23, 2020): 1–17. http://dx.doi.org/10.1155/2020/8867404.

Full text

Abstract:

On an oversaturated urban rail transit line, passengers at downstream stations have to wait for more trains until they get aboard, resulting in service imbalance problem. To improve the service quality, this paper proposes an integrated optimization approach combining the train timetabling and collaborative passenger flow control, with the aim of minimizing indicators associated with the passenger service imbalance and train loading capacity utilization. Considering train regulation constraints and passenger loading dynamics, a mixed-integer linear programming model is formulated. Based on the

APA, Harvard, Vancouver, ISO, and other styles

41

Sun and Li. "Fuzzy Programming Approaches for Modeling a Customer-Centred Freight Routing Problem in the Road-Rail Intermodal Hub-and-Spoke Network with Fuzzy Soft Time Windows and Multiple Sources of Time Uncertainty." Mathematics 7, no. 8 (2019): 739. http://dx.doi.org/10.3390/math7080739.

Full text

Abstract:

In this study, we systematically investigate a road-rail intermodal routing problem the optimization of which is oriented on the customer demands on transportation economy, timeliness and reliability. The road-rail intermodal transportation system is modelled as a hub-and-spoke network that contains time-flexible container truck services and scheduled container train services. The transportation timeliness is optimized by using fuzzy soft time windows associated with the service level of the transportation. Reliability is enhanced by considering multiple sources of time uncertainty, including

APA, Harvard, Vancouver, ISO, and other styles

42

Sannytskyi, N. M., Y. M. Hermaniuk, and T. O. Sharhun. "DEVELOPMENT OF A METHOD FOR ASSIGNING PRIVATE LOCOMOTIVES TO TRAINS." Science and Transport Progress. Bulletin of Dnipropetrovsk National University of Railway Transport, no. 6(90) (April 8, 2021): 23–32. http://dx.doi.org/10.15802/stp2020/224260.

Full text

Abstract:

Purpose. Ukraine is currently in the process of reforming the railway transportations market, which is related to the implementation of European Union Directives to its legislation. As a result of these reforms, the opening of the railway transportation market for carriers independent of Ukrzaliznytsia is envisaged. In such conditions, the problem of ensuring access of rolling stock to the receiving and departure tracks and the elimination of conflict situations with train and shunting movements of rolling stock of Ukrzaliznytsia can be solved by passing trains of independent carriers accordin

APA, Harvard, Vancouver, ISO, and other styles

43

Yan, Baicheng, Xiaoning Zhu, Li Wang, and Yimei Chang. "Integrated Scheduling of Rail-Mounted Gantry Cranes, Internal Trucks and Reach Stackers in Railway Operation Area of Container Terminal." Transportation Research Record: Journal of the Transportation Research Board 2672, no. 9 (2018): 47–58. http://dx.doi.org/10.1177/0361198118782754.

Full text

Abstract:

In this paper, the integrated scheduling of handling equipment at the railway handling area in container terminals is studied, where rail-mounted gantry cranes, internal trucks, and reach stackers are deployed. In the course of the handling operation, loading and unloading containers are handled simultaneously. The handling process is first studied and some scheduling schemes are put forward. Based on the analysis, the problem is formulated as a mixed-integer programming model, with the objectives of minimizing the makespan and the total waiting time of all equipment. Then, to solve the proble

APA, Harvard, Vancouver, ISO, and other styles

44

Gul, Rabia Noreen, Aftab Ahmad, Saqib Fayyaz, Muhammad Kashif Sattar, and Syed Saddam ul Haq. "Hybrid Flower Pollination Algorithm with Sequential Quadratic Programming Technique for Solving Dynamic Combined Economic Emission Dispatch Problem." April 2021 40, no. 2 (2021): 371–82. http://dx.doi.org/10.22581/muet1982.2102.11.

Full text

Abstract:

This paper presents the solution of highly complex, non-linear, multi-objective Dynamic Combined Economic Emission Dispatch (DCEED) problem. DCEED is a power system optimization problem with conflicting objectives of fuel cost and emission. DCEED includes constraints like valve point loading effect, Transmission Losses and Ramp Rate limits. Solution of DCEED problem is given by a novel Hybridized Flower Pollination Algorithm (FPA) with Sequential Quadratic Programming (SQP). FPA is a nature inspired population based meta-heuristic optimization technique that models its search on the flower pol

APA, Harvard, Vancouver, ISO, and other styles

45

І. Я. СКОВРОН, А. С. ДОРОШ, Є. Б. ДЕМЧЕНКО, Т. В. БОЛВАНОВСЬКА, and В. В. МАЛАШКІН. "THE EFFICIENCY IMPROVEMENT OF GROUPAGE CARGO DELIVERY BY ROAD TRANSPORT." Transport systems and transportation technologies, no. 20 (November 30, 2020): 36–44. http://dx.doi.org/10.15802/tstt2020/217400.

Full text

Abstract:

Purpose. The purpose of this article is to study the generally accepted system of transport service, improve the technology of transportation planning and optimize the process of delivery of groupage cargo from the places of their consolidation to end users (enterprises, warehouses, outlets, post offices etc.). Method. When formulating the research task, it is important to take into account the maximum number of the most important factors: the size of the transported consignments; geographical of points of goods storage and loading, as well as end users’ location; type and load capacity of rol

APA, Harvard, Vancouver, ISO, and other styles

46

Kamboh, Muhammad Iqbal, Nazri Mohd Nawi, and Radiah Bt. Mohamad. "An improved flower pollination solution for economic dispatch with valve point effect." Indonesian Journal of Electrical Engineering and Computer Science 22, no. 2 (2021): 629. http://dx.doi.org/10.11591/ijeecs.v22.i2.pp629-637.

Full text

Abstract:

<span>The economic dispatch is used to find the best optimal output of power generation at the lowest operating cost of each generator, to fulfill the requirements of the consumer. To get a practical solution, several constraints have to be considered, like transmission losses, the valve point effect, prohibited operating region, and emissions. In this research, the valve point effect is to be considered which increases the complexity of the problem due to its ripple effect on the fuel cost curve. Economic load dispatch problems are well-known optimization problems. Many classical and me

APA, Harvard, Vancouver, ISO, and other styles

47

Setiawan, Ari, and Teguh Ersada Natail Sitepu. "Scheduling Flexible Manufacturing System with Stacker Crane Using Coloured Petri Nets." Jurnal Teknik Industri 20, no. 2 (2019): 113. http://dx.doi.org/10.9744/jti.20.2.113-126.

Full text

Abstract:

Scheduling Flexible Manufacturing System (FMS) can increase production speed and accuracy. It because FMS has an ability to process various variety of product at same work station. However, FMS need efficient allocation of resources, for example: allocation of material handling equipment. This paper presents production scheduling FMS modelling to 24 jobs and 4 machines considering stacker crane. Coloured Petri Nets (CP-Nets) is the programming language which used to simulate model because it’s simplicity. This model consists two main model activities. The first one is Physical Activity (PA) wh

APA, Harvard, Vancouver, ISO, and other styles

48

Acerbi, Federica, Mirco Rampazzo, and Giuseppe De Nicolao. "An Exact Algorithm for the Optimal Chiller Loading Problem and Its Application to the Optimal Chiller Sequencing Problem." Energies 13, no. 23 (2020): 6372. http://dx.doi.org/10.3390/en13236372.

Full text

Abstract:

The optimal management of multiple chiller systems calls for the solution of the so-called optimal chiller loading (OCL) problem. Due to the interplay of continuous and logical constraints, OCL is an NP-hard problem, so that a variety of heuristic algorithms have been proposed in the literature. Herein, an algorithm for its exact solution, named X-OCL, is developed under the assumption that the chillers’ power consumption curves are quadratic. The proposed method hinges on a decomposition of the solution space so that the overall OCL problem is decomposed to a set of equality constrained quadr

APA, Harvard, Vancouver, ISO, and other styles

49

Hsu, Hsien-Pin, Chia-Nan Wang, Hsin-Pin Fu, and Thanh-Tuan Dang. "Joint Scheduling of Yard Crane, Yard Truck, and Quay Crane for Container Terminal Considering Vessel Stowage Plan: An Integrated Simulation-Based Optimization Approach." Mathematics 9, no. 18 (2021): 2236. http://dx.doi.org/10.3390/math9182236.

Full text

Abstract:

The joint scheduling of quay cranes (QCs), yard cranes (YCs), and yard trucks (YTs) is critical to achieving good overall performance for a container terminal. However, there are only a few such integrated studies. Especially, those who have taken the vessel stowage plan (VSP) into consideration are very rare. The VSP is a plan assigning each container a stowage position in a vessel. It affects the QC operations directly and considerably. Neglecting this plan will cause problems when loading/unloading containers into/from a ship or even congest the YT and YC operations in the upstream. In this

APA, Harvard, Vancouver, ISO, and other styles

50

Ghadiri Nejad, Mazyar, Hüseyin Güden, Béla Vizvári, and Reza Vatankhah Barenji. "A mathematical model and simulated annealing algorithm for solving the cyclic scheduling problem of a flexible robotic cell." Advances in Mechanical Engineering 10, no. 1 (2018): 168781401775391. http://dx.doi.org/10.1177/1687814017753912.

Full text

Abstract:

Flexible robotic cells are used to produce standardized items at a high production speed. In this study, the scheduling problem of a flexible robotic cell is considered. Machines are identical and parallel. In the cell, there is an input and an output buffer, wherein the unprocessed and the finished items are kept, respectively. There is a robot performing the loading/unloading operations of the machines and transporting the items. The system repeats a cycle in its long run. It is assumed that each machine processes one part in each cycle. The cycle time depends on the order of the actions. Th

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!