Comparison of Randomized Solutions for Constrained Vehicle Routing Problem

In this short paper, we study the capacity-constrained vehicle routing problem (CVRP) and its solution by randomized Monte Carlo methods. For solving CVRP we use some pseudorandom number generators commonly used in practice. We use linear, multiple-recursive, inversive, and explicit inversive congruential generators and obtain random numbers from each to provide a route for CVRP. Then we compare the performance of pseudorandom number generators with respect to the total time the random route takes. We also constructed an open-source library github.com/iedmrc/binary-cws-mcs on solving CVRP by Monte-Carlo based heuristic methods.Comment: 6 pages, 2nd International Conference on Electrical, Communication and Computer Engineering (ICECCE), 12-13 June 2020, Istanbul, Turke

Order Compact And Unbounded Order Compact Operators On Rıesz Spaces

Order convergence and unbounded order convergence are not topological terms on Riesz space. On the other hand, compact operatör takes an important place in functional analysis. In this thesis, we investigate order compact and unbounded order compact operators acting on Riesz spaces. An operatör is said to be order compact if it maps an arbitrary order bounded net to a net with an order convergent subnet. In the same way, if an operator maps order bounded net to a net with unbounded order convergent subnet then it is called an unbounded order compact operatör. We expose the relationships between order compact, unbounded order compact, semi-compact and GAM-compact operators. Since order convergence and unbounded order convergence are not topological, we derive new results related to these classes of operators. The results are included in the article [10] in the bibliography section.Riesz uzaylarında sıra yakınsaklık topolojik bir kavram değildir. Bunun yanı sıra Fonksiyonel Analiz’de kompakt operatörler önemli bir yer tutmaktadır. Bu tezde, Riesz uzaylarına etki eden sıra kompakt ve sınırsız sıra kompakt operatörleri araştırıyoruz. Bir operatör eğer sıra sınırlı bir neti sıra yakınsak alt nete sahip olan bir nete resmediyor ise bu operatöre sıra kompakt operatör adı verilir. Aynı şekilde, bir operatör sıra sınırlı neti sınırsız sıra yakınsak alt nete sahip olan bir nete gönderiyor ise bu operatöre sınırsız sıra kompakt operatör adı verilir. Bu tezde sıra kompakt, sınırsız sıra kompakt, semi-kompakt ve GAM kompakt operatöler arasındaki ilişkiler ortaya konmuştur. Sıra yakınsama ve sınırsız sıra yakınsama topolojik olmadığından, bu operatör sınıflarıyla ilgili yeni sonuçlar elde edilmiştir. Elde edilen sonuçlar kaynakça kısmındaki [10] makalesinde yer almaktadır

Comparison of Randomized Solutions for Constrained Vehicle Routing Problem

In this short paper, we study capacity constrained vehicle routing problem (CVRP) and its solution by randomized Monte Carlo methods. For solving CVRP we use some pseudorandom number generators commonly used in practice. We use linear, multiple-recursive, inversive and explicit inversive congruential generators and obtain random numbers from each to provide a route for CVRP. Then we compare the performance of pseudorandom number generators with respect to the total time the random route takes. We also constructed an open-source library github.com/iedmrc/binary-cws-mcs on solving CVRP by Monte-Carlo based heuristic methods. © 2020 IEEE