This page has only limited features, please log in for full access.
Within the area of regional port clusters, this paper establishes a multi-period mixed integer programming model to optimize the empty container repositioning between public hinterlands and ports, comprehensively considering the quantitative and periodic inventory control strategy. By using Markov decision process combined with dynamic programming method, this paper dynamically optimizes the empty container inventory threshold (D;U) under quantitative strategy and S under periodical strategy at each port within the regional port clusters. On this basis, this paper optimizes the empty container repositioning scheme between public hinterlands and ports. Meanwhile, Liaoning coastal regional port cluster and its northeast hinterland are selected as the objects to solve this model and the results show that the total cost of shipping company can be saved by 14.16% and 11.92% respec- tively by the quantitative and periodical inventory control strategy. Selecting the quantity of public hinterland terminals, the empty container demand of public hinterland terminals and ports, the inventory threshold of empty containers and other factors, this paper carries on the sensitivity analysis. This paper validates inventory control strategy can weaken the shipping company in the influence of the external environment changes. And the quantitativeinventory control strategy can reduce the total cost value to a greater extent and more effective in cost control than periodical strategy.
Jiaxin Cai; Yubo Li; Yandong Yin; Xiaohan Wang; Zhihong Jin. Optimization on the Multi-period Empty Container Repositioning Problem in Regional Port Cluster Based upon Inventory Control Strategies. 2021, 1 .
AMA StyleJiaxin Cai, Yubo Li, Yandong Yin, Xiaohan Wang, Zhihong Jin. Optimization on the Multi-period Empty Container Repositioning Problem in Regional Port Cluster Based upon Inventory Control Strategies. . 2021; ():1.
Chicago/Turabian StyleJiaxin Cai; Yubo Li; Yandong Yin; Xiaohan Wang; Zhihong Jin. 2021. "Optimization on the Multi-period Empty Container Repositioning Problem in Regional Port Cluster Based upon Inventory Control Strategies." , no. : 1.
The Belt and Road initiative (BRI) is committed to strengthening the connectivity among countries and building a comprehensive transport network. The China Railway Express (CR Express) as an important part of the BRI has become a new type of intercontinental trade transport mode between Asia and Europe. With the development of the CR Express, China’s coastal ports have become the transfer hub connecting the CR Express with other Asian countries. In this paper, an intermodal container terminal system composed of a maritime container terminal and a railway container terminal is studied. The system consists of railway and truck as two kinds of distribution modes, which is considered as the dual-channel supply chain system. This paper explores the Markov process used in that supply chain system to study the intermodal container terminal system. Numerical analysis manifests the influence of the railway distribution rate. The result shows that cooperation strategy can help to make better use of the reserved terminal and reduce the expected storage time. The cooperation strategy is beneficial to both the terminal operators and the consigners.
Cuijie Diao; Shujuan Guo; Gang Li; Xiaohan Wang; Zhihong Jin. Integrated Planning for the Intermodal Container Terminals of the CR Express based on Markov Process. LISS 2020 2021, 495 -507.
AMA StyleCuijie Diao, Shujuan Guo, Gang Li, Xiaohan Wang, Zhihong Jin. Integrated Planning for the Intermodal Container Terminals of the CR Express based on Markov Process. LISS 2020. 2021; ():495-507.
Chicago/Turabian StyleCuijie Diao; Shujuan Guo; Gang Li; Xiaohan Wang; Zhihong Jin. 2021. "Integrated Planning for the Intermodal Container Terminals of the CR Express based on Markov Process." LISS 2020 , no. : 495-507.
Long queues of arrival trucks are a common problem in seaports, and thus, carbon emissions generated from trucks in the queue cause environmental pollution. In order to relieve gate congestion and reduce carbon emissions, this paper proposes a lane allocation framework combining the truck appointment system (TAS) for four types of trucks. Based on the distribution of arrival times obtained from the TAS, lane allocation decisions in each appointment period are determined in order to minimize the total cost, including the operation cost and carbon emissions cost. The resultant optimization model is a non-linear fractional integer program. This model was firstly transformed to an equivalent integer program with bilinear constraints. Then, an improved branch-and-bound algorithm was designed, which includes further transforming the program into a linear program using the McCormick approximation method and iteratively generating a tighter outer approximation along the branch-and-bound procedure. Numerical studies confirmed the validity of the proposed model and algorithm, while demonstrating that the lane allocation decisions could significantly reduce carbon emissions and operation costs.
Zhihong Jin; Xin Lin; Linlin Zang; Weiwei Liu; Xisheng Xiao. Lane Allocation Optimization in Container Seaport Gate System Considering Carbon Emissions. Sustainability 2021, 13, 3628 .
AMA StyleZhihong Jin, Xin Lin, Linlin Zang, Weiwei Liu, Xisheng Xiao. Lane Allocation Optimization in Container Seaport Gate System Considering Carbon Emissions. Sustainability. 2021; 13 (7):3628.
Chicago/Turabian StyleZhihong Jin; Xin Lin; Linlin Zang; Weiwei Liu; Xisheng Xiao. 2021. "Lane Allocation Optimization in Container Seaport Gate System Considering Carbon Emissions." Sustainability 13, no. 7: 3628.
This paper investigates the Inland Container Transportation (ICT) problem with carbon dioxide emissions. The separation mode that the tractor and semi-trailer could be detached and it permits multitasking to reduce fuel and carbon emission costs. A mixed-integer programming model with Full-Empty container integration has been built. An improved ant colony optimization with two-dimensional variable matrix encoding and Infeasible-Arc filtration strategy has been proposed. Numerical experiments with different scales and characteristics are simulated and validated in order to demonstrate the effectiveness of the proposed algorithm. The comparison result indicates the excellent stability for our approach with different task characteristic distribution.
Wenqing He; Zhihong Jin; Ying Huang; Shida Xu. The Inland Container Transportation Problem with Separation Mode Considering Carbon Dioxide Emissions. Sustainability 2021, 13, 1573 .
AMA StyleWenqing He, Zhihong Jin, Ying Huang, Shida Xu. The Inland Container Transportation Problem with Separation Mode Considering Carbon Dioxide Emissions. Sustainability. 2021; 13 (3):1573.
Chicago/Turabian StyleWenqing He; Zhihong Jin; Ying Huang; Shida Xu. 2021. "The Inland Container Transportation Problem with Separation Mode Considering Carbon Dioxide Emissions." Sustainability 13, no. 3: 1573.
In order to reduce the total cost of empty container repositioning, a multi-period empty container repositioning optimization model of the China Railway Express was established by using distributed robust chance-constrained programming based on partial information such as mean and variance of demand. This established model considered sea-land intermodal transportation, uncertain empty container demand and foldable containers. To simplify the model, the distributed robust chance constraints were transformed into equivalent ones that could be easily solved, and the empty container demands were determined. Numerical experiments were carried out to analyze the influence of different parameters on the total cost. The results showed that the total cost could be greatly reduced by sea-land intermodal transportation. Using foldable containers could reduce the total cost of empty container repositioning. With the improvement of service level, the numbers of empty container repositioning increased owing to the distributional robust chance constraints. When standard and foldable containers were used simultaneously, the total cost could be greatly reduced by appropriately using foldable containers under three different supply–demand relationships of containers. The optimization results may provide a greatly feasible reference for the decision makers of the China Railway Express.
Lei Xing; Qi Xu; Jiaxin Cai; Zhihong Jin. Distributed Robust Chance-Constrained Empty Container repositioning Optimization of the China Railway Express. Symmetry 2020, 12, 706 .
AMA StyleLei Xing, Qi Xu, Jiaxin Cai, Zhihong Jin. Distributed Robust Chance-Constrained Empty Container repositioning Optimization of the China Railway Express. Symmetry. 2020; 12 (5):706.
Chicago/Turabian StyleLei Xing; Qi Xu; Jiaxin Cai; Zhihong Jin. 2020. "Distributed Robust Chance-Constrained Empty Container repositioning Optimization of the China Railway Express." Symmetry 12, no. 5: 706.
To relieve pressure from large vessels and intensive arrival of trucks, an increasing number of marine terminals require trucks to make appointments prior to delivering containers. The quotas are supposed not to impede truck deliveries but should be sufficiently used. For terminals where trucks are allowed to make appointments and arrive on the same day, a critical problem is the simultaneous allocation of appointment quotas and yard cranes. A bi-objective integer model is set up to balance the trade-off between terminals and trucks. A three-dimensional quota is used for characterizing the variabilities in delivery operation. It also overcomes the challenges involved, including the inside workload, and the yard closing deadline. A non-dominated genetic algorithm II-based approach is developed to solve the problem. The method is validated through extensive numerical experiments, and the results show the advantages of simultaneously balancing the workload of yard cranes instead of merely smoothing truck arrivals. Parameter analysis then reveals the influence of both larger vessel size and an increase in trade, as well as the utility ratio of quotas.
Na Li; Gang Chen; ManWo Ng; Wayne K. Talley; Zhihong Jin. Optimized appointment scheduling for export container deliveries at marine terminals. Maritime Policy & Management 2019, 47, 456 -478.
AMA StyleNa Li, Gang Chen, ManWo Ng, Wayne K. Talley, Zhihong Jin. Optimized appointment scheduling for export container deliveries at marine terminals. Maritime Policy & Management. 2019; 47 (4):456-478.
Chicago/Turabian StyleNa Li; Gang Chen; ManWo Ng; Wayne K. Talley; Zhihong Jin. 2019. "Optimized appointment scheduling for export container deliveries at marine terminals." Maritime Policy & Management 47, no. 4: 456-478.
The beam-type placement machine is capable of picking up multiple components simultaneously from the feeders in printed circuit board (PCB) assembly. Simultaneous pickup occurs only if the heads in the beam are aligned with the feeders and the nozzle-types on these heads match with the component-types on the feeders. In order to minimise the assembly cycle time, the optimisation problem is decomposed into two sub-problems, the pickup combination and sequencing problem, and the placement cluster and sequencing problem. These two sub-problems are simultaneously solved by the proposed hybrid genetic algorithm (HGA). The pickup combination and sequencing problem is similar to the popular multi-compartment vehicle routing problem (MCVRP); a genetic algorithm (GA) for the MCVRP is therefore modified and applied to solving the pickup combination and sequencing problem. A greedy heuristic algorithm is used to solve the placement cluster and sequencing problem. The numerical experiments reveal that the HGA outperforms the algorithms proposed by previous papers.
Shujuan Guo; Fei Geng; Katsuhiko Takahashi; Xiaohan Wang; Zhihong Jin. A MCVRP-based model for PCB assembly optimisation on the beam-type placement machine. International Journal of Production Research 2018, 57, 5874 -5891.
AMA StyleShujuan Guo, Fei Geng, Katsuhiko Takahashi, Xiaohan Wang, Zhihong Jin. A MCVRP-based model for PCB assembly optimisation on the beam-type placement machine. International Journal of Production Research. 2018; 57 (18):5874-5891.
Chicago/Turabian StyleShujuan Guo; Fei Geng; Katsuhiko Takahashi; Xiaohan Wang; Zhihong Jin. 2018. "A MCVRP-based model for PCB assembly optimisation on the beam-type placement machine." International Journal of Production Research 57, no. 18: 5874-5891.
Container inventory imbalance (or under / over balanced, i.e. one carrier can be in an excess situation while the other will be in deficit) is a severe problem that adds a substantial expense on ocean freight. The ocean containers are built for continuous transportation with cargo. However, due to the imbalance in world trade and other inherent characteristics of shipping the import volumes and export volumes of laden containers in a port are not equal. This variation leads carriers reposition empty containers from excess ports to elsewhere that the empty containers are in demand. If carriers retain containers in a port pending exports demands the sole purpose of containers cannot be met. Thus, it may add storage cost and wear and tear that makes the container shipping uneconomical. This paper appraises the potential of the container exchange and its practical aspects using real container data. Further, it focuses on several factors that may influence container exchange among carriers. Finally, it concludes that the organizational factors play the key role in container exchange thus recommends for further research based on statistical analysis of this paper.
Lalith Edirisinghe; Zhihong Jin; Aw Wijeratne; Jin Zhihong; Wijewardena Mawatha. The reality of container exchange between shipping lines: Clearing the pathway to virtual container yard. Transport Policy 2018, 72, 55 -66.
AMA StyleLalith Edirisinghe, Zhihong Jin, Aw Wijeratne, Jin Zhihong, Wijewardena Mawatha. The reality of container exchange between shipping lines: Clearing the pathway to virtual container yard. Transport Policy. 2018; 72 ():55-66.
Chicago/Turabian StyleLalith Edirisinghe; Zhihong Jin; Aw Wijeratne; Jin Zhihong; Wijewardena Mawatha. 2018. "The reality of container exchange between shipping lines: Clearing the pathway to virtual container yard." Transport Policy 72, no. : 55-66.
Due to the increase of container transport volume and the limitation of yard resources, yard congestions in container terminal have become increasingly serious. Therefore, it is necessary to optimize the problem of container allocation and yard crane deployment for import containers. With the extensive application of truck appointment system, yard resources allocation could be performed based on the appointment application submitted by shippers or trucking companies. Taking the information of truck appointment system and arrival period of vessels into account, a two-stage programming model is proposed. The container allocation problem is solved to balance the workload among different blocks in first stage, while the second stage aims to minimize the total shifting distance of yard cranes. Then, solver CPLEX is used to provide optimal solution for numerical experiments. It is concluded from experiments that the proposed mode is efficient in reducing the yard congestion by balancing the workload among blocks and decreasing the shifting distance of yard cranes, thus improving both the operational efficiency of yard and the accuracy of resources allocation.
Huiyun Yang; Li Wang; Qi Xu; Zhihong Jin. Collaborative optimization of container allocation and yard crane deployment based on truck appointment system. Journal of Physics: Conference Series 2018, 1074, 012185 .
AMA StyleHuiyun Yang, Li Wang, Qi Xu, Zhihong Jin. Collaborative optimization of container allocation and yard crane deployment based on truck appointment system. Journal of Physics: Conference Series. 2018; 1074 (1):012185.
Chicago/Turabian StyleHuiyun Yang; Li Wang; Qi Xu; Zhihong Jin. 2018. "Collaborative optimization of container allocation and yard crane deployment based on truck appointment system." Journal of Physics: Conference Series 1074, no. 1: 012185.
The vigorous development of O2O e-commerce promote the appearance of many small orders, increasing the stresses on logistics operators to carry out city distribution. However, a crowdsourcing joined to release these stresses is a new try and become more popular. This paper focuses on matching of the crowds and tasks from crowdsourcing platform for city distribution. To address exploring the impact of time, space and efficiency on the task matching in crowdsourcing platform, a bi-objective matching and differentiated pricing model creates to achieve the highest efficiency and the lowest total cost in urban distribution system. For solving the model, a two-dimensional and multi-stage roulette algorithm has been designed, with combining modeling and simulation method. The proposed method takes full use of economic development of the region where the task is located and the space-time efficient distance and space-time reachable distance. To illustrate the effectiveness and validity of the proposed method, a sample test is conducted with the actual operating data of a company in the PRD region, and the results show that 719 tasks out of 746 matching pairs are executed, the task matching rate is 89.4%, the completion rate is 86.1% and the total task price 39140 RMBs. Compared with the original matching situation, the total price increases at 3.90%, while the task completion rate is improved at 37.7%, which greatly enhance the efficiency of crowdsourcing platform member matching. The matching of the participants and tasks of the city distribution crowdsourcing platform, which combines with the measurement of differential pricing and crowds’ credibility, can be applied in this problem successfully.
Xin Lin; Yu-Hang Chen; Lu Zhen; Zhi-Hong Jin; Zhan Bian. A Crowdsourcing Matching and Pricing Strategy in Urban Distribution System. Blockchain Technology and Innovations in Business Processes 2018, 407 -417.
AMA StyleXin Lin, Yu-Hang Chen, Lu Zhen, Zhi-Hong Jin, Zhan Bian. A Crowdsourcing Matching and Pricing Strategy in Urban Distribution System. Blockchain Technology and Innovations in Business Processes. 2018; ():407-417.
Chicago/Turabian StyleXin Lin; Yu-Hang Chen; Lu Zhen; Zhi-Hong Jin; Zhan Bian. 2018. "A Crowdsourcing Matching and Pricing Strategy in Urban Distribution System." Blockchain Technology and Innovations in Business Processes , no. : 407-417.
Disruption often occurs in both land-side and sea-side operations at a container terminal, causing substantial interference of scheduled operations and poor green performance. The land-side disruption is rarely researched, and this paper addresses the ordinary level of such disruption where typically some truck arrivals deviate from their schedule in the appointment system. The aim is to find a response strategy that can maintain high resilience ability of the system in neutralizing the impact of disruptions. First, we consider different levels of late or early arrivals, as well as non-appointed arrivals at a container terminal that is running an appointment system. Second, we propose some response strategies to cope with different levels of disruptions, and evaluate their resilience ability with two Key Performance Indicators (KPIs): total waiting time of on-time trucks and total idling emissions of all trucks, in order to balance the service quality to punctual arrivals and green performance of the whole system. Third, we conduct a sensitivity analysis using a discrete event simulation to understand the performance of the proposed strategies. Considering both KPIs, the best strategy in most scenarios is a combined one based on priority and yard-crane moving distance; its performance depends primarily on the concentration level of container locations and secondly on the system utilization. In the other scenarios that have low arrival punctuality, the best strategy could focus purely on yard-crane moving distance, especially when the first KPI is given lower weight than the second one.
Na Li; Gang Chen; Kannan Govindan; Zhihong Jin. Disruption management for truck appointment system at a container terminal: A green initiative. Transportation Research Part D: Transport and Environment 2018, 61, 261 -273.
AMA StyleNa Li, Gang Chen, Kannan Govindan, Zhihong Jin. Disruption management for truck appointment system at a container terminal: A green initiative. Transportation Research Part D: Transport and Environment. 2018; 61 ():261-273.
Chicago/Turabian StyleNa Li; Gang Chen; Kannan Govindan; Zhihong Jin. 2018. "Disruption management for truck appointment system at a container terminal: A green initiative." Transportation Research Part D: Transport and Environment 61, no. : 261-273.
The expansion of high-speed rail (HSR) service is often regarded as a potentially effective, lower-carbon substitute for intercity air travel. It is experiencing unprecedented development and growth in China; however, its impact on the air market is yet to be investigated. An ex post analysis of the influence of HSR and low-cost carriers on air pricing and demand is carried out in this study by considering 23 city pairs with different lengths using panel data, of which 14 city pairs face HSR competition and 7 city pairs have low cost airlines operating. Our findings reveals that inter and intra modal competition can induce airlines to reduce fares, and a higher on time rate can lead to higher air fares. We also find that higher HSR frequencies and longer air travel time can result in reduction in air travel demand, whereas low-cost carriers have led to a modest increase in air traffic. These results have significant implications on future transport policy.
Rui Zhang; Zaili Yang; Weixin Luan; Zhihong Jin. The Impact of High-Speed Rail and Low-Cost Carriers on China’s Air Market. CICTP 2017 2018, 1 .
AMA StyleRui Zhang, Zaili Yang, Weixin Luan, Zhihong Jin. The Impact of High-Speed Rail and Low-Cost Carriers on China’s Air Market. CICTP 2017. 2018; ():1.
Chicago/Turabian StyleRui Zhang; Zaili Yang; Weixin Luan; Zhihong Jin. 2018. "The Impact of High-Speed Rail and Low-Cost Carriers on China’s Air Market." CICTP 2017 , no. : 1.
This chapter systematically applies modern heuristics to solve multi-criteria decision making problems in the fields of container terminal, which consists of three geographically interrelated core areas: container terminal, anchorage ground on its sea side, and gateway on its land side. For the container terminal, the container loading sequence problem is considered and a hybrid dynamic programming approach is proposed. The considered problem aims at obtaining an optimized container loading sequence for a crane to retrieve all the containers from the yard to the ship. The proposed dynamic algorithms consist of two phases. A heuristic algorithm is developed to retrieve the containers subset which needs no relocation and may be loaded directly onto the ship at the first phase, and a dynamic programming with heuristic rules is applied to solve the loading sequence problem for the rest of the containers at the second phase. For the anchorage ground on the sea side of a container terminal, the tugboat scheduling problem is formulated as a multiprocessor tasks scheduling problem after analyzing the characteristics of tugboat operation. The model considers factors of multi-anchorage bases and three stages of operations (berthing/shifting-berth/unberthing). The objective is to minimize the total operation times for all tugboats and the waste of the tugboats horsepower in use at the same time. A hybrid simulated annealing algorithm is proposed to solve the addressed problem. For the gateway on the land side of a container terminal, resource deployment for truck appointment system on container terminals is solved as an optimization problem. A bi-objective model is set up to minimize resource input and balance workloads. Modern heuristics method based on non-dominated genetic algorithmII is proposed to solve difficulties of simultaneous optimization of resource input and appointment quotas. Three chromosomes representing quotas, yard cranes and gate lanes are set up, some of which are two dimensional. Numerical experiments are untaken to evaluate the effectiveness of the proposed algorithms and show the efficiency of the proposed algorithm. The three parts analyzed above cover all the core elements of modern heuristics of MCDM for the operation optimization in a container terminal from a container terminal to both its land side and its sea side.
Zhihong Jin; Na Li; Qi Xu; Zhan Bian. Modern Heuristics of MCDM for the Operation Optimization in Container Terminals. Handbook of Healthcare Logistics 2017, 271 -322.
AMA StyleZhihong Jin, Na Li, Qi Xu, Zhan Bian. Modern Heuristics of MCDM for the Operation Optimization in Container Terminals. Handbook of Healthcare Logistics. 2017; ():271-322.
Chicago/Turabian StyleZhihong Jin; Na Li; Qi Xu; Zhan Bian. 2017. "Modern Heuristics of MCDM for the Operation Optimization in Container Terminals." Handbook of Healthcare Logistics , no. : 271-322.
Making operational plans for Yard Cranes (YCs) to enhance port efficiency has become vital issues for the container terminals. This paper discusses the load-scheduling problem of multiple YCs. The problem is to schedule two YCs at different container blocks, which serve the loading operations of one quay crane so as to minimize the total distance of visiting paths and the make-span at stack area. We consider the container handling time, the YC visiting time, and the waiting time of each YC when evaluating the make-span of the loading operation by YCs. Both the container bay visiting sequences and the number of containers picked up at each visit of the two YCs are determined simultaneously. A mathematical model, which considers interference between adjacent YCs, is provided by means of time-space network to formulate the problem and a two-stage hybrid algorithm composed of greedy algorithm and dynamic programming is developed to solve the proposed model. Numerical experiments were conducted to compare performances of the algorithm in this study with actual scheduling rules.
Zhan Bian; Qi Xu; Na Li; Zhihong Jin. Scheduling for yard cranes based on two-stage hybrid dynamic programming. Transport 2016, 33, 408 -417.
AMA StyleZhan Bian, Qi Xu, Na Li, Zhihong Jin. Scheduling for yard cranes based on two-stage hybrid dynamic programming. Transport. 2016; 33 (2):408-417.
Chicago/Turabian StyleZhan Bian; Qi Xu; Na Li; Zhihong Jin. 2016. "Scheduling for yard cranes based on two-stage hybrid dynamic programming." Transport 33, no. 2: 408-417.
Rui Zhang; Zhihong Jin; Yu Ma; Weixin Luan. Optimization for two-stage double-cycle operations in container terminals. Computers & Industrial Engineering 2015, 83, 316 -326.
AMA StyleRui Zhang, Zhihong Jin, Yu Ma, Weixin Luan. Optimization for two-stage double-cycle operations in container terminals. Computers & Industrial Engineering. 2015; 83 ():316-326.
Chicago/Turabian StyleRui Zhang; Zhihong Jin; Yu Ma; Weixin Luan. 2015. "Optimization for two-stage double-cycle operations in container terminals." Computers & Industrial Engineering 83, no. : 316-326.
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 follows: at the first phase, a heuristic algorithm is developed to retrieve the containers subset which needs no relocation and may be loaded directly onto the ship; at the second phase, a dynamic programming with heuristic rules is applied to solve the loading sequence problem for the rest of the containers. Numerical experiments showed the effectiveness and practicability of the model and the algorithm by comparing with the loading proposals from an existing research and actual rules respectively.
Zhan Bian; Qianqian Shao; Zhihong Jin. OPTIMIZATION ON THE CONTAINER LOADING SEQUENCE BASED ON HYBRID DYNAMIC PROGRAMMING. Transport 2015, 31, 440 -449.
AMA StyleZhan Bian, Qianqian Shao, Zhihong Jin. OPTIMIZATION ON THE CONTAINER LOADING SEQUENCE BASED ON HYBRID DYNAMIC PROGRAMMING. Transport. 2015; 31 (4):440-449.
Chicago/Turabian StyleZhan Bian; Qianqian Shao; Zhihong Jin. 2015. "OPTIMIZATION ON THE CONTAINER LOADING SEQUENCE BASED ON HYBRID DYNAMIC PROGRAMMING." Transport 31, no. 4: 440-449.
In order to meet the cargo demands of Ro-Ro and Drayage transportation in Liaoning, Shandong and their surrounding areas, this paper plans a Ro-Ro and Drayage transportation corridor between Shandong and Liaoning. Combining the factors that affect the planning of transportation corridor, this paper firstly uses the Fuzzy C-means Clustering method that is based on the objective function. Secondly, this paper establishes a model of transportation corridor planning and analyzes the fuzzy clustering of the ports and their hinterland. Finally, the paper concludes that the Weifang and Yingkou ports are suitable for the Ro-Ro and drayage transportation of cargos in Bohai Bay. Based on the result of clustering, the corridors between Shandong and Liaoning are constructed, which can provide a reference for the planning and construction of the Ro-Ro and Drayage transportation corridors.
Guangmin Yang; Zongxing Chen; Qi Xu; Zhihong Jin. Planning for the Ro-Ro and Drayange Transportation Corridor between Shangdong and Liaoning Based on Fuzzy C-Means Clustering. ICLEM 2014 2014, 381 -389.
AMA StyleGuangmin Yang, Zongxing Chen, Qi Xu, Zhihong Jin. Planning for the Ro-Ro and Drayange Transportation Corridor between Shangdong and Liaoning Based on Fuzzy C-Means Clustering. ICLEM 2014. 2014; ():381-389.
Chicago/Turabian StyleGuangmin Yang; Zongxing Chen; Qi Xu; Zhihong Jin. 2014. "Planning for the Ro-Ro and Drayange Transportation Corridor between Shangdong and Liaoning Based on Fuzzy C-Means Clustering." ICLEM 2014 , no. : 381-389.
In view of the situation of urban distribution, the dynamic vehicle routing problem - in which the information keeps changing during the distribution process - is studied. Various kinds of real-time factors are analyzed. By introducing virtual customers, the paper converts the dynamic vehicle routing problem into the classic single-type static vehicle routing problem and proposes a model based on natural description. A two-stage solving strategy is put forward, and a hybrid genetic algorithm is constructed. Numerical experiment results show that the model and algorithm can effectively reduce the distribution cost.
Pingzhong Lai; Ting Zhang; Zhan Bian; Zhihong Jin. Dynamic Vehicle Routing Optimization on Urban Distribution with Real-Time Information. ICLEM 2014 2014, 1396 -1402.
AMA StylePingzhong Lai, Ting Zhang, Zhan Bian, Zhihong Jin. Dynamic Vehicle Routing Optimization on Urban Distribution with Real-Time Information. ICLEM 2014. 2014; ():1396-1402.
Chicago/Turabian StylePingzhong Lai; Ting Zhang; Zhan Bian; Zhihong Jin. 2014. "Dynamic Vehicle Routing Optimization on Urban Distribution with Real-Time Information." ICLEM 2014 , no. : 1396-1402.
Based on the given information of the container storage situation in the container yard and container ship stowage plan, the container loading sequence problem was discussed. Considering the actual constraints, (i.e., customs examination), a mixed integer programming model was proposed by minimizing the number of relocations during the loading process. Furthermore, a heuristic algorithm was developed. Numerical simulations showed the effectiveness and practicality of both the model and the algorithm.
Hui Lan; Zhan Bian; Zhihong Jin. Optimization of the Container Loading Sequences Based on Actual Constraints. ICLEM 2014 2014, 989 -994.
AMA StyleHui Lan, Zhan Bian, Zhihong Jin. Optimization of the Container Loading Sequences Based on Actual Constraints. ICLEM 2014. 2014; ():989-994.
Chicago/Turabian StyleHui Lan; Zhan Bian; Zhihong Jin. 2014. "Optimization of the Container Loading Sequences Based on Actual Constraints." ICLEM 2014 , no. : 989-994.
Arranging the retrieving sequence and making the operational plans for gantry cranes to enhance port efficiency have become vital issues for the container terminals. In this paper, the problem of retrieving containers from a yard in a given sequence is discussed as an important part of the ship-loading process. This problem is divided into three categories according to its optimization complexity, i.e., the retrieval problem of a crane with a single spreader (ACSS), the retrieval problem of a crane with multiple spreaders (ACMS), and the retrieval problem of multiple cranes with a single spreader (MCSS). Firstly, heuristic algorithms are proposed to develop a retrieving sequence for ACSS to reduce the operational time. Then, optimizing the assignment to multiple spreaders is conducted by exchanging the movements of the obtained retrieving sequence. Finally, the movements are further assigned to two cranes and integrated with the MCSS retrieval problem mentioned above. The numerical experiments show the effectiveness and practicability of the heuristic algorithms.
Zhan Bian; Na Li; Xiang-Jun Li; Zhi-Hong Jin. Operations scheduling for rail mounted gantry cranes in a container terminal yard. Journal of Shanghai Jiaotong University (Science) 2014, 19, 337 -345.
AMA StyleZhan Bian, Na Li, Xiang-Jun Li, Zhi-Hong Jin. Operations scheduling for rail mounted gantry cranes in a container terminal yard. Journal of Shanghai Jiaotong University (Science). 2014; 19 (3):337-345.
Chicago/Turabian StyleZhan Bian; Na Li; Xiang-Jun Li; Zhi-Hong Jin. 2014. "Operations scheduling for rail mounted gantry cranes in a container terminal yard." Journal of Shanghai Jiaotong University (Science) 19, no. 3: 337-345.