Searcharxiv⌕ Search

arXiv subjects

Anthony Karahalios

Publications and source records attributed to Anthony Karahalios.

2 recordsLinked to original sources

Strengthening Compact Vehicle Routing Formulations through Arc-Flow Aggregation and Refinement

Arc-flow formulations can provide strong relaxations for mixed-integer program formulations of vehicle routing problems, but the associated networks may be prohibitively large. We study the setting in which multiple arc flow relaxations may be applied, and introduce a dual-guided aggregation and refinement framework that constructs substantially smaller arc-flow formulations while recovering the LP bound of the original networks. Dual information is used both to identify states that can be aggregated without weakening the bound and to guide node disaggregation. We show that the resulting procedure converges finitely to the arc-flow bound of the full arc-flow formulation. The framework retains the original decision variables, allowing cutting planes to be added directly in the original variable space. Moreover, it produces an explicit MILP formulation without relying on column generation or pricing to determine the arc-flow relaxation bound. We apply our approach to the vehicle routing problem with time windows for which we define two arc flow relaxations, as well as two families of cutting planes over the original variable space. Computational experiments show that strong bounds can be obtained using substantially aggregated networks. The resulting root bounds are competitive with those obtained by the branch-and-price solver RouteOpt, while retaining a formulation that can be solved directly by a general-purpose MILP solver.

math.OC↗

A Quantum Inspired Bi-level Optimization Algorithm for the First Responder Network Design Problem

In the aftermath of a sudden catastrophe, First Responders (FR) strive to promptly reach and rescue immobile victims. Simultaneously, other mobile individuals take roads to evacuate the affected region, or access shelters. The escalated traffic congestion significantly hinders critical FR operations if they share some of the same roads. A proposal from the Turkish Ministry of Transportation and Infrastructure being discussed for implementation is to allocate a subset of road segments for use by FRs only, mark them clearly, and pre-communicate them to the citizens. For the FR paths under consideration: (i) there should exist an FR path from designated entry points to each demand point in the network, and (ii) evacuees try to leave the network (through some exit points following the selfish routing principle) in the shortest time possible when they know that certain segments are not available to them. We develop a mixed integer non-linear programming formulation for this First Responder Network Design Problem (FRNDP). We solve FRNDP using a novel hybrid quantum-classical heuristic building on the Graver Augmented Multi-Seed Algorithm (GAMA). Using the flow-balance constraints for the FR and evacuee paths, we use a Quadratic Unconstrained Binary Optimization (QUBO) model to obtain a partial Graver Bases to move between the feasible solutions of FRNDP. To efficiently explore the solution space for high-quality solutions, we develop a novel bi-level nested GAMA within GAMA: GAGA. We test GAGA on random graph instances of various sizes and instances related to an expected Istanbul earthquake. Comparing GAGA against a state-of-the-art exact algorithm for traditional formulations, we find that GAGA offers a promising alternative approach. We hope our work encourages further study of quantum (inspired) algorithms to tackle complex optimization models from other application domains.

math.OC↗