Search Results

To mitigate the negative effects of freight vehicles on urban areas, many cities have implemented road accessibility restrictions, including limited traffic zones, which restrict access to specific areas during certain times of the day. Implementing these ...

Vehicle routing problems (VRP) are very important in many real-world applications and has been studied for several decades. Recently, neural combinatorial optimization (NCO) has attracted growing research effort. NCO is to train a neural network model to ...

This study proposes an innovative approach to address the Capacitated Vehicle Routing Problem with Time Windows (CVRPTW) by integrating Reinforcement Learning (RL) into Evolutionary Algorithms (EAs), forming the Reinforcement Learning-assisted EA (RL-EA)...

The Competition of Machine Learning for Evolutionary Computation for Solving Vehicle Routing Problems (ML4VRP) seeks to bring together machine learning and evolutionary computation communities to propose innovative techniques for vehicle routing problems ...

The Split Delivery Vehicle Routing Problem with Three-Dimensional Loading Constraints (3L-SDVRP) combines routing and packing challenges with two objectives (minimizing travel distance and maximizing vehicle loading rate). Meta-heuristic algorithms are ...

We address a car patrolling application arising in a service company that needs to visit customers in a large area periodically. Customers are divided into clusters, each of which is assigned to a single patrol and requires different services, either ...

The split delivery vehicle routing problem with three-dimensional loading constraints (3L-SDVRP) extends the traditional capacitated vehicle routing problem by integrating vehicle routing and three-dimensional packing, thus increasing the overall ...

We consider a vehicle routing problem with time windows under uncertain travel times where the goal is to determine routes for a fleet of homogeneous vehicles to arrive at the locations of customers within their stipulated time windows to the maximum ...

A challenge in same-day delivery operations is that delivery requests are typically not known beforehand, but are instead revealed dynamically during the day. This uncertainty introduces a trade-off between dispatching vehicles to serve requests as soon ...

With the rise of e-commerce and increasing customer requirements, logistics service providers face a new complexity in their daily planning, mainly due to efficiently handling same-day deliveries. Existing multistage stochastic optimization approaches ...

We introduce RoutingBlocks, a versatile open-source Python package designed to simplify the development of algorithms for vehicle routing problems with intermediate stops (VRPIS). The package offers a variety of modular algorithmic components and ...

The optimization community has made significant progress in solving vehicle routing problems (VRPs) to optimality using sophisticated branch-cut-and-price (BCP) algorithms. VRPSolver is a BCP algorithm with excellent performance in many VRP variants. ...

The cutting plane method is a key technique for successful branch-and-cut and branch-price-and-cut algorithms that find the exact optimal solutions for various vehicle routing problems (VRPs). Among various cuts, the rounded capacity inequalities (RCIs) ...

Solid waste management remains a major challenge globally, especially for a developing country like the Philippines. The rapid population growth, urbanization, and modernization in the country resulted in a significant accumulation of waste, particularly ...

Considering the constraints of time windows and capacity in the case of a single factory and multiple customers, a collaborative scheduling of discrete manufacturing logistics with time windows (CSDMLTW) model is established. The problem includes the ...

Last-mile routing refers to the final step in a supply chain, delivering packages from a depot station to the homes of customers. At the level of a single van driver, the task is a traveling salesman problem. But the choice of route may be constrained by ...

Online grocers typically let customers choose a delivery time slot to receive their goods. To ensure reliable service, the retailer may want to close time slots as capacity fills up. The number of customers that can be served per slot largely depends on ...

The 2021 Amazon Last Mile Routing Research Challenge, hosted by Amazon.com’s Last Mile Research team, and scientifically supported by the Massachusetts Institute of Technology’s Center for Transportation and Logistics, prompted participants to leverage ...

Managing on-time delivery systems is challenging because of the underlying uncertainties and combinatorial nature of the routing decision. In practice, the efficiency of such systems also hinges on the driver’s familiarity with the local neighborhood. In “...

On-time last-mile delivery is expanding rapidly as people expect faster delivery of goods ranging from grocery to medicines. Managing on-time delivery systems is challenging because of the underlying uncertainties and combinatorial nature of the routing ...

Many routing and scheduling problems are modeled through variables that represent paths (routes, schedules, etc.). For such extensive formulations, branch-price-and-cut (BPC) algorithms nowadays constitute the leading exact solution technique, and most of ...