vehicle routing problem (vrp) is one of the major problems in the transportation and distribution planning. in the most previous studies, the objective of vrp models was distance and vehicle related costs. however in many industrial cases along with routing distance, vehicle loading amount is a factor of cost function. in this paper, we formulate a mixed integer non-linear programming (minlp) m...

This paper focuses on minimizing the annual operative costs in monopolar DC distribution networks with inclusion of solar photovoltaic (PV) generators while considering a planning period 20 years. problem is formulated through mixed-integer nonlinear programming (MINLP) model, which binary variables define nodes where PV must be located, and continuous are related to power flow solution optimal...

This paper contributes with a new two-stage optimization methodology to solve the problem of optimal placement and sizing solar photovoltaic (PV) generation units in medium-voltage distribution networks. The is formulated mixed-integer nonlinear programming (MINLP) model, where it combines binary variables regarding nodes PV generators will be located continuous associated power flow solution. ...

The dynamic nature of today’s competitive markets compels organizations to an incessant reassessment in an effort to respond to continuous challenges. Therefore, warehouses as an important link in most supply chains, must be continually re-evaluated to ensure that they are consistent with both market’s demands and management’s strategies. A number of warehouse decision support models have been ...

Stackelberg games form the core of a number of tools deployed for computing optimal patrolling strategies in adversarial domains, such as the US Federal Air Marshall Service and the US Coast Guard. In traditional Stackelberg security game models the attacker knows only the probability that each target is covered by the defender, but is oblivious to the detailed timing of the coverage schedule. ...

The problem of lot sizing, sequencing and scheduling multiple products in flow line production systems has been studied by several authors. Almost all of the researches in this area assumed that setup times and costs are sequence –independent even though sequence dependent setups are common in practice. In this paper we present a new mixed integer non linear program (MINLP) and a heuristic meth...

We present a specialized branch-and-bound (b&b) algorithm for the Euclidean Steiner tree problem (ESTP) in R and apply it to a convex mixed-integer nonlinear programming (MINLP) formulation of the problem, presented by Fampa and Maculan. The algorithm contains procedures to avoid difficulties observed when applying a b&b algorithm for general MINLP problems to solve the ESTP. Our main emphasis ...

In unmanned aerial vehicle (UAV)-assisted data collection system, UAVs can be deployed to charge ground terminals (GTs) via wireless power transfer (WPT) and collect from them information transmission (WIT). this letter, we aim minimize the time required by a UAV jointly optimizing trajectory of scheduling for all GTs. This problem is formulated as mixed integer nonlinear programming (MINLP) wh...

Abstract In this paper, we propose two novel matheuristic algorithms, i.e., heuristics based on mathematical formulations of the problem, in order to find a good feasible solution satellite constellation design problem for discontinuous coverage with constrained revisit time. This consists searching able periodically observe several targets at Earth surface smallest number satellites achievable...

In this work we propose a simultaneous scheduling and control optimization formulation to address both optimal steady-state production and dynamic product transitions in multiproduct tubular reactors working in several parallel production lines. Because the problem involves integer and continuous variables and the dynamic behavior of the underlying system the resulting optimization problem is c...