Purpose: The research purpose is to enhance picking performance by developing a hybrid algorithm that classifies SKU …

search algorithm for routing and a genetic algorithm and several construction heuristics for packing. Numerical experiments …The Split Delivery Vehicle Routing Problem with three-dimensional loading constraints (3L-SDVRP) combines vehicle … routing and three-dimensional loading with additional packing constraints. In the 3L-SDVRP splitting deliveries of customers …

algorithm to solve the routing problem in the urban multi-modal network. The multi-modal network problem considered in this … Algorithm-II (NSGA-II) algorithms are used to evaluate and compare the results from the CBMODPSO algorithm. In addition …, CBMODPSO results are compared with previous research results. We show the improved algorithm is more repeatable than other …

) is modeled as a new variant of a periodic location routing problem and an adaptive large neighborhood search … solution algorithm for a related waste collection problem seen in the literature, which can be seen as a special case of the …

) is a strongly practically oriented routing problem with many real-world constraints. Due to its complexity, solution … Grouping Genetic Algorithm (GGA) framework with several operators and population management variants. A Bayesian Optimization …

(vehicle routing subproblem). The start date of a tour, however, is also affected by the assignment of orders to pickers and … iterated local search algorithm is designed for the simultaneous solution of the subproblems. By means of extensive numerical …

-and-price algorithm to solve the problem to optimality. Fixed-wing drones, unlike rotary drones, have kinematic constraints associated … presents the implications of these constraints on the drone routing problem formulation and proposes a systematic technique to … address them in the context of the team orienteering problem. Furthermore, a novel branch-and-price algorithm with branching …

The majority of stochastic vehicle routing models consider travel times to be independent. However, in reality, travel … times are often stochastic and correlated, such as in urban areas. We examine a vehicle routing problem with a makespan … objective incorporating both stochastic and correlated travel times. We develop an approach based on extreme-value theory to …

In this paper, we examine a vehicle routing problem with a makespan objective incorporating both stochastic and … correlated travel times, which is usually not considered in routing problems. As an alternative to simulation, we develop an … approach based on extreme-value theory to estimate the expected makespan (and standard deviation) and show how this approach …

Multi-compartment vehicle routing problems arise in a variety of problem settings in which different product types have … optimality, a branch-and-cut algorithm has been developed and implemented. Extensive numerical experiments have been conducted in … order to evaluate the algorithm and to gain insights into the problem structure. The corresponding results show that the …