Collaborative variable neighborhood search for multi-objective distributed scheduling in two-stage hybrid flow shop with sequence-dependent setup times [PDF]
Scientific Reports, 2022 Distributed scheduling is seldom investigated in hybrid flow shops. In this study, distributed two-stage hybrid flow shop scheduling problem (DTHFSP) with sequence-dependent setup times is considered.
Jingcao Cai +5 more
doaj +2 more sources
Influence of a neighborhood shape on the efficiency of continuous variable neighborhood search [PDF]
Yugoslav Journal of Operations Research, 2020 The efficiency of a Variable neighborhood search metaheuristic for continuous global optimization problems greatly depends on geometric shape of neighborhood structures used by the algorithm.
Dražić Milan
doaj +1 more source
Application of dynamic firework algorithm considering variable neighborhood strategy in flexible job shop scheduling problem [PDF]
E3S Web of Conferences, 2021 Aiming at the flexible job shop scheduling problem, this paper constructs a dual-objective mathematical model to minimize the maximum completion time and the minimum total processing cost.
Lv Jie, Zhang Fenqiang
doaj +1 more source
Gaussian variable neighborhood search for the file transfer scheduling problem [PDF]
Yugoslav Journal of Operations Research, 2016 This paper presents new modifications of Variable Neighborhood Search approach for solving the file transfer scheduling problem. To obtain better solutions in a small neighborhood of a current solution, we implement two new local search ...
Dražić Zorica
doaj +1 more source
An Enhanced Evolutionary Local Search for the Split Delivery Vehicle Routing Problem [PDF]
International Journal of Supply and Operations Management, 2017 We present a simple and effective metaheuristic algorithm for the Split Delivery Vehicle Routing Problem (SDVRP). The SDVRP is a relaxation of the classical Vehicle Routing Problem in which a customer demand may be serviced by more than one vehicle.
Sanae Larioui
doaj +1 more source
Variable neighborhood search for maximum diverse grouping problem [PDF]
Yugoslav Journal of Operations Research, 2014 This paper presents a general variable neighborhood search (GVNS) heuristic for solving the maximum diverse grouping problem. Extensive computational experiments performed on a series of large random graphs as well as on several instances of the
Urošević Dragan
doaj +1 more source
A Variable Neighborhood Search heuristic for rolling stock rescheduling
EURO Journal on Transportation and Logistics, 2021 We present a Variable Neighborhood Search heuristic for the rolling stock rescheduling problem. Rolling stock rescheduling is needed when a disruption leads to cancellations in the timetable.
Rowan Hoogervorst +3 more
doaj +1 more source
Buffer Allocation via Bottleneck-Based Variable Neighborhood Search
Applied Sciences, 2020 This study addresses the challenging problem of efficient buffer allocation in production lines. Suitable locations for buffer allocation are determined to satisfy the desired throughput, while a suitable balance between solution quality and computation ...
Sixiao Gao +5 more
doaj +1 more source
Variable neighborhood search for minimum linear arrangement problem [PDF]
Yugoslav Journal of Operations Research, 2016 The minimum linear arrangement problem is widely used and studied in many practical and theoretical applications. It consists of finding an embedding of the nodes of a graph on the line such that the sum of the resulting edge lengths is ...
Mladenović Nenad +2 more
doaj +1 more source
IEEE Access, 2021 In this paper, an adaptive variable neighborhood search ant colony algorithm (AVNSACA) is proposed to solve the vehicle routing problem with soft time windows (VRPSTW).
Meiling He +3 more
doaj +1 more source