Similar Search Results

Metaheuristics for dynamic combinatorial optimization problems

Yang, Shengxiang; Jiang, Yong; Nguyen Trung Thanh - In: IMA journal of management mathematics 24 (2013) 4, pp. 451-480

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

Metaheuristics for the tabu clustered traveling salesman problem

Zhang, Tianjiao; Ke, Liangjun; Li, Jing; Li, Jisheng; … - In: Computers & operations research : and their … 89 (2018), pp. 1-12

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

Metaheuristics for the risk-constrained cash-in-transit vehicle routing problem

Talarico, Luca; Sörensen, Kenneth; Springnael, Johan - In: European journal of operational research : EJOR 244 (2015) 2, pp. 457-470

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

Solving the family traveling salesman problem

Bernardino, Raquel; Paias, Ana - In: European journal of operational research : EJOR 267 (2018) 2, pp. 453-466

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

Relaxation heuristics for the set multicover problem with generalized upper bound constraints

Umetani, Shunji; Arakawa, Masanao; Yagiura, Mutsunori - In: Computers & operations research : and their … 93 (2018), pp. 90-100

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

The late acceptance Hill-Climbing heuristic

Burke, Edmund K.; Bykov, Yuri - In: European journal of operational research : EJOR 258 (2017) 1, pp. 70-78

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

Design of Heuristic Algorithms for Hard Optimization : With Python Codes for the Travelling Salesman Problem

Taillard, Éric D. - 2023

Techniques -- 4. Constructive Methods -- 5. Local Search -- 6. Decomposition Methods -- Part III: Popular Metaheuristics -- 7 … the main metaheuristics from a new angle, deconstructing them into a few key concepts presented in separate chapters … simplified form as a combination of these concepts. This approach avoids giving the impression that metaheuristics is a non …

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

A computational study on ant colony optimization for the traveling salesman problem with dynamic demands

Oliveira, Sabrina M. de; Bezerra, Leonardo C. T.; … - In: Computers & operations research : and their … 135 (2021), pp. 1-19

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

Metaheuristics for the distance constrained generalized covering traveling salesman problem

Singh, Prashant; Kamthane, Ankush R.; Tanksale, Ajinkya N. - In: Opsearch : journal of the Operational Research Society … 58 (2021) 3, pp. 575-609

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

Solving optimization problems by metaheuristics using the OpenOpal framework : integration of travelling salesman problem and selected solvers

Dornberger, Rolf; Ernst, Ramona; Frey, Lukas; Hanne, Thomas - 2012

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