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 paper proposes a multi-objective model for the economic-statistical design of the variable sample size and sampling interval multivariate exponentially weighted moving average control chart by using double warning lines. The Markov chain approach is used to obtain the statistical properties. We extend the Lorenzen and Vance cost function considering multiple assignable causes and multivari...

assigning facilities to locations is one of the important problems, which significantly is influence in transportation cost reduction. in this study, we solve quadratic assignment problem (qap), using a meta-heuristic algorithm with deterministic tasks and equality in facilities and location number. it should be noted that any facility must be assign to only one location. in this paper, first o...

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...

Dealing with multi-objective combinatorial optimization and local search, this article proposes a new multi-objective meta-heuristic named Pareto Adaptive Decomposition algorithm (PAD). Combining ideas from decomposition methods, two phase algorithms and multi-armed bandit, PAD provides a 2-phase modular framework for finding an approximation of the Pareto front. The first phase decomposes the ...

in this paper, matlab code for a recently developed meta-heuristic methodology, the vibrating particles system (vps) algorithm, is presented. the vps is a population-based algorithm which simulates a free vibration of single degree of freedom systems with viscous damping. the particles gradually approach to their equilibrium positions that are achieved from current population and historically b...

this article addresses a single row facility layout problem where the objective is to optimize the arrangement of some rectangular facilities with different dimensions on a line. regarding the np-hard nature of the considered problem, a hybrid meta-heuristic algorithm based on simulated annealing has been proposed to obtain a near optimal solution. a number of test problems are randomly generat...

periodic vehicle routing problem focuses on establishing a plan of visits to clients over a given time horizon so as to satisfy some service level while optimizing the routes used in each time period. this paper presents a new effective heuristic algorithm based on data mining tools for periodic vehicle routing problem (pvrp). the related results of proposed algorithm are compared with the resu...

The purpose of this article is to review the literature on the topic of deterministic vehicle routing problem (VRP) and to give a review on the exact and approximate solution techniques. More specifically the approximate (meta-heuristic) solution techniques are classified into: tabu search, simulated annealing, genetic algorithm, evolutionary algorithm, hybrid algorithm, and Ant Colony Opti...

this study is investigated the optimum parameters for a tuned mass damper (tmd) under the seismic excitation. shuffled complex evolution (sce) is a meta-heuristic optimization method which is used to find the optimum damping and tuning frequency ratio for a tmd. the efficiency of the tmd is evaluated by decreasing the structural displacement dynamic magnification factor (ddmf) and acceleration ...