FRINK Linked Data Fragments server

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

• W2955831796 abstract "The Vehicle Routing Problem (VRP) is a family of Combinatorial Optimization Problems generally used to solve different issues related to transportation systems and logistics. In this thesis, we focused our attention on a variant of the VRP called the Team Orienteering Problem (TOP). In this family of problems, it is a priory impossible to visit all the customers due to travel time limitation on vehicles. Instead, a profit is associated with each customer to represent its value and it is collected once the customer is visited by one of the available vehicles. The objective function is then to maximize the total collected profit with respect to the maximum travel time. Firstly, we introduced a new generalization for the TOP that we called the Clustered TOP (CluTOP). In this variant, the customers are grouped into subsets called clusters to which we associate profits. To solve this variant, we proposed an exact scheme based on the cutting plane approach with additional valid inequalities and pre-processing techniques. We also designed a heuristic method based on the order first-cluster second approach for the CluTOP. This Hybrid Heuristic combines between an ANLS heuristic that explores the solutions space and a splitting procedure that explores the giant tours search space. In addition, the splitting procedure is enhanced by local search procedure in order to enhance its coverage of search space. The second problem treated in this work is called the Synchronized Team Orienteering Problem with Time Windows (STOPTW). This variant was initially proposed in order to model scenarios related to asset protection during escaped wildfires. It considers the case of a heterogeneous fleet of vehicles along with time windows and synchronized visits. To solve this problem, we proposed a heuristic method based on the GRASP×ILS approach that led to a very outstanding results compared to the literature. The last variant of the TOP tackled in this thesis called the Set Orienteering Problem (SOP). Customers in this variant are grouped into subsets called clusters. Each cluster is associated with a profit which is gained if at least one customer is served by the single available vehicle. We proposed a Branch-and-Cut with two separation procedures to separate subtours elimination constraints. We also proposed a Memetic Algorithm with an optimal splitting procedure based on dynamic programming." @default.
• W2955831796 created "2019-07-12" @default.
• W2955831796 creator A5068570414 @default.
• W2955831796 date "2018-12-11" @default.
• W2955831796 modified "2023-09-23" @default.
• W2955831796 title "Selective vehicle routing problem : cluster and synchronization constraints" @default.
• W2955831796 hasPublicationYear "2018" @default.
• W2955831796 type Work @default.
• W2955831796 sameAs 2955831796 @default.
• W2955831796 citedByCount "0" @default.
• W2955831796 crossrefType "dissertation" @default.
• W2955831796 hasAuthorship W2955831796A5068570414 @default.
• W2955831796 hasConcept C123784306 @default.
• W2955831796 hasConcept C126255220 @default.
• W2955831796 hasConcept C134306372 @default.
• W2955831796 hasConcept C162324750 @default.
• W2955831796 hasConcept C173801870 @default.
• W2955831796 hasConcept C175444787 @default.
• W2955831796 hasConcept C177148314 @default.
• W2955831796 hasConcept C181622380 @default.
• W2955831796 hasConcept C31258907 @default.
• W2955831796 hasConcept C33923547 @default.
• W2955831796 hasConcept C41008148 @default.
• W2955831796 hasConcept C42475967 @default.
• W2955831796 hasConcept C513932644 @default.
• W2955831796 hasConcept C74172769 @default.
• W2955831796 hasConceptScore W2955831796C123784306 @default.
• W2955831796 hasConceptScore W2955831796C126255220 @default.
• W2955831796 hasConceptScore W2955831796C134306372 @default.
• W2955831796 hasConceptScore W2955831796C162324750 @default.
• W2955831796 hasConceptScore W2955831796C173801870 @default.
• W2955831796 hasConceptScore W2955831796C175444787 @default.
• W2955831796 hasConceptScore W2955831796C177148314 @default.
• W2955831796 hasConceptScore W2955831796C181622380 @default.
• W2955831796 hasConceptScore W2955831796C31258907 @default.
• W2955831796 hasConceptScore W2955831796C33923547 @default.
• W2955831796 hasConceptScore W2955831796C41008148 @default.
• W2955831796 hasConceptScore W2955831796C42475967 @default.
• W2955831796 hasConceptScore W2955831796C513932644 @default.
• W2955831796 hasConceptScore W2955831796C74172769 @default.
• W2955831796 hasLocation W29558317961 @default.
• W2955831796 hasOpenAccess W2955831796 @default.
• W2955831796 hasPrimaryLocation W29558317961 @default.
• W2955831796 hasRelatedWork W1973751736 @default.
• W2955831796 hasRelatedWork W2031321347 @default.
• W2955831796 hasRelatedWork W2062548183 @default.
• W2955831796 hasRelatedWork W2064310122 @default.
• W2955831796 hasRelatedWork W2081238416 @default.
• W2955831796 hasRelatedWork W2154072282 @default.
• W2955831796 hasRelatedWork W2226441202 @default.
• W2955831796 hasRelatedWork W2314759401 @default.
• W2955831796 hasRelatedWork W2503238886 @default.
• W2955831796 hasRelatedWork W2519604800 @default.
• W2955831796 hasRelatedWork W2586188487 @default.
• W2955831796 hasRelatedWork W2596896931 @default.
• W2955831796 hasRelatedWork W2750785333 @default.
• W2955831796 hasRelatedWork W2756951932 @default.
• W2955831796 hasRelatedWork W2775816300 @default.
• W2955831796 hasRelatedWork W2792393192 @default.
• W2955831796 hasRelatedWork W2912308641 @default.
• W2955831796 hasRelatedWork W2961954026 @default.
• W2955831796 hasRelatedWork W3011060557 @default.
• W2955831796 hasRelatedWork W3026108258 @default.
• W2955831796 isParatext "false" @default.
• W2955831796 isRetracted "false" @default.
• W2955831796 magId "2955831796" @default.
• W2955831796 workType "dissertation" @default.