This page has only limited features, please log in for full access.
China Railway Express (CR Express) is a pioneer of the Silk Road Economic Belt and the 21st Century Maritime Silk Road. The intermodal container terminal system consisting of a maritime terminal and a railway terminal is investigated in this paper. It connects the shipping route and the CR Express route. Typically, there are two container accumulation modes in the railway terminal to dispatch a train, i.e., the fixed-length and the fixed-time container accumulation modes. The intermodal container terminal system can be formulated as the two-echelon dual-channel supply chain model. The steady-state probability matrix is obtained by solving the equilibrium equations. The cooperation between the maritime terminal and the railway terminal is considered to accelerate the accumulation of the containers. The total revenue of the two terminals is used as the key system performance indicator. Numerical experiments are conducted to compare the fixed-length and the fixed-time container accommodation modes. The situations with and without cooperation between two terminals are also compared in the two container accumulation modes, respectively.
Shujuan Guo; Cuijie Diao; Gang Li; Katsuhiko Takahashi. The Two-Echelon Dual-Channel Models for the Intermodal Container Terminals of the China Railway Express Considering Container Accumulation Modes. Sustainability 2021, 13, 2806 .
AMA StyleShujuan Guo, Cuijie Diao, Gang Li, Katsuhiko Takahashi. The Two-Echelon Dual-Channel Models for the Intermodal Container Terminals of the China Railway Express Considering Container Accumulation Modes. Sustainability. 2021; 13 (5):2806.
Chicago/Turabian StyleShujuan Guo; Cuijie Diao; Gang Li; Katsuhiko Takahashi. 2021. "The Two-Echelon Dual-Channel Models for the Intermodal Container Terminals of the China Railway Express Considering Container Accumulation Modes." Sustainability 13, no. 5: 2806.
The integrated allocation and scheduling of handling resources are crucial problems in the railway container terminal (RCT). We investigate the integrated optimization problem for handling resources of the crane area, dual-gantry crane (GC), and internal trucks (ITs). A creative handling scheme is proposed to reduce the long-distance, full-loaded movement of GCs by making use of the advantages of ITs. Based on this scheme, we propose a flexible crossing crane area to balance the workload of dual-GC. Decomposing the integrated problem into four sub-problems, a multi-objective mixed-integer programming model (MIP) is developed. By analyzing the characteristic of the integrated problem, a three-layer hybrid heuristic algorithm (TLHHA) incorporating heuristic rule (HR), elite co-evolution genetic algorithm (ECEGA), greedy rule (GR), and simulated annealing (SA) is designed for solving the problem. Numerical experiments were conducted to verify the effectiveness of the proposed model and algorithm. The results show that the proposed algorithm has excellent searching ability, and the simultaneous optimization scheme could ensure the requirements for efficiency, effectiveness, and energy-saving, as well as the balance rate of dual-GC.
Gang Ren; Xiaohan Wang; Jiaxin Cai; Shujuan Guo. Allocation and Scheduling of Handling Resources in the Railway Container Terminal Based on Crossing Crane Area. Sustainability 2021, 13, 1190 .
AMA StyleGang Ren, Xiaohan Wang, Jiaxin Cai, Shujuan Guo. Allocation and Scheduling of Handling Resources in the Railway Container Terminal Based on Crossing Crane Area. Sustainability. 2021; 13 (3):1190.
Chicago/Turabian StyleGang Ren; Xiaohan Wang; Jiaxin Cai; Shujuan Guo. 2021. "Allocation and Scheduling of Handling Resources in the Railway Container Terminal Based on Crossing Crane Area." Sustainability 13, no. 3: 1190.
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.
The joint distribution mode has become a new optimization mode of distribution at present, this paper considered the carbon emission and customer urgency in the joint distribution vehicle scheduling optimization. Carbon emission calculation was based on speed and speed became decision variable. Customer urgency was defined according to the relaxability of time window. A mixed integer programming model was established with the objective of minimizing the cost. According to the characteristics of the model, this paper designed a hybrid simulated annealing algorithm to solve the problem. The numerical experiments show that joint distribution mode is better than the single distribution mode in the total cost and carbon emissions cost. Under the same example, the optimized speed can reduce the total cost and the cost of carbon emission drastically for the two distribution modes. The main reason is that the speed can be adjusted to meet the customer time window constraint, achieving to minimize the total cost and carbon emission cost.
Lei Xing; Zhenhua Yang; Shujuan Guo; Zhihong Jin. Vehicle scheduling optimization in joint distribution considering carbon emission and customer urgency. 2016 International Conference on Logistics, Informatics and Service Sciences (LISS) 2016, 1 -6.
AMA StyleLei Xing, Zhenhua Yang, Shujuan Guo, Zhihong Jin. Vehicle scheduling optimization in joint distribution considering carbon emission and customer urgency. 2016 International Conference on Logistics, Informatics and Service Sciences (LISS). 2016; ():1-6.
Chicago/Turabian StyleLei Xing; Zhenhua Yang; Shujuan Guo; Zhihong Jin. 2016. "Vehicle scheduling optimization in joint distribution considering carbon emission and customer urgency." 2016 International Conference on Logistics, Informatics and Service Sciences (LISS) , no. : 1-6.
In the tractor-and-trailer transportation system, empty trailers always need to be dispatched insides owing to their same nature and uneven distribution of cargoes. Hence, they are also scheduling objects, as well as laden trailers. Compared with laden-trailer tasks whose origin and destination (OD) are clear, we can only know overall empty trailers' supply and demand, while specific OD are uncertain. Meanwhile, all tasks are required to be executed within a certain time span (time windows). Taking time windows into account, we develop an optimization model on the tractor-and-trailer transportation scheduling with uncertain empty-trailer tasks in road network, and design two-stage heuristic algorithm to solve it, where we raised four algorithms. In the first stage we aim to determine empty-trailer tasks and put forward two policies: (1) minimizing distance of transporting empty trailers; (2) minimizing the total surplus of laden-trailer tasks' OD. In the second stage we aim to schedule all tasks and another two policies were raised: minimum distance and minimum violation of time windows. Four numerical examples based on a practical operation are conducted. The first example shows that the four algorithms are superior to Simulated Annealing Algorithm to solve the problem. In the second example, when time windows width vary, Minimum Surplus Minimum Distance (MSMD) strategy performs best in accuracy. The third example demonstrates the stability of all four algorithms. In the last one, when the number of empty-trailer tasks varies, MSMD still shows obvious advantage in accuracy. Therefore, MSMD is proved to be an effective heuristic algorithm to solve this problem. Our study can be used in the actual truck-and-trailer transportation system with more reasonable decision support.
Zhenhua Yang; Lei Xing; Shujuan Guo; Lixin Shen; Zhihong Jin. An effective heuristic algorithm to solve tractor-and-trailer transportation scheduling problem with time windows. 2016 International Conference on Logistics, Informatics and Service Sciences (LISS) 2016, 1 -10.
AMA StyleZhenhua Yang, Lei Xing, Shujuan Guo, Lixin Shen, Zhihong Jin. An effective heuristic algorithm to solve tractor-and-trailer transportation scheduling problem with time windows. 2016 International Conference on Logistics, Informatics and Service Sciences (LISS). 2016; ():1-10.
Chicago/Turabian StyleZhenhua Yang; Lei Xing; Shujuan Guo; Lixin Shen; Zhihong Jin. 2016. "An effective heuristic algorithm to solve tractor-and-trailer transportation scheduling problem with time windows." 2016 International Conference on Logistics, Informatics and Service Sciences (LISS) , no. : 1-10.
There are several placement machines connected by a conveyor in a printed circuit board assembly line. The objective of the line balancing problem is to minimize the cycle time of the assembly line, which is the maximum production time of the placement machines. In this paper, the nozzle factor, which is often ignored, is considered in estimating the production time of the placement machine, and the nozzle change is also allowed. The production time of a machine is a linear function of the number of components, the number of turns and the number of nozzle changes performed by the machine, which are determined by the component allocation problem, the nozzle set allocation problem and the head allocation problem. These three allocation problems compose the line balancing problem and are solved iteratively. First, the component allocation problem is solved by proposed genetic algorithms (GAs), which generate feasible allocation solutions directly. To search efficiently, non-selective and selective allocation strategies are proposed to solve the component allocation problem. A greedy heuristic (GH) is proposed to solve the nozzle set allocation problem and the head allocation problem simultaneously. Then, the GAs for the component allocation and the GH for the nozzle set and head allocation are integrated according to their interactive relations. Finally, the efficiency of the composite algorithm is illustrated by numerical analysis.
Shujuan Guo; Katsuhiko Takahashi; Katsumi Morikawa; Zhihong Jin. An integrated allocation method for the PCB assembly line balancing problem with nozzle changes. The International Journal of Advanced Manufacturing Technology 2011, 62, 351 -369.
AMA StyleShujuan Guo, Katsuhiko Takahashi, Katsumi Morikawa, Zhihong Jin. An integrated allocation method for the PCB assembly line balancing problem with nozzle changes. The International Journal of Advanced Manufacturing Technology. 2011; 62 (1-4):351-369.
Chicago/Turabian StyleShujuan Guo; Katsuhiko Takahashi; Katsumi Morikawa; Zhihong Jin. 2011. "An integrated allocation method for the PCB assembly line balancing problem with nozzle changes." The International Journal of Advanced Manufacturing Technology 62, no. 1-4: 351-369.
The placement machine is the bottleneck of a printed circuit board (PCB) assembly line. The type of machine considered in this paper is the beam-type placement machine that can simultaneously pick up several components from feeders. It is assumed that the number of nozzle types (NTs) is less than the number of heads on the beam. The objective of the PCB assembly scheduling for a single placement machine is to minimize the cycle time based on the average machine operation time instead of the travelling distance. To minimize the cycle time, the number of turns and the number of pickups should be minimized. The PCB assembly scheduling is hierarchically decomposed into four problems: the nozzle assignment problem, the head allocation problem, the component type (CT) grouping problem and the pickup clustering problem, which are optimized successively and iteratively. First, the nozzle assignment problem considering alternative NTs for one CT is dealt with by the proposed genetic algorithm. For a given nozzle assignment solution, the head allocation problem is solved by a previously greedy heuristic to minimize the number of turns.Then, the CT grouping problem and the pickup clustering problem are solved by a proposed greedy heuristic and a modified agglomerative hierarchical clustering approach, respectively, to minimize the number of pickups. Numerical experiments are carried out to examine the performances of these proposed heuristic approaches. The importance of considering alternative NTs for one CT for the cycle time is also confirmed.
Shujuan Guo; Katsuhiko Takahashi; Katsumi Morikawa. PCB assembly scheduling with alternative nozzle types for one component type. Flexible Services and Manufacturing Journal 2011, 23, 316 -345.
AMA StyleShujuan Guo, Katsuhiko Takahashi, Katsumi Morikawa. PCB assembly scheduling with alternative nozzle types for one component type. Flexible Services and Manufacturing Journal. 2011; 23 (3):316-345.
Chicago/Turabian StyleShujuan Guo; Katsuhiko Takahashi; Katsumi Morikawa. 2011. "PCB assembly scheduling with alternative nozzle types for one component type." Flexible Services and Manufacturing Journal 23, no. 3: 316-345.