The linear multiobjective transportation problem is a special type of vector minimum problem in which constraints are all equality type and the objectives are conflicting in nature. This paper presents an application of fuzzy goal programming to the linear multiobjective transportation problem. In this paper, we use a special type of nonlinear (hyperbolic and exponential) membership functions t...

The fixed-charge Capacitated Multi-commodity Network Design (CMND) is a well-known problem of both practical and theoretical significance. Network design models represent a wide variety of planning and operation management issues in transportation telecommunication, logistics, production and distribution. In this paper, Ant Colony Optimization (ACO) based neighborhoods are proposed for CMND pro...

In this paper, we investigate a Transportation problem which is a special kind of linear programming in which profits; supply and demands are considered as Intuitionistic triangular fuzzy numbers. The crisp values of these Intuitionistic triangular fuzzy numbers are obtained by defuzzifying them and the problem is formulated into linear programming problem. The solution of the formulated proble...

numerous algorithms have been proposed to solve the shortest-pathproblem; many of them consider a single-mode network and crispcosts. other attempts have addressed the problem of fuzzy costs ina single-mode network, the so-called fuzzy shortest-path problem(fspp). the main contribution of the present work is to solve theoptimum path problem in a multimodal transportation network, inwhich the co...

In this paper, a solution procedure has been given for the Multi-Objective Interval Solid Transportation Problem under stochastic environment where the cost coefficients of the objective functions, source availability, destination demand and conveyance capacities have been taken as stochastic intervals. The problem has been transformed into a classical multi-objective transportation problem whe...

Numerous algorithms have been proposed to solve the shortest-pathproblem; many of them consider a single-mode network and crispcosts. Other attempts have addressed the problem of fuzzy costs ina single-mode network, the so-called fuzzy shortest-path problem(FSPP). The main contribution of the present work is to solve theoptimum path problem in a multimodal transportation network, inwhich the co...

In this study, a genetic algorithm is applied to obtain the best combination of transportation parameters for vehicle dispatching. The searching mechanism based on genetic algorithm can find several feasible solutions of dispatching parameters to proceed with transportation plan within constrained conditions. Besides, the concept of fuzzy due time is applied to replace that of time window so as...