the vehicle routing problem with simultaneous pickup and delivery (vrpspd) is a well-known combinatorial optimization problem which addresses provided service to a set of customers using a homogeneous fleet of capacitated vehicles. the objective is to minimize the distance traveled. the vrpspd is an np-hard combinatorial optimization problem. therefore, practical large-scale instances of vrpspd...

the traveling salesman problem (tsp) is the problem of finding the shortest tour through all the nodes that a salesman has to visit. the tsp is probably the most famous and extensively studied problem in the field of combinatorial optimization. because this problem is an np-hard problem, practical large-scale instances cannot be solved by exact algorithms within acceptable computational times. ...

the bi-objective warehouse problem in a crisp environment is often not eective in dealing with the imprecision or vagueness in the values of the problem parameters. to deal with such situations, several researchers have proposed that the parameters be represented as fuzzy numbers. we describe a new algorithm for fuzzy bi-objective warehouse problem using a ranking function followed by an applic...

task assignment problem (tap) involves assigning a number of tasks to a number of processors in distributed computing systems and its objective is to minimize the sum of the total execution and communication costs, subject to all of the resource constraints. tap is a combinatorial optimization problem and np-complete. this paper proposes a hybrid meta-heuristic algorithm for solving tap in a h...

in this paper the real-world occurrence of the multiple-product multiple-constraint single period newsboy problem with two objectives, in which there is incremental discounts on the purchasing prices, is investigated. the constraints are the warehouse capacity and the batch forms of the order placements. the first objective of this problem is to find the order quantities such that the expected ...

This paper considers the search problem, introduced by Srivastava cite{Sr}. This is a model discrimination problem. In the context of search linear models, discrimination ability of search designs has been studied by several researchers. Some criteria have been developed to measure this capability, however, they are restricted in a sense of being able to work for searching only one possibl...