The solutions used to solve bi-level congestion pricing problems are usually based on heuristic network optimization methods which may not be able to find the best solution for these type of problems. The application of meta-heuristic methods can be seen as viable alternative solutions but so far, it has not received enough attention by researchers in this field. Therefore, the objective of thi...

Abstract The Braiding Index ( BI ), defined as the average count of intercepted channels per cross‐section, is a widely used metric for characterizing multi‐thread river systems. However, it does not account diversity (e.g., in terms water discharge) within different cross‐sections, omitting important information related to system complexity. Here we present modification BI, Entropic eBI which ...

In this paper, a combinatorial reverse auction mechanism is proposed for selecting the most efficient service-providers for resolving sustained power interruptions in multiple regions of an electric power distribution company’s responsibility area. Through this mechanism, supplying the required service in each region is assigned to only one potential service-provider considering two criteria in...

time-dependent vehicle routing problem is one of the most applicable but least-studied variants of routing and scheduling problems. in this paper, a novel mathematical formulation of time-dependent vehicle routing problems with heterogeneous fleet, hard time widows and multiple depots, is proposed. to deal with the traffic congestions, we also considered that the vehicles are not forced to come...

This work presents the first projection-free algorithm to solve stochastic bi-level optimization problems, where objective function depends on solution of another problem. The proposed $\textbf{S}$tochastic $\textbf{Bi}$-level $\textbf{F}$rank-$\textbf{W}$olfe ($\textbf{SBFW}$) can be applied streaming settings and does not make use large batches or checkpoints. sample complexity SBFW is shown ...

This paper studies the relationship between the so-called bi-quadratic optimization problem and its semidefinite programming (SDP) relaxation. It is shown that each r -bound approximation solution of the relaxed bi-linear SDP can be used to generate in randomized polynomial time an O(r)-approximation solution of the original bi-quadratic optimization problem, where the constant in O(r) does not...

in this paper, a location allocation (la) problem in construction and demolition (c&d;) waste management (wm) is studied. a bi-level model for this problem under a fuzzy random environment is presented where the upper level is the governments who sets up the processing centers, and the lower level are the administrators of different construction projects who control c&d; waste and the after tre...

In this paper, a bi-objective mixed-integer linear optimization model for Closed-loop Supply Chain Network Design Problem (CLSCND) is developed. The proposed model includes both the forward and reverse directions and includes different types of facilities, namely, manufacturing/remanufacturing centers, warehouses, and disassembly centers. The first objective function tried to minimize the total...