SearcharxivSearch

arXiv subjects

Hamid Najafzad

Publications and source records attributed to Hamid Najafzad.

2 recordsLinked to original sources

A Two-Stage Stochastic Optimization Model for the Equitable Deployment of Fixed and Mobile Electric Vehicle Charging Stations

A major barrier to wide adoption of Electric Vehicles (EVs) is the absence of reliable and equitable charging infrastructure. Poorly located charging stations create coverage gaps and slow down EV adoption, especially in underserved communities. This paper proposes a two-stage stochastic mixed-integer programming model for the optimal deployment of Fixed and Mobile Charging Stations (FCSs and MCSs) across multiple zones and periods. Initially, a finite dominating set of candidate locations is identified using the Edge Scanning Algorithm for a Single Refueling Station (ESS), an exact continuous-location method. We modify the ESS algorithm to incorporate existing public charging stations, thereby avoiding redundant coverage. In the first stage of our model, FCSs are allocated based on long-term traffic patterns, budgetary constraints, and socioeconomic factors to ensure stable baseline coverage. The second stage dynamically assigns MCSs in response to short-term demand fluctuations and uncertainties, aiming to minimize relocation costs while maximizing coverage. We use a scenario-based framework to capture demand variability. Numerical experiments on realistic networks demonstrate the model's capacity to enhance system resilience and reduce unmet demand. These findings offer practical insights for planners and policymakers seeking to develop accessible and demand-responsive EV charging infrastructure.

math.OC

A Finite Dominating Set Approach for the Multi-Item Multi-Period Order Allocation Problem under All-Unit Quantity Discounts and Blending Ratios

This study addresses the multi-item multi-period order allocation problem under all-unit quantity discounts (AUQD) and blending ratios. A manufacturer makes a single product that requires mixing/assembling multiple ingredients/components with pre-determined blending ratios. We consider a single supplier offering quantity-based discounts which introduces non-linearities to the problem. The objective is to minimize procurement cost which includes purchasing, inventory, and ordering costs. We develop a solution procedure that systematically generates a finite dominating set (FDS) of order quantities guaranteed to include an optimal solution to the problem. A Mixed Integer Linear Programming (MILP) model based on the FDS. Our procedure guarantees optimality and eliminates the need for nonlinear discount modeling. Numerical experiments demonstrate that the proposed MILP achieves optimal solutions with significantly reduced computational effort, up to 99% faster for large-scale instances compared to conventional formulations. Sensitivity analyses reveal that the model dynamically adapts to changes in holding costs, shifting between bulk-purchasing and just-in-time strategies, and identifying cost-sensitive ingredients that drive total system cost.

math.OC