Xiaoying Tong's research while affiliated with Dalian Jiaotong University and other places

Publications (3)

Article
Full-text available
In this study, we present and discuss a variant of the classic vehicle routing problem (VRP), the green automated guided vehicle (AGV) routing problem, which involves simultaneous pickup and delivery with time windows (GVRPSPDTW) in an intelligent workshop. The research object is AGV energy consumption. First, we conduct a comprehensive analysis of...
Article
Full-text available
In this study, we present and discuss a variant of the classical vehicle routing problem (VRP), namely the heterogeneous multitype fleet green automated guided vehicle (AGV) routing problem with time windows (HFGVRPTW) applied in the workshops of flexible manufacturing systems (FMS). Specifically, based on the analysis of AGV body structure and mot...
Article
Full-text available
Two-sided assembly lines are designed to produce large and complex products, where workers can perform on both sides at the same time. This paper establishes a mathematical model for the multi-objective two-sided assembly line balancing problems with additional constraints (MOATALBP). The model considers both workers’ skill and balance of the assem...

Citations

... The aim of GVRP is to minimize the total fuel consumption and emissions of the vehicle fleet while meeting the route and vehicle capacity constraints. Various approaches can be used to solve GVRP, such as using alternative fuels, electric, or hybrid vehicles, and optimizing vehicle speeds and routes to minimize emissions Lin et al. 2014;Zheng, Gao, and Tong 2023). ...
... Dissatisfy rule Call-cell Assign to AGV Fig. 3. The sequence s= (c 2 , c 4 , c 5 , c 1 , c 8 , c 9 , c 3 , c 7 , c 6 , c 10 ) is a call-cell sequence generated using the 1 rule-based stochastic method with its serial number (0, 1, 2, 3,4,5,6,7,8,9). In order of serial number 2 from smallest to largest, we first take call-cell c 2 and assign it to AGV 1 , then take call-cells c 4 , c 5 and 3 assign them to AGV 1 , and then take call-cell c 1 , which cannot be assigned to AGV 1 because it does not 4 satisfy rule (2). At this point, the assignment to AGV 1 ends and the assignment to AGV 2 starts. ...