This paper aims to compare a two-echelon and a single-echelon distribution system. A mathematical model for the Single-Echelon Capacitated Vehicle Routing Problem (SE-CVRP) is proposed. This SE-CVRP is the counterpart of Two-Echelon Capacitated Vehicle Routing Problem (2E-CVRP) introduced in the authors’ previous work. The proposed mathematical model is Mixed-Integer Non-Linear Programming (MIN...

abstract: in most industries the cost of raw materials and component parts constitutes almost 60% percent of cost of a product (in some industries up to 80%). in this situation, proper sourcing can play a key role in an organization's efficiency and effectiveness, because it has a direct effect on cost reduction, profitability and flexibility of a company. in this paper, determining the op...

This paper investigates the problem of selecting and scheduling a set of projects among available projects. Each project consists of several tasks and to perform each one some resource is required. The objective is to maximize total benefit. The paper constructs a mathematical formulation in form of mixed integer linear programming model. Three effective metaheuristics in form of the imperialis...

Along with the increased competition in production and service areas, many organizations attempt to provide their products at a lower price higher quality. On other hand, consideration of environmental criteria conventional supplier selection methodologies is required for companies trying promote green supply chain management (GSCM). In this regard, multi-criteria decision-making (MCDM) techniq...

We present a Mixed Integer Linear Programming (MILP) approach in order to model the non-linear problem of minimizing tire noise function. In recent work, we proposed an exact solution for Tire Noise Optimization Problem, dealing with APproximation (TNOP-AP). Here study original modeling EXact- or real-noise (TNOP-EX) and propose new scheme obtain TNOP-EX. Relying on TNOP-AP, use Branch&Cut ...

although several papers have studied no-idle scheduling problems, they all focus on flow shops, assuming one processor at each working stage. but, companies commonly extend to hybrid flow shops by duplicating machines in parallel in stages. this paper considers the problem of scheduling no-idle hybrid flow shops. a mixed integer linear programming model is first developed to mathematically form...

In this research, a single batch processing machine scheduling problem with minimization of total earliness and tardiness as the objective function is investigated.We first formulate the problem as a mixed integer linear programming model. Since the research problem is shown to be NP-hard, an improved memetic algorithmis proposed to efficiently solve the problem. To further enhance the memetic ...