Optimization of Simultaneous Delivery and Pickup Wagon Scheme on Hybrid Siding Network of Railway Terminal

Abstract

Aiming at the local freight train transit system in railway terminal, the optimization of simultaneous delivery and pickup wagon scheme on hybrid siding network is presented. The problem is formulated as a mathematical programming model. The objective function intends to minimize shunting engines’ operating cost, wagons’ travelling cost, and penalty cost for exceeding the retrieval time window. Some constraints indicating the relationship between delivery and pickup wagons, relationship between radial branches and operation batches, relationship between local wagon groups’ retrieved time and outbound train departure time, and relationship between tasks and operation batches are considered in the model. As an NP problem, using traditional method to solve the model is difficult and inefficient. A novel two-stage hybrid optimization procedure is proposed. Firstly, the three-phase approach composed of coding task sequence, dividing task batch, and generating access order sequence population is developed to generate initial solution. Secondly, an asynchronous iteration heuristic is provided. The iteration object is given as the expression form of the solution representing the delivery and pickup wagon sequence and then the initial iteration population is generated. Furthermore, the primary updating iteration population with pending and remaining groups is introduced to optimize iteration object Then, the senior updating iteration population with Lévy flight searching is also introduced to optimize further iteration object. Finally, the experimental scenarios are designed to test the proposed approach. Also, the proposed approach is compared with some other approaches and the performance of the proposed approach is evaluated by some different sized instances.

Research on vehicle path planning of automated guided vehicle with simultaneous pickup and delivery with mixed time windows

“…Our understanding is that many scholars have primarily focused on the VRPSPD in the context of inter-city logistics [5][6][7]. For instance, Li [8] studied the VRPSPD problem in railway hub freight train systems, introducing a novel mixed optimisation method. Hatzenbühler et al [9] focused on the increasing demands of urban delivery, proposing a flexible vehicle routing strategy that integrates both passenger and cargo requirements.…”

“…Constraint (7) ensures that the load of an AGV leaving the depot corresponds to the allocations for the workstations it serves and stays within capacity limits. Constraint (8) addresses the balance of pickup and delivery demands on the route, as well as the load capacity on the arcs. Constraint (9) stipulates that the AGV's arrival at each customer location must coincide with the designated time window.…”

“…Our understanding is that many scholars have primarily focused on the VRPSPD in the context of inter‐city logistics [5–7]. For instance, Li [8] studied the VRPSPD problem in railway hub freight train systems, introducing a novel mixed optimisation method. Hatzenbühler et al.…”