Continuous-Time Scheduling of Berths and Onshore Power Supply in Cold-Chain Logistics: A Chance-Constrained Stochastic Programming Model and RL-ALNS Algorithm

A two-phase adaptive large neighborhood search algorithm for the electric location routing problem with range anxiety

Distributionally robust chance-constrained programming for multi-period emergency resource allocation and vehicle routing in disaster response operations

The remanufacturing of end-of-life products is an effective approach to alleviating resource shortages, environmental pollution, and global warming. As the initial step in the remanufacturing process, the quality and efficiency of disassembly have a decisive impact on the entire workflow. However, the complexity of product structures poses numerous challenges to practical disassembly operations. These challenges include not only conventional precedence constraints among disassembly tasks but also sequential dependencies, where interference between tasks due to their execution order can prolong operation times and complicate the formulation of disassembly plans. Additionally, the inherent uncertainties in the disassembly process further affect the practical applicability of disassembly plans. Therefore, developing reliable disassembly plans must fully consider both sequential dependencies and uncertainties. To this end, this paper employs a chance-constrained programming model to characterise uncertain information and constructs a multi-objective sequence-dependent disassembly line balancing (MO-SDDLB) problem model under uncertain environments. The model aims to minimise the hazard index, workstation time variance, and energy consumption, achieving a multi-dimensional optimisation of the disassembly process. To efficiently solve this problem, this paper designs an innovative multi-objective adaptive large neighbourhood search (MO-ALNS) algorithm. The algorithm integrates three destruction and repair operators, combined with simulated annealing, roulette wheel selection, and local search strategies, significantly enhancing solution efficiency and quality. Practical disassembly experiments on a lithium-ion battery validate the effectiveness of the proposed model and algorithm. Moreover, the proposed MO-ALNS demonstrated a superior performance compared to other state-of-the-art methods. On average, against the best competitor results, MO-ALNS improved the number of Pareto solutions (NPS) by approximately 21%, reduced the inverted generational distance (IGD) by about 21%, and increased the hypervolume (HV) by nearly 8%. Furthermore, MO-ALNS exhibited a superior stability, providing a practical and feasible solution for disassembly optimisation.

A hybrid adaptive large neighborhood search algorithm for the large-scale heterogeneous container loading problem

Efficient feasibility checks and an adaptive large neighborhood search algorithm for the time-dependent green vehicle routing problem with time windows

An efficient multi-objective adaptive large neighborhood search algorithm for solving a disassembly line balancing model considering idle rate, smoothness, labor cost, and energy consumption

This paper addresses the challenge of rising operational costs in last-mile delivery caused by end-customer no-shows. The study proposes a collaborative operational framework for last-mile delivery that accommodates roaming customers, enabling them to be serviced by multiple depots as they transition between different locations. A mixed-integer programming (MIP) model is formulated to minimize the operational costs of last-mile delivery under the proposed framework. To improve the model’s practicality and computational efficiency, an adaptive large neighborhood search (ALNS) algorithm is developed, incorporating tailored neighborhood structures. Furthermore, a late acceptance strategy is embedded within the algorithm to mitigate the risk of premature convergence to local optima. The experimental results demonstrate that, in the absence of depot collaboration, the multi-depot model achieves a 16.9% reduction in operational costs compared to the single-depot model. Moreover, when depot collaboration is enabled, the average cost reduction percentage significantly increases to 40.37%. Notably, under the multi-depot collaborative framework, considering customers' roaming behavior—as opposed to fixed single-location assumptions—leads to a substantial 54.6% reduction in operational costs.

<p style='text-indent:20px;'>The Vehicle Routing Problem with Multiple Time Windows (VRPMTW) is a generalization of problems in real life logistics distribution, which has a wide range of applications and research values. Several neighborhood search based methods have been used to solve this kind of problem, but it still has drawbacks of generating numbers of infeasible solutions and falling into local optimum easily. In order to solve the problem of arbitrary selection for neighborhoods, a series of neighborhoods are designed and an adaptive strategy is used to select the neighborhood, which constitute the Adaptive Large Neighborhood Search(ALNS) algorithm framework. For escaping from the local optimum effectively in the search process, a local search based on destroy and repair operators is applied to shake the solution by adjusting the number of customers. The proposed method allows infeasible solutions to participate in the iterative process to expand the search space. At the same time, an archive is set to save the high-quality feasible solutions during the search process, and the infeasible solutions are periodically replaced. Computational experimental results on VRPMTW benchmark instances show that the proposed algorithm is effective and has obtained better solutions.</p>

The mixed fleet heterogeneous dial-a-ride problem (MF-HDARP) consists of designing vehicle routes for a set of users by using a mixed fleet including both heterogeneous conventional and alternative fuel vehicles. In addition, a vehicle is allowed to refuel from a fuel station to eliminate the risk of running out of fuel during its service. We propose an efficient hybrid adaptive large neighborhood search (hybrid ALNS) algorithm for the MF-HDARP. The computational experiments show that the algorithm produces high quality solutions on our generated instances and on HDARP benchmarks instances. Computational experiments also highlight that the newest components added to the standard ALNS algorithm enhance intensification and diversification during the search process.

Adaptive large neighborhood search algorithm for the Unmanned aerial vehicle routing problem with recharging

In container sea–rail combined transport, the railway yard in an automated container terminal (RYACT) is the link in the whole logistics transportation process, and its operation and scheduling efficiency directly affect the efficiency of logistics. To improve the equipment scheduling efficiency of an RYACT, this study examines the “RYACT–train” cooperative optimization problem in the mode of “unloading before loading” for train containers. A mixed-integer programming model with the objective of minimizing the maximum completion time of automated rail-mounted gantry crane (ARMG) tasks is established. An adaptive large neighborhood search (ALNS) algorithm and random search algorithm (RSA) are designed to solve the abovementioned problem, and the feasibility of the model and algorithm is verified by experiments. At the same time, the target value and calculation time of the model and algorithms are compared. The experimental results show that the model and the proposed algorithms are feasible and can effectively solve the “RYACT–train” cooperative optimization problem. The model only obtains the optimal solution of the “RYACT–train” cooperative scheduling problem with no more than 50 tasks within a limited time, and the ALNS algorithm can solve examples of various scales within a reasonable amount of time. The target value of the ALNS solution is smaller than that of the RSA solution.

With the increasing demand for energy, wind power as a new energy source has been widely used and developed on a large scale. To extend the life of wind turbines, it is necessary but difficult to carry out regular inspections in wind farms located in remote areas. This paper studied the clustering and routing problem of truck-drone joint inspection of wind farms. An Adaptive Large Neighborhood Search (ALNS) algorithm is designed based on the characteristics of this problem. In addition, wind farm instances with different sizes and distributions are generated in this paper to simulate realistic scenes and evaluate ALNS. Finally, real wind farm instances are tested to demonstrate the inspection time in detail. Computational experiments show ALNS can improve significantly inspection time compared with another method.

An adaptive large neighborhood search algorithm for a selective and periodic inventory routing problem

Freight bus is a new public transportation means for city logistics, and each freight bus can deliver and pick up goods at each customer/supplier location it passes. In this paper, we study the route planning problem of freight buses in an urban distribution system. Since each freight bus makes a tour visiting a set of pickup/delivery locations once at every given time interval in each day following a fixed route, the route planning problem can be considered a new variant of periodic vehicle routing problem with pickup and delivery. In order to solve the problem, a Mixed-Integer Linear Programming (MILP) model is formulated and an Adaptive Large Neighborhood Search (ALNS) algorithm is developed. The development of our algorithm takes into consideration specific characteristics of this problem, such as fixed route for each freight bus, possibly serving a demand in a later period but with a late service penalty, etc. The relevance of the mathematical model and the effectiveness of the proposed ALNS algorithm are proved by numerical experiments.

A modified adaptive large neighborhood search algorithm for solving the multi-port continuous berth allocation problem with vessel speed optimization