Results 11 to 20 of about 12,651,596 (195)
Hybrid adaptive large neighborhood search algorithm for the mixed fleet heterogeneous dial-a-ride problem [PDF]
Journal of Heuristics, 2019 The mixed fleet heterogeneous dial-a-ride problem (MF-HDARP) consists of designing vehicle routes for a set of users by using a mixed fleet including both heterogeneous conventional and alternative fuel vehicles. In addition, a vehicle is allowed to refuel from a fuel station to eliminate the risk of running out of fuel during its service.
Mohamed Amine Masmoudi +3 more
openaire +5 more sources
Bi-Objective Adaptive Large Neighborhood Search Algorithm for the Healthcare Waste Periodic Location Inventory Routing Problem. [PDF]
Arab J Sci Eng, 2022 There has been an unexpected increase in the amount of healthcare waste during the COVID-19 pandemic. Managing healthcare waste is vital, as improper practices in the waste system can lead to the further spread of the virus.
Aydemir-Karadag A.
europepmc +2 more sources
International Timetabling Competition 2011: An Adaptive Large Neighborhood Search algorithm [PDF]
, 2012 An algorithm based on Adaptive Large Neighborhood Search (ALNS) for solving the generalized High School Timetabling problem in XHSTT-format (Post et al (2012a)) is presented. This algorithm was among the nalists of round 2 of the International Timetabling Competition 2011 (ITC2011). For problem description and results we refer to Post et al (2012b).
Sørensen, Matias +2 more
openaire +2 more sources
An adaptive hybrid variable-large neighborhood search algorithm for profit maximization problem in designing production lines [PDF]
Computers & Industrial Engineering, 2023 Designing production lines is an important research issue for both academy as well as industry since it should consider both system efficiency and production costs. In this study, the buffer allocation problem (BAP) is solved to maximize the profit of unreliable lines.
Koyuncuoğlu, Mehmet Ulaş, Demir L.
openaire +4 more sources
An Improved Genetic Algorithm With Adaptive Variable Neighborhood Search for FJSP
Algorithms, 2019 For solving the complex flexible job-shop scheduling problem, an improved genetic algorithm with adaptive variable neighborhood search (IGA-AVNS) is proposed.
Xiaolin Gu, Xu Liang
exaly +2 more sources
SystemsIn this paper, we study the dynamic meal delivery routing problem (MDRP) with time-sensitive customers. The multi-objective MDRP optimization model is developed to maximize customer satisfaction and minimize delay penalty cost and riding cost.
Wenjie Wang, Shen Gao
doaj +2 more sources
A variable neighborhood search with an effective local search for uncapacitated multilevel lot-sizing problems [PDF]
, 2014 In this study, we improved the variable neighborhood search (VNS) algorithm for solving uncapacitated multilevel lot-sizing (MLLS) problems. The improvement is two-fold.
Xu, Yuchun +4 more
core +1 more source
IEEE Access, 2021 The Partial Max-SAT (PMSAT) problem is an optimization variant of the well-known Propositional Boolean Satisfiability (SAT) problem. It holds an important place in theory and practice, because a huge number of real-world problems, such as timetabling ...
Haifa Hamad Alkasem +1 more
doaj +1 more source
A search algorithm for global optimisation [PDF]
, 2005 This paper investigates a global search optimisation technique, referred to as the repeated weighted boosting search. The proposed optimisation algorithm is extremely simple and easy to implement.
Wang, X.X. +5 more
core +2 more sources
Journal of Industrial and Management Optimization, 2023 <p style='text-indent:20px;'>The Vehicle Routing Problem with Multiple Time Windows (VRPMTW) is a generalization of problems in real life logistics distribution, which has a wide range of applications and research values. Several neighborhood search based methods have been used to solve this kind of problem, but it still has drawbacks of ...
Feng, Bin, Wei, Lixin, Hu, Ziyu
openaire +2 more sources