ترغب بنشر مسار تعليمي؟ اضغط هنا

A Quantum Annealing Approach for Dynamic Multi-Depot Capacitated Vehicle Routing Problem

101   0   0.0 ( 0 )
 نشر من قبل Saideep Nannapaneni
 تاريخ النشر 2020
  مجال البحث الهندسة المعلوماتية
والبحث باللغة English




اسأل ChatGPT حول البحث

Quantum annealing (QA) is a quantum computing algorithm that works on the principle of Adiabatic Quantum Computation (AQC), and it has shown significant computational advantages in solving combinatorial optimization problems such as vehicle routing problems (VRP) when compared to classical algorithms. This paper presents a QA approach for solving a variant VRP known as multi-depot capacitated vehicle routing problem (MDCVRP). This is an NP-hard optimization problem with real-world applications in the fields of transportation, logistics, and supply chain management. We consider heterogeneous depots and vehicles with different capacities. Given a set of heterogeneous depots, the number of vehicles in each depot, heterogeneous depot/vehicle capacities, and a set of spatially distributed customer locations, the MDCVRP attempts to identify routes of various vehicles satisfying the capacity constraints such as that all the customers are served. We model MDCVRP as a quadratic unconstrained binary optimization (QUBO) problem, which minimizes the overall distance traveled by all the vehicles across all depots given the capacity constraints. Furthermore, we formulate a QUBO model for dynamic version of MDCVRP known as D-MDCVRP, which involves dynamic rerouting of vehicles to real-time customer requests. We discuss the problem complexity and a solution approach to solving MDCVRP and D-MDCVRP on quantum annealing hardware from D-Wave.



قيم البحث

اقرأ أيضاً

138 - Claire Mathieu , Hang Zhou 2021
We give a probabilistic analysis of the unit-demand Euclidean capacitated vehicle routing problem in the random setting, where the input distribution consists of $n$ unit-demand customers modeled as independent, identically distributed uniform random points in the two-dimensional plane. The objective is to visit every customer using a set of routes of minimum total length, such that each route visits at most $k$ customers, where $k$ is the capacity of a vehicle. All of the following results are in the random setting and hold asymptotically almost surely. The best known polynomial-time approximation for this problem is the iterated tour partitioning (ITP) algorithm, introduced in 1985 by Haimovich and Rinnooy Kan. They showed that the ITP algorithm is near-optimal when $k$ is either $o(sqrt{n})$ or $omega(sqrt{n})$, and they asked whether the ITP algorithm was also effective in the intermediate range. In this work, we show that when $k=sqrt{n}$, the ITP algorithm is at best a $(1+c_0)$-approximation for some positive constant $c_0$. On the other hand, the approximation ratio of the ITP algorithm was known to be at most $0.995+alpha$ due to Bompadre, Dror, and Orlin, where $alpha$ is the approximation ratio of an algorithm for the traveling salesman problem. In this work, we improve the upper bound on the approximation ratio of the ITP algorithm to $0.915+alpha$. Our analysis is based on a new lower bound on the optimal cost for the metric capacitated vehicle routing problem, which may be of independent interest.
90 - Ning Xue , Ruibin Bai , Rong Qu 2020
Full truckload transportation (FTL) in the form of freight containers represents one of the most important transportation modes in international trade. Due to large volume and scale, in FTL, delivery time is often less critical but cost and service q uality are crucial. Therefore, efficiently solving large scale multiple shift FTL problems is becoming more and more important and requires further research. In one of our earlier studies, a set covering model and a three-stage solution method were developed for a multi-shift FTL problem. This paper extends the previous work and presents a significantly more efficient approach by hybridising pricing and cutting strategies with metaheuristics (a variable neighbourhood search and a genetic algorithm). The metaheuristics were adopted to find promising columns (vehicle routes) guided by pricing and cuts are dynamically generated to eliminate infeasible flow assignments caused by incompatible commodities. Computational experiments on real-life and artificial benchmark FTL problems showed superior performance both in terms of computational time and solution quality, when compared with previous MIP based three-stage methods and two existing metaheuristics. The proposed cutting and heuristic pricing approach can efficiently solve large scale real-life FTL problems.
The Vehicle Fleet Sizing, Positioning and Routing Problem with Stochastic Customers (VFSPRP-SC) consists on pairing strategic decisions of depot positioning and fleet sizing with operational vehicle routing decisions while taking into account the inh erent uncertainty of demand. We successfully solve the VFSPRP-SC with a methodology comprised of two main blocks: i) a scenario generation phase and ii) a two-stage stochastic program. For the first block, a set of scenarios is selected with a simulation-based approach that captures the behavior of the demand and allows us to come up with different solutions that could match different risk profiles. The second block is comprised of a facility location and allocation model and a Multi Depot Vehicle Routing Problem (MDVRP) assembled under a two-stage stochastic program. We propose several novel ideas within our methodology: problem specific cuts that serve as an approximation of the expected second stage costs as a function of first stage decisions; an activation paradigm that guides our main optimization procedure; and, a way of mapping feasible routes from one second-stage problem data into another; among others. We performed experiments for two cases: the first case considers the expected value of the demand, and the second case considers the right tail of the demand distribution, seeking a conservative solution. By using acceleration techniques we obtain solutions within 1 to 6 hours, reasonable times considering the strategic nature of the decision. For the ex-post evaluation, we solve 75% of the instances in less than 3 minutes, meaning that the methodology used to solve the MDVRP is well suited for daily operation.
Recent developments in urbanization and e-commerce have pushed businesses to deploy efficient systems to decrease their supply chain cost. Vendor Managed Inventory (VMI) is one of the most widely used strategies to effectively manage supply chains wi th multiple parties. VMI implementation asks for solving the Inventory Routing Problem (IRP). This study considers a multi-product multi-period inventory routing problem, including a supplier, set of customers, and a fleet of heterogeneous vehicles. Due to the complex nature of the IRP, we developed a Modified Adaptive Genetic Algorithm (MAGA) to solve a variety of instances efficiently. As a benchmark, we considered the results obtained by Cplex software and an efficient heuristic from the literature. Through extensive computational experiments on a set of randomly generated instances, and using different metrics, we show that our approach distinctly outperforms the other two methods.
Different retail and e-commerce companies are facing the challenge of assembling large numbers of time-critical picking orders that include both single-line and multi-line orders. To reduce unproductive picker working time as in traditional picker-to -parts warehousing systems, different solutions are proposed in the literature and in practice. For example, in a mixed-shelves storage policy, items of the same stock keeping unit are spread over several shelves in a warehouse; or automated guided vehicles (AGVs) are used to transport the picked items from the storage area to packing stations instead of human pickers. This is the first paper to combine both solutions, creating what we call AGV-assisted mixed-shelves picking systems. We model the new integrated order batching and routing problem in such systems as an extended multi-depot vehicle routing problem with both three-index and two-commodity network flow formulations. Due to the complexity of the integrated problem, we develop a novel variable neighborhood search algorithm to solve the integrated problem more efficiently. We test our methods with different sizes of instances, and conclude that the mixed-shelves storage policy is more suitable than the usual storage policy in AGV-assisted mixed-shelves systems for both single-line and multi-line orders (saving up to 67% on driving distances for AGVs). Our variable neighborhood search algorithm provides close-to-optimal solutions within an acceptable computational time.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا