İbrahim Muter

ORCID: 0000-0003-2202-4751
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Vehicle Routing Optimization Methods
  • Optimization and Packing Problems
  • Advanced Manufacturing and Logistics Optimization
  • Scheduling and Optimization Algorithms
  • Scheduling and Timetabling Solutions
  • Optimization and Search Problems
  • Advanced Bandit Algorithms Research
  • Recommender Systems and Techniques
  • Maritime Ports and Logistics
  • Transportation Planning and Optimization
  • Assembly Line Balancing Optimization
  • Computational Geometry and Mesh Generation
  • Facility Location and Emergency Management
  • Transportation and Mobility Innovations
  • Urban and Freight Transport Logistics
  • Advanced Wireless Network Optimization

Amazon (United States)
2021

University of Bath
2017-2020

Bahçeşehir University
2014-2017

Sabancı Üniversitesi
2009-2012

10.1016/j.ejor.2020.01.065 article EN European Journal of Operational Research 2020-02-11

This paper proposes a column generation algorithm for the multidepot vehicle routing problem with interdepot routes. is an extension of in which vehicles are allowed to stop at intermediate depots along their routes replenish. The can be modeled as set covering variables rotations corresponding feasible combinations We consider two pricing subproblems generate rotations. first one generates directly by solving elementary shortest path resource constraints on modified version original...

10.1287/trsc.2013.0489 article EN Transportation Science 2014-02-25

In this article, we deal with the Order Batching Problem (OBP) considering traversal, return, and midpoint routing policies. We consider Set Partitioning formulation of OBP develop a specially tailored column generation–based algorithm for problem. suggest acceleration techniques such as pool strategy relaxation generation subproblem. Also, devised upper-bounding procedure lower-bounding method based on that is strengthened by adding subset-row inequalities are employed. According to...

10.1080/0740817x.2014.991478 article EN IIE Transactions 2015-01-13

10.1016/j.ejor.2018.04.042 article EN European Journal of Operational Research 2018-04-27

We propose a new generic framework for solving combinatorial optimization problems that can be modeled as set covering problem. The proposed algorithmic combines metaheuristics with exact algorithms through guiding mechanism based on diversification and intensification decisions. After presenting this framework, we extensively demonstrate its application to the vehicle routing problem time windows. then conduct thorough computational study of well-known test problems, where show approach not...

10.1287/ijoc.1090.0376 article EN INFORMS journal on computing 2010-03-24

The success of a recommender system is generally evaluated with respect to the accuracy recommendations. However, recently diversity recommendations has also become an important aspect in evaluating systems. One dimension called aggregate diversity, which refers items recommendation lists all users and can be defined different metrics. maximization both simultaneously renders multiobjective optimization problem that handled by approaches. In this paper, after providing thorough analysis...

10.1287/ijoc.2016.0741 article EN INFORMS journal on computing 2017-05-22

This article focuses on the integration of order batching and picker scheduling decisions while taking into account two objectives that have been considered in literature, namely minimization both total travel time to collect all items makespan pickers. integrated problem not only occurs naturally wave picking systems which latest orders becomes key performance metric, but also arises when there is a limit operating time. We present models result from combining these analyze their...

10.1080/24725854.2021.1925178 article EN IISE Transactions 2021-05-06

10.1016/j.trb.2017.09.002 article EN Transportation Research Part B Methodological 2017-09-21

Resource scheduling has been one of the most prominent problems due to its technical challenges and prevalence in real-life. In this paper, we focus on an extension parallel machine problem with additional resources, which can be classified as a static resource-constrained unspecified job-machine assignment. The novelty tackle stems from resource that consists components discrete levels. allocation machines induces general covering constraints. This distinct characteristic also arises...

10.1080/00207543.2020.1777481 article EN International Journal of Production Research 2020-06-17

Recommender systems have become one of the main components web technologies that help people to cope with information overload. Based on analysis past user behavior, these filter items according users’ likes and interests. Two most important metrics used analyze performance are accuracy diversity recommendation lists. Whereas all efforts exerted in prediction interests aim at maximizing former, latter emerges various forms, such as lists across lists, referred aggregate diversity,...

10.1287/ijoc.2019.0952 article EN INFORMS journal on computing 2020-07-07
Coming Soon ...