FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W84627033> ?p ?o ?g. }

• W84627033 abstract "INTRODUCTIONThe planners using TRP pass four steps in generating a plan. Successively, the planners manually plan some difficult customers, TRP generates an initial solution with the sequential insertion algorithm, TRP improves this solution with the improvement steps, and the planners make some manually adjustments to the generated trips. Especially this last step cost the planners too much time at this moment. However, with these manual adjustments the planners are able not only to improve the visual attractiveness of the plan, but also the costs, number of kilometers driven, and the number of driving hours. The goal of the research is to “find the cause why the plan generated with TRP is visually less attractive than the plan after the manual adjustments of the planners and develop an improvement of the current planning algorithm used by TRP with a focus on improving the initial solution”CAUSE OF THE PROBLEMIn this research, we used the customer Zeeman as leading example. We investigated the cause of the problem by analyzing the differences between the plan generated with the current algorithm of TRP and the plan that is manually adjusted by the planners of Zeeman. Two important characteristics of the planning, which make it difficult to generate a clustered and feasible plan, are the time windows of the orders and the required vehicle types for delivery of orders.We defined indicators that examine the quality of the plan and indicators that specifically judge the extent of clustering in a plan. The four indicators of the latter are: the number of cities that are visited by more vehicles than required, the average driven distance between the first and the last order in a trip, the average radius of the clusters, and the average capacity utilization of the vehicles.We found that on all indicators, the manually adjusted plan of Zeeman scores better than the plan generated by TRP’s original algorithm. We concluded that it was not possible to identify one single cause. The most plausible explanation is that the planners explore the neighborhood of the location of the order before inserting the order into a trip, where TRP does not consider this.CURRENT ALGORITHM OF TRPThe current algorithm in TRP consists of two phases. In the first phase, TRP generates an initial solution. The initial solution is generated with the sequential insertion algorithm. This algorithm consists of four steps:1. Select a vehicle2. Select a seed order3. Assign orders to the trip4. Move the trip to a smaller vehicleIn the second phase of TRP’s current algorithm, the initial solution is improved by performingseveral improvement steps based on local search.DEVELOPED APPROACHESWhen we analyzed the operating procedure of the sequential insertion algorithm in the providedcases, we concluded that we tackle the heart of the problem when we improve the second step:select the seed order. The most promising solution found in literature is the circle covering methodof Savelsbergh (1990). We used this method as a basis for generating the clusters in the approacheswe developed. We generate a cluster for each order and determine the radius of this cluster. Next,we defined two different methods to determine which seed order to use (sequential approach) orwhich cluster to merge (parallel approach). In the first method, we select the cluster with thesmallest radius. In the second method, we select the cluster with the largest difference between theradii of different shifts. We call the selection criterion of the method the incentive.We developed two approaches.The first approach is a parallel approach. In the parallel approach, we simultaneously merge thetwo clusters with the highest incentive. We tested the approach with both the smallest radius andthe largest difference incentive. The parallel approach shows multiple strong points on which theplan is improved. With both incentives, the visual attractiveness scores high; the solution looksmore clustered. This is confirmed by the performance indicators. There are some trips withviolations.The second approach is an adjustment to the sequential insertion algorithm. We developed twovariants. In the first variant, we only change the seed selection step. We use the smallest radius of acluster or the largest difference between the radii of different shifts as selection criterion. Thevariant with the smallest radius does not give a feasible solution; there are too many unplannedorders because the required vehicle was no longer available. With the largest difference incentive,we overcome this problem. We again used one of the incentives as selection criterion for the seed,but in the approach, this is the first step of the algorithm and we select the vehicle in the secondstep.CONCLUSIONThe parallel approach scores relatively high on clustering, but the costs are relatively high in comparison to the sequential approach. This is mainly caused by the additional number of vehicles the parallel approach needs to plan all orders. The largest difference incentive gave for both approaches a better result. In that method, we consider both the time windows of the orders and the vehicle preference of neighboring orders in our selection process for a seed order.We concluded that we succeed in improving the plan of TRP for the case of Zeeman. The two most promising approaches are the parallel approach with the smallest radius incentive and the sequential insertion algorithm with seed selection as first step. The sequential approach gives a better overall result, where the parallel approach gives better results with respect to clustering. It depends on the preference of the planners which method they prefer. Most planners will prefer to improve the visual attractiveness of the plan, which would plead for the sequential insertion algorithm with seed selection as first step and the largest difference incentive." @default.
• W84627033 created "2016-06-24" @default.
• W84627033 creator A5058828558 @default.
• W84627033 date "2014-01-01" @default.
• W84627033 modified "2023-09-27" @default.
• W84627033 title "Seed selection in multi-period planning with time windows" @default.
• W84627033 hasPublicationYear "2014" @default.
• W84627033 type Work @default.
• W84627033 sameAs 84627033 @default.
• W84627033 citedByCount "0" @default.
• W84627033 crossrefType "dissertation" @default.
• W84627033 hasAuthorship W84627033A5058828558 @default.
• W84627033 hasConcept C111472728 @default.
• W84627033 hasConcept C120665830 @default.
• W84627033 hasConcept C121332964 @default.
• W84627033 hasConcept C127413603 @default.
• W84627033 hasConcept C138885662 @default.
• W84627033 hasConcept C147176958 @default.
• W84627033 hasConcept C154945302 @default.
• W84627033 hasConcept C166957645 @default.
• W84627033 hasConcept C184603391 @default.
• W84627033 hasConcept C192209626 @default.
• W84627033 hasConcept C205649164 @default.
• W84627033 hasConcept C21547014 @default.
• W84627033 hasConcept C2776505523 @default.
• W84627033 hasConcept C2779530757 @default.
• W84627033 hasConcept C29760336 @default.
• W84627033 hasConcept C41008148 @default.
• W84627033 hasConcept C42475967 @default.
• W84627033 hasConcept C4792198 @default.
• W84627033 hasConcept C81917197 @default.
• W84627033 hasConceptScore W84627033C111472728 @default.
• W84627033 hasConceptScore W84627033C120665830 @default.
• W84627033 hasConceptScore W84627033C121332964 @default.
• W84627033 hasConceptScore W84627033C127413603 @default.
• W84627033 hasConceptScore W84627033C138885662 @default.
• W84627033 hasConceptScore W84627033C147176958 @default.
• W84627033 hasConceptScore W84627033C154945302 @default.
• W84627033 hasConceptScore W84627033C166957645 @default.
• W84627033 hasConceptScore W84627033C184603391 @default.
• W84627033 hasConceptScore W84627033C192209626 @default.
• W84627033 hasConceptScore W84627033C205649164 @default.
• W84627033 hasConceptScore W84627033C21547014 @default.
• W84627033 hasConceptScore W84627033C2776505523 @default.
• W84627033 hasConceptScore W84627033C2779530757 @default.
• W84627033 hasConceptScore W84627033C29760336 @default.
• W84627033 hasConceptScore W84627033C41008148 @default.
• W84627033 hasConceptScore W84627033C42475967 @default.
• W84627033 hasConceptScore W84627033C4792198 @default.
• W84627033 hasConceptScore W84627033C81917197 @default.
• W84627033 hasLocation W846270331 @default.
• W84627033 hasOpenAccess W84627033 @default.
• W84627033 hasPrimaryLocation W846270331 @default.
• W84627033 hasRelatedWork W1588038427 @default.
• W84627033 hasRelatedWork W193047974 @default.
• W84627033 hasRelatedWork W199106599 @default.
• W84627033 hasRelatedWork W2134972063 @default.
• W84627033 hasRelatedWork W2186214397 @default.
• W84627033 hasRelatedWork W2246679964 @default.
• W84627033 hasRelatedWork W2295070815 @default.
• W84627033 hasRelatedWork W2413558971 @default.
• W84627033 hasRelatedWork W2787412873 @default.
• W84627033 hasRelatedWork W2891202616 @default.
• W84627033 hasRelatedWork W2901154197 @default.
• W84627033 hasRelatedWork W2949360824 @default.
• W84627033 hasRelatedWork W2952901870 @default.
• W84627033 hasRelatedWork W3113576081 @default.
• W84627033 hasRelatedWork W3158580671 @default.
• W84627033 hasRelatedWork W40476960 @default.
• W84627033 hasRelatedWork W40726722 @default.
• W84627033 hasRelatedWork W187533961 @default.
• W84627033 hasRelatedWork W2549699452 @default.
• W84627033 hasRelatedWork W3114270212 @default.
• W84627033 isParatext "false" @default.
• W84627033 isRetracted "false" @default.
• W84627033 magId "84627033" @default.
• W84627033 workType "dissertation" @default.