Searcharxiv⌕ Search

arXiv subjects

Soheyl Khalilpourazari

Publications and source records attributed to Soheyl Khalilpourazari.

4 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↗

Stochastic Appointment Scheduling with Patient-and-Time-Dependent Probability Distributions

Outpatient appointment scheduling must balance provider idle time, overtime, and patient waiting under uncertain service times, punctuality, and attendance. These factors may follow patient-and-time-dependent probability distributions, which existing models rarely incorporate simultaneously because of modeling and computational complexity. We propose a stochastic programming model that captures exponentially many scenarios with polynomially many variables and constraints, without sampling. It accommodates patient-dependent service times and patient-and-time-dependent no-shows and arrival times. We also discuss estimating these distributions from electronic health records. We examine how personalized reminders and changes in attendance due to incentives or negative clinic experiences affect scheduling. Our model optimally solves instances of up to 14 patients in reasonable computational time. Its schedules outperform classical Bailey-type rules. Even the best-performing variant has 97% higher expected cost on average. Incorporating patient-dependent service times reduces total costs by 34% on average. Accounting for patient-and-time-dependent unpunctuality and no-shows reduces costs by 12% and 67%, respectively. Personalized reminders can reduce costs by 23%, and sensitivity analyses show that these gains withstand moderate errors in estimated distributions. These findings show how modeling individual patient behavior and tailoring communication can reduce waiting, idle time, and overtime.

math.OC↗

A new exact algorithm for solving single machine scheduling problems with learning effects and deteriorating jobs

In this paper, the single machine scheduling problem with deteriorating jobs and learning effects are considered, which is shown in the previous research that the SDR method no longer provides an optimal solution for the problem. In order to solve the problem, a new exact algorithm is proposed. Various test problems are solved to evaluate the performance of the proposed heuristic algorithm using different measures. The results indicate that the algorithm can solve various test problems with small, medium and large sizes in a few seconds with an error around 1% where solving the test problems with more than 15 jobs is almost impossible by examining all possible permutations in both complexity and time aspects.

cs.DS↗

Sine Cosine Crow Search Algorithm: A powerful hybrid meta heuristic for global optimization

This paper presents a novel hybrid algorithm named Since Cosine Crow Search Algorithm. To propose the SCCSA, two novel algorithms are considered including Crow Search Algorithm (CSA) and Since Cosine Algorithm (SCA). The advantages of the two algorithms are considered and utilize to design an efficient hybrid algorithm which can perform significantly better in various benchmark functions. The combination of concept and operators of the two algorithms enable the SCCSA to make an appropriate trade-off between exploration and exploitation abilities of the algorithm. To evaluate the performance of the proposed SCCSA, seven well-known benchmark functions are utilized. The results indicated that the proposed hybrid algorithm is able to provide very competitive solution comparing to other state-of-the-art meta heuristics.

cs.NE↗