E.E.M. Ellaimony’s research while affiliated with Public Authority for Applied Education and Training and other places

What is this page?


This page lists works of an author who doesn't have a ResearchGate profile or hasn't added the works to their profile yet. It is automatically generated from public (personal) data to further our legitimate goal of comprehensive and accurate scientific recordkeeping. If you are this author and want this page removed, please let us know.

Publications (2)


Table 1 . 
Table 5 . Non dominated solutions and the related efficient points. 
Cost and deterioration of transportation & availabilities and requirements for stages (1, 2 and 3) resp.
Using Dynamic Programming Technique for Solving a Class of Bi-Criteria Multistage Transportation Problem
  • Article
  • Full-text available

May 2015

·

628 Reads

·

7 Citations

IOP Conference Series Materials Science and Engineering

E Ellaimony

·

·

J Al-Rajhi

·

M Al-Ardhi

This paper presents a solution algorithm to solve one class of bicriteria multistage transportation problem. This class represents bi-criteria multistage transportation problem without any restrictions on the intermediate stages. A way to find the non-dominated extreme points in the criteria space is developed. This method involves a parametric search in the criteria space. The presented algorithm is based also on fruitful application of the methods for treating transportation problems and the dynamic programming technique to obtain the shortest route for transportation networks and methods for solving bicriteria linear programming. The solution algorithm as well as an illustrative example are also included in this paper.

Download

Optimum replacement policies for Kuwait passenger transport company busses: Case study

March 2011

·

29 Reads

·

3 Citations

Due to the excess of a vehicle operation through its life, some elements may face failure and deteriorate with time. This leads us to carry out maintenance, repair, tune up or full overhaul. After a certain period, the vehicle elements deteriorations increase with time which causes a very high increase of doing the maintenance operations and their costs. However, the logic decision at this point is to replace the current vehicle by a new one with minimum failure and maximum income. The importance of studying vehicle replacement problems come from the increase of stopping days due to many deteriorations in the vehicle parts. These deteriorations increase year after year causing an increase of operating costs and decrease the vehicle income. Vehicle replacement aims to determine the optimum time to keep, maintain, overhaul, renew and replace vehicles. This leads to an improvement in vehicle income, total operating costs, maintenance cost, fuel and oil costs, ton-kilometers, vehicle and engine performance, vehicle noise, vibration, and pollution. The aim of this paper is to find the optimum replacement policies of Kuwait Passenger Transport Company (KPTCP) fleet of busses. The objective of these policies is to maximize the busses pure profits. The dynamic programming (D.P.) technique is used to generate the busses optimal replacement policies.

Citations (2)


... Shortest The equipment replacement is formulated and solved by dynamic programming as in [41], [42], [43], [44], [45], [46] and [47]. ...

Reference:

On Equipment Replacement Problem: A Comparative Study of Heuristic and Mathematical Programming Models
Optimum replacement policies for Kuwait passenger transport company busses: Case study
  • Citing Article
  • March 2011

... These approaches can be classified into three main categories. The first category comprises methods designed to identify all efficient solutions, including those based on linear programming ( [35], [10], [5], [19], [34], [11]) and dynamic programming ( [13], [12]). The second category includes methods that focus on finding a single efficient solution or compromise solution, such as goal programming ( [6], [25], [37], [27], [30]), interactive methods [32], lexicographic optimization ( [36], [28]), the minimize distance method ( [1], [22] ), and the decomposition approach ( [3], [4]). ...

Using Dynamic Programming Technique for Solving a Class of Bi-Criteria Multistage Transportation Problem

IOP Conference Series Materials Science and Engineering