@article {1441, title = {Exact solution algorithms for the maximum flow problem with additional conflict constraints}, journal = {European Journal of Operational Research}, volume = {287}, year = {2020}, pages = {410-437}, abstract = {

We consider a variant of the maximum flow problem on a given directed graph where some arc pairs are incompatible or conflicting; in other words, they are not allowed to carry positive flow simultaneously. This problem, called the maximum flow problem with conflicts, is known to be strongly NP-hard. In this paper, we present mixed-integer linear programming formulations for the problem and develop exact solution methods based on Benders decomposition, branch-and-bound, and Russian Doll Search over the conflict graph which represents the conflict relations. The effectiveness of the proposed algorithms is tested on a large number of randomly generated instances. The results reveal that their performances are superior to solving the mixed-integer linear programming formulations with a commercial software.

}, keywords = {Benders decomposition, Branch-and-bound, Combinatorial optimization, Conflict, Maximum flow, Russian doll search}, issn = {0377-2217}, doi = {https://doi.org/10.1016/j.ejor.2020.04.001}, url = {https://www.sciencedirect.com/science/article/pii/S0377221720303192}, author = {Zeynep {\c S}uvak and I. Kuban Altinel and Necati Aras} } @article {1446, title = {Gradual covering location problem with multi-type facilities considering customer preferences}, journal = {Computers \& Industrial Engineering}, volume = {147}, year = {2020}, pages = {106577}, abstract = {

In this paper, we address a discrete facility location problem where a retailer aims at locating new facilities with possibly different characteristics. Customers visit the facilities based on their preferences which are represented as probabilities. These probabilities are determined in a novel way by using a fuzzy clustering algorithm. It is assumed that the sum of the probabilities with which customers at a given demand zone patronize different types of facilities is equal to one. However, among the same type of facilities they choose the closest facility, and the strength at which this facility covers the customer is based on two distances referred to as full coverage distance and gradual (partial) coverage distance. If the distance between the customer location and the closest facility is smaller (larger) than the full (partial) coverage distance, this customer is fully (not) covered, whereas for all distance values between full and partial coverage, the customer is partially covered. Both distance values depend on both the customer attributes and the type of the facility. Furthermore, facilities can only be opened if their revenue exceeds a certain threshold value. A final restriction is incorporated into the model by defining a minimum separation distance between the same facility types. This restriction is also extended to the case where a minimum threshold distance exists among facilities of different types. The objective of the retailer is to find the optimal locations and types of the new facilities in order to maximize its profit. Two versions of the problem are formulated using integer linear programming, which differ according to whether the minimum separation distance applies to the same facility type or different facility types. The resulting integer linear programming models are solved by three approaches: commercial solver CPLEX, heuristics based on Lagrangean relaxation, and local search implemented with 1-Add and 1-Swap moves. Apart from experimentally assessing the accuracy and the efficiency of the solution methods on a set of randomly generated test instances, we also carry out sensitivity analysis using a real-world problem instance.

}, keywords = {Customer preferences, Facility location, Fuzzy c-means clustering, Gradual coverage, Lagrangean relaxation}, issn = {0360-8352}, doi = {https://doi.org/10.1016/j.cie.2020.106577}, url = {https://www.sciencedirect.com/science/article/pii/S0360835220303119}, author = {Hande K{\"u}{\c c}{\"u}kaydin and Necati Aras} } @article {1436, title = {Minimizing the misinformation spread in social networks}, journal = {IISE Transactions}, volume = {52}, year = {2020}, pages = {850-863}, abstract = {

AbstractThe Influence Maximization Problem has been widely studied in recent years, due to rich application areas including marketing. It involves finding k nodes to trigger a spread such that the expected number of influenced nodes is maximized. The problem we address in this study is an extension of the reverse influence maximization problem, i.e., misinformation minimization problem where two players make decisions sequentially in the form of a Stackelberg game. The first player aims to minimize the spread of misinformation whereas the second player aims its maximization. Two algorithms, one greedy heuristic and one matheuristic, are proposed for the first player{\textquoteright}s problem. In both of them, the second player{\textquoteright}s problem is approximated by Sample Average Approximation, a well-known method for solving two-stage stochastic programming problems, that is augmented with a state-of-the-art algorithm developed for the influence maximization problem.

}, doi = {10.1080/24725854.2019.1680909}, url = {https://doi.org/10.1080/24725854.2019.1680909}, author = {K{\"u}bra Tan{\i}nm{\i}{\c s} and Necati Aras and I. Kuban Altinel and Evren G{\"u}ney} } @article {1448, title = {The r-interdiction selective multi-depot vehicle routing problem}, journal = {International Transactions in Operational Research}, volume = {27}, year = {2020}, pages = {835-866}, abstract = {

Abstract The protection of critical facilities has been attracting increasing attention in the past two decades. Critical facilities involve physical assets such as bridges, railways, power plants, hospitals, and transportation hubs among others. In this study we introduce a bilevel optimization problem for the determination of the most critical depots in a vehicle routing context. The problem is modeled as an attacker{\textendash}defender game (Stackelberg game) from the perspective of an adversary agent (the attacker) who aims to inflict maximum disruption on a routing network. We refer to this problem as the r-interdiction selective multi-depot vehicle routing problem (RI-SMDVRP). The attacker is the decision maker in the upper level problem (ULP) who chooses r depots to interdict with certainty. The defender is the decision maker in the lower level problem (LLP) who optimizes the vehicle routes in the wake of the attack. The defender has to satisfy all customer demand either using the remaining depots or through outsourcing to a third party logistics service provider. The ULP is solved through exhaustive enumeration, which is viable when the cardinality of interdictions does not exceed five among nine depots. For the LLP we implement a tabu search heuristic adapted to the selective multi-depot VRP. Our results are obtained on a set of RI-SMDVRP instances synthetically constructed from standard MDVRP test instances.

}, keywords = {bilevel programming, interdiction, multi-depot vehicle routing problem, outsourcing, tabu search}, doi = {https://doi.org/10.1111/itor.12669}, url = {https://onlinelibrary.wiley.com/doi/abs/10.1111/itor.12669}, author = {Sadati, Mir Ehsan Hesam and Aksen, Deniz and Necati Aras} } @inbook {1585, title = {Solution of a Real-Life Vehicle Routing Problem with Meal Breaks and Shifts}, booktitle = {Green Transportation and New Advances in Vehicle Routing Problems}, year = {2020}, pages = {131{\textendash}157}, publisher = {Springer International Publishing}, organization = {Springer International Publishing}, doi = {10.1007/978-3-030-45312-1_5}, url = {https://doi.org/10.1007/978-3-030-45312-1_5}, author = {Ci{\u g}dem Karademir and {\"U}mit Bilge and Necati Aras and G{\"o}kay Burak Akku{\c s} and G{\"o}ksu {\"O}znergiz and Onur Do{\u g}an} } @article {1447, title = {A trilevel r-interdiction selective multi-depot vehicle routing problem with depot protection}, journal = {Computers \& operations research}, volume = {123}, year = {2020}, pages = {104996}, author = {Sadati, Mir Ehsan Hesam and Aksen, Deniz and Necati Aras} } @article {1437, title = {Influence maximization with deactivation in social networks}, journal = {European Journal of Operational Research}, volume = {278}, year = {2019}, pages = {105-119}, abstract = {

In this paper, we consider an extension of the well-known Influence Maximization Problem in a social network which deals with finding a set of k nodes to initiate a diffusion process so that the total number of influenced nodes at the end of the process is maximized. The extension focuses on a competitive variant where two decision makers are involved. The first one, the leader, tries to maximize the total influence spread by selecting the most influential nodes and the second one, the follower, tries to minimize it by deactivating some of these nodes. The formulated bilevel model is solved by complete enumeration for small-sized instances and by a matheuristic for large-sized instances. In both cases, the lower level problem, which is a stochastic optimization problem, is approximated via the Sample Average Approximation method.

}, keywords = {Bilevel modeling, Influence maximization, Matheuristics, Metaheuristics, Stochastic optimization}, issn = {0377-2217}, doi = {https://doi.org/10.1016/j.ejor.2019.04.010}, url = {https://www.sciencedirect.com/science/article/pii/S0377221719303303}, author = {K{\"u}bra Tan{\i}nm{\i}{\c s} and Necati Aras and I. Kuban Altinel} } @article {1444, title = {An integrated disaster preparedness model for retrofitting and relief item transportation}, journal = {Networks and Spatial Economics}, volume = {19}, year = {2019}, pages = {1031{\textendash}1068}, author = {D{\"o}yen, Alper and Necati Aras} } @article {1434, title = {Minimum cost noncrossing flow problem on layered networks}, journal = {Discrete Applied Mathematics}, volume = {261}, year = {2019}, pages = {2-21}, abstract = {

In this work we focus on an extension of the minimum cost flow problem in layered networks. Feasible arc flows must satisfy a specific compatibility restriction in addition to flow balance and capacity restrictions. Namely, at most one of the crossing arcs is allowed to have positive flow on it. This variant of the minimum cost flow problem, which we call the minimum cost noncrossing flow problem, can frequently be encountered in real life. The determination of optimal temporal quay crane allocations to berthed vessels in container terminals, and optimal train schedules through the stations on the same railroad line are two examples. We first analyze the complexity of the problem and show that the noncrossing flow problem is in fact NP-complete in a layered network. Then, we introduce mixed-integer linear programming formulations and discuss a polynomially solvable special case. Next we show a sufficient condition for the existence of a crossing in an optimal solution, which can be used for preprocessing the arcs in order to reduce the problem size. Our computational experiments on a large test set show that our preprocessing algorithm can significantly reduce the number of arcs.

}, keywords = {integer programming, Layered networks, Network flows, Noncrossing flow}, issn = {0166-218X}, doi = {https://doi.org/10.1016/j.dam.2018.09.016}, url = {https://www.sciencedirect.com/science/article/pii/S0166218X18304815}, author = {I. Kuban Altinel and Necati Aras and Zeynep {\c S}uvak and Z C Ta{\c s}k{\i}n} } @article {1445, title = {SLA-aware optimal resource allocation for service-oriented networks}, journal = {Future Generation Computer Systems}, volume = {101}, year = {2019}, pages = {959-974}, abstract = {

The popularity of traditional network services and web content is succeeded by the recent trend in customized services proliferated by the smart devices and gadgets. Fall-risk assessment, augmented reality, ECG (electrocardiography) monitoring, virtual reality-based gaming and similar services are driven through data generated by multi-modal sensors embedded in the end-user equipment. These services may possess varying characteristics and requirements represented with performance metrics and Quality of Service (QoS) parameters. Even though the small form-factor end-user gadgets are getting powerful in terms of resource capacity, they are still incapable of executing complex routines, and thus these tasks should be offloaded to a remote machine. Service-Centric Networks (SCN) focus on delivering customized services to the users in a location-independent fashion. This is in parallel with previous vision put forward by the Information-Centric Networks (ICN) and Content Delivery Networks (CDN), which aim to enhance the end-user experience. The novel set of services for complementing the daily activities of the end-users mostly depicts a latency-intolerant attribute which ultimately calls for a full-fledged resource allocation scheme. Within this context, both computation and networking resources should be allocated optimally, and task assignments should be handled precisely for following the requirements specified by the Service Level Agreements (SLAs). This paper initially presents and discusses problem definitions that should be addressed by the service-centric multi-tier computing architecture that is composed of edge, metro, and cloud servers. In order to achieve this objective, an SLA-aware optimal resource allocation and task assignment model for service-oriented networks is proposed. This optimization model is based on a nonlinear delay formulation for accommodating service-centric network scenarios under various conditions. It is then reshaped as a mixed-integer linear model through piecewise linear approximation. Additionally, a heuristic implementation is presented to address the time and space complexities of the problem for which the aforementioned optimization models remain ineffective. Performance evaluation results show that the proposed solutions are able to find a good allocation of resources while taking the requirements of the services into account.

}, keywords = {Cloud computing, Edge computing, Network optimization, Service-centric networks, Task offloading}, issn = {0167-739X}, doi = {https://doi.org/10.1016/j.future.2019.07.050}, url = {https://www.sciencedirect.com/science/article/pii/S0167739X19306430}, author = {Ahmet Cihat Bakt{\i}r and Bet{\"u}l Ahat and Necati Aras and Atay {\"O}zg{\"o}vde and Cem Ersoy} } @article {1443, title = {Determining the most vulnerable components in a transportation network}, journal = {Sigma}, volume = {9}, year = {2018}, pages = {371{\textendash}382}, author = {K{\"u}{\c c}{\"u}kayd{\i}n, Hande and Necati Aras} } @article {1442, title = {Robust supply chain network design with multi-products for a company in the food sector}, journal = {Applied Mathematical Modelling}, volume = {60}, year = {2018}, pages = {526-539}, abstract = {

The paper aims to solve a problem faced by a company competing in the snacks market in Turkey. In line with the growth in this market, the company needs to make important decisions over the next few years about the timing and location of a new plant, its initial capacity, the timing and amount of additional capacity to be installed at the new and existing plants, the assignment of demand points to plants and the amount of raw materials to be shipped from suppliers to the plants in each period. The objective is to minimize the total cost of various components. The problem is formulated as a multi-period supply chain network design model with multi products. The resulting mixed-integer linear programming model is solved by the commercial solver CPLEX. This model enables us to carry out all analyses requested by the company in an efficient way. After this deterministic model is solved on the basis of a 9\% annual increase in demand, it is extended to a minimax regret model to deal with uncertainty in demand quantities. The results suggest that opening the new plant in the city of {\.I}zmir is indeed a robust solution that is unaffected in different scenarios that are based on three distinct demand increase rates. Even though the location of the new plant remains unchanged with respect to scenarios, the optimal robust solution differs from the optimal solution of each scenario in terms of the capacity expansion decisions. After all obtained results had been communicated to the company managers and executives, the new plant construction was started in 2016 very close to the city that the mathematical model had determined. The new plant is expected to start operating in 2018.

}, keywords = {Demand uncertainty, Facility location-allocation, Mixed-integer linear programming, Robust optimization, Supply chain network design}, issn = {0307-904X}, doi = {https://doi.org/10.1016/j.apm.2018.03.034}, url = {https://www.sciencedirect.com/science/article/pii/S0307904X18301586}, author = {Necati Aras and {\"U}mit Bilge} } @inbook {1186, title = {Bilevel Models on the Competitive Facility Location Problem}, booktitle = {Spatial Interaction Models}, year = {2017}, pages = {1{\textendash}19}, publisher = {Springer}, organization = {Springer}, author = {Necati Aras and K{\"u}{\c c}{\"u}kayd{\i}n, Hande} } @article {1164, title = {Designing distribution systems with reverse flows}, journal = {Journal of Remanufacturing}, volume = {7}, year = {2017}, pages = {113{\textendash}137}, author = {Tombu{\c s}, Ay{\c s}e Cilac{\i} and Necati Aras and Verter, Vedat} } @article {1163, title = {Optimal sensor deployment to increase the security of the maximal breach path in border surveillance}, journal = {European Journal of Operational Research}, volume = {259}, year = {2017}, pages = {19{\textendash}36}, author = {Karabulut, Ezgi and Necati Aras and I. Kuban Altinel} } @article {1173, title = {A new multi-objective mathematical model for the high-level synthesis of integrated circuits}, journal = {Applied Mathematical Modelling}, volume = {40}, year = {2016}, pages = {2274{\textendash}2290}, author = {Necati Aras and Yurdakul, Arda} } @article {1171, title = {Optimal berth allocation, time-variant quay crane assignment and scheduling with crane setups in container terminals}, journal = {European Journal of Operational Research}, volume = {254}, year = {2016}, pages = {985{\textendash}1001}, author = {T{\"u}rko{\u g}ullar{\i}, Yavuz B and Z. Caner Ta{\c s}k{\i}n and Necati Aras and I. Kuban Altinel} } @article {1089, title = {Optimal Berth Allocation, Time-variant Quay Crane Assignment and Scheduling with Crane Setups in Container Terminals}, journal = {European Journal of Operational Research}, volume = {254}, year = {2016}, pages = {985-1001}, doi = {http://dx.doi.org/10.1016/j.ejor.2016.04.022}, author = {Yavuz Boga{\c c} T{\"u}rkogullari and Z C Ta{\c s}k{\i}n and Necati Aras and I. Kuban Altinel} } @article {1194, title = {Optimal Sensor Deployment to Increase the Security of the Maximal Breach Path in Border Surveillance}, year = {2016}, institution = {Bo{\u g}azi{\c c}i University}, author = {Karabulut E and Necati Aras and I. Kuban Altinel} } @article {1467, title = {Locating recycling facilities for IT based electronic waste in Turkey}, journal = {Journal of Cleaner Production}, volume = {105}, year = {2015}, month = {Oct}, pages = {324{\textendash}336}, issn = {09596526}, author = {Necati Aras and Aybek Korugan and B{\"U}Y{\"U}K{\"O}ZKAN FEYZ{\.I}O{\u G}LU, G{\"U}L{\c C}{\.I}N and S{\.I}VR{\.I}KAYA {\c S}ER{\.I}FO{\u G}LU, FUNDA and Erol, Ismail and Nurtani{\c s} Velio{\u g}lu, Meltem} } @article {aksen2014bilevel, title = {A bilevel partial interdiction problem with capacitated facilities and demand outsourcing}, journal = {Computers \& Operations Research}, volume = {41}, year = {2014}, pages = {346{\textendash}358}, publisher = {Pergamon}, author = {Aksen, Deniz and {\c S}eng{\"u}l Akca, Sema and Necati Aras} } @article {TurkogullariEtAl2014, title = {Optimal berth allocation and time-invariant quay crane assignment in container terminals}, journal = {European Journal of Operational Research}, volume = {235}, number = {1}, year = {2014}, pages = {88{\textendash}101}, doi = {http://dx.doi.org/10.1016/j.ejor.2013.10.015}, author = {Yavuz Boga{\c c} T{\"u}rkogullari and Z C Ta{\c s}k{\i}n and Necati Aras and I. Kuban Altinel} } @inbook {aras2014simultaneous, title = {Simultaneous Optimization of Berth Allocation, Quay Crane Assignment and Quay Crane Scheduling Problems in Container Terminals}, booktitle = {Operations Research Proceedings 2012}, year = {2014}, pages = {101{\textendash}107}, publisher = {Springer International Publishing}, organization = {Springer International Publishing}, author = {Necati Aras and T{\"u}rko{\u g}ullar{\i}, Yavuz and Z C Ta{\c s}k{\i}n and I. Kuban Altinel} } @article {keskin2014wireless, title = {Wireless sensor network lifetime maximization by optimal sensor deployment, activity scheduling, data routing and sink mobility}, journal = {Ad Hoc Networks}, volume = {17}, year = {2014}, pages = {18{\textendash}36}, publisher = {Elsevier}, author = {Keskin, M Emre and I. Kuban Altinel and Necati Aras and Ersoy, Cem} } @article {aksen2013bilevel, title = {A bilevel p-median model for the planning and protection of critical facilities}, journal = {Journal of Heuristics}, volume = {19}, number = {2}, year = {2013}, pages = {373{\textendash}398}, publisher = {Springer US}, author = {Aksen, Deniz and Necati Aras and Piyade, Nuray} } @article {bacsdere2013leader, title = {A leader-follower game for the point coverage problem in wireless sensor networks}, journal = {European Journal of Industrial Engineering}, volume = {7}, number = {5}, year = {2013}, pages = {635{\textendash}656}, publisher = {Inderscience Publishers}, author = {Ba{\c s}dere, Mehmet and Necati Aras and I. Kuban Altinel and Af{\c s}ar, Sezin} } @inbook {aksen2013matheuristic, title = {A Matheuristic for Leader-Follower Games Involving Facility Location-Protection-Interdiction Decisions}, booktitle = {Metaheuristics for Bi-level Optimization}, year = {2013}, pages = {115{\textendash}151}, publisher = {Springer Berlin Heidelberg}, organization = {Springer Berlin Heidelberg}, author = {Aksen, Deniz and Necati Aras} } @article {aksen2012bilevel, title = {A bilevel fixed charge location model for facilities under imminent attack}, journal = {Computers \& Operations Research}, volume = {39}, number = {7}, year = {2012}, pages = {1364{\textendash}1381}, publisher = {Pergamon}, author = {Aksen, Deniz and Necati Aras} } @article {kucukaydin2012ciftduzeyli, title = {Ciftduzeyli Bir Rekabetci Tesis Yer Secimi Problemi Icin Tabu Arama Sezgiseli}, journal = {Endustri Muhendisligi Dergisi}, volume = {23}, number = {1}, year = {2012}, publisher = {TMMOB Makina Muhendisleri Odasi}, author = {K{\"u}{\c c}{\"u}kayd{\i}n, Hande and Necati Aras and I. Kuban Altinel} } @article {guney2012efficient, title = {Efficient solution techniques for the integrated coverage, sink location and routing problem in wireless sensor networks}, journal = {Computers \& Operations Research}, volume = {39}, number = {7}, year = {2012}, pages = {1530{\textendash}1539}, publisher = {Elsevier}, author = {G{\"u}ney, Evren and Necati Aras and I. Kuban Altinel and Ersoy, Cem} } @conference {kucukaydin2012hybrid, title = {Hybrid Tabu Search Heuristics for a Bilevel Competitive Facility Location Model}, booktitle = {26th Annual Conference of the Belgian Operational Research Society}, year = {2012}, author = {K{\"u}{\c c}{\"u}kayd{\i}n, Hande and Necati Aras and I. Kuban Altinel} } @article {keccici2012incorporating, title = {Incorporating the threat of terrorist attacks in the design of public service facility networks}, journal = {Optimization Letters}, volume = {6}, number = {6}, year = {2012}, pages = {1101{\textendash}1121}, publisher = {Springer-Verlag}, author = {Ke{\c c}ici, Serhat and Necati Aras and Verter, Vedat} } @article {kuccukaydin2012leader, title = {A leader{\textendash}follower game in competitive facility location}, journal = {Computers \& Operations Research}, volume = {39}, number = {2}, year = {2012}, pages = {437{\textendash}448}, publisher = {Elsevier}, author = {K{\"u}{\c c}{\"u}kayd{\i}n, Hande and Necati Aras and I. Kuban Altinel} } @article {doyen2012two, title = {A two-echelon stochastic facility location model for humanitarian relief logistics}, journal = {Optimization Letters}, volume = {6}, number = {6}, year = {2012}, pages = {1123{\textendash}1145}, publisher = {Springer-Verlag}, author = {D{\"o}yen, Alper and Necati Aras and Barbaroso{\u g}lu, G{\"u}lay} } @article {14445765, title = {{Competitive facility location problem with attractiveness adjustment of the follower: A bilevel programming model and its solution}}, journal = {European Journal of Operational Research}, volume = {208}, year = {2011}, pages = {206{\textendash}220}, doi = {10.1016/j.ejor.2010.08.009}, author = {Hande K{\"u}{\c c}{\"u}kaydin and Necati Aras and I. Kuban Altinel} } @article {kuccukaydin2011discrete, title = {A discrete competitive facility location model with variable attractiveness}, journal = {Journal of the Operational Research Society}, volume = {62}, number = {9}, year = {2011}, pages = {1726{\textendash}1741}, publisher = {Nature Publishing Group}, author = {K{\"u}{\c c}{\"u}kayd{\i}n, H and Necati Aras and I. Kuban Altinel} } @article {keskin2011lifetime, title = {Lifetime maximization in wireless sensor networks using a mobile sink with nonzero traveling time}, journal = {The Computer Journal}, year = {2011}, pages = {bxr048}, publisher = {Oxford University Press}, author = {Keskin, M Emre and I. Kuban Altinel and Necati Aras and Ersoy, Cem} } @article {aras2011optimal, title = {Optimal inventory and pricing policies for remanufacturable leased products}, journal = {International Journal of Production Economics}, volume = {133}, number = {1}, year = {2011}, pages = {262{\textendash}271}, publisher = {Elsevier}, author = {Necati Aras and Refik G{\"u}ll{\"u} and Y{\"u}r{\"u}lmez, Sevil} } @article {aras2011selective, title = {Selective multi-depot vehicle routing problem with pricing}, journal = {Transportation Research Part C: Emerging Technologies}, volume = {19}, number = {5}, year = {2011}, pages = {866{\textendash}884}, publisher = {Elsevier}, author = {Necati Aras and Aksen, Deniz and Tu{\u g}rul Tekin, Mehmet} } @article {altinel2011variable, title = {Variable neighbourhood search heuristics for the probabilistic multi-source Weber problem}, journal = {Journal of the Operational Research Society}, volume = {62}, number = {10}, year = {2011}, pages = {1813{\textendash}1826}, publisher = {Nature Publishing Group}, author = {I. Kuban Altinel and Necati Aras and {\"O}zk{\i}sac{\i}k, KC} } @article {aksen2010budget, title = {The budget constrained r-interdiction median problem with capacity expansion}, journal = {Central European Journal of Operations Research}, volume = {18}, number = {3}, year = {2010}, pages = {269{\textendash}291}, publisher = {Springer-Verlag}, author = {Aksen, Deniz and Piyade, Nuray and Necati Aras} } @article {13998331, title = {{A column generation based heuristic for sensor placement, activity scheduling and data routing in wireless sensor networks}}, journal = {European Journal of Operational Research}, volume = {207}, year = {2010}, pages = {1014{\textendash}1026}, doi = {10.1016/j.ejor.2010.05.020}, author = {Yavuz Boga{\c c} T{\"u}rkogullari and Necati Aras and I. Kuban Altinel and Cem Ersoy} } @article {aras2010designing, title = {Designing the reverse logistics network}, journal = {Closed-loop supply chains: new developments to improve the sustainability of business practices. Auerbach Publications}, year = {2010}, pages = {67{\textendash}97}, author = {Necati Aras and Boyaci, Tamer and Verter, Vedat and Ferguson, M and Souza, GC} } @article {13288019, title = {{An efficient heuristic for placement, scheduling and routing in wireless sensor networks}}, journal = {Ad Hoc Networks}, volume = {8}, year = {2010}, pages = {654{\textendash}667}, doi = {10.1016/j.adhoc.2010.01.005}, author = {Yavuz Boga{\c c} T{\"u}rkogullari and Necati Aras and I. Kuban Altinel and Cem Ersoy} } @article {13988334, title = {{Efficient integer programming formulations for optimum sink location and routing in heterogeneous wireless sensor networks}}, journal = {Computer Networks}, volume = {54}, year = {2010}, pages = {1805{\textendash}1822}, doi = {10.1016/j.comnet.2010.02.009}, author = {Evren G{\"u}ney and Necati Aras and I. Kuban Altinel and Cem Ersoy} } @article {erol2010exploring, title = {Exploring reverse supply chain management practices in Turkey}, journal = {Supply Chain Management: An International Journal}, volume = {15}, number = {1}, year = {2010}, pages = {43{\textendash}54}, publisher = {Emerald Group Publishing Limited}, author = {Erol, Ismail and Velioglu, Meltem Nurtanis and Serifoglu, Funda Sivrikaya and B{\"u}y{\"u}k{\"o}zkan, G{\"u}l{\c c}in and Necati Aras and Cakar, Nigar Demircan and Aybek Korugan} } @book {13986675, title = {{A Hybrid Tabu Search Heuristic for a Bilevel Competitive Facility Location Model}}, series = {Hybrid Metaheuristics}, year = {2010}, pages = {31{\textendash}45}, doi = {10.1007/978-3-642-16054-7_3}, author = {Hande K{\"u}{\c c}{\"u}kaydin and Necati Aras and I. Kuban Altinel} } @conference {aras2010location, title = {Location and selective routing problem with pricing for the collection of used products}, booktitle = {Computers and Industrial Engineering (CIE), 2010 40th International Conference on}, year = {2010}, pages = {1{\textendash}6}, publisher = {IEEE}, organization = {IEEE}, author = {Necati Aras and Aksen, Deniz and Tekin, Tugrul} } @article {turkougullari2010optimal, title = {Optimal placement, scheduling, and routing to maximize lifetime in sensor networks}, journal = {Journal of the Operational Research Society}, volume = {61}, number = {6}, year = {2010}, pages = {1000{\textendash}1012}, publisher = {Nature Publishing Group}, author = {T{\"u}rko{\u g}ullar{\i}, YB and Necati Aras and I. Kuban Altinel and Ersoy, Cem} } @book {13282841, title = {{A Tabu Search Heuristic for Point Coverage, Sink Location, and Data Routing in Wireless Sensor Networks}}, series = {EvoWorkshops}, year = {2010}, pages = {83{\textendash}94}, doi = {10.1007/978-3-642-12139-5_8}, author = {Evren G{\"u}ney and I. Kuban Altinel and Necati Aras and Cem Ersoy} } @article {aksen2009design, title = {Design and analysis of government subsidized collection systems for incentive-dependent returns}, journal = {International Journal of Production Economics}, volume = {119}, number = {2}, year = {2009}, pages = {308{\textendash}327}, publisher = {Elsevier}, author = {Aksen, Deniz and Necati Aras and Karaarslan, Ay{\c s}e G{\"o}n{\"u}l} } @article {4756751, title = {{Discrete approximation heuristics for the capacitated continuous location-allocation problem with probabilistic customer locations}}, journal = {Computers \& Operations Research}, volume = {36}, year = {2009}, pages = {2139{\textendash}2148}, doi = {10.1016/j.cor.2008.08.003}, author = {Engin Durmaz and Necati Aras and I. Kuban Altinel} } @article {4778684, title = {{A location-allocation heuristic for the capacitated multi-facility Weber problem with probabilistic customer locations}}, journal = {European Journal of Operational Research}, volume = {198}, year = {2009}, pages = {790{\textendash}799}, doi = {10.1016/j.ejor.2008.10.014}, author = {I. Kuban Altinel and Engin Durmaz and Necati Aras and Kerem Can {\"O}zkisacik} } @article {ozkisacik2009solving, title = {Solving probabilistic multi-facility Weber problem by vector quantization}, journal = {OR spectrum}, volume = {31}, number = {3}, year = {2009}, pages = {533{\textendash}554}, publisher = {Springer-Verlag}, author = {{\"O}zk{\i}sac{\i}k, Kerem Can and I. Kuban Altinel and Necati Aras} } @conference {50780509, title = {{A Variable Neighborhood Search Heuristic for Point Coverage, Sink Location and Data Routing in Wireless Sensor Networks}}, booktitle = {International Conference on Communication Theory, Reliability, and Quality of Service}, year = {2009}, doi = {10.1109/CTRQ.2009.33}, author = {Evren G{\"u}ney and I. Kuban Altinel and Necati Aras and Cem Ersoy} } @article {4363814, title = {{Binary integer programming formulation and heuristics for differentiated coverage in heterogeneous sensor networks}}, journal = {Computer Networks}, volume = {52}, year = {2008}, pages = {2419{\textendash}2431}, doi = {10.1016/j.comnet.2008.05.002}, author = {I. Kuban Altinel and Necati Aras and Evren G{\"u}ney and Cem Ersoy} } @conference {50713928, title = {{An efficient heuristic for placement, scheduling and routing in wireless sensor networks}}, booktitle = {International Symposium on Computer and Information Sciences}, year = {2008}, doi = {10.1109/ISCIS.2008.4717856}, author = {Yavuz Boga{\c c} T{\"u}rkogullari and Necati Aras and I. Kuban Altinel and Cem Ersoy} } @article {aras2008efficient, title = {Efficient heuristics for the rectilinear distance capacitated multi-facility Weber problem}, journal = {Journal of the Operational Research Society}, volume = {59}, number = {1}, year = {2008}, pages = {64{\textendash}79}, publisher = {Nature Publishing Group}, author = {Necati Aras and Orbay, M and I. Kuban Altinel} } @conference {guney2008efficient, title = {Efficient integer programming formulations for optimum sink location and routing in wireless sensor networks}, booktitle = {Computer and Information Sciences, 2008. ISCIS{\textquoteright}08. 23rd International Symposium on}, year = {2008}, pages = {1{\textendash}6}, publisher = {IEEE}, organization = {IEEE}, author = {Guney, E and I. Kuban Altinel and Necati Aras and Ersoy, Cem} } @article {Aras2008a, title = {Locating collection centers for distance-and incentive-dependent returns}, journal = {International Journal of Production Economics}, volume = {111}, number = {2}, year = {2008}, pages = {316{\textendash}333}, publisher = {Elsevier}, author = {Necati Aras and Aksen, Deniz} } @article {Aras2008, title = {Locating collection centers for incentive-dependent returns under a pick-up policy with capacitated vehicles}, journal = {European Journal of Operational Research}, volume = {191}, number = {3}, year = {2008}, pages = {1223{\textendash}1240}, publisher = {Elsevier}, author = {Necati Aras and Aksen, Deniz and G{\"o}n{\"u}l Tanu{\u g}ur, Ay{\c s}e} } @article {aras2007new, title = {New heuristic methods for the capacitated multi-facility Weber problem}, journal = {Naval Research Logistics (NRL)}, volume = {54}, number = {1}, year = {2007}, pages = {21{\textendash}32}, publisher = {Wiley Online Library}, author = {Necati Aras and I. Kuban Altinel and Orbay, Metin} } @article {aksen2007open, title = {Open vehicle routing problem with driver nodes and time deadlines}, journal = {Journal of the Operational Research Society}, volume = {58}, number = {9}, year = {2007}, pages = {1223{\textendash}1234}, publisher = {Nature Publishing Group}, author = {Aksen, D and {\"O}zyurt, Z and Necati Aras} } @conference {50632893, title = {{Optimal placement and activity scheduling to maximize coverage lifetime in wireless sensor networks}}, booktitle = {International Symposium on Computer and Information Sciences}, year = {2007}, doi = {10.1109/ISCIS.2007.4456874}, author = {Yavuz Boga{\c c} T{\"u}rkogullari and Necati Aras and I. Kuban Altinel and Cem Ersoy} } @inbook {aras2007solving, title = {Solving the capacitated multi-facility Weber problem by simulated annealing, threshold accepting and genetic algorithms}, booktitle = {Metaheuristics}, year = {2007}, pages = {91{\textendash}112}, publisher = {Springer US}, organization = {Springer US}, author = {Necati Aras and Yumusak, Sadettin and I. Kuban Altinel} } @article {aras2006coordination, title = {Coordination and priority decisions in hybrid manufacturing/remanufacturing systems}, journal = {Production and Operations Management}, volume = {15}, number = {4}, year = {2006}, pages = {528{\textendash}543}, publisher = {Wiley Online Library}, author = {Necati Aras and Verter, Vedat and Boyaci, Tamer} } @inbook {aksen2006customer, title = {Customer selection and profit maximization in vehicle routing problems}, booktitle = {Operations Research Proceedings 2005}, year = {2006}, pages = {37{\textendash}42}, publisher = {Springer Berlin Heidelberg}, organization = {Springer Berlin Heidelberg}, author = {Aksen, Deniz and Necati Aras} } @article {50507263, title = {{Effective coverage in sensor networks: Binary integer programming formulations and heuristics}}, volume = {9}, year = {2006}, pages = {4014{\textendash}4019}, doi = {10.1109/ICC.2006.255709}, author = {I. Kuban Altinel and Necati Aras and Evren G{\"u}ney and Cem Ersoy} } @inbook {ozyurt2006open, title = {Open vehicle routing problem with time deadlines: Solution methods and an application}, booktitle = {Operations Research Proceedings 2005}, year = {2006}, pages = {73{\textendash}78}, publisher = {Springer Berlin Heidelberg}, organization = {Springer Berlin Heidelberg}, author = {{\"O}zyurt, Zeynep and Aksen, Deniz and Necati Aras} } @article {aras2006solving, title = {Solving the uncapacitated multi-facility Weber problem by vector quantization and self-organizing maps}, journal = {Journal of the Operational Research Society}, volume = {57}, number = {1}, year = {2006}, pages = {82{\textendash}93}, publisher = {Nature Publishing Group}, author = {Necati Aras and {\"O}zk{\i}sac{\i}k, KC and I. Kuban Altinel} } @article {ray2005optimal, title = {Optimal prices and trade-in rebates for durable, remanufacturable products}, journal = {Manufacturing \& Service Operations Management}, volume = {7}, number = {3}, year = {2005}, pages = {208{\textendash}228}, publisher = {INFORMS}, author = {Ray, Saibal and Boyaci, Tamer and Necati Aras} } @article {aras2004effect, title = {The effect of categorizing returned products in remanufacturing}, journal = {IIE Transactions}, volume = {36}, number = {4}, year = {2004}, pages = {319{\textendash}331}, publisher = {Taylor \& Francis}, author = {Necati Aras and Boyaci, Tamer and Verter, Vedat} } @article {56229753, title = {{Product-line selection and pricing with remanufacturing under availability constraints}}, volume = {5583}, year = {2004}, pages = {244{\textendash}255}, doi = {10.1117/12.572218}, author = {Necati Aras and G{\"o}k{\c c}e Esenduran and I. Kuban Altinel} } @article {1217349, title = {{A Kohonen-like decomposition method for the Euclidean traveling salesman problem-KNIES_DECOMPOSE}}, journal = {IEEE Transactions on Neural Networks}, volume = {14}, year = {2003}, pages = {869{\textendash}890}, doi = {10.1109/TNN.2003.811562}, author = {Necati Aras and I. Kuban Altinel and John Oommen} } @conference {altmel2003self, title = {A self-organizing method for map reconstruction}, booktitle = {Neural Networks for Signal Processing, 2003. NNSP{\textquoteright}03. 2003 IEEE 13th Workshop on}, year = {2003}, pages = {677{\textendash}687}, publisher = {IEEE}, organization = {IEEE}, author = {I. Kuban Altinel and Necati Aras and Oommen, BJ} } @article {14462270, title = {{Fast, efficient and accurate solutions to the Hamiltonian path problem using neural approaches}}, journal = {Computers \& Operations Research}, volume = {27}, year = {2000}, pages = {461{\textendash}494}, doi = {10.1016/S0305-0548(99)00065-9}, author = {I. Kuban Altinel and Necati Aras and John Oommen} } @conference {507696, title = {{A Kohonen-like Decomposition Method for the Traveling Salesman Problem: KNIESDECOMPOSE}}, booktitle = {European Conference on Artificial Intelligence}, year = {2000}, pages = {261{\textendash}265}, author = {Necati Aras and I. Kuban Altinel and John Oommen} } @conference {aras2000kohonen, title = {A Kohonen-like Decomposition Method for the Traveling Salesman Problem: KNIESDECOMPOSE.}, booktitle = {ECAI}, year = {2000}, pages = {261{\textendash}265}, author = {Necati Aras and I. Kuban Altinel and Oommen, B John} } @article {1740244, title = {{The Kohonen network incorporating explicit statistics and its application to the travelling salesman problem}}, journal = {Neural Networks}, volume = {12}, year = {1999}, pages = {1273{\textendash}1284}, doi = {10.1016/S0893-6080(99)00063-5}, author = {Necati Aras and John Oommen and I. Kuban Altinel} } @inbook {oommen1999solving, title = {Solving the Travelling Salesman Problem using the Kohonen Network Incorporating Explicit Statistics}, booktitle = {Neural Nets WIRN VIETRI-98}, year = {1999}, pages = {273{\textendash}282}, publisher = {Springer London}, organization = {Springer London}, author = {Oommen, B John and Necati Aras and I. Kuban Altinel} } @article {1654599, title = {{Discrete vector quantization for arbitrary distance function estimation}}, journal = {IEEE Transactions on Systems, Man, and Cybernetics}, volume = {28}, year = {1998}, pages = {496{\textendash}510}, doi = {10.1109/3477.704289}, author = {John Oommen and I. Kuban Altinel and Necati Aras} } @conference {oommen1997arbitrary, title = {Arbitrary distance function estimation using discrete vector quantization}, booktitle = {Neural Networks, 1997., International Conference on}, volume = {2}, year = {1997}, pages = {1272{\textendash}1277}, publisher = {IEEE}, organization = {IEEE}, author = {Oommen, John and I. Kuban Altinel and Necati Aras} } @article {859143, title = {{Vector Quantization for Arbitrary Distance Function Estimation}}, journal = {Informs Journal on Computing}, volume = {9}, year = {1997}, pages = {439{\textendash}451}, doi = {10.1287/ijoc.9.4.439}, author = {I. Kuban Altinel and John Oommen and Necati Aras} } @article {14443126, title = {{Parametric distance functions vs. nonparametric neural networks for estimating road travel distances}}, journal = {European Journal of Operational Research}, volume = {93}, year = {1996}, pages = {230{\textendash}243}, doi = {10.1016/0377-2217(96)00045-8}, author = {Ethem Alpaydin and I. Kuban Altinel and Necati Aras} } @conference {50018430, title = {{Arbitrary distance function estimation using vector quantization}}, booktitle = {International Symposium on Neural Networks}, year = {1995}, doi = {10.1109/ICNN.1995.487272}, author = {John Oommen and I. Kuban Altinel and Necati Aras} }