Показаны сообщения с ярлыком Герцбах И.Б.. Показать все сообщения
Показаны сообщения с ярлыком Герцбах И.Б.. Показать все сообщения

среда, 5 июля 2017 г.

ON THE PROBLEM OF CONSTRUCTING ROUTES, PART I

Transport and Telecommunication Vol. 18, no. 3, 2017


Transport and Telecommunication, 2017, volume 18, no. 3, 231–233

Transport and Telecommunication Institute, Lomonosova 1, Riga, LV-1019, Latvia
DOI 10.1515/ttj-2017-0020

HISTORICAL COMMENTS ON APPLIED RESEARCH

Globalization in the modern world creates unique opportunities for researchers in access to scientific information in various applied fields. However, even today, many national studies, which were performed at different times not in English, remain inaccessible to the modern researchers. Meanwhile, many of them have not only historical value, but still retain scientific importance and are of scientific interest to the research community.

In order to at least partially eliminate this problem, the Editorial Board decided to open a special section of the journal with the provisional title "Historical Comments on Applied Research".

This issue of the journal opens the above rubric with two articles:

Original paper “On the Problem of Constructing Routes: Methodology and Numerical Example” by Linis and Maksim. It marks 50-year to the deficit function model initially developed in this 1967 work. This model then paved the way to further research of vehicle-fleet management in terms of optimal routing and scheduling.
Announcement of this work by Ilya B. Gertsbakh, Tao Liu and Avishai (Avi) Ceder. This
work is a preface to the above mentioned article and explains the motivation of the authors to prepare an article for publication in the journal.

The Editorial Board hopes that the new rubric will be of interest to readers. The Editorial Board will be glad to receive comments from the readers on this matter, as well as possible proposals for the preparation of similar materials from the national scientific heritage of different countries for future issues of the journal.

Prof. Igor Kabashkin, Editor-in-Chief

Prof. Irina Yatskiv, Deputy/ Managing Editor

ON THE PROBLEM OF CONSTRUCTING ROUTES,

PART I: PREFACE

Ilya B. Gertsbakh1, Tao Liu2, Avishai (Avi) Ceder3

1Department of Mathematics, Ben-Gurion University of the Negev
Beer-Sheva 84105, Israel
E-mail: elyager@bezeqint.net

2Department of Civil and Environmental Engineering, The University of Auckland
Auckland 1142, New Zealand
E-mail: tliu773@aucklanduni.ac.nz

3IDEC, Hiroshima University, Japan,
Faculty of Civil and Environmental Engineering, Technion-Israel Institute of Technology,
Haifa 32000, Israel
E-mail: a.ceder@auckland.ac.nz

This is a preface of the translation of the 1967 paper by Linis and Maksim, “On the problem of constructing routes” (in Russian) (in the Proceedings of the Institute of Civil Aviation Engineering, Issue 102, pp. 36-45). It marks 50-year to the deficit function (DF) model initially developed in this 1967 work; the DF model then paved the way to further research of vehicle-fleet management in terms of optimal routing and scheduling. The merit of this translation is to describe the roots of the DF modelling to enable further studies to emerge with more contributions.

Keywords: deficit function, routing, scheduling, transportation

1. Introduction

In 1967, Vald K. Linis and Misha S. Maksim published the paper “On the problem of constructing routes” (in Russian) in the Proceedings of the Institute of Civil Aviation Engineering Issue 102, pp. 36-45. This paper based, in essence, on their research work conducted in the Central Scientific Research



231

Unauthenticated

Download Date | 7/1/17 11:03 AM
Transport and Telecommunication Vol. 18, no. 3, 2017



Institute of Civil Aviation (Riga) combined with practical experience gained from the actual scheduling activities conducted in Moscow. During the period of 1965 to 1974, the problem of constructing aircraft routes was dealt with the project of designing Central Aviation Schedule for the Aeroflot Company in the Central Scientific Research Institute of Civil Aviation (Riga). The project was led scientifically by Professor Kh. B. Kordonsky with its core group members of Vald K. Linis, Valery Venevcev, Misha S. Maksim and Ilya B. Gertsbakh. The limitation of computer’s power, in those days, made the routing and scheduling problem of 2,000 daily trips of the central Aeroflot schedule as a problem of formidable difficulty.
The seminal work of Linis and Maksim (1967) has the following merits. First, it introduced the concept of characteristic functions, later called deficit functions (DFs) because of representing the deficit number of vehicles required at a particular terminal in question in a multi-terminal transportation system. Second, it presented the first proof of the minimal fleet size theorem in the terms of maxima of the DF’s. Third, it developed the idea of utilizing DFs for fleet size minimization through shifting flight departure times. Fourth, it proposed a heuristic algorithm for constructing aircraft routes. Fifth, it proposed an algorithm for constructing the minimal complete chain system (MCCS). Sixth, it described, in non-formal terms, a new graph- theoretic construction of the so-called Linis graph (see Gertsbakh and Gurevich, 1982), which allows to solve the so-called Center Problem and develop further the research associated with the crew scheduling activity. These ideas escribed in the paper of Linis and Maksim (1967) were well ahead of their time and preserve their importance and novelty even for today and for future further research.
The DF concept and modelling attracted the attention of the English-spoken community through the work by Gertsbakh and Gurevich (1977), Gertsbakh and Stern (1978) and Ceder and Stern (1981). Since then, there have been plenty of developments in the understanding of the theoretical, methodological and applied aspects of the DF advantages. That is, the DF concept and modelling proffers a graphical person-computer interactive approach and provides a highly informative graphical technique that is simple to interact with and use. Practical suggestions can be interjected, by the scheduler/planner followed immediately by describing the effects of the suggestions on the vehicle’s schedule. Thus the graphical DF concept helps in creating an efficient public transport (PT) vehicle schedules, timetables, crew duties, networks of routes, bus rapid transit systems, and operational parking spaces (Gertsbakh and Gurevich, 1982; Ceder, 2016). For a detailed description of the major developments of the DF modelling and applications in PT planning and operations over the past 50 years, readers are referred to Ceder (2016) and Liu and Ceder (2017).

The year 2017 marks the 50th anniversary of the publication of Linis and Maksim 1967 paper. To commemorate this historical event in transportation science and stimulate further use of the DF concept as a bridge between the world of researchers and the world of practitioners, we translated the original Russian article into English with the title of ‘on the problem of constructing routes, part II: methodology and numerical example’; it follows this part. In this preface, we provide a historical overview of the Linis-Maksim paper, add remarks, and clarify some concepts and facts.

2. Remarks and Commentary

Following the Russian publication tradition in those days, the 1967 paper of Linis and Maksim has neither an abstract nor references. It mainly comprised of seven sections.

Section 1 of the paper provides a description of the problem considered. This section starts by introducing the background of the local civil aviation schedule-design problem. It follows by two main questions: (1) what is the minimal fleet size required for a given schedule, and (2) how to construct the optimal routes for each aircraft.
Section 2 aims at answering the first question of fleet size estimation and minimization. It starts by introducing the basic notations with the employment of a 22-trip, 5-terminal example to explicate the notations. Then it provides the definition of the step (or characteristic) function, i.e., the DF, using graphical illustrations of the 22-trip, 5-terminal example. It continues by the presentation of the well-known fleet size formula describing the relationship between the fleet size and the total deficits of all the terminals. Similar fleet size formulations were independently derived by Bartlett (1957) and Salzborn (1972, 1974).

Sections 3 and 4 focuses on answering the second question of constructing routes. Section 3 introduces the “balance” property of schedule followed by the definition of the minimal complete chain system (MCCS). The MCCS serves as the basis of constructing aircraft routes and crew duties. Next, a simple algorithm for constructing MCCS is described. The final part of Section 3 provides an extension of



232

Unauthenticated

Download Date | 7/1/17 11:03 AM
Transport and Telecommunication Vol. 18, no. 3, 2017



the MCCS with some insights for constructing balanced crew duties. Section 4 is another interesting extension of the MCCS making each chain to visit a base airport calling it a Centre Problem. An intuitive-based procedure, utilizing the so-call “hollow zones” of the DFs, is provided to construct closed chains to visit the base airports.

Section 5 provides an eight-step algorithm for solving the problem of route construction with minimal fleet size. The DF-based fleet size estimation and minimization procedures are incorporated within this algorithm in its fifth step. Fleet size reduction through shifting departure times appears in the sixth step. The seventh step is about the feasibility check of the MCCS, and in the last step, MCCSs are constructed according to an optimization criterion.

Section 6 employs the 22-trip, 5-terminal example to illustrate (i) fleet size estimation procedure using the DF tool; (ii) fleet size reduction procedure through shifting flight departure times; and (iii) aircraft route construction. The example has shown that the DF-based tool is simple and easy to use graphically for fleet size estimation and minimization, and for aircraft route construction.
The last section of the paper notes that the DF-based methodology can be extended from one to many airline companies simultaneously, which will maximize the effectiveness and efficiency of the DF-based methodology.

3. Concluding Remark

It is remarkable that the 50-year ago paper by Linis and Maksim (1967) doesn’t only provide the DF-based methodology for fleet size estimation and minimization, but also provides a good algorithm for route construction based on the MCCS of the DFs. In addition, it is fascinating that the construction of the MCCS is directly related to the crew scheduling activity, which is not addressed in their paper. Moreover, the construction of a MCCS with each chain visiting a base airport using the “hollow zones” of the DFs, is related to the depot-constrained vehicle scheduling problem appearing years after. All in all, the merit of this 1967 paper’s translation is to describe the roots of the DF modelling so as to enable further studies to emerge with more contributions.

Postscript

Misha S. Maksim passed away ten years ago. Vald K. Linis is retired long time ago. The Central Scientific Research Institute of Civil Aviation where Misha S. Maksim and Vald K. Linis worked was founded around 1964 and does not exist for almost 25 years.

References

  1. Bartlett, T.E. (1957) An algorithm for the minimum number of transport units to maintain a fixed schedule. Naval Research Logistics Quarterly, 4(2), 139-149.

  1. Ceder, A. (2016) Public Transit Planning and Operation: Modelling, Practice and Behaviour, second ed. CRC Press, Boca Raton, USA.

  1. Ceder, A., and Stern, H.I. (1981) Deficit function bus scheduling with deadheading trip insertions for fleet size reduction. Transportation Science, 15(4), 338-363.

  1. Gertsbach (Gertsbakh), I., and Gurevich, Y. (1977) Constructing an optimal fleet for a transportation schedule. Transportation Science, 11(1), 20-36.
  2. Gertsbakh, I., and Gurevich, Y. (1982) Homogeneous optimal fleet. Transportation Research Part B: Methodological, 16(6), 459-470.

  1. Gertsbakh, I., and Stern, H.I. (1978) Minimal resources for fixed and variable job schedules.
Operations Research, 26(1), 68-85.
  1. Linis, V.K., and Maksim, M.S. (1967) On the problem of constructing routes. Proceedings of the Institute of Civil Aviation Engineering Issue 102, pp. 36-45 (in Russian).
  2. Liu, T., and Ceder, A. (2017) Deficit function related to public transport: 50 year retrospective, new
developments, and prospects. Transportation Research Part B: Methodological, 100, 1-19.
  1. Salzborn, F.J.M. (1972) Optimum bus scheduling. Transportation Science, 6(2), 137-148.
  2. Salzborn, F.J.M. (1974) Minimum fleet size models for transportation systems. In: D.J. Buckley (Ed.), Proceedings of the 6th International Symposium on Transportation & Traffic Theory (ISTTT6), Sydney, Australia, 607-624.



пятница, 31 марта 2017 г.

В.Линис и М Максим: 50-летие революционной публикации


Dear Subhi,
Look at the attached paper. It summarizes 50 years since the publication of the pioneering work of Linis and Maksim which was  published in the RKIIGA Transactions, in 1967, in Russian.
This work was a part of our joint work with Kordonsky, Maksim, Linis ,Venevcev, Gertsbakh on the computerized GA schedule.
From the bibliography, you can see that the ideas stated in pioneering 1967 work  were widely developed and found many applications.

All the best,
Yours
Ilya Gertsbakh
31.03.2017
---------
Субхиша, привет!
Илья Борисович Герцбах прислал мне обзорную статью о ступенчатых функциях, которые ввели в научный оборот Линис и Максим. Обзорная статья посвящена 50-летию выхода их прорывной статьи в 1967 году!  Это колоссальное  признание и авторитет.
Страна должна знать своих героев!

До встречи,
В.Жданов

-------- Пересылаемое сообщение --------
От кого: "ilya" <elyager@bezeqint.net>
Кому: 'Виталий Жданов' <zhdanov_vp@mail.ru>
Дата: Пятница, 31 марта 2017, 20:17 +02:00
Тема: RE:
Vitalii, privet!
Liu is from New Zealand, Avi Ceder –from our Technion.
I sent  the pdf to Linis too.

Good night,
Ilya

From: Виталий Жданов [mailto:zhdanov_vp@mail.ru] Sent: Friday, March 31, 2017 5:41 PM To: ilya Subject: Re:

Ни фига себе!!!
Какой тут Индекс цитирования, тут целый памятник!  :))) Правда в Новой Зеландии, а не в Риге.
А Линису выслали?

В.Жданов
Пятница, 31 марта 2017, 15:51 +02:00 от "ilya" <elyager@bezeqint.net>:
Виталий, привет!
Хочу похвастаться: посмотрите прилагаемую статью - она посвящена 50-летию со дня публикации в 1967 году, в трудах РКИИ ГА , статьи Линиса  и Максима . Она была частью нашего центрального расписания. С тех пор появилось много работ, использующих идею "ступенчатых функций",  введенных в этой статье.

Всего,
Илья
----------


















воскресенье, 22 января 2017 г.

Предложение от И.Герцбаха. Коллеги, поддержим?

Dear Subhi,
I have a suggestion:
To compose on your site a list of scientific publications
(   a) of all people working in CNII ASU GA in the period 1967-1991;
(   b) devoted to the problems solved by the Institute.
I could make a list for Maksim, Venevcev,Linis,Kordonsky, myself;
There will be data from Georgy, Alik Fraiman, Paramonov, Khoikhin and many, many others –
It will be an impressive collections of works  which preserve their  importance   also today.

Best
Ilya
21.01.2017
---
Dear Ilya,
It is a good idea!

Best regards
Subhi
---
Dear Subhi,
Here is a list of our publications  related to aviation schedule,
this is what I could remember for Linis ,Maksim, Valera, Kh. Borisovich and myself.
With regard to my colleagues the list is not complete.

The last item of Nesterov and Fraiman is an interesting material, I found it on Yandex.
I would suggest to order the publications by the publication year, seems it will be easier to made up the list.
All the best, and I hope that your respondents will continue the list.

Yours
Ilya
Часть трудов В.Линиса, в Gasanovke. Фото Subhi























1. V. Linis and M. Maksim. On the problem of constructing routes. Proc. Instit. Civil Aviation. 1967, 102, 36-45 (in Russian).

2. V. Venevcev , i . Gertsbakh, An Algorithm for Solving Large-Scale Problems in the Presence of Computer Errors. (in Russian). 1969, Automatic Control and Computer Sciences, Riga.

3. Gertsbach, I. On a Problem of Choosing the Order of Dependent Trials, Theory of Probability and its Applications,” 17, 709-712 (1972).

4. V.Venevcev, I..Gertsbakh, V.Linis, M. Maksim and Kh. Kordonsky, Heuristic Method for Constructing the Aviation Schedule, In the Coll. Automation in Machinery, Academy of Sciences, (Moscow, 1969) (in Russian).

5. V.Venevcev, I..Gertsbakh, V.Linis, M. Maksim and Kh. Kordonsky, Central Avia-schedule as a Part of Air Traffic Control System, Proceedings of the First International Traffic Control Session, Sec. 6, 5-26 (Versailles, 1970).

6. I. Gertsbakh, Probabilistic Ideas in Heuristic Algorithms for Solving Scheduling Problems, Nav. Res. Log. Quarterly, 1977, Issue 2, pp 339-348.

7. I Gertsbakh and Yu. Gurevich, Homogeneous Optimal Fleet, Transportation Research, Part B, 1982, 16(6) 459-470

8. I. Gertsbakh and Helman Stern, Minimal Resources for Fixed and Variable Job Schedules, Operations Research, 1978, No 1, 68-75.

9. I. Gertsbakh and Yu. Gurevich, Constructing an Optimal Fleet for a Transportation Schedule, Transportation Science, 1977, 11(1), 20-36.

10. I. Gertsbakh and Paolo Serafini. Periodic Transportation Schedule with Flexible Departure Times an Interactive Approach Based on Periodic Event Scheduling problems and the Deficit Function Approach, Europ. J. Operations Research, 1991, 50(3), 298-309

Ю. В. Нестеров,
Заслуженный работник транспорта Российской Федерации, вице-президент – директор Центра расписания и тарифов ЗАО «Транспортная клиринговая палата»
 
А. Б. Фрайман,
докт. инж. наук, лауреат премии Совета Министров СССР, президент «
Global Aviation Services & Travel»

Парадигма стратегии управления воздушным транспортом

----------------------
Добрый день , Субхи!
Предложение - хорошее.Я бы к нему добавила ещё одно.
Размещать на Вашем сайте новые научные публикации бывших  сотрудников ЦНИИАСУГА (тех , кто ещё занимается наукой, а также научные публикации их детей, имеющих отношение к авиации и космосу.

С уважением  - Людмила Савельевна
28.01.2017





вторник, 17 января 2017 г.

И.Герцбах. Reality of implementationi...

Dear Subhi,
I am becoming what in Russian is said "graphoman". I have in spare another short story with a romantic title "Flight to France", but this will be later.

All the best,
regards to all friends.
Ilya

 Alik's letter inspired me to write this note in which I would like to share with other people   my subjective impression about the reality of implementing  computers into practice. 

1.       1. The official point of view  in the mid  sixties in USSR was that implementation of computers and mathematical methods would provide future progress of Soviet society and make it possible to accomplish the building of Communism in USSR.
This was a very bold claim. Just a few years earlier, in the mid - fifties, the cybernetics was declared as a science of obscurantism ("nauka mrakobesov").
The first steps in applying computers  were encouraging. Problems of scientific  calculations, stock taking,  registration and small-scale scheduling were successfully made and implemented by computers.  I remember how one high positioned "nachal'nik" privately has expressed to me his opinion that soon the computer decisions will come in conflict with the reality and this will result in nothing good. I personally witnessed two such collisions.
2.       2. I worked in 1973 in the Computer center of Light Industry (Riga). One day, my boss  stormed  into my room and  cried  enthusiastically : "We have it , we found  it! "
Turns out that in the production plan of cloth factory in Ogre (Latvia), has been found an "error": if a
Огрский трикотажный комбинат
wool costume  number 52 would be replaced by a proper number
of costumes of model 50, then  the enterprise  would gain and save 1.5 mln rubles. My boss immediately  informed about his finding the local ministry, the ministry –the boss of Ogres factory.
The days of high spirit very soon ended by a  call from the factory: "You are idiots", -said the Chief Engineer." Do you think that we did not know about this possibility ?
We knew it of course, and would receive a premium for  a rationalization proposal. And now because of your stupidity, we lost this possibility !" He also added that he ordered to  kick out
from his factory any  person from our  organization.

3.       3. The attitude of officials of Civil Aviation Ministry to us, the workers of NII ASU, at least at the beginning of our work, was a clear mixture of hatred,  fear and polite mocking. May be, I am exaggerating, but here is a typical episode.
About 1970, we started to analyze the flight safety conditions in several most important flight control points located  remotely  from the airports. The work was done by Valery,  Georgy, and probably Evgeny was also involved in this work. We knew the potential increase of flight intensity of basic airlines and could therefore simulate and predict the safety conditions in most important control points. The acute problem was that because of growing load, the probability of  appearance of "dangerous close ins" ("opasnoe sblizhenie") become very high.  After Khaim Borisovich saw our results, he said to me: "Take this printout to the Head of Air Traffic Department and show it  to him."

Москва, бывшее здание МГА
I went to Moscow and knocked on the door of the big "nachal'nik". It was a nice looking man, age 40-50, perhaps his name was Andreev.  "Here is the report of what will happen in the next few years in the non controlled flight crossing points"-said I and gave him the printout. For 15 seconds this man was very silent. He understood that I am delivering him a very hot potato. If something will happen in the future, he would be accused of being informed about the danger. His reaction was simple and fast: - " Take away your papers and   immediately get out of   my room !"



4.       4. Probably, the general attitude of the Ministry to our Institute has gradually changed in positive direction, especially after Khaim Borisovich and Maksim successfully carried out the preschedule coordination session with all local companies which took place  in Riga, in the winter of 1971. Shortly after this session,   for the first time, the  schedule was made in full  by computer .

5.       5. Generally speaking, any bureaucratic system will resist to implementing new technologies, methods etc. Very often, Ministry workers were aware of the defects of their work, but by natural reasons were not willing to admit it or to report about them to their bosses. I am convinced that Andreev knew very well about problems of flight safety, it was his permanent headache and he hated any outsider's reminding him about that.

6.       6. In order to change things and make real improvements in the operation of the existing bureaucratic system you need that two things happen. First,  you must be able to carry out an important part of the decision making process better than the existing system does. And second, the existing system is not able  to  perform the new decision process.
 In our case with the central schedule , these two things happened:  our schedule was good enough  and even better than the existing one and, because of Sharkevich's tragic death,
the Ministry was not able to do it .

четверг, 12 января 2017 г.

И.Герцбах. История создания первого компьютерного расписания Аэрофлота

Dear Subhi,
I found your name in the CNII ASU GA blog.
My name is Ilya Gertsbakh, I worked on AEROFLOT flight scheduling (raspisanie)
In the period 1965-1972, under the guidance of Khaim Borisovich Kordonsky.
I wrote a short memo about  the history of doing aviation schedule, in English,
and I would like  to ask you to print it your blog.

Be in touch,
Ilya Gertsbakh
12.01.2017
-------------
Илья Борисович, приветствую Вас!
Замечательно, что Вы решили поделиться воспоминаниями, уверен, что они будут интересны (мне точно).
Я начал работать в НВЦ в 1967, благодаря Х.Б.Кордонскому, и прекрасно помню Вас.

С уважением
Subhi Gasanov
-------------

Dear Subhi,
Here it is. Working in CNII in 1965-72 was probably the most interesting period of my  professional life.
It is sad that Khaim Borisovich, Misha Maksim and Valery Venevcev , the real authors and creators of the Aeroflot schedule,
are not with us anymore.
About myself: in 1974 I repatriated to Israel, worked in Ben Gurion University, Beersheva, in Mathematics Department, 1974-1999.
Since 1999 I am retired  professor (called "emeritus"), live in Tel-Aviv, near the sea, and  trying to do some science.
Presently working on network reliability.
Reading your blog with interest, would welcome any information exchange.
Privet vsem collegam, vsem kogo znaju lichno i pomnju a takzhe   vsem ostal'nym

Vash Ilya
--------------



A short history of AEROFLOT first computerized schedule



The computation Center in the Civil Aviation Institute was founded probably in 1964. It had a group which started working on computer applications in AEROFLOT. The work of this group gave no visible results, as we found later, and was concentrated around hopeless trials to apply integer programming to make the schedule. Institute administration decided to organize a new Department in the Computation Center under the guidance of Khaim Borisovich. I started to work there since September 1965. Kh. B. nominated a small group of people which included Vald Linis, Valery Venevcev, Misha Maksim and myself, and we were given the task of making the central AEROFLOT schedule using computers. We had no idea what really the schedule is and how to do it, neither manually, nor by aid of a computer.

After some time spent in heated discussions which resulted in nothing, a wise decision was made by Kh. B. who said:" Before we do the schedule using computer, we must learn how it is done now manually, without computers". As a result, Valery and MIsha were sent to Moscow, to the Ministry to take part in the actual scheduling process. In sixties, there were two sessions each year, approximately one month each, for winter and summer navigations, respectively. The schedule was made by a very smart man named Sharkevich and a small group of two-three his technical aides. Sharkevich kept in his phenomenal memory literally hundreds of flights together with their arrival/departure times. Valery and Misha were present in two sessions. Upon their return, we discussed what they saw and understood. The input information for the schedule were so-called local projects submitted by separate territorial branches of AEROFLOT (local companies). Already on the stage of preliminary analysis of this input, it was necessary to solve a series of fleet optimization problems whose goal was to minimize the number of aircraft involved in the schedule. As the result of this stage, the basic "flights" which had to be nominated their arrival/departure times, were not separate flights but chains of flights termed in AEROFLOT "turnover chains" (TC) ("Grafiki oborota"). The next and most crucial part of the scheduling procedure was choosing the exact arrival/departure instants for each flight. All these instants were rounded up to 5 minutes, and each 5- minute interval was permanently attached to a certain arrival or departure. In doing this attachment, it was necessary first of all to guarantee some important safety conditions demanding special time intervals between arriving / departing aircraft using the same exit/landing corridor. In formal terms, the manual procedure was of greedy type, without backtracking, which means that the TC's were positioned using some heuristic priority rules. The highest priority were given to the international flights, next – to the flights delivering newspapers, then - multi-leg flights to Siberia from Moscow, and so on. Upon understanding the existing priorities, we were able to design a computerized assignment of ranking the TC's according to their priority.

As in many real-life problems, there was no unique optimum criterion for the whole schedule but rather a hierarchy of criteria for each stage of the scheduling process. So, after determining the scheduling sequence according to the priority rank, each TC was positioned into the schedule according to the local criterion who was aimed at minimizing the total penalty of the deviations from the "ideal" arrival/departure times given in the input. Kh. B. took active part in formalizing the local and global criteria which were eventually finalized based on computer experimentation.

Our first serious computer trial was made in 1967 on URAL-1. This was a huge electronic brontosaurus which occupied the whole space of an old Pravoslav church located in the middle of a site belonging in those times to Civil Aviation Institute. URAL-1 had a very small fast memory and several magnetic drums of relatively large capacity. However, frequent information exchange between the central processor and the drums immediately led to a failure, so that a serious work couldn't be made on this computer. We tried also another URAL-1 in Tartu University, with the same unfortunate results. Nevertheless, we were able to check the global and local priority rules, and toward the end of 1968 the main principles of doing computerized schedule were ready for implementation.

As far as I remember, in 1969 we already were in the new building of the Computer Center, near the main campus of the Institute, where we continued our work on the new computer MINSK-22 consisting of two original computers with joint fast memory of 8192 30-bit words + 8 magnetic drums each with memory of 16,384 30-bit words. The whole system was hardly able to work without failure more than 4-6 hours. We were forced to split the whole input of about 1000 TC's into series of small portions of 50-100 TC's. After processing a portion, we repeated the process and went to the next portion only after two successive results were identical. Doing the whole schedule took about 24 hours of work.

In the end of 1970 we were ready to do the "real" schedule for AEROFLOT but the Ministry did not hurry to use our experience. The people in Ministry were not convinced that we will be able to do the job. I am not excluding that some people there were not willing to transfer their exclusive role of making important decisions (accept or decline a proposal about opening new airline connection, for example) to some distant people who operate with such strange arguments as "computer-based decision". But here came a blind chance which made the Ministry urgently ask for our help: Sharkevich suddenly died from throat cancer, and nobody of his aides was capable of doing his unique work. So, the winter schedule of 1971 was made in our computation center. Under the guidance of Kh. B., the whole procedure of analyzing and optimizing the local scheduling projects was made in Riga, when the representatives of all local AEROFLOT companies came to us with their projects.

There were several occasions when we had to make important decisions without having enough experience and knowledge. For example, we had to decide which of the two local companies has to carry out a certain "profitable " air connection, for example Ukrainian- or Moscow- located company. Here again Kh. B. demonstrated his outstanding skills and talents. He simply made a series of meetings with several very experienced people from the local companies and told them approximately the following : teach us how to make a right decision in these and these circumstances. He got several very good and honest advices , in particular from one expert from Moscow. After several lessons, we learned the principles and smoothly went though the painful process of accepting/correcting the local scheduling projects. Misha Maksim put all the projects through the procedure of estimating and minimizing the fleet size. It made an enormous impression as the people from the local companies were taught the interactive step-function technique used for the optimization purpose.

Kh.B. also insisted on printing the whole schedule on a computerized linotype machine which was able to make all set-up work automatically by receiving appropriate commands from a perforated tape. Vald Linis made and extraordinary programming work transferring all the information from computer-made schedule into the form needed for this linotype machine. The work was made in typography No 3 in Riga, located on the former Lenina street 137/139. The next schedule was made on the yearly basis, and the typing process was transferred to Moscow. As far as I know, the set-up work was manual.

My information ends on April 1, 1972, when I left the CNIIASU GA, and I know very little about the further developments.





вторник, 29 ноября 2016 г.

Книга о ЦНИИАСУГА: Свой среди своих - Георгий Попов

Субхи, привет!
Твоими усилиями продолжает жить ЦНИИ АСУ ГА. 
Это даёт мотив не торопиться на митинг с небожителями.
Спасибо.  

Георгий Попов 
28.11.16

Я мог понять себя общаясь с ними

   


   
15 сентября 1966 года после собеседования с Кордонским Х.Б.  
был принят в отдел расписания НВЦ ГА, где начальником был Максим М.С.
С марта 1972 года работал в ведомственных ВЦ Латвийской ССР.
В июле 1979 года вернулся в ЦНИИ АСУ ГА в отдел Фраймана А.Б.

    Ещё в первую рабочую осень стало ясно, что без осознания 
"структуры данных" - любви не будет!!!
Поэтому увлекался. Алгоритмами тоже:
- сортировки;
- поиска кратчайших путей на сети;
- динамического программирования.
Участвовал в:
- тестировании комплекса Минск-2222 (спарка двух ЭВМ типа Минск-22);
- вводе и обработке рейсов железнодорожного расписания (пассажирского);
- тестировании РДС-1968 года;
- составлении планов авиаперевозок плодоовощной продукции 
 из республик Средней Азии на Дальний Восток и Крайний Север;
- разработке и внедрении "Указателя маршрутов грузовых перевозок";
- разработке методики и программного обеспечения по определению
 тарифных расстояний по прямым связям РДС на карте воздушных трасс СССР;
- разработке структуры базы данных рейсов РДС;
- создании Российской тарифной системы на воздушном транспорте. 
Автор специального алгоритма:
- поиска кратчайших путей на авиатранспортной сети
 "Квазиупорядоченная очередь".

Судьба подарила мне общение с неординарными личностями: