In today’s world, logistics problems are crucial for the supply chain management. The vehicle routing one of most studied combinatorial optimization in literature. real life applications, all parameters problem may not be known. this paper, we considered capacitated with stochastic demands. Uniform and normal distributions were analyzed on customer demands to observe nature problem. These metho...

We consider a network design problem that arises in the costoptimal design of last mile telecommunication networks. It extends the Connected Facility Location problem by introducing capacities on the facilities and links of the networks. It combines aspects of the capacitated network design problem and the single-source capacitated facility location problem We refer to it as the Capacitated Con...

Capacitated P-median problem (CPMP) is one of the popular discrete location problems. CPMP locates P facilities between the candidate points, in order to satisfy the customer demand. This problem is a NP-hard problem. In this paper, a new hybrid algorithm is proposed to solve CPMP. In proposed method, K-means clustering algorithm will find a proper solution for Fixed Neighborhood Search algorit...

ABSTRACT. POPMUSIC — Partial optimization metaheuristic under special intensification conditions — is a template for tackling large problem instances. This template has been shown to be very efficient for various combinatorial problems like p-median, sum of squares clustering, vehicle routing and map labeling. In terms of algorithmic complexity, one of the most complex part of POPMUSIC template...

This paper presents an artificial bee colony (ABC) algorithm adjusted for the capacitated vehicle routing problem. The vehicle routing problem is an NP-hard problem and capacitated vehicle routing problem variant (CVRP) is considered here. The artificial bee metaheuristic was successfully used mostly on continuous unconstrained and constrained problems. Here this algorithm has been implemented ...

In a distribution problem, designing the right route can minimize total transportation costs. Therefore, this research aims to design that produces minimal distance by clustering demand points first. We generated method cluster considering proximity among and vehicle capacity. solving we are using p-median determine genetic algorithm with characteristics of CVRPTW problem. or capacitated routin...

This paper studies an industrial lot-sizing and scheduling problem coming from the food-industry that extends multi-item capacitated includes lost sales, overtimes, safety stock non-uniform sequence-dependent setups on parallel machines. We introduce two different formulations adapt well-known Relax-and-Fix Fix-and-Optimise heuristics in order to quickly obtain feasible solutions large instance...

this paper presents a fuzzy decision-making approach to deal with a clustering supplier problem in a supply chain system. during recent years, determining suitable suppliers in the supply chain has become a key strategic consideration. however, the nature of these decisions is usually complex and unstructured. in general, many quantitative and qualitative factors, such as quality, price, and fl...