Vahid Mahmoodian

Solving Multiplicative Programs by Binary-encoding the Multiplication Operation

  • Hadi Charkhgard
  • Fabian Rigterink
  • Payman Ghasemi Saghand
  • Vahid Mahmoodian
    • Categories Applications - OR and Management Sciences, Game Theory Tags ,

    Multiplicative programs in the form of maximization and/or minimization have numerous applications in conservation planning, game theory, and multi-objective optimization settings. In practice, multiplicative programs are challenging to solve because of their multiplicative objective function (a product of continuous or integer variables). These challenges are twofold: 1. As the number of factors in the objective … Read more

    Multi-objective Optimization Based Algorithms for Solving Mixed Integer Linear Minimum Multiplicative Programs

  • Hadi Charkhgard
  • Vahid Mahmoodian
  • Yu Zhang
    • Categories (Mixed) Integer Nonlinear Programming, Branch and Cut Algorithms, Global Optimization

    We present two new algorithms for a class of single-objective non-linear optimization problems, the so-called Mixed Integer Linear minimum Multiplicative Programs (MIL-mMPs). This class of optimization problems has a desirable characteristic: a MIL-mMP can be viewed as a special case of the problem of optimization over the efficient set in multi-objective optimization. The proposed algorithms … Read more

    Query Batching Optimization in Database Systems

  • Hadi Charkhgard
  • Iman Dayarian
  • Mehrad Eslami
  • Vahid Mahmoodian
  • Yicheng Tu
    • Categories (Mixed) Integer Linear Programming, Approximation Algorithms, Multidisciplinary Design Optimization

    Techniques based on sharing data and computation among queries have been an active research topic in database systems. While work in this area developed algorithms and systems that are shown to be effective, there is a lack of rigorous modeling and theoretical study for query processing and optimization. Query batching in database systems has strong … Read more

    A bi-level branch-and-bound algorithm for the capacitated competitive facility location problem

  • Hadi Charkhgard
  • Vahid Mahmoodian
  • Yu Zhang
    • Categories Branch and Cut Algorithms, Supply Chain Management Tags , , ,

    Competitive facility location problem is a typical facility locating optimization problem but in a competitive environment. The main characteristic of this problem is the competitive nature of the market. In essence, the problem involves two competitors, i.e., a leader and a follower, who seek to attract customers by establishing new facilities to maximize their own … Read more

    Hybrid Rebalancing with Dynamic Hubbing for Free-floating Bike Sharing Using Multi-objective Simulation Optimization

  • Hadi Charkhgard
  • Vahid Mahmoodian
  • Yu Zhang
    • Categories Optimization of Simulated Systems, Transportation Tags , , , ,

    For rebalancing problem of free-floating bike sharing systems, we propose dynamic hubbing (i.e. dynamically determining geofencing areas) and hybrid rebalancing (combining user-based and operator-based strategies) and solve the problem with a novel multi-objective simulation optimization approach. Given historical usage data and real-time bike GPS location information, dynamic geofenced areas (hubs) are determined to encourage users … Read more