Simulated Annealing Algorithm for Solving Sequence-Dependent Disassembly Line Balancing Problem. - Can Berk Kalayci; Surendra M. Gupta (MIM, 2013)

Artificial bee colony algorithm for solving sequence-dependent disassembly line balancing problem. - Can Berk Kalayci; Surendra M. Gupta (Expert Syst. Appl., 2013)

A perturbation based variable neighborhood search heuristic for solving the Vehicle Routing Problem with Simultaneous Pickup and Delivery with Time Limit. - Olcay Polat; Can Berk Kalayci; Osman Kulak; Hans-Otto Günther (Eur. J. Oper. Res., 2015)

A hybrid genetic algorithm for sequence-dependent disassembly line balancing problem. - Can Berk Kalayci; Olcay Polat; Surendra M. Gupta (Ann. Oper. Res., 2016)

An ant colony system empowered variable neighborhood search algorithm for the vehicle routing problem with simultaneous pickup and delivery. - Can Berk Kalayci; Can Kaya (Expert Syst. Appl., 2016)

An artificial bee colony algorithm with feasibility enforcement and infeasibility toleration procedures for cardinality constrained portfolio optimization. - Can Berk Kalayci; Okkes Ertenlice; Hasan Akyer; Hakan Aygoren (Expert Syst. Appl., 2017)

A survey of swarm intelligence for portfolio optimization: Algorithms and applications. - Okkes Ertenlice; Can Berk Kalayci (Swarm Evol. Comput., 2018)

A comprehensive review of deterministic models and applications for mean-variance portfolio optimization. - Can Berk Kalayci; Okkes Ertenlice; Mehmet Anil Akbay (Expert Syst. Appl., 2019)

Disassembly line balancing problem: a review of the state of the art and future directions. - Eren Özceylan; Can Berk Kalayci; Askiner Güngör; Surendra M. Gupta (Int. J. Prod. Res., 2019)

Responsible & sustainable manufacturing. - Surendra M. Gupta; Askiner Güngör; Kannan Govindan 002; Eren Özceylan; Can Berk Kalayci; Rajesh Piplani (Int. J. Prod. Res., 2020)

A parallel variable neighborhood search algorithm with quadratic programming for cardinality constrained portfolio optimization. - Mehmet Anil Akbay; Can Berk Kalayci; Olcay Polat (Knowl. Based Syst., 2020)

An efficient hybrid metaheuristic algorithm for cardinality constrained portfolio optimization. - Can Berk Kalayci; Olcay Polat; Mehmet Anil Akbay (Swarm Evol. Comput., 2020)

Application of CMSA to the Electric Vehicle Routing Problem with Time Windows, Simultaneous Pickup and Deliveries, and Partial Vehicle Charging. - Mehmet Anil Akbay; Can Berk Kalayci; Christian Blum 001 (MIC, 2022)

Modelling and solving the milk collection problem with realistic constraints. - Olcay Polat; Can Berk Kalayci; Duygu Topaloglu (Comput. Oper. Res., 2022)

Application of Adapt-CMSA to the Two-Echelon Electric Vehicle Routing Problem with Simultaneous Pickup and Deliveries. - Mehmet Anil Akbay; Can Berk Kalayci; Christian Blum 001 (EvoCOP, 2023)

Application of Adapt-CMSA to the Electric Vehicle Routing Problem with Simultaneous Pickup and Deliveries. - Mehmet Anil Akbay; Christian Blum 001; Can Berk Kalayci (EUROCAST (1), 2024)

Advances in partial disassembly line balancing: A state-of-the-art review. - Elif Güler; Can Berk Kalayci; Mehmet Ali Ilgin; Eren Özceylan; Askiner Güngör (Comput. Ind. Eng., 2024)

CMSA based on set covering models for packing and routing problems. - Mehmet Anil Akbay; Christian Blum 001; Can Berk Kalayci (Ann. Oper. Res., 2024)