A New Mixed-Integer Programming Modeling for the Steiner Ring Star Problem
نویسندگان
چکیده
منابع مشابه
A Mixed Integer Programming Formulation for the Heterogeneous Fixed Fleet Open Vehicle Routing Problem
The heterogeneous fixed fleet open vehicle routing problem (HFFOVRP) is one of the most significant extension problems of the open vehicle routing problem (OVRP). The HFFOVRP is the problem of designing collection routes to a number of predefined nodes by a fixed fleet number of vehicles with various capacities and related costs. In this problem, the vehicle doesn’t return to the depot after se...
متن کاملAn Imperialist Competitive Algorithm and a Mixed Integer Programming Formulation for the Capacitated Vehicle Routing Problem
The Vehicle Routing Problem (VRP), a famous problem of operation research, holds a central place in combinatorial optimization problems. In this problem, a fleet vehicles with Q capacity start to move from depot and return after servicing to customers in which visit only ones each customer and load more than its capacity not at all. The objective is to minimize the number of used vehicles and t...
متن کاملa mixed integer programming formulation for the heterogeneous fixed fleet open vehicle routing problem
the heterogeneous fixed fleet open vehicle routing problem (hffovrp) is one of the most significant extension problems of the open vehicle routing problem (ovrp). the hffovrp is the problem of designing collection routes to a number of predefined nodes by a fixed fleet number of vehicles with various capacities and related costs. in this problem, the vehicle doesn’t return to the depot after se...
متن کاملAn Integer Linear Programming based Heuristic Approach for the Capacitated m-Ring-Star Problem
We address the Capacitated m-Ring-Star Problem in which the aim is to find m rings (simple cycles) visiting a central depot, a subset of customers and a subset of potential Steiner nodes, while customers not belonging to any ring must be "allocated" to a visited (customer or Steiner) node. Moreover, the rings must be node-disjoint and the number of customers allocated or visited in a ring canno...
متن کاملA new approach for solving neutrosophic integer programming problems
Linear programming is one of the most important usages of operation research methods in real life, that includes of one objective function and one or several constraints which can be in the form of equality and inequality. Most of the problems in the real world are include of inconsistent and astute uncertainty, because of this reason we can’t obtain the optimal solution easily. In this paper, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Korean Operations Research and Management Science Society
سال: 2014
ISSN: 1225-1119
DOI: 10.7737/jkorms.2014.39.1.013