{"title":"基于网络重构的最早到达转运","authors":"R. Dhungana, T. N. Dhamala","doi":"10.3126/nmsr.v35i1-2.29974","DOIUrl":null,"url":null,"abstract":"The abstract flow model is the generalization of network flow model which deals with the flow paths (routes) satisfying the switching property. Contraflow model increases the flow value by reversing the required arc directions from the sources to the sinks. In this paper, we integrate the concepts of abstract flow and contraflow to introduce abstract earliest arrival transshipment contraflow model in multi-terminal abstract network. The abstract contraflow on multi-terminal dynamic network is NP-Complete. We present an efficient approximation algorithm to solve the problem. This approach satisfies the demand of sinks by sending optimal flow at every possible time point and seeks to eliminate the crossing conflicts.","PeriodicalId":165940,"journal":{"name":"The Nepali Mathematical Sciences Report","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Abstract Earliest Arrival Transshipment with Network Reconfiguration\",\"authors\":\"R. Dhungana, T. N. Dhamala\",\"doi\":\"10.3126/nmsr.v35i1-2.29974\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The abstract flow model is the generalization of network flow model which deals with the flow paths (routes) satisfying the switching property. Contraflow model increases the flow value by reversing the required arc directions from the sources to the sinks. In this paper, we integrate the concepts of abstract flow and contraflow to introduce abstract earliest arrival transshipment contraflow model in multi-terminal abstract network. The abstract contraflow on multi-terminal dynamic network is NP-Complete. We present an efficient approximation algorithm to solve the problem. This approach satisfies the demand of sinks by sending optimal flow at every possible time point and seeks to eliminate the crossing conflicts.\",\"PeriodicalId\":165940,\"journal\":{\"name\":\"The Nepali Mathematical Sciences Report\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-12-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The Nepali Mathematical Sciences Report\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.3126/nmsr.v35i1-2.29974\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"The Nepali Mathematical Sciences Report","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3126/nmsr.v35i1-2.29974","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Abstract Earliest Arrival Transshipment with Network Reconfiguration
The abstract flow model is the generalization of network flow model which deals with the flow paths (routes) satisfying the switching property. Contraflow model increases the flow value by reversing the required arc directions from the sources to the sinks. In this paper, we integrate the concepts of abstract flow and contraflow to introduce abstract earliest arrival transshipment contraflow model in multi-terminal abstract network. The abstract contraflow on multi-terminal dynamic network is NP-Complete. We present an efficient approximation algorithm to solve the problem. This approach satisfies the demand of sinks by sending optimal flow at every possible time point and seeks to eliminate the crossing conflicts.