Results 31 to 40 of about 9,501,678 (288)
Constraint-based Very Large-Scale Neighborhood search [PDF]
Constraints, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sébastien Mouthuy +2 more
openaire +3 more sources
Simulated annealing with large-neighborhood search for two-echelon location routing problem
工程科学学报, 2017 Considering the multi-level distribution network has becoming more and more common, a two-echelon location routing problem (2E-LRP) model was established based on minimum total cost objective function.
LI Xiang, LI Su-jian, LI Hong
doaj +1 more source
Variable neighbourhood decomposition search for 0-1 mixed integer programs [PDF]
, 2009 In this paper we propose a new hybrid heuristic for solving 0-1 mixed integer programs based on the principle of variable neighbourhood decomposition search. It combines variable neighbourhood search with a general-purpose CPLEX MIP solver.
Hanafi, S +7 more
core +1 more source
Algorithms, 2021 For decades, the use of weights has proven its superior ability to improve dynamic local search weighting algorithms’ overall performance. This paper proposes a new mechanism where the initial clause’s weights are dynamically allocated based on the ...
Abdelraouf Ishtaiwi +4 more
doaj +1 more source
Adaptive large neighborhood search for mixed integer programming [PDF]
Mathematical Programming Computation, 2021 AbstractLarge Neighborhood Search (LNS) heuristics are among the most powerful but also most expensive heuristics for mixed integer programs (MIP). Ideally, a solver adaptively concentrates its limited computational budget by learning which LNS heuristics work best for the MIP problem at hand.
openaire +2 more sources
A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem [PDF]
, 2008 The heterogeneous fleet vehicle routing problem is investigated using some adaptations of the variable neighborhood search (VNS). The initial solution is obtained by Dijkstra's algorithm based on a cost network constructed by the sweep algorithm and the ...
Imran, Arif +2 more
core +1 more source
Operations Research Perspectives, 2020 This article introduces a new variant of the inventory routing problem related to real-world businesses. Specifically, in the beverage industry, business customers such as restaurants and bars, demand consistent delivery times, have different opening ...
Emilio J. Alarcon Ortega +2 more
doaj +1 more source
Large Neighborhood Search based on Neural Construction Heuristics
CoRR, 2022 We propose a Large Neighborhood Search (LNS) approach utilizing a learned construction heuristic based on neural networks as repair operator to solve the vehicle routing problem with time windows (VRPTW). Our method uses graph neural networks to encode the problem and auto-regressively decodes a solution and is trained with reinforcement learning on ...
Jonas K. Falkner +2 more
openaire +3 more sources
Engineering Science and Technology, an International Journal, 2021 The design of a production line directly affects the system performance which is usually measured by its throughput. The problem involving determination of the optimal capacity and location of the buffers in a production line is known as the buffer ...
Mehmet Ulaş Koyuncuoğlu, Leyla Demir
doaj +1 more source
Solving DCOPs with Distributed Large Neighborhood Search
CoRR, 2017 The field of Distributed Constraint Optimization has gained momentum in recent years, thanks to its ability to address various applications related to multi-agent cooperation. Nevertheless, solving Distributed Constraint Optimization Problems (DCOPs) optimally is NP-hard.
Ferdinando Fioretto +4 more
openaire +2 more sources