A5054242291- Vehicle Routing Optimization Methods
- Advanced Manufacturing and Logistics Optimization
- Optimization and Packing Problems
- Facility Location and Emergency Management
- Smart Parking Systems Research
- Complexity and Algorithms in Graphs
- Transportation and Mobility Innovations
- Urban and Freight Transport Logistics
- Optimization and Search Problems
- Metaheuristic Optimization Algorithms Research
- Scheduling and Optimization Algorithms
- Advanced Graph Theory Research
- Optimization and Mathematical Programming
- Maritime Ports and Logistics
- Scheduling and Timetabling Solutions
- Maritime Transport Emissions and Efficiency
- Transportation Planning and Optimization
- Assembly Line Balancing Optimization
- Resource-Constrained Project Scheduling
- Cultural and Sociopolitical Studies
- Advanced Optical Network Technologies
- Network Packet Processing and Optimization
- Law, logistics, and international trade
- Global Trade and Competitiveness
- Operations Management Techniques
Galatasaray University
2012-2023
AbstractGiven n items and m knapsacks, the Generalized Assignment Problem (GAP) is to find optimum assignment of each item exactly one knapsack, without exceeding capacity any knapsack. This problem can also be described as optimal jobs capacitated agents. During last three decades, many papers have been published on GAP. In this survey we mainly concentrate its real-life applications in scheduling, timetabling, telecommunication, facility location, transportation, production planning, etc....
Given n items and m knapsacks, the Generalized Assignment Problem (GAP) is to find optimum assignment of each item exactly one knapsack, without exceeding capacity any knapsack. This problem can also be described as optimal jobs capacitated agents. During last three decades, many papers have been published on GAP. In this survey we mainly concentrate its real-life applications in scheduling, timetabling, telecommunication, facility location, transportation, production planning, etc. We...
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...
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...
The Capacitated Multi-facility Weber Problem (CMWP) is concerned with locating I capacitated facilities so as to satisfy the demand of J customers minimum total transportation cost a single commodity. This non-convex optimization problem and difficult solve. work focuses on multi-commodity extension considers situation where K distinct commodities are shipped subject capacity constraints. Customer locations, demands, capacities for each commodity known priori. costs, which proportional...
This work is concerned with the unidirectional cyclic layout problem, which known to be NP-complete. type of problem arises, for example, in determination workstation locations around a closed loop conveyor system, allocation cutting tools on sites turret, positioning stations single AGV path. Although it can formulated as Quadratic Assignment Problem, general there are two special cases satisfying additional assumptions. In Balanced Unidirectional Cyclic Layout material flow conserved at...