Gültekin Kuyzu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Gültekin Kuyzu has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Martin Savelsbergh
School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332
3 shared publications Özlem Ergun
2 shared publications- Ali Ekici
Department of Industrial Engineering, Ozyegin University, Istanbul, Turkey
1 shared publication - Eda Yücel
TOBB University of Economics and Technology
1 shared publication - Evren Olcaytu
Department of Industrial Engineering, TOBB University of Economics and Technology, Ankara, Turkey
1 shared publication Okan Örsan Özener
Department of Industrial Engineering, Ozyegin University, Istanbul, 34794 Turkey
1 shared publication
Latest Publications
- 1 June 2020
- Published by Elsevier in Computers & Operations Research
- Vol. 118
An integrated solution approach for multi-objective, multi-skill workforce scheduling and routing problems
- 1 June 2020
- Published by Elsevier in Computers & Operations Research
- Vol. 118
An integrated solution approach for multi-objective, multi-skill workforce scheduling and routing problems
- 11 December 2019
- Published by Taylor & Francis in Transportation Letters
- Vol. 13 (1) , 21-35
Location-based distribution estimation for stochastic bid price optimization
Stochastic bid price optimization of truckload carriers in simultaneous independent transportation auctions requires estimating the probability distributions of the clearing prices. Historical data can be used for this purpose. The sole estimation method found in the literature for this problem setting only takes the length of the auction load into account. In this paper, we devise methods for load-specific parameter estimation by filtering out data coming from past auction loads with distant origin or destination locations. Through simulations, we demonstrate that our methods can improve the profitability of the carriers compared to the previously used method.
- 11 December 2019
- Published by Taylor & Francis in Transportation Letters
- Vol. 13 (1) , 21-35
Location-based distribution estimation for stochastic bid price optimization
Stochastic bid price optimization of truckload carriers in simultaneous independent transportation auctions requires estimating the probability distributions of the clearing prices. Historical data can be used for this purpose. The sole estimation method found in the literature for this problem setting only takes the length of the auction load into account. In this paper, we devise methods for load-specific parameter estimation by filtering out data coming from past auction loads with distant origin or destination locations. Through simulations, we demonstrate that our methods can improve the profitability of the carriers compared to the previously used method.
- 1 January 2017
- Published by Elsevier in Computers & Operations Research
- Vol. 77, 32-43
Lane covering with partner bounds in collaborative truckload transportation procurement
- 1 January 2017
- Published by Elsevier in Computers & Operations Research
- Vol. 77, 32-43
Lane covering with partner bounds in collaborative truckload transportation procurement
- 1 November 2015
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Transportation Science
- Vol. 49 (4) , 817-829
Cyclic Delivery Schedules for an Inventory Routing Problem
We consider an inventory routing problem where a common vendor is responsible for replenishing the inventories of several customers over a perpetual time horizon. The objective of the vendor is to minimize the total cost of transportation of a single product from a single depot to a set of customers with deterministic and stationary consumption rates over a planning horizon while avoiding stock-outs at the customer locations. We focus on constructing a repeatable (cyclic) delivery schedule for the product delivery. We propose a novel algorithm, called the Iterative Clustering-Based Constructive Heuristic Algorithm, to solve the problem in two stages: (i) clustering, and (ii) delivery schedule generation. To test the performance of the proposed algorithm in terms of solution quality and computational efficiency, we perform a computational study on both randomly generated instances and real-life instances provided by an industrial gases manufacturer. We also compare the performance of the proposed algorithm against an algorithm developed for general routing problems.
- 1 November 2015
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Transportation Science
- Vol. 49 (4) , 817-829
Cyclic Delivery Schedules for an Inventory Routing Problem
We consider an inventory routing problem where a common vendor is responsible for replenishing the inventories of several customers over a perpetual time horizon. The objective of the vendor is to minimize the total cost of transportation of a single product from a single depot to a set of customers with deterministic and stationary consumption rates over a planning horizon while avoiding stock-outs at the customer locations. We focus on constructing a repeatable (cyclic) delivery schedule for the product delivery. We propose a novel algorithm, called the Iterative Clustering-Based Constructive Heuristic Algorithm, to solve the problem in two stages: (i) clustering, and (ii) delivery schedule generation. To test the performance of the proposed algorithm in terms of solution quality and computational efficiency, we perform a computational study on both randomly generated instances and real-life instances provided by an industrial gases manufacturer. We also compare the performance of the proposed algorithm against an algorithm developed for general routing problems.
- 1 March 2015
- Published by Elsevier in Transportation Research Part B: Methodological
- Vol. 73, 34-58
Bid price optimization for truckload carriers in simultaneous transportation procurement auctions
- 1 March 2015
- Published by Elsevier in Transportation Research Part B: Methodological
- Vol. 73, 34-58
Bid price optimization for truckload carriers in simultaneous transportation procurement auctions
- 1 June 2007
- Published by Elsevier in Computers & Operations Research
- Vol. 34 (6) , 1551-1560
Shipper collaboration
- 1 June 2007
- Published by Elsevier in Computers & Operations Research
- Vol. 34 (6) , 1551-1560
Shipper collaboration
- 1 May 2007
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Transportation Science
- Vol. 41 (2) , 206-221
Reducing Truckload Transportation Costs Through Collaboration
In the highly fragmented truckload transportation industry a substantial fraction of truck movements involves empty trucks, i.e., moves that reposition trucks. However, reducing the amount of truck repositioning is difficult because the need for a carrier to reposition its trucks depends on the interactions between the shippers the carrier is serving. Through collaboration, shippers may be able to identify and submit sequences of continuous loaded movements to carriers, reducing the carriers’ need for repositioning, and thus lowering the carriers’ costs. A portion of the carriers’ cost savings may be returned to the shippers in the form of lower prices. We discuss optimization technology that can be used to assist in the identification of repeatable, dedicated truckload continuous move tours with little truck repositioning. Timing considerations are critical to practical viability and a key focus of our efforts. We demonstrate the effectiveness of the algorithms developed on various randomly generated instances as well as on instances derived from data obtained from a strategic sourcing consortium for a $14 billion U.S. industry.
- 1 May 2007
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Transportation Science
- Vol. 41 (2) , 206-221
Reducing Truckload Transportation Costs Through Collaboration
In the highly fragmented truckload transportation industry a substantial fraction of truck movements involves empty trucks, i.e., moves that reposition trucks. However, reducing the amount of truck repositioning is difficult because the need for a carrier to reposition its trucks depends on the interactions between the shippers the carrier is serving. Through collaboration, shippers may be able to identify and submit sequences of continuous loaded movements to carriers, reducing the carriers’ need for repositioning, and thus lowering the carriers’ costs. A portion of the carriers’ cost savings may be returned to the shippers in the form of lower prices. We discuss optimization technology that can be used to assist in the identification of repeatable, dedicated truckload continuous move tours with little truck repositioning. Timing considerations are critical to practical viability and a key focus of our efforts. We demonstrate the effectiveness of the algorithms developed on various randomly generated instances as well as on instances derived from data obtained from a strategic sourcing consortium for a $14 billion U.S. industry.