Related papers: The fragility-constrained vehicle routing problem …
We study the capacitated vehicle routing problem in graphic metrics (graphic CVRP). Our main contribution is a new lower bound on the cost of an optimal solution. For graphic metrics, this lower bound is tight and significantly stronger…
Recent neural combinatorial optimization (NCO) methods have shown promising problem-solving ability without requiring domain-specific expertise. Most existing NCO methods use training and testing data with a fixed constraint value and lack…
The vehicle routing problem has great importance and application in transportation and supply chain management. In this case, there are several supply requests in a transportation network. The main goal is to allocate customers to available…
The rapid growth of pharmaceutical refrigerated logistics poses sustainability challenges, including elevated costs, energy consumption, and resource inefficiency. Collaborating multiple depots can enhance logistics efficiency when…
In the last decades, the classical Vehicle Routing Problem (VRP), i.e., assigning a set of orders to vehicles and planning their routes has been intensively researched. As only the assignment of order to vehicles and their routes is already…
The integration of electric vehicles (EVs) with the energy grid has become an important area of research due to the increasing EV penetration in today's transportation systems. Under appropriate management of EV charging and discharging,…
Finding a feasible and prompt solution to the Vehicle Routing Problem (VRP) is a prerequisite for efficient freight transportation, seamless logistics, and sustainable mobility. Traditional optimization methods reach their limits when…
The multi Vehicle Routing Problem with Pickup and Delivery with Time Windows is a challenging version of the Vehicle Routing Problem. In this paper, by embedding many complex assignment routing constraints through constructing a multi…
While traditional optimization problems were often studied in isolation, many real-world problems today require interdependence among multiple optimization components. The traveling thief problem (TTP) is a multi-component problem that has…
Location Routing is a fundamental planning problem in logistics, in which strategic location decisions on the placement of facilities (depots, distribution centers, warehouses etc.) are taken based on accurate estimates of operational…
Vehicle Routing Problem is a well-known problem in logistics and transportation, and the variety of such problems is explained by the fact that it occurs in many real-life situations. It is an NP-hard combinatorial optimization problem and…
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 multi-stage stochastic…
The multi-vehicle covering tour problem with time windows (MCTPTW) aims to construct a set of maximal coverage routes for a fleet of vehicles that serve (observe) a secondary set of sites given a fixed time schedule, coverage requirements,…
We consider the vehicle routing problem with stochastic demands (VRPSD), a problem in which customer demands are known in distribution at the route planning stage and revealed during route execution upon arrival at each customer. A…
The capacitated vehicle routing problem (CVRP) is one of the most extensively studied problems in combinatorial optimization. In this problem, we are given a depot and a set of customers, each with a demand, embedded in a metric space. The…
The vehicle routing problem is a well known class of NP-hard combinatorial optimisation problems in literature. Traditional solution methods involve either carefully designed heuristics, or time-consuming metaheuristics. Recent work in…
This paper introduces a reinforcement learning approach to optimize the Stochastic Vehicle Routing Problem with Time Windows (SVRP), focusing on reducing travel costs in goods delivery. We develop a novel SVRP formulation that accounts for…
Two multivehicle routing problems are considered in the framework that a visit to a location must take place during a specific time window in order to be counted and all time windows are the same length. In the first problem, the goal is to…
The Capacitated Vehicle Routing Problem (CVRP) is a core NP-hard problem in the field of combinatorial optimization. It aims to plan optimal routes for a fleet of vehicles with uniform capacity, serving a set of customers with specific…
Transportation occupies one-third of the amount in the logistics costs, and accordingly transportation systems largely influence the performance of the logistics system. This work presents an adaptive data-driven innovative modular approach…