The Capacitated Vehicle Routing Problem (CVRP) is one of the most popular routing problems. In the CVRP, a fleet of capacitated vehicles located at a central depot are used to deliver products to a set of geographically dispersed customers with known demand. In this work, a new two-step approach to solve the CVRP with a heterogeneous fleet is proposed. In the first step; a balanced K-means clus...

Capacitated network design is a crucial problem to telecommunications network planners. In this paper we consider the Multi-Level Capacitated Minimum Spanning Tree Problem (MLCMST), a generalization of the well-known Capacitated Minimum Spanning Tree Problem. We present a genetic algorithm, based on the notion of grouping, that is quite effective in solving large-scale problems to within 10% of...

Problem statement: Lot-size is the clustering of items for transportation or manufacturing processes occurring at the same time. The issue in lot-size problem is to design production processes so that the feasible production quantities are equal to customer demand quantities and the timing of production is such that inventory positions are almost zero. Approach: In this study, we explore the mu...

In this article a capacitated transportation problem is considered which is formulated as a multi objective capacitated transportation problem with mixed constraints. To determine the optimum compromise solution of multi objective capacitated transportation problem (MOCTP) with mixed constraints a Fuzzy multi objective programming approach has been applied in which we use three different forms ...

the network design problem (ndp) is one of the important problems in combinatorial optimization. among the network design problems, the multicommodity capacitated network design (mcnd) problem has numerous applications in transportation, logistics, telecommunication, and production systems. the mcnd problems with splittable flow variables are np-hard, which means they require exponential time t...

In this paper we discuss the solution of the clustering problem usually solved by the K-means algorithm. The problem is known to have local minimum solutions.A simulated annealing algorithm for the clustering problem. The solution of the clustering problem usually solved by the K-means algorithm.In this paper, we explore the applicability of simulated annealing. Clustering problem is investigat...

In this paper we consider the CAPACITATED DOMINATING SET problem — a generalisation of the DOMINATING SET problem where each vertex v is additionally equipped with a number c(v), which is the number of other vertices this vertex can dominate. We provide an algorithm that solves CAPACITATED DOMINATING SET exactly in O(1.89) time and polynomial space. Despite the fact that the CAPACITATED DOMINAT...

In this article we present benchmark datasets for the Mixed Capacitated Arc Routing Problem under Time restrictions with Intermediate Facilities (MCARPTIF). The problem is a generalisation of the Capacitated Arc Routing Problem (CARP), and closely represents waste collection routing. Four different test sets are presented, each consisting of multiple instance files, and which can be used to ben...

This work focuses on the capacitated vehicle routing problem. In this work, a real-time application is developed using online real-world data for mobile devices have IOS and Android operating systems. The fuzzy c-means clustering algorithm used to group demand points ant colony optimization employed determine best route within each group. customer distances between these are obtained via Google...