Showing 1 - 10 of 1,979
We consider a problem faced by a buying office for one of the largest retail distributors in the world. The buying office plans the distribution of goods from Asia to various destinations across Europe. The goods are transported along shipping lanes by shipping companies, many of which have...
Persistent link: https://www.econbiz.de/10010574182
This paper focuses on vehicle routing problems with profits and addresses the so-called Capacitated Team Orienteering Problem. Given a set of customers with a priori known profits and demands, the objective is to find the subset of customers, for which the collected profit is maximized, and to...
Persistent link: https://www.econbiz.de/10010871271
heuristics for this problem and to present a tabu search heuristic for further improvement. Computational results indicate that … through determing the best visit day combination for each customer. For each problem a new tabu search heuristic is proposed …
Persistent link: https://www.econbiz.de/10009450177
Persistent link: https://www.econbiz.de/10009731223
Persistent link: https://www.econbiz.de/10010366179
Persistent link: https://www.econbiz.de/10009563773
Persistent link: https://www.econbiz.de/10011630515
Persistent link: https://www.econbiz.de/10012489664
heuristic finds optimal solutions for all test problems that can be solved exactly by a branch-and-cut algorithm, while running … exactly, the tabu search algorithm outperforms the best local search heuristic currently available. The performance gap …
Persistent link: https://www.econbiz.de/10009209357
In this paper we propose a heuristic for solving the problem of resource constrained preemptive scheduling in the two … minimization of makespan. The problem is NP-hard. The heuristic first sequences jobs on the machine at stage 1 and then solves the … sharing of the resources between the stages is taken into account is also derived. The performance of the heuristic evaluated …
Persistent link: https://www.econbiz.de/10010753509