Motivated by the business model called“community group buying”(CGB),which has emerged in China and some countries in Southeast Asia,such as Singapore and Indonesia,we develop algorithms that could help CGB platforms...Motivated by the business model called“community group buying”(CGB),which has emerged in China and some countries in Southeast Asia,such as Singapore and Indonesia,we develop algorithms that could help CGB platforms match consumers with stage-stations(the picking up center under the CGB mode).By altering the fundamental design of the existing hierarchy algorithms,improvements are achieved.It is proven that our method has a faster running speed and greater space efficiency.Our algorithms avoid traversal and compress the time complexities of matching a consumer with a stage-station and updating the storage information to O(logM)and O(MlogG),where M is the number of stage-stations and G is that of the platform’s stock-keeping units.Simulation comparisons of our algorithms with the current methods of CGB platforms show that our approaches can effectively reduce delivery costs.An interesting observation of the simula-tions is worthy of note:Increasing G may incur higher costs since it makes inventories more dispersed and delivery prob-lems more complicated.展开更多
In this paper, we study some results of extended timed event graph (ETEG)by using graph theory's methods in the dioid framework. A necessary and sufficient con-dition for the observability of ETEG is obtained and ...In this paper, we study some results of extended timed event graph (ETEG)by using graph theory's methods in the dioid framework. A necessary and sufficient con-dition for the observability of ETEG is obtained and ETEG's standard structure is alsoestablished.展开更多
基金supported by the National Natural Science Foundation of China(71991464,71921001)Fundamental Research Funds for the Central Universities,General Program(WK2040000053)Key Program(YD2040002027)。
文摘Motivated by the business model called“community group buying”(CGB),which has emerged in China and some countries in Southeast Asia,such as Singapore and Indonesia,we develop algorithms that could help CGB platforms match consumers with stage-stations(the picking up center under the CGB mode).By altering the fundamental design of the existing hierarchy algorithms,improvements are achieved.It is proven that our method has a faster running speed and greater space efficiency.Our algorithms avoid traversal and compress the time complexities of matching a consumer with a stage-station and updating the storage information to O(logM)and O(MlogG),where M is the number of stage-stations and G is that of the platform’s stock-keeping units.Simulation comparisons of our algorithms with the current methods of CGB platforms show that our approaches can effectively reduce delivery costs.An interesting observation of the simula-tions is worthy of note:Increasing G may incur higher costs since it makes inventories more dispersed and delivery prob-lems more complicated.
文摘In this paper, we study some results of extended timed event graph (ETEG)by using graph theory's methods in the dioid framework. A necessary and sufficient con-dition for the observability of ETEG is obtained and ETEG's standard structure is alsoestablished.
