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 10 of 10 for “"Soft time windows"”.

  1. Algorithms and heuristics for time-window-constrained traveling salesman problems

    … for solving traveling salesman problems with time-window constraints- Two types of time windows are considered: hard time windows, which are inviolable, and soft time windows, which are violable at a cost. For both cases, we develop several heuristic procedures, including some that are based …

    nps Repository record for Algorithms and heuristics for time-window-constrained traveling salesman problems (opens in a new tab)

  2. MATHEMATICAL PROGRAMMING ALGORITHMS FOR TRANSPORTATION PROBLEMS

    … heterogeneous-fleet vehicle routing problem with time windows and the multi-depot heterogeneous-fleet pickup and delivery problem with soft time windows. The studied problems consider additional real-world requirements, often neglected in the literature. They lead to more involved problems but on …

    milano Repository record for MATHEMATICAL PROGRAMMING ALGORITHMS FOR TRANSPORTATION PROBLEMS (opens in a new tab)

  3. The Pickup and Multiple Delivery Problem

    … vehicle routing and scheduling problem with soft time windows, working time and last-in-first-out constraints, developed in collaboration with Transfaction Ltd., who conduct logistics analysis for several large retailers in the UK. A summary of relevant background literature is presented …

    whiterose Download PDF for The Pickup and Multiple Delivery Problem (opens in a new tab)

  4. Optimizing Integrated and Sustainable Production Scheduling and Vehicle Routing Problems

    … considerations and operational realities such as time-of-use (TOU)-based energy pricing, electric vehicle (EV) usage, and soft delivery windows. This thesis addresses these challenges by developing a sequence of bi-objective optimization models and algorithmic approaches for integrated …

    unsw Repository record for Optimizing Integrated and Sustainable Production Scheduling and Vehicle Routing Problems (opens in a new tab)

  5. Model and algorithm for solving real time dial-a-ride problem

    This research studies a static and real-time dial-a-ride problem with time varying travel times, soft time windows, and multiple depots. First, a static DARP model is formulated as a mixed integer programming and in order to validate the model, several random small network problems are solved using …

    maryland Repository record for Model and algorithm for solving real time dial-a-ride problem (opens in a new tab)

  6. Routing and Scheduling with Time Windows: Models and Algorithms for Tramp Sea Cargos and Rail Car-Blocks

    … with each product having pickup and download time windows and a destination port, the problem is to find the schedule for a fleet of ships that maximizes profit over a specified time horizon. The problem is modeled as a Mixed Integer Non-Linear Program and reformulated as an equivalent Mixed …

    gatech Repository record for Routing and Scheduling with Time Windows: Models and Algorithms for Tramp Sea Cargos and Rail Car-Blocks (opens in a new tab)

  7. Optimization frameworks for collaborative truck-drone logistics under environmental and operational considerations

    … Problem with Adaptive Drone Deployment Sites and Soft Time Windows (GA-TDPRP-AS-STW), explicitly modeling roadway slopes, variable truck speeds, and flexible drone deployment sites under penalty-based time windows. Both a MIP and an enhanced ALNS are developed. On small benchmarks, the MIP proves …

    missouri Repository record for Optimization frameworks for collaborative truck-drone logistics under environmental and operational considerations (opens in a new tab) Embargoed until 2026-12-01

  8. Design, modelling, and experimental evaluation of human order-picking and replenishment systems with AMR-based bin transportation

    … operating costs, labor productivity, order lead times, and, ultimately, overall supply chain performance. Order-picking has long been recognized as the most labor-intensive and costly warehouse operation, frequently accounting for more than half of the total operating cost of a distribution …

    greece Repository record for Design, modelling, and experimental evaluation of human order-picking and replenishment systems with AMR-based bin transportation (opens in a new tab)