this paper introduces a technique for controlling a class of uncertain chaotic systems using an adaptive fuzzy proportional-integrator-derivative (pid) controller with h∞ tracking performance. the purpose of this work is to achieve optimal tracking performance of the controller using backtracking search algorithm (bsa). bsa, which is a novel heuristic algorithm, has an easy structure with singl...

In this paper, we present a parallel greedy randomized adaptive search procedure (GRASP) for the Steiner problem in graphs. GRASP is a two phase metaheuristic. In the first phase, solutions are constructed using a greedy randomized procedure. Local search is applied in the second phase, leading to a local minimum with respect to a specified neighborhood. In the Steiner problem in graphs, feasib...

Local branching is a general purpose heuristic method which searches locally around the best known solution by employing tree search. It has been successfully used in Mixed Integer Programming (MIP) where local branching constraints are used to model the neighborhood of an incumbent solution and improve the bound. The neighborhoods are obtained by linear inequalities in the MIP model so that MI...

In this paper, scheduling problem of flowshop with the criterion of minimizing the total flow time has been considered. An effective hybrid Quantum Genetic Algorithm and Variable Neighborhood Search (QGA-VNS or QGAVNS) has been proposed as solution of Flow Shop Scheduling Problem (FSSP). First, the QGA is considered for global search in optimal solution and then VNS has been integrated for enha...

The Technician Routing and Scheduling Problem (TRSP) consists in routing staU to serve requests for service, taking into account time windows, skills, tools, and spare parts. Typical applications include maintenance operations and staU routing in telecoms, public utilities, and in the health care industry. In this paper we tackle the Dynamic TRSP (D-TRSP) in which new requests appear over time....

Most of the studies on vehicle routing problem with time windows (VRPTW) aim to minimize total travel distance or travel time. This paper presents the VRPTW with a new objective function of minimizing the total fuel consumption. A mathematical model is proposed to formulate this problem. Then, a novel tabu search algorithm with a random variable neighborhood descent procedure (RVND) is given, w...

To reduce delivery failures in last mile delivery, several types of options have been proposed the past twenty years. Still, customer satisfaction is a challenge because single location chosen independently time at which customer’s order will be delivered. In addition, shared locations such as lockers and shops also experience failure due to capacity or opening-time issues moment delivery. addr...

Multi-Agent Path Finding (MAPF) is the problem of planning collision-free paths for multiple agents in a shared environment. In this paper, we propose novel algorithm MAPF-LNS2 based on large neighborhood search solving MAPF efficiently. Starting from set that contain collisions, repeatedly selects subset colliding and replans their to reduce number collisions until become collision-free. We co...