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 16 of 16 for “"Split Delivery"”.

  1. Capacitated rural postman problem with time windows and split delivery

    The importance of effective and efficient distribution is evident from its associated costs. Transportation and shipping alone comprise roughly 15 percent of a product's sales in the U.S. Physical distribution is very energy and labor intensive, which have both become relatively more expensive in …

    arizona-thes Repository record for Capacitated rural postman problem with time windows and split delivery (opens in a new tab)

  2. Solving Combinatorial Optimization Problems Using Genetic Algorithms and Ant Colony Optimization

    … <p><strong><em>Ant colony optimization for the split delivery vehicle routing problem</em></strong></p> <p>An Ant Colony Optimization (ACO) based approach is presented to solve the Split Delivery Vehicle Routing Problem (SDVRP). SDVRP is a relaxation of the Capacitated Vehicle Routing Problem …

    utk-theses Repository record for Solving Combinatorial Optimization Problems Using Genetic Algorithms and Ant Colony Optimization (opens in a new tab)

  3. Integer Programming-Based Heuristics for Vehicle Routing Problems

    … VRP. We use integer programming to model the split delivery VRP with minimum delivery amounts, the multi-depot split delivery VRP, the period VRP, the standard VRP, and the multi-depot VRP. We apply our heuristics to benchmark problems from the literature and generate many new problems with …

    maryland Repository record for Integer Programming-Based Heuristics for Vehicle Routing Problems (opens in a new tab)

  4. A Study of Four Network Problems in Transportation, Telecommunications, and Supply Chain Management

    … In the second chapter we investigate the split delivery vehicle routing problem (SDVRP), where a customer's demand can be split among several vehicles. The third chapter deals with the regenerator location problem (RLP) that arises in optical networks. The fourth chapter solves the …

    maryland Repository record for A Study of Four Network Problems in Transportation, Telecommunications, and Supply Chain Management (opens in a new tab)

  5. Optimizing routes for order picking in warehouses.

    … logistics, with a particular focus on the Split Delivery Vehicle Routing Problem (SDVRP) encountered by the e-commerce company, Ellos Group. The SDVRP requires a solution that partitions demand between forklifts while satisfying routing and computational constraints in a warehouse setting …

    chalmers Repository record for Optimizing routes for order picking in warehouses. (opens in a new tab)

  6. A Meta-Heuristic Algorithm for Vehicle Routing Problem with Interdiction

    … Capacitated Vehicle Routing Problem (CVRP) and Split Delivery Vehicle Routing Problem (SDVRP), with and without interdiction. A feasibility analysis for small instances was developed using CPLEX, highlighting the sensitivity of VRPI solutions to interdiction probabilities, particularly in …

    mcmaster Repository record for A Meta-Heuristic Algorithm for Vehicle Routing Problem with Interdiction (opens in a new tab)

  7. Vehicle Routing Problems that Minimize the Completion Time: Heuristics, Worst-Case Analyses, and Computational Results

    … operations, the objective is often to finish the delivery or the task as soon as possible, not to plan routes with the minimum total distance. Even in commercial package delivery nowadays, companies are investing in new technologies to speed up delivery instead of focusing merely on the min-sum …

    maryland Repository record for Vehicle Routing Problems that Minimize the Completion Time: Heuristics, Worst-Case Analyses, and Computational Results (opens in a new tab)

  8. Σχεδιασμός, ανάπτυξη και εφαρμογές αυτόνομων οχημάτων στη γεωργία

    … for the robots. The problem is modeled as a Split Delivery Vehicle Routing Problem (SDVRP) and is formulated as mixed integer optimization that minimizes the maximum service time for the transport jobs. Simulation experiments are performed for robot teams of different sizes, and robots with …

    greece Repository record for Σχεδιασμός, ανάπτυξη και εφαρμογές αυτόνομων οχημάτων στη γεωργία (opens in a new tab)

  9. The Pickup and Delivery Problem with Split Loads

    … vehicle may service. We call this the Pickup and Delivery Problem with Split Loads (PDPSL). We model this problem as a dynamic program and introduce structural results that can help practitioners implement the use of split loads, including the definition of an upper bound on the benefit of split …

    gatech Repository record for The Pickup and Delivery Problem with Split Loads (opens in a new tab)

  10. Statistical and Machine Learning Approaches for Estimating Optimal Solution Values in Combinatorial Optimization: Applications to the Traveling Salesman and Vehicle Routing Problems

    … in operations to assess potential savings from split deliveries, helping them determine whether to implement the classic VRP scenario or adopt the Split Delivery Vehicle Routing Problem (SDVRP) senario. This dissertation introduces and rigorously evaluates statistical and machine learning models …

    maryland Repository record for Statistical and Machine Learning Approaches for Estimating Optimal Solution Values in Combinatorial Optimization: Applications to the Traveling Salesman and Vehicle Routing Problems (opens in a new tab)

  11. Robust vehicle routing in disaster relief and ride-sharing: models and algorithms

    … vehicle routing problem (CVRP) and the split delivery vehicle routing problem (SDVRP) with uncertain travel times and demands when planning vehicle routes for delivering critical supplies to the affected population in need after a disaster. A robust optimization approach is used for the …

    binghamton Repository record for Robust vehicle routing in disaster relief and ride-sharing: models and algorithms (opens in a new tab)

  12. Vehicle Routing Problem with Interdiction

    … and consider the multi-period expected delivery. Our objective is to minimize the total travel cost or to maximize the demand fulfillment, depending on the supply quantity. This problem is called the Vehicle Routing Problem with Interdiction (VRPI). We first prove that the proposed VRPI …

    mcmaster Repository record for Vehicle Routing Problem with Interdiction (opens in a new tab)

  13. A distribution network design model based on network splitting

    … important than ever. How to devise an efficient delivery network with low cost has attracted a significant amount of research over the years. The problem is called the Vehicle Routing Problem in literature, which is an extension of the Traveling Salesman Problem. Recently, a new branch of the …

    missouri Repository record for A distribution network design model based on network splitting (opens in a new tab)

  14. The split-demand one-commodity pickup-and-delivery travelling salesman problem.

    … to solve a particular problem known as The split-demand one-commodity pickup-and-delivery travelling salesman problem (SD1PDTSP). This combines three vehicle routing problems. The first one is the Capacitated Vehicle Routing Problem (CVRP), aiming at designing the routes for a vehicle fleet …

    ull Repository record for The split-demand one-commodity pickup-and-delivery travelling salesman problem. (opens in a new tab)

  15. Routing and Control of Unmanned Aerial Vehicles for Performing Contact-Based Tasks

    … systems. The VRP and its extension, the split delivery VRP (SVRP), are analyzed to determine the effects of using two different objective functions, the total cost objective, and the last delivery objective. A worst-case analysis suggests that using the SVRP can improve total costs by as …

    vt Repository record for Routing and Control of Unmanned Aerial Vehicles for Performing Contact-Based Tasks (opens in a new tab)

  16. A class of single vehicle routing problems with predefined customer sequence and depot returns

    … VRP), με πολλαπλές παραδόσεις ανά πελάτη (Split Delivery VRP), με διανομή και παραλαβή (Pickup and Delivery VRP) και με στοχαστική ζήτηση (Stochastic VRP). Η δουλειά των Yang et al. (2000) αποτέλεσε έμπνευση για την παρούσα διατριβή. Οι Yang et al. διερεύνησαν το στοχαστικό VRP (SVRP) με …

    greece Repository record for A class of single vehicle routing problems with predefined customer sequence and depot returns (opens in a new tab)