We introduce the multi-agent transportation (MAT) problem, where agents have to transport containers from their starting positions designated goal positions. Movement takes place in a common environment collisions between and must be avoided. In contrast other frameworks such as pathfinding (MAPF) or pickup delivery (MAPD), are allowed separate at any time, which can reduce makespan also allows...

in this paper, we consider the fuzzy fixed-charge transportation problem (ffctp). both of fixed and transportation cost are fuzzy numbers. contrary to previous works, electromagnetism-like algorithms (em) is firstly proposed in this research area to solve the problem. three types of em; original em, revised em, and hybrid em are firstly employed for the given problem. the latter is being firstl...

Sta selection for the varying activities performed by enterprises requires a coherent approach, which cannot be simplistic, to the information held. The use of exible computation and the vague representation of knowledge available by means of linguistic labels allow the problem to be recognised as it is in real life. This paper is an attempt to supply a satisfactory solution to a real sta manag...

In this study criterion of maximum profit intensity for transportation problems, in contrast to the known criteria of minimum expenses or minimum time for transportation, is considered. This criterion synthesizes financial and time factors and has real economic sense. According to the purpose of this paper, the algorithm of the solution of such a transportation problem is constructed. It is sho...

The linear multiobjective transportation problem is a special type of vector minimum problem in which constraints are all equality type and the objectives are conicting 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 to ...