Search results for: Epaminondas G. Kyriakidis

Authors: Epaminondas G. Kyriakidis, Theodosis D. Dimitrakos, Constantinos C. Karamatsoukis

Abstract:

The vehicle routing problem (VRP) is a well-known problem in Operations Research and has been widely studied during the last fifty-five years. The context of the VRP is that of delivering products located at a central depot to customers who are scattered in a geographical area and have placed orders for these products. A vehicle or a fleet of vehicles start their routes from the depot and visit the customers in order to satisfy their demands. Special attention has been given to the capacitated VRP in which the vehicles have limited carrying capacity of the goods that must be delivered. In the present work, we present a specific capacitated stochastic vehicle routing problem which has realistic applications to distributions of materials to shops or to healthcare facilities or to military units. A vehicle starts its route from a depot loaded with items of two similar but not identical products. We name these products, product 1 and product 2. The vehicle must deliver the products to N customers according to a predefined sequence. This means that first customer 1 must be serviced, then customer 2 must be serviced, then customer 3 must be serviced and so on. The vehicle has a finite capacity and after servicing all customers it returns to the depot. It is assumed that each customer prefers either product 1 or product 2 with known probabilities. The actual preference of each customer becomes known when the vehicle visits the customer. It is also assumed that the quantity that each customer demands is a random variable with known distribution. The actual demand is revealed upon the vehicle’s arrival at customer’s site. The demand of each customer cannot exceed the vehicle capacity and the vehicle is allowed during its route to return to the depot to restock with quantities of both products. The travel costs between consecutive customers and the travel costs between the customers and the depot are known. If there is shortage for the desired product, it is permitted to deliver the other product at a reduced price. The objective is to find the optimal routing strategy, i.e. the routing strategy that minimizes the expected total cost among all possible strategies. It is possible to find the optimal routing strategy using a suitable stochastic dynamic programming algorithm. It is also possible to prove that the optimal routing strategy has a specific threshold-type structure, i.e. it is characterized by critical numbers. This structural result enables us to construct an efficient special-purpose dynamic programming algorithm that operates only over those routing strategies having this structure. The findings of the present study lead us to the conclusion that the dynamic programming method may be a very useful tool for the solution of specific vehicle routing problems. A problem for future research could be the study of a similar stochastic vehicle routing problem in which the vehicle instead of delivering, it collects products from ordered customers.

Keywords: collection of similar products, dynamic programming, stochastic demands, stochastic preferences, vehicle routing problem

Procedia PDF Downloads 235

Authors: Epaminondas G. Kyriakidis, Theodosis D. Dimitrakos, Constantinos C. Karamatsoukis

Abstract:

The vehicle routing problem (VRP) is a well-known problem in Operations Research and has been widely studied during the last fifty-five years. The context of the VRP is that of delivering or collecting products to or from customers who are scattered in a geographical area and have placed orders for these products. A vehicle or a fleet of vehicles start their routes from a depot and visit the customers in order to satisfy their demands. Special attention has been given to the capacitated VRP in which the vehicles have limited carrying capacity for the goods that are delivered or collected. In the present work, we present a specific capacitated stochastic vehicle routing problem which has many realistic applications. We develop and analyze a mathematical model for a specific vehicle routing problem in which a vehicle starts its route from a depot and visits N customers according to a particular sequence in order to collect from them two similar but not identical products. We name these products, product 1 and product 2. Each customer possesses items either of product 1 or product 2 with known probabilities. The number of the items of product 1 or product 2 that each customer possesses is a discrete random variable with known distribution. The actual quantity and the actual type of product that each customer possesses are revealed only when the vehicle arrives at the customer’s site. It is assumed that the vehicle has two compartments. We name these compartments, compartment 1 and compartment 2. It is assumed that compartment 1 is suitable for loading product 1 and compartment 2 is suitable for loading product 2. However, it is permitted to load items of product 1 into compartment 2 and items of product 2 into compartment 1. These actions cause costs that are due to extra labor. The vehicle is allowed during its route to return to the depot to unload the items of both products. The travel costs between consecutive customers and the travel costs between the customers and the depot are known. The objective is to find the optimal routing strategy, i.e. the routing strategy that minimizes the total expected cost among all possible strategies for servicing all customers. It is possible to develop a suitable dynamic programming algorithm for the determination of the optimal routing strategy. It is also possible to prove that the optimal routing strategy has a specific threshold-type strategy. Specifically, it is shown that for each customer the optimal actions are characterized by some critical integers. This structural result enables us to design a special-purpose dynamic programming algorithm that operates only over these strategies having this structural property. Extensive numerical results provide strong evidence that the special-purpose dynamic programming algorithm is considerably more efficient than the initial dynamic programming algorithm. Furthermore, if we consider the same problem without the assumption that the customers are ordered, numerical experiments indicate that the optimal routing strategy can be computed if N is smaller or equal to eight.

Keywords: dynamic programming, similar products, stochastic demands, stochastic preferences, vehicle routing problem

Procedia PDF Downloads 220

Authors: Li Chin Law, Epaminondas Mastorakos, Mohd Roslee Othman, Antonis Trakakis

Abstract:

The paper introduces an alternative concept of carbon capture for shipping by using pre-combustion carbon capture technology (Pre-CCS), which was proven to be less energy intensive than post-combustion carbon capture from the engine exhaust. Energy assessment on amine-based post-combustion CCS on LNG-fuelled ships showed that the energy efficiency of CCS ships reduced from 48% to 36.6%. Then, an energy assessment was carried out to compare the power and heat requirements of the most used hydrogen production methods and carbon capture technologies. Steam methane reformer (SMR) was found to be 20% more energy efficient and achieved a higher methane conversion than auto thermal reaction and methane decomposition. Next, pressure swing adsorber (PSA) has shown a lower energy requirement than membrane separation, cryogenic separation, and amine absorption in pre-combustion carbon capture. Hence, an integrated system combining SMR and PSA (SMR-PSA) with waste heat integration (WHR) was proposed. This optimized SMR-based integrated system has achieved 65% of CO₂ reduction with less than 7-percentage point of energy penalty (41.7% of energy efficiency). Further integration of post-combustion CCS with the SMR-PSA integrated system improved carbon capture rate to 86.3% with 9-percentage points of energy penalty (39% energy efficiency). The proposed system was shown to be able to meet the carbon reduction targets set by International Maritime Organization (IMO) with certain energy penalties.

Keywords: shipping, decarbonisation, alternative fuels, low carbon, hydrogen, carbon capture

Procedia PDF Downloads 47

Authors: Stavros Palavouzis, Alexandra Triantafyllopoulou, Aliki Tzima, Epaminondas Paplomatas

Abstract:

Mating-type genes are present in most filamentous fungi, even though teleomorphs for all species have not been recorded. Our study tries to explore the effect of different growth conditions on the expression of MAT genes in Neofusicoccum mediterraneum. As such, selected isolates were grown in potato dextrose broth or in water agar supplemented with pine needles under a 12 h photoperiod, as well as in constant darkness. Mycelia and spores were collected at different time points, and RNA extraction was performed, with the extracted product being used for cDNA synthesis. New primers for MAT gene expression were designed while qPCR results are underway. The second part of the study involved the isolation and cloning in a selected pGEM-T vector of the Botryosphaeria dothidea MAT1 1 1 and MAT1 2 1 mating genes, including flanking regions. As a next step, the genes were amplified using newly designed primers with engineered restriction sites. Amplicons were excised and subsequently sub-cloned in appropriate binary vectors. The constructs were afterward inserted into Agrobacterium tumefaciens and utilized for Agrobacterium-mediated transformation (ATMT) of Neofusicoccum mediterraneum. At the same time, the transformation of a Verticillium dahliae tomato race 1 strain (70V) was performed as a control. While the procedure was successful in regards to V. dahliae, transformed strains of N. mediterraneum could not be obtained. At present, a new transformation protocol, which utilizes a combination of protoplast and Agro transformation, is being evaluated.

Keywords: anamorph, heterothallism, perithecia, pycnidia, sexual stage

Procedia PDF Downloads 153