We study the Mixed Capacitated General Routing Problem (MCGRP) in which a fleet of capacitated vehicles has to serve a set of requests by traversing a mixed weighted graph. The requests may be located on nodes, edges, and arcs. The problem has theoretical interest because it is a generalization of the Capacitated Vehicle Routing Problem (CVRP), the Capacitated Arc Routing Problem (CARP), and th...

The generalized minimum spanning tree problem is a generalization of the minimum spanning tree problem. This network design problems finds several practical applications, especially when one considers the design of a large-capacity backbone network connecting several individual networks. In this paper we study the performance of six neighborhood search heuristics based on tabu search and variab...

The soft-clustered vehicle-routing problem (SoftCluVRP) is a variant of the classical capacitated problem. Customers are partitioned into clusters and all customers same cluster must be served by vehicle. In this paper, we present large multiple neighborhood search for SoftCluVRP. We design analyze destroy repair operators as well two post-optimization components, which both based on variable d...

Abstract Minimizing the setup costs caused by color changes is one of main concerns for paint shop scheduling in automotive industry. Yet, finding an optimized sequence a very challenging task, as large number exterior systems car manufacturing need to be painted variety different colors. Therefore, there strong efficient automated solutions this area. Previously, exact and metaheuristic approa...

Dispatching vehicle fleets to serve flights is a key task in airport ground handling (AGH). Due the notable growth of flights, it challenging simultaneously schedule multiple types operations (services) for large number where each type operation performed by one specific fleet. To tackle this issue, we first represent scheduling as complex routing problem and formulate mixed integer linear prog...

Operation of multi-reservoir systems is known as complicated and often large-scale optimization problems. The problems, because of broad search space, nonlinear relationships, correlation of several variables, as well as problem uncertainty, are difficult requiring powerful algorithms with specific capabilities to be solved. In the present study a Self-adaptive version of Melody Search algorith...

Abstract Timetabling problems are specific types of scheduling that deal with assigning certain events to the timeslots. This is subject hard constraints should be achieved get a feasible timetable and soft must meet as many possible during forming schedule. paper introduces an adaptive tabu search. Eleven benchmark datasets year 2002 applied show effectiveness introduced algorithm. These consi...

Factory management plays an important role in improving the productivity and quality of service in the production process. In particular, the distributed permutation flow shop scheduling problem with multiple factories is considered a priority factor in the factory automation. This study proposes a novel model of the developed distributed scheduling by supplementing the reentrant characteristic...

The pickup and delivery problem with time windows is the problem of serving a number of transportation requests using a limited amount of vehicles. Each request involves moving a number of goods from a pickup location to a delivery location. Our task is to construct routes that visit all locations such that corresponding pickups and deliveries are placed on the same route and such that a pickup...