Showing 1 - 10 of 1,335
tests show that our parameter-free algorithm is able to compete with state-of-the-art metaheuristics for the PFSP. Also, the …From a managerial point of view, the more effcient, simple, and parameter-free (ESP) an algorithm is, the more likely … it will be used in practice for solving real-life problems. Following this principle, an ESP algorithm for solving the …
Persistent link: https://www.econbiz.de/10010551634
tests show that our parameter-free algorithm is able to compete with state-of-the-art metaheuristics for the PFSP. Also, the …From a managerial point of view, the more efficient, simple, and parameter-free (ESP) an algorithm is, the more likely … it will be used in practice for solving real-life problems. Following this principle, an ESP algorithm for solving the …
Persistent link: https://www.econbiz.de/10011132909
classical heuristics is a powerful one that can be successfully applied in a variety of cases. Copyright Sociedad de Estadística …
Persistent link: https://www.econbiz.de/10010995375
The Minimum Latency Problem (MLP) is a variant of the Traveling Salesman Problem which aims to minimize the sum of arrival times at vertices. The problem arises in a number of practical applications such as logistics for relief supply, scheduling and data retrieval in computer networks. This...
Persistent link: https://www.econbiz.de/10010871181
present a brief discussion on the important issues in SCM. We then argue that metaheuristics can play an important role in …
Persistent link: https://www.econbiz.de/10005772349
considering multiple open vehicle routes and multiple depots. This paper compares three metaheuristics for the WRRP: an iterated …
Persistent link: https://www.econbiz.de/10010597578
this paper, we propose a simple yet effective iterated local search algorithm for the VRPB. Its main component is an … out in order to identify the most important components of the algorithm and to properly tune the values of their … parameters. The results of the computational experiments carried out show that this algorithm is very competitive in comparison …
Persistent link: https://www.econbiz.de/10011097721
subsequently considering parts of the problem. The second approach is a custom iterated local search algorithm (ILS) with a step …
Persistent link: https://www.econbiz.de/10010871094
Persistent link: https://www.econbiz.de/10008636326
In this paper, an approach based on Ant Colony Optimisation (ACO) is described for one-sided time constraint Vehicle Routing Problem (VRP), where the delivery of products from the depot to distribution centres has to take place within the maximum permissible time. The problem is described with...
Persistent link: https://www.econbiz.de/10010668934