Search Results - subject:"variable neighborhood descent"

A metaheuristic for crew scheduling in a pickup-and-delivery problem with time windows

Lucci, Mauro; Severín, Daniel E.; Zabala, Paula - In: International transactions in operational research : a … 30 (2023) 2, pp. 970-1001

Persistent link: https://www.econbiz.de/10013417118

Effective metaheuristics for the latency location routing problem

Osorio-Mora, Alan; Rey, Carlos; Toth, Paolo; Vigo, Daniele - In: International transactions in operational research : a … 30 (2023) 6, pp. 3801-3832

Persistent link: https://www.econbiz.de/10014328099

Automatic instantiation of a Variable Neighborhood Descent from a Mixed Integer Programming model

Adamo, Tommaso; Ghiani, Gianpaolo; Guerriero, Emanuela; … - In: Operations Research Perspectives 4 (2017), pp. 123-135

In this paper we describe the automatic instantiation of a Variable Neighborhood Descent procedure from a Mixed Integer … model-derived Variable Neighborhood Descent procedure and the approach with a single automatically-designed neighborhood …

Persistent link: https://www.econbiz.de/10011825943

Automatic instantiation of a Variable Neighborhood Descent from a Mixed Integer Programming model

Adamo, Tommaso; Ghiani, Gianpaolo; Guerriero, Emanuela; … - In: Operations research perspectives 4 (2017), pp. 123-135

Persistent link: https://www.econbiz.de/10011823267

Order picking with multiple pickers and due dates : simultaneous solution of order batching, batch assignment and sequencing, and picker routing problems

Scholz, André; Schubert, Daniel; Wäscher, Gerhard - 2016

Persistent link: https://www.econbiz.de/10011578979

D- and I-optimal design of mixture experiments in the presence of ingredient availability constraints

SYAFITRI, Utami; SARTONO, Bagus; GOOS, Peter - Faculteit Toegepaste Economische Wetenschappen, … - 2015

constraints is a nonlinear multidimensional knapsack problem and propose a variable neighborhood descent algorithm to identify D …

Persistent link: https://www.econbiz.de/10011124235

D- and I-optimal design of mixture experiments in the presence of ingredient availability constraints

Syafitri, Utami; Sartono, Bagus; Goos, Peter - 2015

Persistent link: https://www.econbiz.de/10010486239

Variable Neighborhood Search for the Order Batching and Sequencing Problem with Multiple Pickers

Henn, Sebastian - Fakultät für Wirtschaftswissenschaft, … - 2012

missed. This article shows how Variable Neighborhood Descent and Variable Neighborhood Search can be applied in order to …

Persistent link: https://www.econbiz.de/10009654292

An efficient GRASP+VND metaheuristic for the traveling repairman problem

SALEHIPOUR, Amir; SÖRENSEN, Kenneth; GOOS, Peter; … - Faculteit Toegepaste Economische Wetenschappen, … - 2008

The traveling repairman problem is a customer-centric routing problem, in which the total waiting time of the customers is minimized, rather than the total travel time of a vehicle. To date, research on this problem has focused on exact algorithms and approximation methods. To the best of our...

Persistent link: https://www.econbiz.de/10005588096