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...

We propose mathematical programming models for solving problems arising from planning and running an energy production process based on burning biomasses. The models take into account different aspects of the problem: determination of the biomasses to produce and/or buy, transportation decisions to convey the materials to the respective plants, and plant design. Whereas the “running model” is l...

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...

This paper presents the review of past studies concerning mathematical models for rescheduling passenger railway services, as part of delay management in the occurrence of railway disruption. Many past mathematical models highlighted were aimed at minimizing the service delays experienced by passengers during service disruptions. Integer programming (IP) and mixed-integer programming (MIP) mode...

Multicommodity distribution problem is one of the most interesting and useful models in mathematical programming due to its major role in distribution networks. The purpose of this paper is to describe and solve a special class of multicommodity distribution problems in which shipment of a commodity from a plant to a customer would go through different distribution centers. The problem is t...

Dynamic lot sizing problem is one of the significant problem in industrial units and it has been considered by  many researchers. Considering the quantity discount in  purchasing cost is one of the important and practical assumptions in the field of inventory control models and it has been less focused in terms of stochastic version of dynamic lot sizing problem. In  this paper, stochastic dyn...

We present a generalization of the average shadow price in 0-1-Mixed Integer Linear Programming problems and its relation with bottlenecks including the analysis relative to the coefficients matrix of resource constraints. A mathematical programming approach to find the strategy for investment in resources is presented. KeywordsMixed Integer programming, Average shadow price, Bottlenecks, Resou...

the aim of this study is to propose a new mixed integer linear programming (milp) model to find the minimum required number of yard cranes, rubber tyred gantry cranes (rtgcs), for completion the total amount of works at the end of planning horizon. in other word, we find the optimal number of yard cranes in a container terminal which completes the total amount of works. the paper supports the p...

research interests have been focused on the concept of penalizing jobs both for being early and for being tardy because not only of modern competitive industrial challenges of providing a variety of products at a very low cost by smoothing productions but also of its increasing and exciting computer applications. here, sequencing approaches of the mixed- model just-in-time production systems is...

despite existing various integer programming for sequencing problems, there is not enoughinformation about practical values of the models. this paper considers the problem of minimizing maximumlateness with release dates and presents four different mixed integer programming (mip) models to solve thisproblem. these models have been formulated for the classical single machine problem, namely sequ...