Showing 91 - 100 of 339
In this paper, we present the orienteering problem with hotel selection (OPHS), an extension of the orienteering problem (OP). In the OPHS, a set of vertices with a score and a set of hotels are given. The goal is to determine a fixed number of connected trips that visits some vertices and...
Persistent link: https://www.econbiz.de/10010681844
If railway companies ask for station capacity numbers, their underlying question is in fact one about the platformability of extra trains. Train platformability depends not only on the infrastructure, buffer times, and the desired departure and arrival times of the trains, but also on route...
Persistent link: https://www.econbiz.de/10010753663
Persistent link: https://www.econbiz.de/10010155936
Persistent link: https://www.econbiz.de/10007259728
The Single-Vehicle Cyclic Inventory Routing Problem (SV-CIRP) belongs to the class of Inventory Routing Problems (IRP) in which the supplier optimises both the distribution costs and the inventory costs at the customers. The goal of the SV-CIRP is to minimise both kinds of costs and to maximise...
Persistent link: https://www.econbiz.de/10010776929
In order to improve the robustness of a railway system in station areas, this paper introduces an iterative approach to successively optimize the train routing through station areas and to enhance this solution by applying some changes to the timetable in a tabu search environment. We present...
Persistent link: https://www.econbiz.de/10010871085
In the team orienteering problem (TOP) a set of locations is given, each with a score. The goal is to determine a fixed number of routes, limited in length, that visit some locations and maximise the sum of the collected scores. This paper describes an algorithm that combines different local...
Persistent link: https://www.econbiz.de/10005287875
During the last decade, a number of challenging applications in logistics, tourism and other fields were modelled as orienteering problems (OP). In the orienteering problem, a set of vertices is given, each with a score. The goal is to determine a path, limited in length, that visits some...
Persistent link: https://www.econbiz.de/10008865182
Traditional route planners assist in finding the shortest or fastest route from one place to another. This paper presents a novel approach to path finding in a directed graph, namely a target distance, motivated by the problem that a recreational cyclist deals with when searching a nice route of...
Persistent link: https://www.econbiz.de/10008869787
During the past decades, several joint maintenance and inventory optimization systems have been studied in literature. Compared to the sequential optimization of both models, Kabir and Al-Olayan (1996) reported a remarkable influence on total cost due to their joint optimization method. This...
Persistent link: https://www.econbiz.de/10010665787