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 20 of 137 for “"Neighborhood Search"”.

  1. Neighborhood Search Algorithms for Multi-Trip Vehicle Routing

    Think about the lines of trucks we overtake on highways. Each of these trucks is performing a journey that may include several delivery or pickup operations before getting to a depot. And each of these journeys is generally determined through a large-scale planning process that concerns a fleet of …

    liege Repository record for Neighborhood Search Algorithms for Multi-Trip Vehicle Routing (opens in a new tab) Restricted access

  2. A Large Neighborhood Search Heuristic for Naval Re-Supply

    … Expeditionary Readiness (LASER) employs a large neighborhood search (LNS) algorithm to modernize naval re-supply planning in the military. Preliminary results indicate that the LNS algorithm provides dramatic performance benefits compared to a more traditional, mixed integer programming approach.

    jhu Repository record for A Large Neighborhood Search Heuristic for Naval Re-Supply (opens in a new tab)

  3. A variable neighborhood search to solve migratory beekeeping routing problem

    … the routes and so on. A variable neighbourhood search (VNS) algorithm involving an initial solution generation procedure based on greedy strategy, a perturbation procedure and a local search procedure is proposed to solve the complicated MBRP. Finally, thirty computational instances reflecting …

    manitoba Repository record for A variable neighborhood search to solve migratory beekeeping routing problem (opens in a new tab)

  4. Route planning for electric vehicles using Adaptive Large Neighborhood Search

    … used to solve this problem is the Adaptive Large Neighborhood Search (ALNS) which is a so-called meta-heuristic method where the solution is destroyed and repaired iteratively to improve the solution over time. ALNS is flexible and can be designed to fit various formulations of the EVRP. In this …

    chalmers Repository record for Route planning for electric vehicles using Adaptive Large Neighborhood Search (opens in a new tab)

  5. A Large-Scale Neighborhood Search Algorithm for Multi-Activity Tour Scheduling Problems

    In this research, we study multi-activity tour scheduling problems with heterogeneous employees in a service sector where demand varies greatly during the day. This problem relates to assigning the employees’ working days throughout the planning horizon and working periods on each working day. In …

    mcmaster Repository record for A Large-Scale Neighborhood Search Algorithm for Multi-Activity Tour Scheduling Problems (opens in a new tab)

  6. An Adaptive Large Neighborhood Search Heuristic for the Inventory Routing Problem with Time Windows

    This research addresses an integrated distribution and inventory control problem which is faced by a large retail chain in the United States. In their current distribution network, a direct shipping policy is used to keep stores stocked with products. The shipping policy specifies that a dedicated …

    arkansas Repository record for An Adaptive Large Neighborhood Search Heuristic for the Inventory Routing Problem with Time Windows (opens in a new tab)

  7. ADVERSARIAL EXPERIMENTATION IN ATLATL: LEVERAGING SENSITIVITY ANALYSIS, NEIGHBORHOOD SEARCH HEURISTICS, AND PROBABILISTIC SCENARIO GENERATION TO EXPOSE AI WEAKNESSES

    … sensitivity analysis, and local adversarial search. To test the framework, three reference agents are evaluated on a small scenario: NAMaiV5 and NAMaiV9 (scripted AI) and Pascal (a neural network trained on the test scenario). Latin Hypercube Sampling generates 20,000 diverse scenarios, each …

    nps Repository record for ADVERSARIAL EXPERIMENTATION IN ATLATL: LEVERAGING SENSITIVITY ANALYSIS, NEIGHBORHOOD SEARCH HEURISTICS, AND PROBABILISTIC SCENARIO GENERATION TO EXPOSE AI WEAKNESSES (opens in a new tab)

  8. Particle Swarm Optimization with Enhanced Neighborhood Search Algorithm and Probabilistic Crossover Genetic Algorithm for Task Scheduling in Cloud Computing

    … Optimization (PSO) by introducing an effective neighborhood search technique. Also, we introduce static and dynamic methods to select ENS-PSO neighborhood search size. PxGA enhances the Genetic Algorithm (GA) by applying a weighted probabilistic approach to the crossover operation. CloudSim …

    carleton Repository record for Particle Swarm Optimization with Enhanced Neighborhood Search Algorithm and Probabilistic Crossover Genetic Algorithm for Task Scheduling in Cloud Computing (opens in a new tab)

  9. A large-scale neighborhood search approach to vehicle routing pick-up and delivery problem with time windows under uncertainty

    … We therefore develop a large-scale neighbourhood search heuristic combined with a break-and-join heuristic and a clustering heuristic. We use this heuristic to build a set of schedules with far lower operating costs than the existing solution and effectively decrease the costs by 15% by reducing …

    uiuc Repository record for A large-scale neighborhood search approach to vehicle routing pick-up and delivery problem with time windows under uncertainty (opens in a new tab)

  10. Um modelo matemático multi terminais e uma metaheurística Adaptive Large Neighborhood Search para o problema de roteamento de navios aliviadores visando o escoamento de petróleo offshore

    … of shuttle tanks routing and an Adaptive Large Neighborhood Search meta - heuristic (ALNS) that is able to define shuttle tanks routes at a minimum cost. The computational tests showed that the mathematical model performs better than another proposed model in the literature and that the ALNS …

    brazil-uerj Repository record for Um modelo matemático multi terminais e uma metaheurística Adaptive Large Neighborhood Search para o problema de roteamento de navios aliviadores visando o escoamento de petróleo offshore (opens in a new tab)

  11. Uma meta-heurística Adaptive Large Neighborhood Search com mecanismos de paralelismo, detecção de estagnação e perturbações para o problema de roteamento de veículos com frota heterogênea, periódico e Multi-Trips

    … The metaheuristic chosen, called Adaptive Large Neighborhood Search (ALNS), combines the power of successful strategies in the literature as a large neighborhood search and adaptive mechanisms with new features such as parallelism, detection of stagnation and perturbations. Our ALNS was …

    brazil-uerj Repository record for Uma meta-heurística Adaptive Large Neighborhood Search com mecanismos de paralelismo, detecção de estagnação e perturbações para o problema de roteamento de veículos com frota heterogênea, periódico e Multi-Trips (opens in a new tab)

  12. Multiple Vehicle Routing Problem with Fuel Constraints

    … and Rerouting, and Tour Improvement. Four neighborhoods were investigated (2-opt, 3-opt, Target Vehicle Exchange, Depot Exchange), using the Variable Neighborhood Descent and Variable Neighborhood Search schemes, with APD and Voronoi partition methods. These neighborhoods were compared to …

    tamu Repository record for Multiple Vehicle Routing Problem with Fuel Constraints (opens in a new tab)

  13. Optimizing Warehouse Order Batching when Routing Is Precedence Constrained and Pickers Have Varying Skills

    … This savings estimate is used in a Large Neighborhood Search algorithm, which outperforms heuristics from literature and compares well to optimal solutions (1.2% mean error). An A* algorithm is used for precedence-constrained picker routing. Compared to the performance of a reference …

    aalto Repository record for Optimizing Warehouse Order Batching when Routing Is Precedence Constrained and Pickers Have Varying Skills (opens in a new tab)

  14. Meta-heurísticas para o problema de sequenciamento de lotes de tarefas em máquinas paralelas

    … foram desenvolvidos: Adaptive Large Neighborhood Search (ALNS), Iterated Greedy (IG) e Simulated Annealing (SA). Todos estes algoritmos utilizam técnicas de busca em vizinhança para melhorar a qualidade de uma solução. As meta-heurísticas ALNS, IG e SA possuem estruturas simples e …

    brazil-ufv Repository record for Meta-heurísticas para o problema de sequenciamento de lotes de tarefas em máquinas paralelas (opens in a new tab)

  15. Computational Methods for Solving the Combinatorial Optimization Problems in Transportation

    … algorithm, which adapts the Adaptive Large Neighborhood Search framework. The experimental results validate the efficiency and effectiveness of our proposed algorithm and prove it is quite flexible to adapt to a dynamic environment. The third problem is arc routing problem with the truck and …

    usf Repository record for Computational Methods for Solving the Combinatorial Optimization Problems in Transportation (opens in a new tab)

  16. Models and advanced optimization algorithms for the integrated management of logistics operations

    … to achieve feasible solutions, and a variable neighborhood search algorithm in order to search for improved solutions. In what concerns the vehicle routing problem with mixed linehaul and backhauls and two-dimensional loading constraints, di erent variable neighborhood search algorithms are …

    minho-thes Repository record for Models and advanced optimization algorithms for the integrated management of logistics operations (opens in a new tab)

  17. O problema do caixeiro viajante com passageiros e lotação

    … model is proposed. This model supported the search for exact solutions by Mathematical and Constraint Programming. Additionally, is presented a branchand- bound algorithm specifically developed for the problem. Aiming the search for good quality solutions in short time period, five …

    brazil-ufrn Repository record for O problema do caixeiro viajante com passageiros e lotação (opens in a new tab)

Page 1 of 7