@prefix dcat: <http://www.w3.org/ns/dcat#> .
@prefix dct: <http://purl.org/dc/terms/> .
@prefix foaf: <http://xmlns.com/foaf/0.1/> .
@prefix vcard: <http://www.w3.org/2006/vcard/ns#> .
@prefix xsd: <http://www.w3.org/2001/XMLSchema#> .

<https://rec.harvest-normandie.data4citizen.com/dataset/oai-hal-tel-00844699v1> a dcat:Dataset ;
    dct:description """
              In this thesis, we deal with modeling and solving various problems including vehicle routing and scheduling. We propose approximate methods that aim to solve problems qui- ckly and e ciently. Five problems are addressed. The rst one is the Resource-Constrained Project Scheduling Problem (RCPSP) for which a multi-commodity ow approach is intro- duced. We also consider methods dealing with extensions of this problem ( nancial or time constraints). The second one is a two dimensional Orthogonal Packing Problem (2OPP) with the resolution being based on its RCPSP relaxation. The third one is the Stacker Crane Problem (SCP). It is a pickup and delivery problem: goods must be transported from starting points to various destinations with a eet of vehicles. In the SCP, a single one-capacity vehicle is available. We propose original tree based models and algorithms for the preemptive case. The fourth one is a Dial-a-Ride Problem (DARP) with nancial constraints. We solve this problem through an insertion heuristic using a constraint pro- pagation technique. The fth one combines routing problem and two dimensional packing. It is the 2L-CVRP in which items have to be delivered to customers. A GRASP ELS framework is introduced for this problem. Experimental results show the e ectiveness of the proposed methods.
            """ ;
    dct:identifier "NNT: 2010CLF22053" ;
    dct:issued "2026-05-10T08:34:07.610083"^^xsd:dateTime ;
    dct:language "fr" ;
    dct:modified "2026-05-10T08:34:07.610088"^^xsd:dateTime ;
    dct:publisher <https://rec.harvest-normandie.data4citizen.com/organization/cce9db95-46d9-4dc2-84b6-764215d0a002> ;
    dct:title "Time-salving algorithms for vehicule routing and scheduling problems" ;
    dcat:contactPoint [ a vcard:Organization ;
            vcard:fn "CCSD" ] ;
    dcat:distribution <https://rec.harvest-normandie.data4citizen.com/dataset/oai-hal-tel-00844699v1/resource/7fcc9299-11b9-4627-8da2-c2eb54785f6a> ;
    dcat:keyword "complexite",
        "complexity",
        "heuristics",
        "heuristiques",
        "infoeu-reposemanticsdoctoralthesis",
        "infoinfo-dscomputer-science-csdata-structures-and-algorithms-csds",
        "metaheuristics",
        "metaheuristiques",
        "multi-commodity",
        "ordonnancement",
        "packing",
        "placement",
        "scheduling",
        "theses",
        "transport",
        "vehicle-routing" ;
    dcat:landingPage <https://theses.hal.science/tel-00844699> .

<https://rec.harvest-normandie.data4citizen.com/dataset/oai-hal-tel-00844699v1/resource/7fcc9299-11b9-4627-8da2-c2eb54785f6a> a dcat:Distribution ;
    dct:format "HTML" ;
    dct:issued "2026-05-10T08:34:07.613276"^^xsd:dateTime ;
    dct:modified "2026-05-10T08:34:07.591482"^^xsd:dateTime ;
    dct:title "Time-salving algorithms for vehicule routing and scheduling problems" ;
    dcat:accessURL <https://theses.hal.science/tel-00844699> .

<https://rec.harvest-normandie.data4citizen.com/organization/cce9db95-46d9-4dc2-84b6-764215d0a002> a foaf:Agent ;
    foaf:name "test_moissonnage_selune" .

<https://theses.hal.science/tel-00844699> a foaf:Document .