Variable neighborhood search: basics and variants
Variable neighborhood search (VNS) is a framework for building heuristics, based upon
systematic changes of neighborhoods both in a descent phase, to find a local minimum, and …
systematic changes of neighborhoods both in a descent phase, to find a local minimum, and …
Variable neighborhood search: The power of change and simplicity
This review discusses and analyses three main contributions championed by Professor
Mladenović. These include variable neighborhood search (VNS), variable formulation space …
Mladenović. These include variable neighborhood search (VNS), variable formulation space …
[PDF][PDF] A history of metaheuristics
A History of Metaheuristics arXiv:1704.00853v1 [cs.AI] 4 Apr 2017 Page 1 A History of
Metaheuristics ∗ Kenneth Sörensen Marc Sevaux Fred Glover Abstract This chapter …
Metaheuristics ∗ Kenneth Sörensen Marc Sevaux Fred Glover Abstract This chapter …
The dial-a-ride problem with electric vehicles and battery swapping stations
Abstract The Dial-a-Ride Problem (DARP) consists of designing vehicle routes and
schedules for customers with special needs and/or disabilities. The DARP with Electric …
schedules for customers with special needs and/or disabilities. The DARP with Electric …
Variable neighborhood search algorithms to solve the electric vehicle routing problem with simultaneous pickup and delivery
Y Yilmaz, CB Kalayci - Mathematics, 2022 - mdpi.com
This paper addresses the Electric Vehicle Routing Problem with Simultaneous Pickup and
Delivery (EVRP-SPD), in which electric vehicles (EVs) simultaneously deliver goods to and …
Delivery (EVRP-SPD), in which electric vehicles (EVs) simultaneously deliver goods to and …
A memetic based algorithm for simultaneous preventive maintenance scheduling and spare-parts inventory management for manufacturing systems
To increase machine availability, it may be necessary to halt them to replace components
before failures occur. Therefore, optimizing spare parts inventory management is a key …
before failures occur. Therefore, optimizing spare parts inventory management is a key …
Surgery scheduling in outpatient procedure centre with re-entrant patient flow and fuzzy service times
To meet the increase in demand for outpatient surgical services, surgery scheduling for
outpatient procedure centres (OPCs) has recently attracted considerable attention in both …
outpatient procedure centres (OPCs) has recently attracted considerable attention in both …
Minimization of maximum lateness on parallel machines with a single server and job release dates
This paper addresses the problem of scheduling independent jobs with release dates on
identical parallel machines with a single server. The goal consists in minimizing the …
identical parallel machines with a single server. The goal consists in minimizing the …
A three-level particle swarm optimization with variable neighbourhood search algorithm for the production scheduling problem with mould maintenance
X Fu, FTS Chan, B Niu, NSH Chung, T Qu - Swarm and Evolutionary …, 2019 - Elsevier
To improve the reliability of production systems in the plastics industry, researchers are now
taking mould maintenance into consideration, besides machine maintenance, in the …
taking mould maintenance into consideration, besides machine maintenance, in the …
Variable neighborhood search algorithms for the permutation flowshop scheduling problem with the preventive maintenance
This paper addresses to the permutation flowshop scheduling problem while considering
the preventive maintenance in the non-resumable case. The criterion to be optimized is the …
the preventive maintenance in the non-resumable case. The criterion to be optimized is the …