Showing 1 - 7 of 7
algorithms and approximation methods. To the best of our knowledge, this paper presents one of the first metaheuristic approaches …
Persistent link: https://www.econbiz.de/10005588096
We focus on the D-optimal design of screening experiments involving main-effects regression models, especially with large numbers of factors and observations. We propose a new selection strategy for the coordinate-exchange algorithm based on an orthogonality measure of the design. Computational...
Persistent link: https://www.econbiz.de/10010839858
seconds, we also propose a Large Neighborhood Search metaheuristic. This solution approach can be applied at high frequency to … cope with the dynamics and uncertainties in a disaster situation. Our experiments show that the metaheuristic produces near …
Persistent link: https://www.econbiz.de/10010839916
In this paper we defi?ne a new problem, the aim of which is to fi?nd a set of k dissimilar alternative solutions for a vehicle routing problem (VRP) on a single instance. ?This problem has several practical applications in the cash-in-transit sector and in the transportation of hazardous...
Persistent link: https://www.econbiz.de/10010839935
waiting times, delimits the customer's visit within a specified time interval. Two metaheuristic algorithms have been …
Persistent link: https://www.econbiz.de/10010710026
the problem is proposed and solved by using a progressive multi-objective metaheuristic. Realistic instances are also …
Persistent link: https://www.econbiz.de/10010961064
In this paper, we propose a new metaheuristic to solve the Risk constrained Cash-in-Transit Vehicle Routing Problem … metaheuristic, called aLNS (Ant colony heuristic with Large Neighbourhood Search), is described. The aLNS metaheuristic combines the …
Persistent link: https://www.econbiz.de/10010941824