The vehicle routing problem with time windows (VRPTW) underpins distribution and field-service operations, yet most multi-objective treatments optimise only fleet size and travelled distance, and rely on generic evolutionary operators that struggle to move the discrete, rugged fleet-size axis. We study a three-objective VRPTW that additionally minimises the imbalance of driver working times, a criterion of direct operational and fairness relevance, and propose MO-GEMA, a decomposition-based memetic algorithm built on three coordinated, routing-specific ideas. First, guided ejection search, hitherto a single-objective fleet minimiser, is lifted into a dedicated objective-axis operator that drives the fleet dimension from within the decomposition. Second, a balance-aware ruin operator dismantles the longest-duration routes for reconstruction, explicitly creating room to even out working times. Third, a weight-directed scalar local search shapes each subproblem so that the population spreads across the trade-off surface rather than collapsing onto a single corner. Beyond the algorithm, we provide guarantees rarely available for memetic routing solvers: the soundness and completeness of the Tchebycheff decomposition, the correctness and hypervolume monotonicity of the external archive, and a computable fleet lower bound that doubles as a provable early-stop signal for the guided-ejection operator. On the 100-customer Solomon instances, under an equal wall-clock budget, MO-GEMA attains the best overall mean hypervolume of 0.732 and the lowest IGD+ of 0.205 among ten algorithms, surpassing nine multi-objective baselines that span the classical (NSGA-II), decomposition (MOEA/D), learning-augmented (RL-AOS) and VRPTW-specific (MDLS, CLG-GA) families; the strongest of them, MDLS, reaches only 0.596, and MO-GEMA Pareto-dominates a far larger share of every baseline's front than the reverse. The same engine does not forfeit single-objective quality: on the hard R2 and RC2 classes, it matches or beats all seven algorithms of a recent state-of-the-art study on 16 of 19 instances under the classical lexicographic objective.

This study addresses the daily scheduling and routing problem for home healthcare workers while incorporating lunch break requirements. The Home Healthcare Scheduling and Routing Problem is analysed alongside its common constraints, including patient and caregiver time windows, caregiver qualifications, and mandated breaks. To address this, four different variants of an effective Adaptive Large Neighbourhood Search (ALNS) algorithm were developed to provide high-quality solutions. The algorithms demonstrate significant efficiency, solving 30-patient instances optimally within an average of 12 seconds. For scenarios involving 100 patients, they maintained robust performance with a slight increase in computational time of about 54 seconds. Results indicate operational efficiency improvements of up to 36% through optimized travel routes and patient visitation schedules. To translate these findings into practice, a decision support system, the Home Healthcare Decision Support System (HHDSS), was designed to assist administrators by automating the complex task of scheduling and routing of caregivers. Tested using realistic patient data generated from Turkey, the system effectively allocates healthcare resources and improves responsiveness. Overall, the proposed framework shows strong potential as a valuable practical tool for improving the responsiveness and efficiency of home healthcare logistics.

In this work, a probabilistic bid generation problem with the pricing of a bundle of lanes and carrier’s vehicle routing is considered as it is an importation in transportation service procurement. Depending on the network of the vehicle, there exist multiple lanes for traveling between two locations. To solve the bid generation problem efficiently, a two-phase method approach is presented. At the core of the procedure a feasible vehicle routing problem on a multidigraph is solved by an exhaustive search algorithm to enumerate all routes concerning routing constraints and treat each route as a decision variable in the set partitioning formulation. We examine our model both analytically and empirically using a simulation-based analysis.

During the spread of the epidemic, the home delivery service (HDS) has been quickly introduced by retailers which helps customers avoid the risk of viral infection while shopping at offline stores. However, the operation cost of HDS is a huge investment for O2O retailers. How to minimize the operating costs of HDS is an urgent issue for the industry. To solve this problem, we outline those management decisions of HDS that have an impact on operating costs, including dynamic vehicle routing, driver sizing and scheduling, and propose an integrated optimization model by comprehensively considering these management decisions. Moreover, the dynamic feature of online orders and the heterogeneous workforces are also considered in this model. To solve this model, an efficient adaptive large neighborhood search (ALNS) and branch-and-cut algorithms are developed. In the case study, we collected real data from a leading O2O retailer in China to assess the effectiveness of our proposed model and algorithms. Experimental results show that our approach can effectively reduce the operating costs of HDS. Furthermore, a comprehensive analysis is conducted to reveal the changing patterns in operating costs, and some valuable management insights are provided for O2O retailers. The theoretical and numerical results would shed light on the management of HDS for O2O retailers.

Transportation planning in forest industry is a challenging activity since it involves complex decisions about raw material allocation, vehicle routing and scheduling of trucks arrivals to both harvest areas and the plants. In the Argentine context, specifically in the Argentinean Northeast (NEA) region, the forest industry plays essential role for the economic development and, among the included activities, the transportation is the key element considering the volumes that must be moved and the distances to be traveled. Therefore, enhancing efficiency in the transportation activity improves significantly the performance of this industry. In this work, a Mixed Integer Linear Programming (MILP) model is presented, where raw material allocation, vehicle routing and scheduling of trucks arrivals are simultaneously addressed. Since the resolution times of the proposed integrated MILP model are prohibitive for large instances, a hierarchical approach is also presented. The considered decomposition approach involves two stages: in the first phase, the raw material allocation and vehicle routing problems are solved through a MILP model, while in the second phase, fixing the route for each truck according to the results of the previous step, the scheduling of truck arrivals to both the harvest areas and the plants is solved through a new MILP model. The obtained results show that the proposed approach is very effective and could be easily applied in this industry.

This paper introduces a covering model for collaborative bidirectional multi-period vehicle routing problems under profit-sharing agreements (CB-VRPPA) in bulk transportation (BT) networks involving one control tower and multiple shippers and carriers. The objective is to maximize the total profits of all parties subject to profit allocation constraints among carriers, terminal capability limitations, transport capability limitations and time-window constraints. The proposed method includes three stages: (a) generate all feasible routes of each carrier, (b) eliminate unattractive feasible routes via a proposed screening technique to reduce the initial problem size, and (c) solve the reduced problem using a branch-and-bound algorithm. Computational experiments are performed for real-life, medium- and large-scale instances. The proposed method provides satisfactory results when applied to solve the CB-VRPPA. We also conduct a sensitivity analysis on a critical parameter of the profit-sharing agreement to confirm the effectiveness of the proposed method.

The primary challenge in the supply chain is minimizing travel distance and time between hubs and customers. Inappropriate assignment of vehicle routing results in travel distances longer than required, causing delays in achieving timely deliveries, and ultimately negatively affect the customer expectations routes. In this study, the selecting optimal vehicle routing has been addressed. This involves calculating the shortest possible that meets the demand effectively while adhering to various logistical constraints like warehouse fixed positions, demand variety, demand quantity, and destination locations. Dynamic programming has been developed where numerous time period-based fluctuations can be accommodated such as fluctuations in traffic, alternative routes availability, and changes in travel distances. The weighted demand cost matrix has been introduced to prioritize and cluster the group of customer nodes for the assignment of certain vehicles. Moreover, API google distance matrix (latitudes and longitudes) has been integrated into the model to extract live locations of source-and-demand nodes which are a function of different time periods of a day. The dynamic has optimized the vehicle routes and results in 30.9% reduction comparing the existing case. The validation was done through four more cases where different possibilities such as business expansion, network growth, demand fluctuations, and vehicle capacities.

Nowadays, most manufacturing units try to locate their requirements and the depot vehicle routing in order to transport the goods at optimum cost. Needless to mention that the locations of the required warehouses influence on the performance of vehicle routing. In this paper, a mathematical programming model to optimize the storage location and vehicle routing are presented. The first objective function of the model minimizes the total cost associated with the transportation and storage, and the second objective function minimizes the difference distance traveled by vehicles. The study uses Imperialist Competitive Algorithm (ICA) to solve the resulted problems in different sizes. The preliminary results have indicated that the proposed study has performed better than NSGA-II and PAES methods in terms of Quality metric and Spacing metric.

In this paper, we consider the multi depot heterogeneous vehicle routing problem with time windows in which vehicles may be replenished along their trips. Using the modeling technique in a new-generation solver, we construct a novel formulation considering a rich series of constraint conditions and objective functions. Computation results are tested on an example comes from the real-world application and some cases obtained from the benchmark problems. The results show the good performance of local search method in the efficiency of replenishment system and generalization ability. The variants can be used to almost all kinds of vehicle routing problems, without much modification, demonstrating its possibility of practical use.