Research Outputs
Permanent URI for this communityhttps://hdl.handle.net/20.500.14288/2
Browse
37 results
Search Results
Publication Metadata only A binarization strategy for modelling mixed data in multigroup classification(Institute of Electrical and Electronics Engineers (IEEE), 2013) Masmoudi, Youssef; Chabchoub, Habib; Department of Industrial Engineering; Türkay, Metin; Faculty Member; Department of Industrial Engineering; College of Engineering; 24956This paper presents a binarization pre-processing strategy for mixed datasets. We propose that the use of binary attributes for representing nominal and integer data is beneficial for classification accuracy. We also describe a procedure to convert integer and nominal data into binary attributes. Expectation-Maximization (EM) clustering algorithms was applied to classify the values of the attributes with a wide range to use a small number of binary attributes. Once the data set is pre-processed, we use the Support Vector Machine (LibSVM) for classification. The proposed method was tested on datasets from the literature. We demonstrate the improved accuracy and efficiency of presented binarization strategy for modelling mixed and complex data in comparison to the classification of the original dataset, nominal dataset and binary dataset.Publication Restricted A discrate-continuous optimization approach for the design and operation of synchromodal transportation networks(Koç University, 2016) Reşat, Hamdi Giray; Türkay, Metin; 0000-0003-4769-6714; Koç University Graduate School of Sciences and Engineering; Industrial Engineering; 24956Publication Metadata only A fundamental experimental approach for optimal design of speed bumps(Elsevier, 2018) Bilgin, Ertuğrul; Lav, Abdullah Hilmi; N/A; Lav, Ahmet Hakan; Undergraduate student; School of MedicineSpeed bumps and humps are utilized as means of calming traffic and controlling vehicular speed. Needless to say, bumps and humps of large dimensions in length and width force drivers to significantly reduce their driving speeds so as to avoid significant vehicle vertical acceleration. It is thus that this experimental study was conducted with the aim of determining a speed bump design that performs optimally when leading drivers to reduce the speed of their vehicles to safe levels. The first step of the investigation starts off by considering the following question: "What is the optimal design of a speed bump that will - at the same time - reduce the velocity of an incoming vehicle significantly and to a speed that resulting vertical acceleration does not jeopardize road safety? The experiment has been designed to study the dependent variables and collect data in order to propose an optimal design for a speed bump. To achieve this, a scaled model of 1:6 to real life was created to simulate the interaction between a car wheel and a speed bump. During the course of the experiment, a wheel was accelerated down an inclined plane onto a horizontal plane of motion where it was allowed to collide with a speed bump. The speed of the wheel and the vertical acceleration at the speed bump were captured by means of a Vernier Motion Detector.Publication Restricted A method for pickup and delivery and its application to truck route scheduling(Koç University, 2015) Altun, Aysu; Oğuz, Ceyda; 0000-0003-0994-1758; Koç University Graduate School of Sciences and Engineering; Industrial Engineering; 6033Publication Restricted Air Carrier’s Liability under the 1999 Montreal Convention: Death, Bodily Injury and Delay of Passenger(Koç University, 2015) Gölcüklü, İlyas; Özbek, Meltem Deniz Güner; Koç University Graduate School of Social Sciences and Humanities; LawPublication Metadata only An exact algorithm for integrated planning of operations in dry bulk terminals(Pergamon-Elsevier Science Ltd, 2019) N/A; Department of Industrial Engineering; Ünsal, Özgür; Oğuz, Ceyda; PhD Student; Faculty Member; Department of Industrial Engineering; Graduate School of Sciences and Engineering; College of Engineering; 328856; 6033We consider integrated planning problem of export dry bulk terminals. This problem consists of three important operations: (i) berth allocation, (ii) reclaimer scheduling, and (iii) stockyard allocation, and includes tidal time windows, multiple stocking pads and non-crossing of reclaimers. We exploit relationships among these operations to decompose this complex problem and propose a logic-based Benders decomposition algorithm. Master and subproblems are modeled with mixed-integer programming and constraint programming, respectively, such that complementary strengths of these programming paradigms are utilized. Computational experiments show that the proposed method can effectively solve the integrated problem for up to two weeks of planning horizon.Publication Metadata only An online optimization approach to post-disaster road restoration(Pergamon-Elsevier Science Ltd, 2021) Akbari, Vahid; Shiri, Davood; Department of Industrial Engineering; Salman, Fatma Sibel; Faculty Member; Department of Industrial Engineering; College of Engineering; 178838Natural disasters impact transportation networks adversely and cause road sections to be damaged or blocked. The road network may even become disconnected, impeding accessibility between disaster-stricken areas and critical locations such as hospitals, relief aid depots and transportation hubs. In the immediate response phase, a set of blocked edges should be selected and restored to reconnect the transportation network. While locations of the disrupted roads can be identified using drone or satellite images, an accurate estimation of time to restore a road segment can be carried out only after expert observations on the field. In this article, we study a post-disaster road restoration problem modeled on an undirected edge-weighted graph with k blocked edges, where the unblocking time of a blocked edge is revealed online once the road restoration team visits an end-node of that blocked edge. The objective is to minimize the time at which the road network is reconnected. We first investigate the worst-case performance of online algorithms against offline optimal solutions by means of the competitive ratio. We prove that any online deterministic algorithm cannot achieve a competitive ratio better than 2k-1. We also provide an optimal online algorithm that is proven to achieve this lower bound. In addition, to achieve good performance on realistic instances, we implement an algorithm that solves a mixed integer programming model each time new information is revealed. Since model solution is prohibitively time-consuming, we also propose a novel polynomial time online algorithm. We compare these two algorithms with two other benchmark online algorithms on both Istanbul road network instances and several other city instances from the literature. Our experiments show that the proposed polynomial time online algorithm performs superior to the benchmark ones and obtains solutions close to the offline optimum on all the tested instances.Publication Metadata only Arc routing problems to restore connectivity of a road network(Pergamon-Elsevier Science Ltd, 2016) Kasaei, Maziar; Department of Industrial Engineering; Salman, Fatma Sibel; Faculty Member; Department of Industrial Engineering; College of Engineering; 178838After a disaster, restoring accessibility in the affected area is critical for response operations. We study two arc routing problems for clearing blocked roads. The first problem minimizes the time to reconnect the road network, while the second maximizes the total benefit gained by reconnecting network components within a time limit. For each problem, we develop a mixed integer programming formulation and two versions of a heuristic algorithm. We conduct computational experiments on Istanbul data and instances adapted from the literature. The heuristics achieve near-optimal or optimal solutions quickly in most of the tested instances.Publication Restricted Carrier's liability in international carriage of goods by air(Koç University, 2016) Turhan, Gökhan; Buğra, Ayşegül; 0000-0003-2578-5660; Koç University Graduate School of Social Sciences and Humanities; Law; 237477Publication Metadata only Constraint programming approach to quay crane scheduling problem(Pergamon-Elsevier Science Ltd, 2013) N/A; N/A; Department of Industrial Engineering; Ünsal, Özgür; Oğuz, Ceyda; PhD Student; Faculty Member; Department of Industrial Engineering; Graduate School of Sciences and Engineering; College of Engineering; College of Engineering; 328856; 6033This study presents a constraint programming (CP) model for the quay crane scheduling problem (QCSP), which occurs at container terminals, with realistic constraints such as safety margins, travel times and precedence relations. Next, QCSP with time windows and integrated crane assignment and scheduling problem, are discussed. The performance of the CP model is compared with that of algorithms presented in QCSP literature. The results of the computational experiments indicate that the CP model is able to produce good results while reducing the computational time, and is a robust and flexible alternative for different types of crane scheduling problems.