Results 271 to 280 of about 7,624,569 (302)

Large Neighborhood Search for Dial-a-Ride Problems

2011
Dial-a-Ride problems (DARPs) arise in many urban transportation applications. The core of a DARP is a pick and delivery routing with multiple vehicles in which customers have ride-time constraints and routes have a maximum duration. This paper considers DARPs for which the objective is to minimize the routing cost, a complex optimization problem which ...
Siddhartha Jain 0001, Pascal Van Hentenryck   +1 more
openaire   +2 more sources

Adaptive large neighborhood search for scheduling of mobile robots

Proceedings of the Genetic and Evolutionary Computation Conference, 2019
Our work addresses the scheduling of mobile robots for transportation and processing of operations on machines in a flexible manufacturing system. Both mobile robots and automated guided vehicles (AGVs) can transport components among machines in the working space.
Quang-Vinh Dang 0002, Hana Rudová, Cong Thanh Nguyen   +2 more
openaire   +1 more source

Very Large-Scale Neighborhood Search

2013
One of the central issues in developing neighborhood search techniques is defining the neighborhood. As a rule of thumb, larger neighborhoods contain higher quality local optimal solutions compared to smaller neighborhoods. However, larger neighborhoods also typically require more time to search than smaller neighborhoods.
Douglas S. Altner, Ravindra K. Ahuja, Özlem Ergun, James B. Orlin   +3 more
openaire   +1 more source

Maximal matchings in graphs with large neighborhoods of independent vertices

Journal of Graph Theory, 1990
AbstractWe obtain lower bounds on the size of a maximum matching in a graph satisfying the condition |N(X)| ≥ s for every independent set X of m vertices, thus generalizing results of Faudree, Gould, Jacobson, and Schelp for the case m = 2.
I. Rinsma, C. H. C. Little, Douglas R. Woodall   +2 more
openaire   +1 more source

Hybridization Based on Large Neighborhood Search

2016
The type of algorithm addressed in this chapter is based on the following general idea. Given a valid solution to the tackled problem instance—henceforth called the incumbent solution—first, destroy selected parts of it, resulting in a partial solution. Then apply some other, possibly exact, technique to find the best valid solution on the basis of the
Christian Blum, Günther R. Raidl
openaire   +1 more source

A Multiobjective Large Neighborhood Search for a Vehicle Routing Problem

2014
In this paper, a multiobjective adaptive large neighborhood search is proposed for a vehicle routing problem (VRP) of which the objectives are the total travel time and the cumulative time, i.e., the total arrival time at all customers. It hybrids destroy-repair operators with local search for generating new solutions.
Liangjun Ke, Laipeng Zhai
openaire   +1 more source

New neighborhood search algorithms based on exponentially large neighborhoods

2001
A practical approach for solving computationally intractable problems is to employ heuristic (approximation) algorithms that can find nearly optimal solutions within a reasonable amount of computational time. An improvement algorithm is an approximation algorithm which starts with a feasible solution and iteratively attempts to obtain a better solution.
openaire   +1 more source

Large neighborhood search for break scheduling

2016
A high a level of concentration is essential in certain working areas such as in air traffic control, assembly line works or supervision. In such areas breaks are mandatory to avoid fatal errors. Breaks are regulated due to safety rules or legal demands. The break scheduling problem (Bsp) deals with these kind of regulations.
openaire   +1 more source

Subset Neighborhood Rough Sets

Knowledge-Based Systems, 2022
Tareq M Al-Shami, Davide Ciucci
exaly  

The Impact of Neighborhoods on Diabetes Risk and Outcomes: Centering Health Equity

Diabetes Care, 2023
Mahasin Mujahid, Xing Gao, Tené T Lewis
exaly