Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 14 of 14 for “"Dynamic Vehicle Routing Problem"”.

  1. Dynamic vehicle routing problem with industry 4.0 approach

    … their challenges, particularly those that are dynamic, such as dynamic vehicle routing problems. To prepare dynamic supply chain systems for organizations, Industry 4.0 must be applied. Despite ample studies that consider the Dynamic Vehicle Routing Problem (DVRP), the interactions between …

    wichita-thes Repository record for Dynamic vehicle routing problem with industry 4.0 approach (opens in a new tab)

  2. Using group role assignment to solve Dynamic Vehicle Routing Problem

    The Dynamic Vehicle Routing Problem (DVRP) is a more complex problem than the traditional Vehicle Routing Problem (VRP) in the combinatorial optimization of operations research. With more degrees of freedom, DVRP introduces new challenges while judging the merit of a given route plan. This thesis …

    laurentian Repository record for Using group role assignment to solve Dynamic Vehicle Routing Problem (opens in a new tab)

  3. Solving the dynamic vehicle routing problem with mixed backhauls through re-optimization

    In this dissertation we studied the Dynamic Vehicle Routing Problem with Mixed Backhauls (DVRPMB), which seeks to assign, in the most efficient way, dynamic pick-up requests that arrive in real-time while a predefined distribution plan is being executed. We used periodic re-optimization to deal …

    greece Repository record for Solving the dynamic vehicle routing problem with mixed backhauls through re-optimization (opens in a new tab)

  4. ONLINE VEHICLE ROUTING UNDER STOCHASTIC DEMANDS USING APPROXIMATE DYNAMIC PROGRAMMING

    This thesis studies an instance of a Dynamic Vehicle Routing Problem (DVRP) under Stochastic Demands, drawn from a real-world situation. Specifically, a single courier must accomplish two kinds of tasks: deliveries that are known from the beginning of operations, and pickups that appear after the …

    nus Repository record for ONLINE VEHICLE ROUTING UNDER STOCHASTIC DEMANDS USING APPROXIMATE DYNAMIC PROGRAMMING (opens in a new tab) Download file for ONLINE VEHICLE ROUTING UNDER STOCHASTIC DEMANDS USING APPROXIMATE DYNAMIC PROGRAMMING (opens in a new tab)

  5. Analysis of the Dynamic Travelling Salesman Problem with Different Policies

    … analyze new policies for the traveling salesman problem in a dynamic and stochastic environment (DTSP). The DTSP is defined as follows: demands for service arrive in time according to a Poisson process, are independent and uniformly distributed in a Euclidean region of bounded area, and the time …

    concordia Download PDF for Analysis of the Dynamic Travelling Salesman Problem with Different Policies (opens in a new tab)

  6. Um modelo de otimização de roteamento em tempo real de veículos de apoio marítimo de plataformas offshore

    … of the oil and gas industry, the supply vessel routing problem in offshore platform groups possesses various variants. The problem variant treated in this work is concerned with the routing of supply vessels whereby two types of service requests are allowed: planned service requests, which are …

    brazil-uerj Repository record for Um modelo de otimização de roteamento em tempo real de veículos de apoio marítimo de plataformas offshore (opens in a new tab)

  7. Dynamic boundary guarding against radially incoming targets

    … safety perspective. Recent growth in autonomous vehicle technology has led to assigning these monotonous tasks to the autonomous vehicles. This assignment requires design of a set of motion laws for these autonomous vehicles that are both effective and efficient, with provable bounds. This thesis …

    msu Repository record for Dynamic boundary guarding against radially incoming targets (opens in a new tab)

  8. Putting the ping into online shopping: Dynamic Heuristics for Vehicle Routing and Slot Offering

    This thesis deals with a real-world optimisation problem arising within the context of attended home delivery of groceries. Customers must choose a delivery slot during which they are able to accept their delivery, and retailers must ensure that each customer is served during their chosen slot. The …

    lancaster Download PDF for Putting the ping into online shopping: Dynamic Heuristics for Vehicle Routing and Slot Offering (opens in a new tab)

  9. Using Metaheuristics to solve Dynamic Vehicle Routing Problems

    The Vehicle Routing Problem (VRP) is considered to be a complex and high-level set of various routing problems. One of its important variants is the Dynamic Vehicle Routing Problem (DVRP), in which not all customers are known in advance, but are revealed as the system progresses. Consequently, DVRP …

    unsw Repository record for Using Metaheuristics to solve Dynamic Vehicle Routing Problems (opens in a new tab)

  10. Bayesian Reinforcement Learning on Semi–Markov Decision Processes

    … of supply chains as the usage of automated vehicles is increasing. Further, utilising historical data and domain knowledge to increase the performance and ensure robust behaviour of the decision–making agent is valuable from an industry point of view. The dynamic vehicle routing problem …

    chalmers Repository record for Bayesian Reinforcement Learning on Semi–Markov Decision Processes (opens in a new tab)

  11. SHUTTLE-LINE ROUTING FOR MOBILITY-ON-DEMAND SYSTEMS WITH RIDESHARING

    … is a car-sharing scheme in which users pick up a vehicle from one rack and drive to another rack near their destination. This allows MoD to provide a private car service that is cheaper than owning one. Differently from MoD, ridesharing is a concept in which multiple users with a similar journey …

    nus Repository record for SHUTTLE-LINE ROUTING FOR MOBILITY-ON-DEMAND SYSTEMS WITH RIDESHARING (opens in a new tab) Download file for SHUTTLE-LINE ROUTING FOR MOBILITY-ON-DEMAND SYSTEMS WITH RIDESHARING (opens in a new tab)

  12. Dynamische Tourenplanung - Modifikation von klassischen Heuristiken für das Dynamische Rundreiseproblem (DTSP) und das Dynamische Tourenplanungsproblem (DVRP) mit der Möglichkeit der Änderung des aktuellen Fahrzeugzuges

    … Tourenplanung und Transportdisposition Planungsprobleme lösen, die ein hohes Maß an Dynamik aufweisen. Speziell die Inputfaktoren der Tourenplanung sind größtenteils dynamisch und stochastisch. Aus Sicht des Autors kann die Qualität von Tourplanungsergebnissen durch die zeitnahe Berücksichtigung …

    qucosa-diss

  13. Vehicle Routing for Emergency Evacuations

    … introduces and analyzes the Bus Evacuation Problem (BEP), a unique Vehicle Routing Problem motivated both by its humanitarian significance and by the routing and scheduling challenges of planning transit-based, regional evacuations. First, a variant where evacuees arrive at constant, …

    vt Repository record for Vehicle Routing for Emergency Evacuations (opens in a new tab)