Article
Engineering, Industrial
Ethem Canakoglu, Ibrahim Muter
Summary: This paper focuses on an extension of the parallel machine scheduling problem with additional resources, which consist of components with discrete levels, leading to general covering constraints. The problem's characteristics are also reflected in a real-life audit scheduling problem for financial firm branches. Mathematical models and heuristic algorithms are proposed to address these issues, with extensive computational experiments conducted to evaluate the performance of the proposed algorithms.
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
(2021)
Article
Management
Alessandro Agnetis, Ben Hermans, Roel Leus, Salim Rostami
Summary: This paper discusses a problem of determining the state of a system through costly tests before a deadline, as well as a related search problem with multiple searchers aiming to find a target before a deadline. Both problems are shown to be NP-hard and various algorithms are proposed to tackle them effectively. Extensive computational experiments suggest that different formulations perform better in different scenarios, and a local search procedure is shown to be effective in finding near-optimal solutions.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2022)
Article
Computer Science, Interdisciplinary Applications
Changyu Chen, Mahdi Fathi, Marzieh Khakifirooz, Kan Wu
Summary: This research proposes a hybrid approach using a mixed-integer programming model and a hybrid tabu search algorithm to solve the scheduling problem in wafer fabrication. The objectives are to maximize processed jobs and minimize completion time. Computational results show that the hybrid tabu search algorithm outperforms the mixed-integer programming model in terms of solution quality and computational time.
COMPUTERS & INDUSTRIAL ENGINEERING
(2022)
Article
Computer Science, Interdisciplinary Applications
C. Filippi, G. Guastaroba, D. L. Huerta-Munoz, M. G. Speranza
Summary: This study addresses a Fair Facility Location Problem by minimizing the conditional beta-mean to balance system efficiency and fair treatment of users. A heuristic framework based on Kernel Search is proposed to solve the problem, with computational experiments validating the high-quality solutions produced by the framework.
COMPUTERS & OPERATIONS RESEARCH
(2021)
Article
Mathematics
Tzu-Chin Lin, Bertrand M. T. Lin
Summary: Taichung is the hub of the precision optical industry in Taiwan, with modernized and automated optics companies running 24-hour production lines. However, the current manual shift scheduling system for engineers is time-consuming and often leads to workload imbalances. This study aims to provide a solution for Glorytek to increase efficiency and optimize engineering staff allocation. The results show that an automated system significantly improves shift scheduling efficiency.
Article
Computer Science, Interdisciplinary Applications
Zhe Sun, Una Benlic, Mingjie Li, Qinghua Wu
Summary: Investigated the application of the minimum load coloring problem in broadcast WDM networks and proposed an integer programming model and a reinforcement learning based tabu search algorithm to effectively solve the problem.
COMPUTERS & OPERATIONS RESEARCH
(2022)
Article
Agricultural Engineering
Jin Xin Cao, Xiangting Wang, Jiachen Gao
Summary: Biomass as an important renewable energy source has gained attention, but inefficient biomass logistics systems hinder biomass utilization. This study proposes a hybrid heuristic algorithm to address the biomass resource location-routing problem, and tests its effectiveness and efficiency through computational examples.
BIOSYSTEMS ENGINEERING
(2021)
Article
Management
Cinna Seifi, Marco Schulze, Juergen Zimmermann
Summary: This paper introduces a mixed-integer linear program for a shift scheduling problem in a German potash mine, which outperforms existing solution procedures by considering production scheduling with sequence-dependent setup, changeover, and removal times, and meeting mining-specific requirements for practical implementation. Computational experiments on realistic problem instances derived from real-world data show the effectiveness of the new formulation.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2021)
Article
Computer Science, Interdisciplinary Applications
Xiangyi Zhang, Lu Chen
Summary: This paper studies a parallel-machine scheduling problem that takes into account machine health conditions and preventive maintenance with the objective to minimize total tardiness and quality risk. Two mixed integer linear programming models are developed and a general variable neighborhood search heuristic is proposed. The computational experiments show that the proposed algorithm outperforms the tabu search heuristic in terms of solution quality by 2.20% on average. Managerial insights are also derived regarding the balance between quality risk and delivery requirement when health information is considered.
COMPUTERS & OPERATIONS RESEARCH
(2022)
Article
Management
M. A. Forbes, M. G. Harris, H. M. Jansen, F. A. van der Schoot, T. Taimre
Summary: This article proposes a new approach to integrating simulation into the optimization model, which solves stochastic resource allocation problems and derives strong Benders cuts. The approach is tested on nursing home shift scheduling and airport check-in counter allocation problems, achieving exact solutions within a reasonable amount of time.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2024)
Article
Computer Science, Interdisciplinary Applications
Rodolfo Mendoza-Gomez, Roger Z. Rios-Mercado
Summary: This paper addresses the problem of locating primary health care centers that integrate outpatient medical services and a set of complementary services. It aims to maximize the coverage of the complementary services while constraining the total travel distance for the outpatient service allocation. The study presents two bi-objective programming models to identify the trade-off between the total travel distance and different budgets. A case study based on the public health care system of the State of Mexico in Mexico is conducted to assess the trade-off. The proposed models are shown to be useful in the empirical work.
COMPUTERS & INDUSTRIAL ENGINEERING
(2022)
Article
Engineering, Civil
Junqi Zhang, Huan Liu, Peng Zu, Mengshi Zhao, Cheng Wang, Aiiad Albeshri, Abdullah Abusorrah, MengChu Zhou
Summary: Recently, the use of a particle swarm optimizer (PSO) to guide robots in a source location problem has gained attention. Traditional obstacle avoidance strategies are not effective when robots lack prior information. This work proposes a novel PSO based on Tabu Search (PSO-TS) that sets trapping areas as tabu objects to enable robots to locate multiple sources without prior knowledge or expensive hardware.
IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS
(2023)
Article
Engineering, Manufacturing
Shilong Wang, Haixu Zou, Sibao Wang
Summary: This article studies a parallel machine scheduling problem combining operation scheduling, tool scheduling and restrained resources, and proposes a Tabu-Genetic Algorithm to find the optimal solution. The proposed method performs well in both small and large size problems compared to other algorithms.
PROCEEDINGS OF THE INSTITUTION OF MECHANICAL ENGINEERS PART B-JOURNAL OF ENGINEERING MANUFACTURE
(2022)
Article
Management
Yuehui Wu, Ali Gul Qureshi, Tadashi Yamada
Summary: This study investigates a multi-allocation hub location routing problem for the design of an intra-city express service system. The results show that using multi-allocation hub location routing can effectively reduce costs.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2022)
Article
Engineering, Industrial
Shijin Wang, Qianyang Zhao
Summary: This paper addresses a container liner shipping problem with speed optimisation, proposing a probabilistic tabu search algorithm to minimize total costs of the fleet. Computational experiments demonstrate the effectiveness and superiority of the proposed method in solving the problem.
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
(2022)
Review
Management
Mohammad Delasay, Armann Ingolfsson, Bora Kolfal, Kenneth Schultz
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2019)
Article
Computer Science, Artificial Intelligence
Gunes Erdogan, Neophytos Stylianou, Christos Vasilakis
DECISION SUPPORT SYSTEMS
(2019)
Article
Management
Armann Ingolfsson, Eman Almehdawe, Ali Pedram, Monica Tran
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2020)
Article
Management
Maria Battarra, Federico Fraboni, Oliver Thomasson, Gunes Erdogan, Gilbert Laporte, Marco Formentini
Summary: The Workload Allocation Problem involves assigning a sequence of operations to workers based on their skills and the variable processing time needed for each job. This study, rooted in Calzedonia's operations, compared the performance of different algorithms, including CPLEX, exact algorithms, and metaheuristics, as well as a simple heuristic used in the company. By analyzing the computational results, it was found that the effectiveness of each method varied in practice, highlighting the strengths and weaknesses of each approach.
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY
(2021)
Article
Operations Research & Management Science
Gunes Erdogan, E. Alper Yildirim
Summary: This paper introduces new structural properties for the carrier-vehicle traveling salesman problem, presenting a new mixed-integer second-order conic optimization formulation and an iterated local search algorithm. Computational experiments on literature instances demonstrate the superiority of the new formulation and the high-quality solutions found by the ILS algorithm.
TRANSPORTATION SCIENCE
(2021)
Article
Management
Ramez Kian, Gunes Erdogan, Sander de Leeuw, F. Sibel Salman, Ehsan Sabet, Bahar Y. Kara, Muhittin H. Demir
Summary: This paper discusses the design of a network of administrative facilities to support the roll-out of cash-based interventions in the context of the Syrian refugee crisis. The goal is to reach the maximum number of eligible beneficiaries while minimizing logistics costs and security risks. The authors developed a hierarchical multi-objective metaheuristic algorithm to optimize facility location and routing decisions, and applied it to real data from a region in Turkey with associated managerial insights.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2022)
Article
Green & Sustainable Science & Technology
Hewen Zhou, Qing Yang, Eid Gul, Mengmeng Shi, Jiashuo Li, Minjiao Yang, Haiping Yang, Bin Chen, Haibo Zhao, Yunjun Yan, Gunes Erdogan, Pietro Bartocci, Francesco Fantozzi
Summary: The catering industry in China produces approximately 17-18 Mt of food waste per year, accounting for about 20% of the total food losses in the country. The National Development and Reform Commission has approved 100 pilot cities to implement food waste treatment projects, with a focus on anaerobic digestion. A case study conducted on a university campus demonstrates that small scale biogas plants can help reduce the environmental impact of food waste management, especially when coupled with pyrolysis processes.
Article
Computer Science, Interdisciplinary Applications
Gunes Erdogan
Summary: This paper aims to apply Computational Ethics to the shortlisting process in hiring by using Linear Programming, determining weights for each qualification type to compute scores and rankings for applicants. The author suggests the use of the Maximin model and iteratively eliminating applicants with the lowest score.
COMPUTERS & OPERATIONS RESEARCH
(2022)
Article
Computer Science, Interdisciplinary Applications
M. Hakan Akyuz, Ibrahim Muter, Gunes Erdogan, Gilbert Laporte
Summary: This research tackles the delivery problem in e-commerce logistics and proposes an online problem and mixed integer programming formulation to deal with fulfillment decisions. Through an iterative matheuristic approach, the researchers successfully achieve high-quality results.
COMPUTERS & OPERATIONS RESEARCH
(2022)
Article
Management
Gunes Erdogan, Maria Battarra, Antonio M. Rodriguez-Chia
Summary: This paper introduces the joint problem of locating hubs on a network and determining transportation prices between the hubs. It presents a nonlinear bilevel programming model which is linearized and strengthened through variable reductions as well as valid inequalities. The paper also studies the case where the price of each hub arc is determined by applying a common discount factor to the predefined tariff in the existing network.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2022)
Article
Management
Eda Yucel, F. Sibel Salman, Gunes Erdogan
Summary: This paper introduces a multi-period, two-dimensional vehicle loading and dispatching problem, aiming to minimize the total vehicle usage and earliness penalty costs, and provides a Mixed-Integer Linear Programming model (MILP) and an Adaptive Large Neighbourhood Search (ALNS) algorithm for solving the problem.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2022)
Article
Computer Science, Interdisciplinary Applications
Oliver Thomasson, Maria Battarra, Gunes Erdogan, Gilbert Laporte
Summary: This paper introduces the Twin-Robot Pallet Assignment and Scheduling Problem (TRPASP) and presents a mathematical model and four heuristic algorithms for solving the problem. The objective is to minimize the makespan, and computational experiments show that the best results are obtained using a parallel hybrid metaheuristic.
COMPUTERS & OPERATIONS RESEARCH
(2022)
Article
Computer Science, Interdisciplinary Applications
Ozge Safak, Guenes Erdogan
Summary: This paper presents a Large Neighbourhood Search (LNS) algorithm for effective item packing into containers. The algorithm can handle various constraints and issues such as weight limit, loading priorities, and stability. It also provides a visualized and animated packing solution to assist workers. The comparison with state-of-the-art algorithms demonstrates the quality of the solutions achieved by the LNS algorithm.
COMPUTERS & OPERATIONS RESEARCH
(2023)
Editorial Material
Management
Armann Ingolfsson, Avishai Mandelbaum, Kenneth Schultz, Galit B. Yom-Tov
OPERATIONS RESEARCH
(2023)
Article
Computer Science, Interdisciplinary Applications
Amir Rastpour, Armann Ingolfsson, Burhaneddin Sandikci
Summary: This study considers a Markovian multiserver queueing system with two customer classes, priorities, and reneging. An algorithm is proposed to calculate stationary probability bounds for this system, which is faster and more accurate than existing algorithms.
INFORMS JOURNAL ON COMPUTING
(2022)
