This master thesis deals with a special variant of the Vehicle Routing Problem (VRP), where there are many customers per road segment. This kind of VRP arises in many real-life situations, e.g. mail delivery and garbage collection. VRP solvers are part of most Decision Support Systems (DSS) used by companies in this business sector. In an operational setting, it is often more important to get a...

BACKGROUND Malignant melanoma is the deadliest form of skin cancer and is refractory to conventional chemotherapy and radiotherapy. Therefore alternative approaches to treat this disease, such as immunotherapy, are needed. Melanoma vaccine design has mainly focused on targeting CD8+ T cells. Activation of effector CD8+ T cells has been achieved in patients, but provided limited clinical benefit...

The Vehicle Routing Problem (VRP) is a class of well-known NP-hard combinatorial optimisation problems. The VRP is concerned with the design of the optimal routes, used by a fleet of identical vehicles stationed at a central depot to serve a set of customers with known demands. In the basic version of the problem, known as a Capacitated VRP (CVRP), only capacity restrictions for vehicles are co...

We propose a heuristic for a class of vehicle routing problems (VRPs) with minmax objective. These include the Capacitated VRP, the Capacitated VRP with multiple use of vehicles, and the Traveling Salesman Problem with multiple use of vehicles. A tabu search based adaptive memory procedure of instances indicate that the method produces very good solutions within reasonable computing times.

In this paper, the frequency reuse and the distributed dynamic channel assignment for microcellular networks are studied. We show that it is possible to use carriers with violation to the frequency reuse pattern with an insignificant degradation of the quality of service. As a result, a new family of distributed dynamic channel assignment algorithms is presented: the DDCA with violation to the ...

Vehicle routing problem is one of the most important issues in transportation. Among VRP problems, the competitive VRP is more important because there is a tough competition between distributors and retailers. In this study we introduced new method for VRP in competitive environment. In these methods Two-Person Nonzero Sum games are defined to choose equilibrium solution. Therefore, revenue giv...

The vehicle routing problem (VRP) is a typical discrete combinatorial optimization problem, and many models algorithms have been proposed to solve the VRP its variants. Although existing approaches contributed significantly development of this field, these either are limited in size or need manual intervention choosing parameters. To difficulties, studies considered learning-based (LBO) VRP. Th...

With the development of economy, distribution problem logistics becomes more and complex. Based on traffic network data, this study analyzed vehicle routing (VRP), designed a dynamic with time window (DVRPTW) model, solved it genetic algorithm (GA). In order to improve performance algorithm, operation was improved, output solution further optimized by hill climbing algorithm. The analysis examp...

Vehicle routing problem is a kind of common problem in logistics distribution center, in order to solve the high delivery cost of VRP and time constraint problem, the VRP model with the object level and constraints by semi-soft time window is built. Aiming to the semi-soft time window constraints the optimization of the model is discussed. Finally the numerical examples prove the superiority of...

The vehicle routing problem (VRP) is an important aspect of transportation logistics with many variants. This paper studies the VRP with backhauls (VRPB) in which the set of customers is partitioned into two subsets: linehaul customers requiring a quantity of product to be delivered, and backhaul customers with a quantity to be picked up. The basic VRPB involves finding a collection of routes w...