We present a bi-objective model for a green truck scheduling and routing problem at a cross-docking system. This model determines three key decisions at the cross dock: (1) defining a sequence and schedule of inbound trucks at the receiving door, (2) specifying a sequence and a schedule of outbound trucks at the shipping door, and (3) determining the routes of the outbound truck while serving c...

The problem of maximal hub covering as a challenging problem in operation research. Transportation programming seeks to find an optimal location of a set of hubs to reach maximum flow in a network. Since the main structure's parameters of the problem such as origin-destination flows, costs and travel time, change periodically in the real world applications, new issues arise in handling it. In t...

ABSTRACT: The problem of robust design is treated as a bi-objective optimization problem in which the performance mean and variation are optimized and minimized, respectively. A method for deriving a utility function as a local approximation of the efficient frontier is presented and investigated at different locations of candidate solutions, with different ranges of interest, and for efficient...

This paper presents a novel bi-objective manpower scheduling problem that minimizes the penalty resulted from employees’ assignment at lower skill levels than their real skill and maximizes employees’ utility for working at a special skill level in some shifts or on some days. Employees are classified in two specialist groups and three skill levels in each specialization. In addition, the prese...

In this paper, a Multi-Choice Stochastic Bi-Level Programming Problem (MCSBLPP) is considered where all the parameters of constraints are followed by normal distribution. The cost coefficients of the objective functions are multi-choice types. At first, all the probabilistic constraints are transformed into deterministic constraints using stochastic programming approach. Further, a general tran...

In this work, a version of the technique for order preference by similarity ideal solution (TOPSIS) with entropic regularization approach is developed for solving the fuzzy multi-objective nonlinear programming (MONLP) problems. Applying the basic principle of compromise of TOPSIS, the fuzzy MONLP problem can be reduced into a fuzzy bi-objective nonlinear programming problem. Moreover, followin...