the capacitated vehicle routing problem (cvrp) is a well-known combinatorial optimization problem that holds a central place in logistics management. the vehicle routing is an applied task in the industrial transportation for which an optimal solution will lead us to better services, save more time and ultimately increase in customer satisfaction. this problem is classified into np-hard problem...

This article analyzes a strongly nonlinear oscillator with cubic and harmonic restoring force and proposes an efficient analytical technique based on the modified energy balance method (MEBM). The proposed method incorporates higher-order approximations. After applying the proposed MEBM, a set of complicated higher-order nonlinear algebraic equations are obtained. Higher-order nonlinear algebra...

OBJECTIVE A Standardized Clinical Assessment and Management Plan (SCAMP) standardizes the care of patients with a predefined diagnosis while actively inviting and collecting data on clinician deviations (DEVs) from its recommendations. For 3 different pediatric cardiac diagnoses managed by SCAMPs, we determined the frequency of, types of, and reasons for DEVs, which are considered to be a valua...

The Quantum Approximate Optimization Algorithm (QAOA) is a hybrid quantum-classical algorithm to solve binary-variable optimization problems. Due the short circuit depth and its expected robustness systematic errors, it one of promising candidates likely run on near-term quantum devices. We simulate performance QAOA applied Max-Cut problem compare with some best classical alternatives, for exac...

We consider the approximate solution of discrete optimization problems using procedures that are capable of magnifying the effectiveness of any given heuristic algorithm through sequential application. In particular, we embed the problem within a dynamic programming framework, and we introduce several types of rollout algorithms, which are related to notions of policy iteration. We provide cond...

In this paper, we propose a capacity scaling heuristic using a column generation and row generation technique to address the multicommodity capacitated network design problem. The capacity scaling heuristic is an approximate iterative solution method for capacitated network problems based on changing arc capacities, which depend on flow volumes on the arcs. By combining a column and row generat...

In the present work, by applying known Bernstein polynomials and their advantageous properties, we establish an efficient iterative algorithm to approximate the numerical solution of fuzzy Fredholm integral equations of the second kind. The convergence of the proposed method is given and the numerical examples illustrate that the proposed iterative algorithm are ‎valid.‎