In this paper a wide class of discrete optimization problems, which can be formulated as a 0-1 linear programming problem is discussed. It is assumed that the objective function costs are not precisely known. This uncertainty is modeled by specifying a finite set of fuzzy scenarios. Under every fuzzy scenario the costs are given as fuzzy intervals.… (More)
The NP-hard problem of vehicle routing and scheduling problem with fuzzy time windows and fuzzy goal is formulated and two heuristic algorithms for solving this problem are presented.