in this research, performance of pattern search algorithm (ps) was investigated in order to optimize the nonlinear muskingum model parameters in contrast with the general algorithms, for wilson and karoun floods routing. wilson flood routing has been chosen to compare the ability of ps algorithm with other algorithms and, karoun flood routing has been chosen for a better evaluation of ps. the r...

Due to many damages that human activities have imposed on the environment, authorities, manufacturers, and industry owners have taken into account the development of supply chain more than ever. One of the most influential and essential human activities in the supply chain are transportation which green vehicles such as electric vehicles (EVs) are expected to generate higher economic and enviro...

the inventory routing problem (irp) arises in the context of vendor-managed systems. this problem addresses jointly solving an inventory management problem and a vehicle routing problem. in this paper, we consider a multi-depot multi-vehicle inventory routing problem in which suppliers produce one type of product to be delivered to customers during a finite time horizon. we propose a two-phase ...

This paper re-examines the classical problem of minimizing maximum lateness which is defined as follows: given a collection of n jobs with processing times and due dates, in what order should they be processed on a single machine to minimize maximum lateness? The lateness of a job is defined as its completion time minus its due date. This problem can be solved easily by ordering the jobs in non...

although our religious doctrines have given special importance to the execution of legal punishments and penalties for their conventional outcomes, the execution of legal punishments or their suspension in the age of occultation of the infallible imam (a.s.) has been one of the controversial issues in jurisprudence, to the extent that it has created two conflicting fronts; one, a group of disti...

stochastic approach to vehicle routing problem: development and theories abstract in this article, a chance constrained (ccp) formulation of the vehicle routing problem (vrp) is proposed. the reality is that once we convert some special form of probabilistic constraint into their equivalent deterministic form then a nonlinear constraint generates. knowing that reliable computer software for lar...

Purpose: In this study, a mixed-integer programming model is developed to minimize the total lateness and completion time of jobs in an automotive company. order respond rapidly continuous customer demand through production, work schedule engineers research development department considered flexibly. Methodology: supported by analytical hierarchy process determine weighted values tardiness time...