Browsing by Author "Erdoğan, Güneş"
Now showing items 1-11 of 11
-
Ambulance location for maximum survival
Erkut, Erhan; Ingolfsson, A.; Erdoğan, Güneş (Wiley, 2008-02)This article proposes new location models for emergency medical service stations. The models are generated by incorporating a survival function into existing covering models. A survival function is a monotonically decreasing ... -
The attractive traveling salesman problem
Erdoğan, Güneş; Cordeau, J.-F.; Laporte, G. (Elsevier, 2010-05-16)In the Attractive Traveling Salesman Problem the vertex set is partitioned into facility vertices and customer vertices. A maximum profit tour must be constructed on a subset of the facility vertices. Profit is computed ... -
A branch-and-cut algorithm for solving the non-preemptive capacitated swapping problem
Erdoğan, Güneş; Cordeau, J.-F.; Laporte, G. (Elsevier, 2010-08-06)This paper models and solves a capacitated version of the Non-Preemptive Swapping Problem. This problem is defined on a complete digraph , at every vertex of which there may be one unit of supply of an item, one unit of ... -
Computational comparison of five maximal covering models for locating ambulances
Erkut, Erhan; Ingolfsson, A.; Sim, T.; Erdoğan, Güneş (Wiley, 2009-01)This article categorizes existing maximum coverage optimization models for locatingambulances based on whether the models incorporate uncertainty about (1) ambulanceavailability and (2) response times. Data from Edmonton, ... -
Formulations and branch-and-cut algorithms for the generalized vehicle routing problem
Bektaş, T.; Erdoğan, Güneş; Ropke, S. (Informs, 2011-08)The generalized vehicle routing problem (GVRP) consists of finding a set of routes for a number of capacitated vehicles on a graph where the vertices are partitioned into clusters with given demands, such that the total ... -
Metaheuristics for the traveling salesman problem with pickups, deliveries and handling costs
Erdoğan, Güneş; Battarra, M.; Laporte, G.; Vigo, D. (Elsevier, 2012-05)This paper studies the Traveling Salesman Problem with Pickups, Deliveries, and Handling Costs. The subproblem of minimizing the handling cost for a fixed route is analyzed in detail. It is solved by means of an exact ... -
Modelling and solving an m-location, n-courier, priority-based planning problem on a network
Erdoğan, Güneş; Tansel, B.; Akgün, İ. (Springer Nature, 2012-01)In this paper, we study an m-location, n-courier, priority-based planning problem on a network, which we refer to as the Courier Planning Problem (CPP). The CPP arises on a daily basis in the context of planning the ... -
Scheduling ambulance crews for maximum coverage
Erdoğan, Güneş; Erkut, Erhan; Ingolfsson, A.; Laporte, G. (Palgrave MacMillan, 2010-04)This paper addresses the problem of scheduling ambulance crews in order to maximize the coverage throughout a planning horizon. The problem includes the subproblem of locating ambulances to maximize expected coverage with ... -
Solving a large-scale crew pairing problem
Erdoğan, Güneş; Haouari, Mohamed; Örmeci Matoğlu, Melda; Özener, Okan Örsan (Palgrave Macmillan, 2015)Airline companies seek to solve the problem of determining an assignment of crews to a pre-determined flight schedule with minimum total cost, called the Crew Pairing Problem (CPP). Most of the existing studies focus on ... -
The traveling salesman problem with pickups, deliveries, and handling costs
Battarra, M.; Erdoğan, Güneş; Laporte, G.; Vigo, D. (Informs, 2010-08)This paper introduces a new variant of the one-to-many-to-one single vehicle pickup and delivery problems (SVPDP) that incorporates the handling cost incurred when rearranging the load at the customer locations. The ... -
Two classes of quadratic assignment problems that are solvable as linear assignment problems
Erdoğan, Güneş; Tansel, B. Ç. (Elsevier, 2011-08)The Quadratic Assignment Problem is one of the hardest combinatorial optimization problems known. We present two new classes of instances of the Quadratic Assignment Problem that can be reduced to the Linear Assignment ...
Share this page
