Narrow search
Showing 1 - 10 of 597
Cover Image
Efficient Benders decomposition for distance-based critical node detection problem
Hooshmand, F.; Mirarabrazi, F.; MirHassani, S. A. - In: Omega : the international journal of management science 93 (2020), pp. 1-15
Persistent link: https://www.econbiz.de/10012243822
Cover Image
A cooperative parallel metaheuristic for the capacitated vehicle routing problem
Jin, Jianyong; Crainic, Teodor Gabriel; Løkketangen, Arne - In: Computers & operations research : and their … 44 (2014), pp. 33-41
Persistent link: https://www.econbiz.de/10010240601
Cover Image
A multi-agent based cooperative approach to scheduling and routing
Martin, Simon; Ouelhadj, Djamila; Beullens, Patrick; … - In: European journal of operational research : EJOR 254 (2016) 1, pp. 169-178
Persistent link: https://www.econbiz.de/10011503238
Cover Image
Parallel Scatter Search Approach for the MinMax Regret Location Problem
Ibri, Sarah; Cherabrab, Mohammed EL Amin; Abdoune, … - In: International Journal of Applied Metaheuristic … 9 (2018) 2, pp. 1-17
In this paper we propose an efficient solving method based on a parallel scatter search algorithm that accelerates the search time to solve the minmax regret location problem. The algorithm was applied in the context of emergency management to locate emergency vehicles stations. A discrete event...
Persistent link: https://www.econbiz.de/10012042964
Cover Image
Sequential and parallel large neighborhood search algorithms for the periodic location routing problem
Hemmelmayr, Vera C. - In: European journal of operational research : EJOR 243 (2015) 1, pp. 52-60
Persistent link: https://www.econbiz.de/10010492331
Cover Image
Pattern-based models and a cooperative parallel metaheuristic for high school timetabling problems
Saviniec, Landir; Santos, Maristela Oliveira; Costa, … - In: European journal of operational research : EJOR 280 (2020) 3, pp. 1064-1081
Persistent link: https://www.econbiz.de/10012132517
Cover Image
Parallel local search algorithms for high school timetabling problems
Saviniec, Landir; Santos, Maristela Oliveira; Costa, … - In: European journal of operational research : EJOR 265 (2018) 1, pp. 81-98
Persistent link: https://www.econbiz.de/10011805323
Cover Image
Sequential and parallel large neighborhood search algorithms for the periodic location routing problem
Hemmelmayr, Vera C. - In: European Journal of Operational Research 243 (2015) 1, pp. 52-60
We propose a large neighborhood search (LNS) algorithm to solve the periodic location routing problem (PLRP). The PLRP … combines location and routing decisions over a planning horizon in which customers require visits according to a given …
Persistent link: https://www.econbiz.de/10011190772
Cover Image
Efficient Golden-Ball Algorithm Based Clustering to solve the Multi-Depot VRP With Time Windows
Guezouli, Lahcene; Abdelhamid, Samir; Bensakhria, Mohamed - In: International Journal of Applied Evolutionary … 9 (2018) 1, pp. 1-16
Routing Problem by considering the existence of multiple available depots and a time window which must not be violated, that … they call the Multi-Depot Vehicle Routing Problem with Time Window (MDVRPTW), and with respecting a set of criteria …
Persistent link: https://www.econbiz.de/10012042726
Cover Image
Routing in Wireless Mesh Networks based on Termites' Intelligence
Sharma, Sharad; Malik, Asha - In: International Journal of Applied Metaheuristic … 8 (2017) 2, pp. 1-21
. Routing, being most critical issue in their implementation. The dynamic network conditions impose setbacks in the selection of … optimal path. There is exigent requirement to tackle these routing issues in context of these networks. In this paper, the …
Persistent link: https://www.econbiz.de/10012042943