This work presents the application of a CO2 emission estimation function for cargo vehicles on Capacited Vehicle Routing Problems (CVRP) setting, considering route’s slopes variation. Comparisons were established with functions minimizing fuel consumption and route length in case study about selective collection recyclable waste at Sorocaba, state São Paulo, Brazil. Routes lower emissions have ...

Based on minimizing a piecewise diierentiable lp function subject to a single inequality constraint, this paper discusses algorithms for a discretized regularization problem for ill-posed inverse problems. We examine computational challenges of solving this regularization problem. Possible minimization algorithms such as the steepest descent method, iteratively weighted least squares (IRLS) met...

 We present a new mathematical model for a permutation flowshop scheduling problem with sequence-dependent setup times considering minimization of two objectives, namely makespan and weighted mean total earliness/tardiness. Only small-sized problems with up to 20 jobs can be solved by the proposed integer programming approach. Thus, an effective multi-objective immune system (MOIS) is ...

Abstract Affine matrix rank minimization problem aims to find a low-rank or approximately low-rank matrix that satisfies a given linear system. It is well known that this problem is combinatorial and NP-hard in general. Therefore, it is important to choose the suitable substitution for this matrix rank minimization problem. In this paper, a continuous promoting low rank non-convex fraction func...

In this paper, we establish a stochastic maximum principle for minimization problem under partial information. With the Backward differential equations (in short BSDE’s), sufficient condition of optimality to characterize and determine an optimal control. This is done instead using Hamiltonian which deterministic function. The translating dynamics state variables controlled system contain BSPDE...

This paper studies the hybrid flow shop scheduling where the optimization criterion is the minimization of total tardiness. First, the problem is formulated as a mixed integer linear programming model. Then, to solve large problem sizes, an artificial immune algorithm hybridized with a simple local search in form of simulated annealing is proposed. Two experiments are carried out to evaluate th...