Variable neighborhood searchLogisticsVehicle schedulingThis paper presents a solution methodology for the heterogeneous fleet vehicle routing problem with time windows. The objective is to minimize the total distribution costs, or similarly to determine the optimal fleet size and mix that minimizes both ...
The remaining k-1 edges are chosen successively 10 Glover and Laguna to minimize the increase in total weight at each step, where the edges considered meet exactly one node from those that are endpoints of edges previously chosen. For k = 4, the greedy construction performs the steps in ...
Various computational analyses performed using Relative Percentage Deviation and Kruskal Wallis-H test indicates that the Tabu search algorithm tries to minimize the sustainable cost obtained from these initial solutions. TS-S-SAVING relatively and consistently outperforms in terms of the different ...
Following this approach we propose the Iterated Tabu Search and Variable Neighborhood Descent algorithm (ITS-VND) to minimize 〈R, U(X)〉. Compared with the existing Iterated Tabu Search algorithms for this problem (Fu et al., 2013, Huang et al., 2013, Huang et al., 2012, Ye et al.,...
Classically the UCP is formulated as follows [1]: the objective function of the UCP to minimize the production cost is mathematically formulated as,Min(Fuelcost+Start-upcost+Shut-downcost)($) Fuzzy logic modelling of the UC problem Fuzzy set theory is a generalization of traditional crisp set ...
minimize total assigning cost and fulfill additional side constraints. Denote by the cost of assigning lecture i to the time period j. This cost must be specified in terms of availability and preferences of the lecturer responsible for lecture i. In this model, the preference of lecturers ...
This paper proposes a multi-start local search algorithm that solves the flexible job-shop scheduling (FJSP) problem to minimize makespan. The proposed algorithm uses a path-relinking method to generate near optimal solutions. A heuristic parameter, alpha, is used to assign machines to operations....
Problem \(\mathcal {A}\): Specify the real-valued continuous optimal control \(u^*(t)\) and the corresponding optimal state \(x^*(t)\), \(t\in [0,1]\), that maximize (or minimize) the functional $$\begin{aligned} {\mathcal {J}}(x,u)=\int _{0}^{1}{\mathcal {F}}...
The objective is to minimize the sum of the traveling costs related to the performed routes. The proposed algorithm is based on a heuristic framework previously introduced by the authors for the solution of the Capacitated Location Routing Problem (CLRP). The algorithm applies a hybrid Granular ...
With the previously defined parameters and decision variables, the objective function is expressed as follows:(1)Minimize∑i∈H∑j∈H:j>ifijZij+∑k∈HfhkXkkIn the objective function, in the first term, we sum the individual fixed costs of establishing hub links; in the second term, we ...